To see the other types of publications on this topic, follow the link: Gossip, dissemination, network, algorithms.
Journal articles on the topic 'Gossip, dissemination, network, algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Gossip, dissemination, network, algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Yang, Bo, Demin Liu, and Wenfeng Zhang. "Information dissemination in mobile social networks with gossip algorithms." International Journal of Ad Hoc and Ubiquitous Computing 21, no. 4 (2016): 259. http://dx.doi.org/10.1504/ijahuc.2016.076369.
Full text
2
Sharma, Rajesh, and Anwitaman Datta. "GoDisco++: A gossip algorithm for information dissemination in multi-dimensional community networks." Pervasive and Mobile Computing 9, no. 2 (April 2013): 324–35. http://dx.doi.org/10.1016/j.pmcj.2012.09.005.
Full text
3
Hromkovič, Juraj, Ralf Klasing, Dana Pardubská, Juraj Waczulík, and Hubert Wagener. "Effective Systolic Algorithms for Gossiping in Cycles." Parallel Processing Letters 08, no. 02 (June 1998): 197–205. http://dx.doi.org/10.1142/s0129626498000213.
Full textAbstract:
The complexity of systolic dissemination of information in the rings of processors (cycles) in the one-way (telegraph) mode is investigated. Tight lower and upper bounds on the complexity of one-way systolic gossip are established.
4
LIESTMAN, ARTHUR L., and DANA RICHARDS. "PERPETUAL GOSSIPING." Parallel Processing Letters 03, no. 04 (December 1993): 347–55. http://dx.doi.org/10.1142/s0129626493000381.
Full textAbstract:
In this paper, we introduce a new information dissemination problem in which gossiping is to occur continuously but with restricted use of the network. In this problem, information continues to be generated by each member of the network and, thus, the gossip process must be ongoing. However, in order to allow the network to be used for other purposes, the communications used by the gossip process are limited to k calls per time unit. We present some preliminary results on this new problem.
5
Kenyeres, Martin, and Jozef Kenyeres. "Comparative Study of Distributed Consensus Gossip Algorithms for Network Size Estimation in Multi-Agent Systems." Future Internet 13, no. 5 (May 18, 2021): 134. http://dx.doi.org/10.3390/fi13050134.
Full textAbstract:
Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that measuring their size poses a serious challenge. Therefore, the algorithms for determining/estimating this parameter in an effective manner have been gaining popularity over the past decades. In the paper, we analyze five frequently applied distributed consensus gossip-based algorithms for network size estimation in multi-agent systems (namely, the Randomized gossip algorithm, the Geographic gossip algorithm, the Broadcast gossip algorithm, the Push-Sum protocol, and the Push-Pull protocol). We examine the performance of the mentioned algorithms with bounded execution over random geometric graphs by applying two metrics: the number of sent messages required for consensus achievement and the estimation precision quantified as the median deviation from the real value of the network size. The experimental part consists of two scenarios—the consensus achievement is conditioned by either the values of the inner states or the network size estimates—and, in both scenarios, either the best-connected or the worst-connected agent is chosen as the leader. The goal of this paper is to identify whether all the examined algorithms are applicable to estimating the network size, which algorithm provides the best performance, how the leader selection can affect the performance of the algorithms, and how to most effectively configure the applied stopping criterion.
6
Wang, Yu Ze, Shao Chuan Wu, and Wen Cui. "Gossip Algorithms for Average Energy Estimation in Wireless Sensor Networks." Applied Mechanics and Materials 577 (July 2014): 908–12. http://dx.doi.org/10.4028/www.scientific.net/amm.577.908.
Full textAbstract:
Gossip algorithms which belong to a kind of distributed algorithms can be used to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. This paper proposes an improved broadcast gossip algorithm to estimate average energy with better accuracy. In this proposed algorithm, we use some companion variables to save the sum, and convergence error is decreasing with the number of companion variables increasing. Convergence of the proposed algorithm is studied theoretically and verified by simulations. Although the estimated value is random, we show that the novel algorithm can converge closer to average than broadcast gossip algorithm in probability.
7
Zanaj, Elma, Marco Baldi, and Franco Chiaraluce. "Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks." Journal of Communications Software and Systems 4, no. 2 (June 22, 2008): 105. http://dx.doi.org/10.24138/jcomss.v4i2.223.
Full textAbstract:
Gossip is a well-known technique for distributed computing in an arbitrarily connected network, that can be adopted effectively in wireless sensor networks. Gossip algorithms have been widely studied in previous literature, but mostly from a theoretical point of view. The aim of this paper isto verify the behavior of the gossip approach in practicalscenarios, through the analysis and interpretation of simulated results. So, we investigate the impact of optimizing the neighbor selection probabilities, the effect of multiple link failures and that of limited transmission radius. The possibility to use broadcast-like algorithms to increase the rate of convergence in averaging problems is also discussed and its advantage estimated.
8
Fan, Xiying, Chuanhe Huang, Junyu Zhu, and Bin Fu. "Replication-Based Data Dissemination in Connected Internet of Vehicles." Wireless Communications and Mobile Computing 2019 (April 4, 2019): 1–16. http://dx.doi.org/10.1155/2019/2150524.
Full textAbstract:
Due to the dynamically changing topology of Internet of Vehicles (IoV), it is a challenging issue to achieve efficient data dissemination in IoV. This paper considers strongly connected IoV with a number of heterogenous vehicular nodes to disseminate information and studies distributed replication-based data dissemination algorithms to improve the performance of data dissemination. Accordingly, two data replication algorithms, a deterministic algorithm and a distributed randomised algorithm, are proposed. In the proposed algorithms, the number of message copies spread in the network is limited and the network will be balanced after a series of average operations among the nodes. The number of communication stages needed for network balance shows the complexity of network convergence as well as network convergence speed. It is proved that the network can achieve a balanced status after a finite number of communication stages. Meanwhile, the upper and lower bounds of the time complexity are derived when the distributed randomised algorithm is applied. Detailed mathematical results show that the network can be balanced quickly in complete graph; thus highly efficient data dissemination can be guaranteed in dense IoV. Simulation results present that the proposed randomised algorithm outperforms the present schemes in terms of transmissions and dissemination delay.
9
Yang, Zhiwei, Weigang Wu, Yong Li, and Yishun Chen. "Cluster-based efficient information dissemination in dynamic networks." International Journal of Distributed Sensor Networks 14, no. 3 (March 2018): 155014771876208. http://dx.doi.org/10.1177/1550147718762086.
Full textAbstract:
Dynamic network is an abstraction of networks with frequent topology changes arising from node mobility or other reasons. In this article, we first propose a dynamic network model, named ( T, L)-HiNet, to extend existing dynamic network models with clusters. ( T, L)-HiNet includes several properties defining the stability of cluster hierarchy in a dynamic network, including cluster head set, cluster member set and the connections among them. Based on ( T, L)-HiNet, we design several hierarchical information dissemination algorithms for different scenarios of dynamics. Furthermore, we extend the ( T, L)-HiNet model and corresponding algorithms in two directions, that is, stability of cluster head set and cluster size. The correctness of our algorithms is proved rigorously, and their performance is evaluated via both numerical analysis and simulations. The results show that compared with the algorithm recently proposed by Kuhn et al., our design can significantly reduce communication cost and also time cost.
10
Li, Zhiyuan, Junlei Bi, and Carlos Borrego. "Exploiting Temporal and Spatial Regularities for Content Dissemination in Opportunistic Social Network." Wireless Communications and Mobile Computing 2019 (March 6, 2019): 1–16. http://dx.doi.org/10.1155/2019/3173152.
Full textAbstract:
Recently, content dissemination has become more and more important for opportunistic social networks. The challenges of opportunistic content dissemination result from random movement of nodes and uncertain positions of a destination, which seriously affect the efficiency of content dissemination. In this paper, we firstly construct time-varying interest communities based on the temporal and spatial regularities of users. Next, we design a content dissemination algorithm on the basis of time-varying interest communities. Our proposed content dissemination algorithm can run in O(nlogn) time. Finally, the comparisons between the proposed content dissemination algorithm and state-of-the-art content dissemination algorithms show that our proposed content dissemination algorithm can (a) keep high query success rate, (b) reduce the average query latency, (c) reduce the hop count of a query, and (d) maintain low system overhead.
11
Yang, Zhiwei, and Weigang Wu. "The (T, L)-Path Model and Algorithms for Information Dissemination in Dynamic Networks." Information 9, no. 9 (August 24, 2018): 212. http://dx.doi.org/10.3390/info9090212.
Full textAbstract:
A dynamic network is the abstraction of distributed systems with frequent network topology changes. With such dynamic network models, fundamental distributed computing problems can be formally studied with rigorous correctness. Although quite a number of models have been proposed and studied for dynamic networks, the existing models are usually defined from the point of view of connectivity properties. In this paper, instead, we examine the dynamicity of network topology according to the procedure of changes, i.e., how the topology or links change. Following such an approach, we propose the notion of the “instant path” and define two dynamic network models based on the instant path. Based on these two models, we design distributed algorithms for the problem of information dissemination respectively, one of the fundamental distributing computing problems. The correctness of our algorithms is formally proved and their performance in time cost and communication cost is analyzed. Compared with existing connectivity based dynamic network models and algorithms, our procedure based ones are definitely easier to be instantiated in the practical design and deployment of dynamic networks.
12
Xiong, Nan, Minrui Fei, Taicheng Yang, and Yu-Chu Tian. "Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach." Complexity 2018 (November 8, 2018): 1–16. http://dx.doi.org/10.1155/2018/4283087.
Full textAbstract:
This paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time calibration in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned from dynamic WSNs. Secondly, based on the mutual drift estimation, each pair of activated nodes fully adjusts clock rate and offset to achieve network-wide time synchronization by drawing upon the gossip consensus approach. The converge-to-max criterion is introduced to achieve a much faster convergence speed. The theoretical results on the probabilistic synchronization performance of the RGCS are presented. Thirdly, a Revised-RGCS is developed to counteract the negative impact of bounded delays, because the uncertain delays are always present in practice and would lead to a large deterioration of algorithm performances. Finally, extensive simulations are performed on the MATLAB and OMNeT++ platform for performance evaluation. Simulation results demonstrate that the proposed algorithms are not only efficient for synchronization issues required for dynamic topology changes but also give a better performance in terms of converging speed, collision rate, and the robustness of resisting delay, and outperform other existing protocols.
13
Tyushev, Kirill, Konstantin Amelin, and Boris Andrievsky. "The method of saving data integrity for decentralized network of group of UAV using quantized gossip algorithms." IFAC-PapersOnLine 49, no. 13 (2016): 259–64. http://dx.doi.org/10.1016/j.ifacol.2016.07.961.
Full text
14
Liu, Xiaoyang, and Daobing He. "Information Propagation and Public Opinion Evolution Model Based on Artificial Neural Network in Online Social Network." Computer Journal 63, no. 11 (November 5, 2019): 1689–703. http://dx.doi.org/10.1093/comjnl/bxz104.
Full textAbstract:
Abstract This paper proposes a new information dissemination and opinion evolution IPNN (Information Propagation Neural Network) model based on artificial neural network. The feedforward network, feedback network and dynamic evolution algorithms are designed and implemented. Firstly, according to the ‘six degrees separation’ theory of information dissemination, a seven-layer neural network underlying framework with input layer, propagation layer and termination layer is constructed; secondly, the information sharing and information interaction evolution process between nodes are described by using the event information forward propagation algorithm, opinion difference reverse propagation algorithm; finally, the external factors of online social network information dissemination is considered, the impact of external behavior patterns is measured by media public opinion guidance and network structure dynamic update operations. Simulation results show that the proposed new mathematical model reveals the relationship between the state of micro-network nodes and the evolution of macro-network public opinion. It accurately depicts the internal information interaction mechanism and diffusion mechanism in online social network. Furthermore, it reveals the process of network public opinion formation and the nature of public opinion explosion in online social network. It provides a new scientific method and research approach for the study of social network public opinion evolution.
15
Seo, MinSeok, SeungGwan Lee, and Sungwon Lee. "Clustering-based Data Dissemination Protocol Using the Path Similarity for Autonomous Vehicles." Symmetry 11, no. 2 (February 19, 2019): 260. http://dx.doi.org/10.3390/sym11020260.
Full textAbstract:
The VANET (Vehicle Ad Hoc Network) is gathering attention for autonomous vehicles and the MANET (Mobile Ad Hoc Network) is attracting interest as well. Therefore, efforts have been made to overcome the challenges of the VANET in which the topology changes in real time and instability exists due to the difference in speed and physical phase. Particularly in the IoT era, the total amount of network nodes in addition to vehicle nodes is expected to increase dramatically. Therefore, a clustering algorithm for a mesh network capable of autonomous configuration is suitable for reducing the load of the central control device and data redundancy on the network, which is expected to increase as the IoT era progresses. However, since clustering algorithms based on the existing research have been developed for the current traffic situation, inefficiency is inevitable in the future autonomous navigation period in which traveling path prediction can be accurately performed. Therefore, this paper discusses a clustering algorithm and a data propagation algorithm between clusters using path information. The main content of this paper is as follows. First, we propose a clustering algorithm using path information and considering the existing research results. In the autonomous navigation period, if the path is predictable, the probability that the nodes in the same cluster are in the same block for a longer time than the conventional one can converge to 100%. Therefore, the survival time of the cluster can be dramatically improved. Second, we developed a data propagation algorithm that can increase the information propagation rate of the entire network using path information. The cluster temporarily stores the data to be disseminated and then disseminates it when it encounters another cluster of neighbors. Therefore, data can be disseminated even for noncontiguous clusters. To summarize, this paper proposes clustering-based data dissemination algorithms and protocols using vehicle pathways for autonomous navigation and compares them with clustering-based data dissemination algorithms using existing directions.
16
Zhang, Junkai, Bin Wang, Jinfang Sheng, Jinying Dai, Jie Hu, and Long Chen. "Identifying Influential Nodes in Complex Networks Based on Local Effective Distance." Information 10, no. 10 (October 10, 2019): 311. http://dx.doi.org/10.3390/info10100311.
Full textAbstract:
With the rapid development of Internet technology, the social network has gradually become an indispensable platform for users to release information, obtain information, and share information. Users are not only receivers of information, but also publishers and disseminators of information. How to select a certain number of users to use their influence to achieve the maximum dissemination of information has become a hot topic at home and abroad. Rapid and accurate identification of influential nodes in the network is of great practical significance, such as the rapid dissemination, suppression of social network information, and the smooth operation of the network. Therefore, from the perspective of improving computational accuracy and efficiency, we propose an influential node identification method based on effective distance, named KDEC. By quantifying the effective distance between nodes and combining the position of the node in the network and its local structure, the influence of the node in the network is obtained, which is used as an indicator to evaluate the influence of the node. Through experimental analysis of a lot of real-world networks, the results show that the method can quickly and accurately identify the influential nodes in the network, and is better than some classical algorithms and some recently proposed algorithms.
17
Qureshi, Kashif Naseer, Farooq Ul Islam, Omprakash Kaiwartya, Arvind Kumar, and Jaime Lloret. "Improved Road Segment-Based Geographical Routing Protocol for Vehicular Ad-hoc Networks." Electronics 9, no. 8 (August 4, 2020): 1248. http://dx.doi.org/10.3390/electronics9081248.
Full textAbstract:
The real-time traffic information dissemination among on-road vehicles has been envisioned via realizing vehicular ad hoc networks (VANETs) as smart service-oriented roadside wireless sensor networks. The network enables various types of real-time traffic applications related to safety and infotainment for drivers and passengers. The information dissemination-centric routing protocols for vehicular networks have to dynamically adopt under the constrained network environment while considering the higher mobility of vehicular nodes and unpredictable physical topologies in the network. The issue needs to be addressed through smart and network-aware routing protocols. Geographical routing protocols have witnessed significant attention for information dissemination under these types of dynamic vehicular network environment. To this end, this paper presents an improved road segment-based geographical routing (ISR) protocol focusing on better head node selection for information dissemination. It divides the forwarding area into a number of road segments and selects a head node on each segment by focusing on traffic-aware information including the location, direction, and link quality-centric score for every vehicle on each road segment. Algorithms were developed for the complete process of head node selection and information dissemination among vehicles on the road segments. The simulation results attested the performance benefits of the proposed routing framework as compared to the state-of-the-art protocols considering dynamic vehicular traffic environment-related metrics.
18
Tripathy, Asis Kumar, and Suchismita Chinara. "Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network." ISRN Sensor Networks 2012 (October 18, 2012): 1–10. http://dx.doi.org/10.5402/2012/375026.
Full textAbstract:
Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.
19
Muchnik, Lev, and Jacob Goldenberg. "Seeding on Moving Ground: How Understanding Network Instability Can Improve Message Dissemination." GfK Marketing Intelligence Review 9, no. 2 (November 27, 2017): 42–47. http://dx.doi.org/10.1515/gfkmir-2017-0017.
Full textAbstract:
Abstract Most analyses of the social structure of a network implicitly assume that the relationships in the network are relatively stable. We present evidence that this is not the case. The focal network of this study grew in bursts rather than monotonously over time, and the bursts were highly localized. Links were added and deleted in nearby localities and are not randomly dispersed throughout the network. Also changes in structure lead to simultaneous changes in self-stated interests of its members. For SNA marketing applications the findings suggest interesting improvements. Local bursts around a seed can change the structure of the network dramatically and therefore a marketer’s influence and his chances of success. Therefore, network measurements should be carried out more frequently and closer to the actual implementation of a seeding campaign. To detect these abrupt, dramatic local changes marketers also use a finer resolution. Further, recommendation algorithms that simultaneously account for changes in network structure and content should be applied.
20
Yin, Hong-Jian, Hai Yu, Yu-Li Zhao, Zhi-Liang Zhu, and Wei Zhang. "Analysis of the Dynamic Influence of Social Network Nodes." Scientific Programming 2017 (2017): 1–6. http://dx.doi.org/10.1155/2017/5046905.
Full textAbstract:
In recent years, with the development of the social network theories, how to find or mining the most significant node in social network for understanding or controlling the information dissemination has become a hot topic and a series of effective algorithms have been presented. In this paper, a new scheme to measure the dynamic influence of the nodes in a social network is proposed, in which the sum of trust values of the propagation nodes is used. Simulations have been carried out and the results show that our scheme is stable and accurate.
21
Comellas, F., and G. Gimenez. "Genetic Programming to Design Communication Algorithms for Parallel Architectures." Parallel Processing Letters 08, no. 04 (December 1998): 549–60. http://dx.doi.org/10.1142/s0129626498000547.
Full textAbstract:
Broadcasting is an information dissemination problem in which a message originating at one node of a communication network (modeled as a graph) is to be sent to all other nodes as quickly as possible. This paper describes a new way of producing broadcasting schemes using genetic programming. This technique has proven successful by easily finding optimal algorithms for several well-known families of networks (grids, hypercubes and cycle connected cubes) and has indeed generated a new scheme for butterflies that improves the known upper bound for the broadcasting time of these networks.
22
Frikh, Bouchra, and Brahim Ouhbi. "Web Algorithms for Information Retrieval." International Journal of Mobile Computing and Multimedia Communications 6, no. 1 (January 2014): 1–16. http://dx.doi.org/10.4018/ijmcmc.2014010101.
Full textAbstract:
The World Wide Web has emerged to become the biggest and most popular way of communication and information dissemination. Every day, the Web is expending and people generally rely on search engine to explore the web. Because of its rapid and chaotic growth, the resulting network of information lacks of organization and structure. It is a challenge for service provider to provide proper, relevant and quality information to the internet users by using the web page contents and hyperlinks between web pages. This paper deals with analysis and comparison of web pages ranking algorithms based on various parameters to find out their advantages and limitations for ranking web pages and to give the further scope of research in web pages ranking algorithms. Six important algorithms: the Page Rank, Query Dependent-PageRank, HITS, SALSA, Simultaneous Terms Query Dependent-PageRank (SQD-PageRank) and Onto-SQD-PageRank are presented and their performances are discussed.
23
Stylidou, Andreana, Alexandros Zervopoulos, Aikaterini Georgia Alvanou, George Koufoudakis, Georgios Tsoumanis, and Konstantinos Oikonomou. "Evaluation of Epidemic-Based Information Dissemination in a Wireless Network Testbed." Technologies 8, no. 3 (June 28, 2020): 36. http://dx.doi.org/10.3390/technologies8030036.
Full textAbstract:
Information dissemination is an integral part of modern networking environments, such as Wireless Sensor Networks (WSNs). Probabilistic flooding, a common epidemic-based approach, is used as an efficient alternative to traditional blind flooding as it minimizes redundant transmissions and energy consumption. It shares some similarities with the Susceptible-Infected-Recovered (SIR) epidemic model, in the sense that the dissemination process and the epidemic thresholds, which achieve maximum coverage with the minimum required transmissions, have been found to be common in certain cases. In this paper, some of these similarities between probabilistic flooding and the SIR epidemic model are identified, particularly with respect to the epidemic thresholds. Both of these epidemic algorithms are experimentally evaluated on a university campus testbed, where a low-cost WSN, consisting of 25 nodes, is deployed. Both algorithm implementations are shown to be efficient at covering a large portion of the network’s nodes, with probabilistic flooding behaving largely in accordance with the considered epidemic thresholds. On the other hand, the implementation of the SIR epidemic model behaves quite unexpectedly, as the epidemic thresholds underestimate sufficient network coverage, a fact that can be attributed to implementation limitations.
24
Liu, Ping. "Information Dissemination Mechanism Based on Cloud Computing Cross-Media Public Opinion Network Environment." International Journal of Information Technologies and Systems Approach 14, no. 2 (July 2021): 70–83. http://dx.doi.org/10.4018/ijitsa.2021070105.
Full textAbstract:
As an important expression of social public opinion, network public opinion develops rapidly with the popularization of the internet and then affects the real society. Therefore, the use of computer technology to study the network public opinion information transmission mechanism has strong practical significance. The purpose of this paper is to use cloud computing to realize the research of information dissemination mechanism in the context of cross-media public opinion network. Researched from three aspects of operator supervision, number of media, and user density, the hotspot propagation mechanism of Storm platform given in this paper can solve the efficiency problems of traditional algorithms while ensuring accuracy, improve efficiency, and lay the foundation for the research on the monitoring of Internet public opinion propagation.
25
Zhang, Xin, Jiali You, Hanxing Xue, and Jinlin Wang. "A Decentralized PageRank Based Content Dissemination Model at the Edge of Network." International Journal of Web Services Research 17, no. 1 (January 2020): 1–16. http://dx.doi.org/10.4018/ijwsr.2020010101.
Full textAbstract:
In the era of Internet of Things, cloud services are difficult to meet the real-time transmission requirements of users for the data generated in the edge of network especially for the Internet video services. Utilizing the devices at the edge of network, such as an intelligent router, to achieve nearby content services for users can effectively reduce backbone traffic and enhance service performance. This article proposes a decentralized PageRank-based content dissemination model at the edge of network, in which a suitable node selection algorithm is designed to distribute the content evenly in the network. Each node can quickly obtain data from neighbor nodes, thereby reducing the cloud load as well as the network bandwidth and improving the service response performance. The simulation shows that, compared with the other two dissemination algorithms, the content is distributed more even, which means every node has more opportunity to obtain the data from neighbors; and the service rejection rate can be decreased by an average of 5.2% in the case of high concurrent requests.
26
Liu, Qingxue, Barend Jacobus van Wyk, Shengzhi Du, and Yanxia Sun. "Dynamic Small World Network Topology for Particle Swarm Optimization." International Journal of Pattern Recognition and Artificial Intelligence 30, no. 09 (November 2016): 1660009. http://dx.doi.org/10.1142/s0218001416600090.
Full textAbstract:
A new particle optimization algorithm with dynamic topology is proposed based on small world network. The technique imitates the dissemination of information in a small world network by dynamically updating the neighborhood topology of the Particle Swarm Optimization (PSO). In comparison with other four classic topologies and two PSO algorithms based on small world network, the proposed dynamic neighborhood strategy is more effective in coordinating the exploration and exploitation ability of PSO. Simulations demonstrated that the convergence of the swarms is faster than its competitors. Meanwhile, the proposed method maintains population diversity and enhances the global search ability for a series of benchmark problems.
27
Anshu Kumar Dwivedi DUBEY. "EE-LEACH: Energy Enhancement in LEACH to Improve Network Life Time of Homogeneous Wireless Sensor Network." Law, State and Telecommunications Review 12, no. 1 (March 16, 2020): 205–24. http://dx.doi.org/10.26512/lstr.v12i1.29051.
Full textAbstract:
Purpose ”“ In the recent scenario, there are various issues related to wireless sensor networks such as clustering, routing, packet loss, network strength. The core functionality of primarily wireless sensor networks is sensor nodes that are randomly scattered over a specific area. The sensor senses the data and sends it to the base station. Energy consumption is an important issue in wireless sensor networks. Clustering and cluster head selection is an important method used to extend the lifetime of wireless sensor networks. The main goal of this research article is to reduce energy consumption using a clustering process such as CH determination, cluster formation, and data dissemination.
Methodology/approach/design ”“ The simulation in this paper was finished utilizing MATLAB programming methodology and the proposed technique is contrasted with the LEACH and MOD-LEACH protocols.
Findings ”“ The simulation results of this research show that the energy consumption and dead node ratio are improved of wireless sensor networks as compared to the LEACH and MOD-LEACH algorithms.
Originality/value ”“ In the wireless sensor network there are various constraints energy is one of them. In order to solve this problem use CH selection algorithms to reduce energy consumption and consequently increase network lifetime.
28
Yang, Zhiwei, Weigang Wu, Yishun Chen, Xiaola Lin, and Jiannong Cao. "(Q, S)-distance model and counting algorithms in dynamic distributed systems." International Journal of Distributed Sensor Networks 14, no. 1 (January 2018): 155014771875687. http://dx.doi.org/10.1177/1550147718756872.
Full textAbstract:
With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as “dynamic network.” With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named ( Q, S)- distance and ( Q, S)*- distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations.
29
Zheng, Zhe, Chunliang Zhou, Xiangpei Meng, Le Wang, and Ying Xu. "Prediction Model for Information Dissemination in Social Network Media Based on Triangle Ring Attractor." Mathematical Problems in Engineering 2020 (February 11, 2020): 1–11. http://dx.doi.org/10.1155/2020/1563946.
Full textAbstract:
In order to solve the information transfer of social network media, a new information transfer prediction method is presented by a triangle ring attractor. At first, the description method of social media information is given in this model, and the evaluation indexes such as information recall rate, matching degree, and recall rate are emphatically expounded. At the same time, the characteristics of media information are analyzed with a triangular ring attractor, and an information transfer prediction model is established. Finally, through the simulation experiment, the key factors influencing the method are deeply analyzed. Experimental results show that compared with other algorithms, this method has good adaptability in the degree of information attenuation and information checking rate.
30
Kim, Sungwook. "New Bargaining Game Model for Collaborative Vehicular Network Services." Mobile Information Systems 2019 (March 7, 2019): 1–11. http://dx.doi.org/10.1155/2019/6269475.
Full textAbstract:
The wireless industry’s evolution from fourth generation (4G) to fifth generation (5G) will lead to extensive progress in new vehicular network environments, such as crowdsensing, cloud computing, and routing. Vehicular crowdsensing exploits the mobility of vehicles to provide location-based services, whereas vehicular cloud computing is a new hybrid technology that instantly uses vehicular network resources, such as computing, storage, and Internet for decision-making. In this study, novel crowdsensing, cloud computing, and routing algorithms are developed for a next-generation vehicular network, and they are combined into a hybrid scheme. To provide an effective solution toward an appropriate interactive vehicular network process, we focus on the paradigm of learning algorithms and game theory. Based on individual cooperation, our proposed scheme is designed as a triple-plane game model to adapt to the dynamics of a vehicular network system. The primary advantage of our game-based approach is to provide self-adaptability and responsiveness to current network environments. The performance of our hybrid scheme is evaluated and analyzed using simulation experiments in terms of the cloud service success ratio, normalized dissemination throughput, and crowdsensing success probability.
31
Wang, Wei Ping, and Li Zhou. "Research on Intelligent Control Technology with Building Energy Control Model Based on Intelligent Control Algorithm." Advanced Materials Research 1014 (July 2014): 329–32. http://dx.doi.org/10.4028/www.scientific.net/amr.1014.329.
Full textAbstract:
For the current smart building energy control algorithms are still large energy loss, poor energy-saving effect and other issues, this paper presents a fuzzy neural network algorithm based on improved BP algorithm, the improved algorithm of BP neural network algorithm first reverse dissemination and weighting coefficients are adjusted to accelerate the convergence rate of the original algorithm, and then build the improved BP neural network algorithm for fuzzy neural network, and then to improve it fuzzy membership function parameters to improve the efficiency of fuzzy neural network learning. Simulation results show that the proposed fuzzy neural network algorithm based on improved BP algorithm in the intelligent building energy control, with the algorithm is better than traditional BP neural network energy savings, reducing the energy loss rate.
32
Elias, Shamsul Jamel, Shahirah Mohamed Hatim, Mohamad Yusof Darus, Shapina Abdullah, Jamaluddin Jasmis, R. Badlishah Ahmad, and Adam Wong Yoon Khang. "Congestion control in vehicular adhoc network: a survey." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 3 (March 1, 2019): 1280. http://dx.doi.org/10.11591/ijeecs.v13.i3.pp1280-1285.
Full textAbstract:
Vehicular adhoc network (VANET) has a significant potential in reducing traffic congestion to provide a stress-free and safer platform for road drivers to travel on the road. However, the current VANET is vulnerable to several challenges which need to be overcome. Congestion control is considered as one of the main challenges in VANET due to the high dynamic topology characteristic. Reliable congestion control (CC) are necessary to provide effectient dissemination of time-critical safety messages in VANET applications; safety and non-safety applications. In this paper, we present the overview on VANET, its application and challenges. We also discuss on the congestion control and provide a brief survey on the congestion control algorithms such as vehicular cloud computing, multiplicative rate decreasing algorithm, multi-objective Tabu search, D-FPAV algorithm and beaconing strategies which have been proposed in order to provide better solutions towards achieving a successful Smart Tranporation System.
33
Kaissari, Soufiane, Safae El Abkari, Abdelilah Jilbab, and Abdennaser Bourouhou. "Performance comparison of communication protocol algorithms in WSN based agriculture: PlanTech case study." E3S Web of Conferences 297 (2021): 01061. http://dx.doi.org/10.1051/e3sconf/202129701061.
Full textAbstract:
Wireless sensor networks (WSN) have become increasingly important in agriculture in recent years because they provide critical tools for better decision-making (knowledge -collection- storage- analysis-dissemination of data). These technologies provide resources for making informed decisions and implementing control measures on time. They are also essential tools for understanding the effects of climate change on agriculture, such as shrinking arable land and providing solutions to mitigate the negative consequences of these phenomena. In this paper, we propose a model based on WSN for the supervision of agricultural data. We investigate the impact of deterministic, random, and selective CH routing protocols on the network’s lifetime, residual energy, and exchanged information quantity. The deterministic CH protocol showed significant results in terms of the number of functional nodes and the energy consumption in the network. Thus, the selective CH protocol outperformed both protocols regarding the quantity of exchanged data in the network.
34
Bae, Ihn-Han. "An Intelligent Broadcasting Algorithm for Early Warning Message Dissemination in VANETs." Mathematical Problems in Engineering 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/848915.
Full textAbstract:
Vehicular ad hoc network (VANET) has gained much attention recently to improve road safety, reduce traffic congestion, and enable efficient traffic management because of its many important applications in transportation. In this paper, an early warning intelligence broadcasting algorithm is proposed, EW-ICAST, to disseminate a safety message for VANETs. The proposed EW-ICAST uses not only the early warning system on the basis of time to collision (TTC) but also the intelligent broadcasting algorithm on the basis of fuzzy logic. Thus, the EW-ICAST resolves effectively broadcast storm problem and meets time-critical requirement. The performance of EW-ICAST is evaluated through simulation and compared with that of other alert message dissemination algorithms. From the simulation results, we know that EW-ICAST is superior toSimple,P-persistence, andEDBalgorithms.
35
Katti, Amogh, Giuseppe Di Fatta, Thomas Naughton, and Christian Engelmann. "Epidemic failure detection and consensus for extreme parallelism." International Journal of High Performance Computing Applications 32, no. 5 (February 1, 2017): 729–43. http://dx.doi.org/10.1177/1094342017690910.
Full textAbstract:
Future extreme-scale high-performance computing systems will be required to work under frequent component failures. The MPI Forum’s User Level Failure Mitigation proposal has introduced an operation, MPI_Comm_shrink, to synchronize the alive processes on the list of failed processes, so that applications can continue to execute even in the presence of failures by adopting algorithm-based fault tolerance techniques. This MPI_Comm_shrink operation requires a failure detection and consensus algorithm. This paper presents three novel failure detection and consensus algorithms using Gossiping. Stochastic pinging is used to quickly detect failures during the execution of the algorithm, failures are then disseminated to all the fault-free processes in the system and consensus on the failures is detected using the three consensus techniques. The proposed algorithms were implemented and tested using the Extreme-scale Simulator. The results show that the stochastic pinging detects all the failures in the system. In all the algorithms, the number of Gossip cycles to achieve global consensus scales logarithmically with system size. The second algorithm also shows better scalability in terms of memory and network bandwidth usage and a perfect synchronization in achieving global consensus. The third approach is a three-phase distributed failure detection and consensus algorithm and provides consistency guarantees even in very large and extreme-scale systems while at the same time being memory and bandwidth efficient.
36
Sekaran, Ramesh, and Ganesh Kumar Parasuraman. "A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks." Scientific World Journal 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/865071.
Full textAbstract:
The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.
37
Ullah, Fasee, Izhar Ullah, Atif Khan, M. Irfan Uddin, Hashem Alyami, and Wael Alosaimi. "Enabling Clustering for Privacy-Aware Data Dissemination Based on Medical Healthcare-IoTs (MH-IoTs) for Wireless Body Area Network." Journal of Healthcare Engineering 2020 (November 28, 2020): 1–10. http://dx.doi.org/10.1155/2020/8824907.
Full textAbstract:
There is a need to develop an effective data preservation scheme with minimal information loss when the patient’s data are shared in public interest for different research activities. Prior studies have devised different approaches for data preservation in healthcare domains; however, there is still room for improvement in the design of an elegant data preservation approach. With that motivation behind, this study has proposed a medical healthcare-IoTs-based infrastructure with restricted access. The infrastructure comprises two algorithms. The first algorithm protects the sensitivity information of a patient with quantifying minimum information loss during the anonymization process. The algorithm has also designed the access polices comprising the public access, doctor access, and the nurse access, to access the sensitivity information of a patient based on the clustering concept. The second suggested algorithm is K-anonymity privacy preservation based on local coding, which is based on cell suppression. This algorithm utilizes a mapping method to classify the data into different regions in such a manner that the data of the same group are placed in the same region. The benefit of using local coding is to restrict third-party users, such as doctors and nurses, when trying to insert incorrect values in order to access real patient data. Efficiency of the proposed algorithm is evaluated against the state-of-the-art algorithm by performing extensive simulations. Simulation results demonstrate benefits of the proposed algorithms in terms of efficient cluster formation in minimum time, minimum information loss, and execution time for data dissemination.
38
Sedighimanesh, Mohammad, and Ali Sedighimanesh. "Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm." Law, State and Telecommunications Review 10, no. 1 (May 14, 2018): 185–200. http://dx.doi.org/10.26512/lstr.v10i1.21506.
Full textAbstract:
Purpose – Clustering, routing, and data dissemination are an important issue in wireless sensor networks. The basic functions of wireless sensor networks are phenomena controlling in the physical environment, and the reporting of sensed data to the central node called sink, in which more operations can be done on the data. The most important limitation of wireless sensor networks is energy consumption. There are several ways to increase the lifetime of these networks, that one of the most important is the using proper clustering method. The aim of this study is to reduce energy consumption using an effective clustering algorithm and for this purpose, the honeybee colony metaheuristic method was used for cluster heads selection.
Methodology/approach/design – The simulation in this paper was done using MATLAB software and the proposed method is compared with the LEACH and SEED approach.
Findings – The results of simulations in this research indicate that the research has significantly reduced the energy consumption in the network than LEACH and SEED algorithms.
Originality/value – Given the energy constraints in the wireless sensor network, providing such solutions and using metaheuristic algorithms can dramatically reduce energy consumption and, consequently increase network lifetime.
39
Lienkov, S. V., V. M. Dzhulij, A. V. Selyukov, V. S. Orlenko, and A. V. Atamaniuk. "SECURITY MODEL DISSEMINATION OF FORBIDDEN INFORMATION IN INFORMATION AND TELECOMMUNICATION NETWORKS." Collection of scientific works of the Military Institute of Kyiv National Taras Shevchenko University, no. 68 (2020): 53–64. http://dx.doi.org/10.17721/2519-481x/2020/68-06.
Full textAbstract:
The article proposes an approach to defining a security model for the dissemination of prohibited information in information and telecommunication networks. The most effective prediction of the spread of the prohibited information threat is carried out by modeling this process. Information and telecommunication networks are large-scale networks with an ever-growing number of subscribers. With the rapid growth in the number of ITKS users, there are problems of information security and information protection in them. The analysis of information security problems proved that apart from the problems associated with the use of the global Internet as a distributed information and telecommunication system, it is well known and can be solved, there is a poorly studied problem of prohibited content. Creation of models and algorithms for the spread of the threat of prohibited information is one of the key approaches to solving this problem. The analysis of publications on this topic shows that existing solutions are ineffective. Usually, when modeling the propagation of a threat of prohibited information, the ITKS topology (the network model is a fully connected graph) is not taken into account. When modeling the threat of the spread of prohibited information, it is important to have a topology that reflects the structure of connections in a real network, as well as to use an adequate model of information interaction between nodes. Another important problem is the large-scale ITCS, which makes it difficult to obtain data from the simulation model in a reasonable time. The solution to this problem is to create an analytical model of the threat of the spread of prohibited information in the ITCS. An algorithm has been developed for the implementation of TSPI (threat of the spread of prohibited information) in the ITKS, based on the nature of the processes occurring in real conditions. The simulation model of TSPI in ITKS has been proposed, which takes into account the topological characteristics of the network, as well as the features of information interaction of subscribers as man-machine systems. With its help, experiments have been carried out, the results of which have shown the dependence of the implementation of the RFID on the topological vulnerability of the network. An analytical model of the TSPI has been developed, taking into account the topological vulnerability of the network. The relevance of the results of the analytical solution was confirmed by a series of experiments on the topology of a real network using simulation modeling. In this case, the error for the protection process was no more than 10%, for the attack process - no more than 15%.
40
Alvanou, Aikaterini Georgia, Alexandros Zervopoulos, Asterios Papamichail, Konstantinos Bezas, Spiridon Vergis, Andreana Stylidou, Athanasios Tsipis, et al. "CaBIUs: Description of the Enhanced Wireless Campus Testbed of the Ionian University." Electronics 9, no. 3 (March 8, 2020): 454. http://dx.doi.org/10.3390/electronics9030454.
Full textAbstract:
Technological evolution and in particular the development of the Internet of Things (IoT) has paved the way for material prosperity and a better standard of living. A critical factor in the effectiveness of emerging IoT applications, which heavily rely on sensor information flow, is the development of a functional and efficient Wireless Sensor Network. Additionally, the levels of automation are conducive to usability and time efficiency by reducing the need for human intervention, as well as increasing the rate at which experiments can be carried out. In current work, an already installed infrastructure on the Ionian University campus is considered and enhanced, with the goal of elevating accessibility and user-friendliness, by designing a web platform. The presented platform enables the remote development, execution and monitoring of simple but necessary network-based algorithms using a custom language, without requiring code to be uploaded to remote nodes. As a proof of concept, three information dissemination algorithms are implemented and provided as example templates for users, promoting simultaneously ease of use.
41
Dash, Sanjit Kumar, Sasmita Mishra, and Jibitesh Mishra. "Mobile Data Offloading Using Opportunistic Communication and AP Deployment." International Journal of Mobile Computing and Multimedia Communications 8, no. 4 (October 2017): 66–84. http://dx.doi.org/10.4018/ijmcmc.2017100104.
Full textAbstract:
There is an exponential surge in the number of Wi-Fi enabled devices which has caused an unprecedented overload on cellular and Wi-Fi networks. The two emergent techniques that have made significant difference in the reduction of network traffic surge are opportunistic communication and effective access point deployment. Since these techniques take user mobility into account, the authors propose to implement them at places where mobility pattern of users can be predicted intuitively, such as a college campus. The aim is to find strategic points across a college campus for deployment of Wi-Fi routers and explore the possibility of opportunistic communication. Then, the focus is on finding the target set which ensures high rate of information dissemination using proposed random and greedy algorithms. The mobility traces are captured using an android app WeCamp, which subsequently helps to find the locations with maximum number of users and to redeploy access points in such places using proposed algorithms to ensure uniform network speeds and efficient Wi-Fi connectivity.
42
Jan, Naveed, Ali Al-Bayatti, Naseer Alalwan, and Ahmed Alzahrani. "An Enhanced Source Location Privacy based on Data Dissemination in Wireless Sensor Networks (DeLP)." Sensors 19, no. 9 (May 2, 2019): 2050. http://dx.doi.org/10.3390/s19092050.
Full textAbstract:
Wireless Sensor Network is a network of large number of nodes with limited power and computational capabilities. It has the potential of event monitoring in unattended locations where there is a chance of unauthorized access. The work that is presented here identifies and addresses the problem of eavesdropping in the exposed environment of the sensor network, which makes it easy for the adversary to trace the packets to find the originator source node, hence compromising the contextual privacy. Our scheme provides an enhanced three-level security system for source location privacy. The base station is at the center of square grid of four quadrants and it is surrounded by a ring of flooding nodes, which act as a first step in confusing the adversary. The fake node is deployed in the opposite quadrant of actual source and start reporting base station. The selection of phantom node using our algorithm in another quadrant provides the third level of confusion. The results show that Dissemination in Wireless Sensor Networks (DeLP) has reduced the energy utilization by 50% percent, increased the safety period by 26%, while providing a six times more packet delivery ratio along with a further 15% decrease in the packet delivery delay as compared to the tree-based scheme. It also provides 334% more safety period than the phantom routing, while it lags behind in other parameters due to the simplicity of phantom scheme. This work illustrates the privacy protection of the source node and the designed procedure may be useful in designing more robust algorithms for location privacy.
43
Anish Soni and Rajneesh Randhawa. "Simulating and Analysing the Impact of Routing Protocols on Different Parameters of WSNs." Journal of Technology Management for Growing Economies 6, no. 1 (April 27, 2015): 27–37. http://dx.doi.org/10.15415/jtmge.2015.61003.
Full textAbstract:
Energy efficiency of Wireless Sensor Networks has become an essential requirement and is the main issue for researchers. Various routing, data dissemination and energy efficient protocols have been designed for Wireless Sensor Networks where energy issue has been given more stress. Sensors in wireless sensor networks work on battery and have limited energy. Hence, network has limited lifetime. Routing protocol plays a major role in deciding for how much time a network will survive. All routing algorithms tend to increase the lifetime of WSN while maintaining factors like successful and real-time delivery of a message. This paper aims towards studying different categories of routing protocols and finally four hierarchical routing protocols LEACH, EHRP, SEP and FAIR have been simulated. The performance of each routing protocol has been measured on some performance metrics like network lifetime, packets transferred to BS, number of dead nodes etc and finally concluded that how a routing protocol can impact the network lifetime.
44
Chen, Yishun, Weigang Wu, and Hui Cao. "Navigation Route based Stable Connected Dominating Set for Vehicular Ad Hoc Networks." International Journal of Web Services Research 12, no. 1 (January 2015): 12–26. http://dx.doi.org/10.4018/ijwsr.2015010102.
Full textAbstract:
Forming a virtual backbone has been always a significant technique for ad hoc networks to achieve high efficiency in various applications, including mobility management, broadcast based information dissemination, etc. This is especially true for Vehicular Ad Hoc Network (VANET), because most of VANET applications rely on broadcasting messages. Among others, constructing the Connected Dominating Set (CDS) is a popular approach to forming virtual backbone in ad hoc networks, including VANETs. Although quite a lot of work has been done on CDS algorithms for ad hoc networks, almost all existing algorithms focus on minimizing the size of CDS, i.e. the number of nodes in CDS. In this paper, the authors consider to improve the stability of CDS, i.e. to reduce the changes of CDS during the runtime of a VANET. By making use of vehicle navigation route, the authors propose a new metric to selecting CDS node with high stability. Then, based on the new metric the authors design a CDS algorithm, which can construct a CDS with higher stability than the CDS by existing algorithms. Such advantage is validated via extensive simulations.
45
Spadaccino, Pietro, Francesca Cuomo, and Andrea Baiocchi. "Epidemic and Timer-Based Message Dissemination in VANETs: A Performance Comparison." Electronics 9, no. 4 (March 31, 2020): 595. http://dx.doi.org/10.3390/electronics9040595.
Full textAbstract:
Data dissemination is among the key functions of Vehicular Ad-Hoc Networks (VANETs), and it has attracted much attention in the past decade. We address distributed, efficient, and scalable algorithms in the context of VANETs adopting the paradigm. We introduce an epidemic algorithm for message dissemination. The algorithm, named EPIC, is based on few assumptions, and it is very simple to implement. It uses only local information at each node, broadcast communications, and timers. EPIC is designed with the goal to reach the highest number of vehicles “infected” by the message, without overloading the network. It is tested on different scenarios taken from VANET simulations based on real urban environments (Manhattan, Cologne, Luxembourg). We compare our algorithm with a standard-based solution that exploits the contention-based forwarding component of the ETSI GeoNetworking protocol. On the other hand, we adapt literature based on a connected cover set to assess the near-optimality of our proposed algorithm and gain insight into the best selection of relay nodes as the size of the graph over which messages are spread scales up. The performance evaluation shows the behavior of EPIC and allows us to optimize the protocol parameters to minimize delay and overhead.
46
Yao, Yu Kun, Zhi Hu Liu, Zhi Ren, and Ya Di Wen. "An Efficient Routing Algorithm for Opportunistic Networks Based on Network Coding." Advanced Materials Research 756-759 (September 2013): 2214–19. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2214.
Full textAbstract:
To address the problems in Opportunistic Networks that nodes employing routing algorithms based on epidemic mechanism cant sense their neighboring nodes timely and many redundant data packets permeate through the network, an efficient routing algorithm based on XOR network coding was proposed (Xor Network Coding based Epidemic Routing, XNCER). When a node gets a Hello message, it broadcasts, instead of unicasting, a SV(Summary Vector) packet, in return, to all its neighboring nodes. Therefore, the data transmission can be initiated immediately, and the XOR network coding can also be leveraged so as to enhance the efficiency of data transmission. Moreover, the packets destined to the one hop neighboring nodes obtain the priority in transmission, and are determined whether to be deleted based on the ACK mechanism running in the MAC layer in order to cut down the memory overhead and restrain redundant packets from dissemination. Theoretical analysis and extensive simulation results show that the new algorithm obtains an overall improvement in terms of network overhead, average end-to-end delay as well as delivery rate. The novel algorithm can effectively solve the problems of sensing neighboring nodes and data redundancy.
47
Cui, Wanqiu, Junping Du, Dawei Wang, Feifei Kou, and Zhe Xue. "MVGAN: Multi-View Graph Attention Network for Social Event Detection." ACM Transactions on Intelligent Systems and Technology 12, no. 3 (July 19, 2021): 1–24. http://dx.doi.org/10.1145/3447270.
Full textAbstract:
Social networks are critical sources for event detection thanks to the characteristics of publicity and dissemination. Unfortunately, the randomness and semantic sparsity of the social network text bring significant challenges to the event detection task. In addition to text, time is another vital element in reflecting events since events are often followed for a while. Therefore, in this article, we propose a novel method named Multi-View Graph Attention Network (MVGAN) for event detection in social networks. It enriches event semantics through both neighbor aggregation and multi-view fusion in a heterogeneous social event graph. Specifically, we first construct a heterogeneous graph by adding the hashtag to associate the isolated short texts and describe events comprehensively. Then, we learn view-specific representations of events through graph convolutional networks from the perspectives of text semantics and time distribution, respectively. Finally, we design a hashtag-based multi-view graph attention mechanism to capture the intrinsic interaction across different views and integrate the feature representations to discover events. Extensive experiments on public benchmark datasets demonstrate that MVGAN performs favorably against many state-of-the-art social network event detection algorithms. It also proves that more meaningful signals can contribute to improving the event detection effect in social networks, such as published time and hashtags.
48
Fan, Na, Zongtao Duan, and Guangyuan Zhu. "A data dissemination mechanism based on evaluating behavior for vehicular delay-tolerant networks." International Journal of Distributed Sensor Networks 15, no. 7 (July 2019): 155014771986550. http://dx.doi.org/10.1177/1550147719865509.
Full textAbstract:
Vehicular delay-tolerant networks are widely used in intelligent transport application. Vehicle nodes exchange and share various information in vehicular delay-tolerant networks. However, current delay-tolerant network routing algorithms do not take into account the dynamic characteristic of traffic flow, and they do not effectively resist cyber attacks, such as black hole attack. To address this issue, we propose a data dissemination mechanism for vehicular delay-tolerant networks. In this mechanism, we develop a combined model to estimate the real-time traffic density. Simultaneously, we propose the metrics which include node interaction dispersion, node interaction freshness, node interaction participation, and node interaction contribution to evaluate behavior of nodes. Based on these metrics, a routing method is constructed. In this routing method, a relay node is selected by evaluating communication interaction behaviors among vehicle nodes. Considering the factors of traffic flow density and communication behaviors of vehicle nodes, a message forwarding strategy scheme is built for different traffic density scenarios. Extensive simulations show that the proposed mechanism exhibits superior performance over existing methods in forwarding traffic information and alleviates negative effects from black hole attacks.
49
Wu, Qingqing, Xianguan Zhao, Lihua Zhou, Yao Wang, and Yudi Yang. "Minimizing the influence of dynamic rumors based on community structure." International Journal of Crowd Science 3, no. 3 (September 2, 2019): 303–14. http://dx.doi.org/10.1108/ijcs-09-2019-0025.
Full textAbstract:
Purpose With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides convenience for life, it also brings many problems such as security risks and public opinion orientation. Various negative, malicious and false information spread across regions, which seriously affect social harmony and national security. Therefore, this paper aims to minimize negative information such as online rumors that has attracted extensive attention. The most existing algorithms for blocking rumors have prevented the spread of rumors to some extent, but these algorithms are designed based on entire social networks, mainly focusing on the microstructure of the network, i.e. the pairwise relationship or similarity between nodes. The blocking effect of these algorithms may be unsatisfactory in some networks because of the sparse data in the microstructure. Design/methodology/approach An algorithm for minimizing the influence of dynamic rumor based on community structure is proposed in this paper. The algorithm first divides the network into communities, and integrates the influence of each node within communities and rumor influence probability to measure the influence of each node in the entire network, and then selects key nodes and bridge nodes in communities as blocked nodes. After that, a dynamic blocking strategy is adopted to improve the blocking effect of rumors. Findings Community structure is one of the most prominent features of networks. It reveals the organizational structure and functional components of a network from a mesoscopic level. The utilization of community structure can provide effective and rich information to solve the problem of data sparsity in the microstructure, thus effectively improve the blocking effect. Extensive experiments on two real-world data sets have validated that the proposed algorithm has superior performance than the baseline algorithms. Originality/value As an important research direction of social network analysis, rumor minimization has a profound effect on the harmony and stability of society and the development of social media. However, because the rumor spread has the characteristics of multiple propagation paths, fast propagation speed, wide propagation area and time-varying, it is a huge challenge to improve the effectiveness of the rumor blocking algorithm.
50
Bür, Kaan, and Maria Kihl. "Evaluation of Selective Broadcast Algorithms for Safety Applications in Vehicular Ad Hoc Networks." International Journal of Vehicular Technology 2011 (April 10, 2011): 1–13. http://dx.doi.org/10.1155/2011/730895.
Full textAbstract:
Just as wireless communications develop further to achieve higher performance, new application areas emerge to challenge the limits. Vehicular ad hoc networks are one of these areas, and emergency situation warning is one of their most popular applications since traffic safety is a concern for everyone. Due to the life-critical nature of emergency applications, however, it is extremely important to ensure the solutions proposed meet the standards required, such as reliable and timely delivery of the safety warning in a situation like car collision avoidance. In order to put the candidate solutions to the test and evaluate their feasibility, we adopt the approach of computer simulation. We implement four different selective broadcast algorithms used for information dissemination in vehicular ad hoc networks, and compare their performance under identical realistic simulation conditions. Our goal is to provide an evaluation focussing on the performance with respect to safety, rather than to network aspects like throughput, loss, and delay. We define four new performance criteria to address the effectiveness, efficiency, timeliness, and overhead of the broadcast algorithms in safety warning delivery. The results we obtain using these criteria help us to understand better the design requirements of a high-performance selective broadcast algorithm.