Log in

Relevant bibliographies by topics / Computer networks. Selective dissemination of information / Journal articles

To see the other types of publications on this topic, follow the link: Computer networks. Selective dissemination of information.

Journal articles on the topic 'Computer networks. Selective dissemination of information'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Computer networks. Selective dissemination of information.'

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

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

ZHAO, Zhi-wei, Yong-gang WANG, and Jia-jun BU. "Integrated mutual selection based code dissemination for reprogramming wireless sensor networks." Journal of China Universities of Posts and Telecommunications 20, no. 1 (February 2013): 79–114. http://dx.doi.org/10.1016/s1005-8885(13)60011-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Azzaoui, Nadjet, Ahmed Korichi, Bouziane Brik, and Med el Amine Fekair. "Towards Optimal Dissemination of Emergency Messages in Internet of Vehicles: A Dynamic Clustering-Based Approach." Electronics 10, no. 8 (April 19, 2021): 979. http://dx.doi.org/10.3390/electronics10080979.

Full text

Abstract:

In this paper, we target dissemination issues of emergency messages in a highly dynamic Internet of Vehicles (IoV) network. IoV is emerging as a new class of vehicular networks to optimize road safety as well as users’ comfort. In such a context, forwarding emergency messages through vehicle-to-vehicle communications (V2V) plays a vital role in enabling road safety-related applications. For instance, when an accident occurs, forwarding such information in real time will help to avoid other accidents in addition to avoiding congestion of network traffic. Thus, dissemination of emergency information is a major concern. However, on the one hand, vehicle density has increased in the last decade which may lead to several issues including message collisions, broadcast storm, and the problem of hidden nodes. On the other hand, high mobility of vehicles and hence dynamic changes of network topology result in failure of dissemination of emergency packets. To overcome these problems, we propose a new dissemination scheme of emergency packets by vehicles equipped with both DSRC and cellular LTE wireless communication capabilities. Our scheme is based on a dynamic clustering strategy, which includes a new cluster head selection algorithm to deal with the broadcast storm problem. Furthermore, our selection algorithm enables not only the election of the most stable vehicles as cluster heads, and hence their exploitation in forwarding the emergency information, but also the avoidance of packet collisions. We simulated our scheme in an urban environment and compared it with other data dissemination schemes. Obtained results show the efficiency of our scheme in minimizing collision and broadcast storm problems, while improving latency, packet delivery ratio and data throughput, as compared to other schemes.

APA, Harvard, Vancouver, ISO, and other styles

4

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

Yao, Yuhui, Yan Sun, Chris Phillips, and Yue Cao. "Movement-Aware Relay Selection for Delay-Tolerant Information Dissemination in Wildlife Tracking and Monitoring Applications." IEEE Internet of Things Journal 5, no. 4 (August 2018): 3079–90. http://dx.doi.org/10.1109/jiot.2018.2831439.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cao, Dun, Bin Zheng, Baofeng Ji, Zhengbao Lei, and Chunhai Feng. "A robust distance-based relay selection for message dissemination in vehicular network." Wireless Networks 26, no. 3 (October 30, 2018): 1755–71. http://dx.doi.org/10.1007/s11276-018-1863-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Basha, S. Karimulla, and T. N. Shankar. "Fuzzy logic based forwarder selection for efficient data dissemination in VANETs." Wireless Networks 27, no. 3 (February 24, 2021): 2193–216. http://dx.doi.org/10.1007/s11276-021-02548-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Alowish, Mazen, Yoshiaki Shiraishi, Yasuhiro Takano, Masami Mohri, and Masakatu Morii. "A novel software-defined networking controlled vehicular named-data networking for trustworthy emergency data dissemination and content retrieval assisted by evolved interest packet." International Journal of Distributed Sensor Networks 16, no. 3 (March 2020): 155014772090928. http://dx.doi.org/10.1177/1550147720909280.

Full text

Abstract:

Vehicle ad hoc network is the key technology for a future Internet of vehicles and intelligent transport system. However, involvement of vast number of vehicles in Internet of vehicles limits the performance of vehicle ad hoc network. To tackle this problem, a novel vehicle ad hoc network architecture with two different technologies such as software-defined networking and named-data networking is proposed in this article. In the proposed software-defined networking controlled vehicular named-data networking, IP addressing issue is resolved by named-data networking and global view of the network is attained by software-defined networking. Emergency data dissemination is initiated with packet classification. For packet classification, policy-based bifold classifier is proposed in roadside unit and supported by evolved interest packet. Subsequently, best disseminator selection is carried out by trustworthy weighted graph scheme based on novel weight value, which is computed by considering significant metrics. Content retrieval is accomplished by roadside unit and assisted by a controller. Location of content producer is obtained from a controller and optimal route is selected by roadside unit. Optimal route selection is performed by roadside unit for both content retrieval and vehicle-to-vehicle communication using novel region-based hybrid cuckoo search algorithm. Hybrid algorithm combines cuckoo search and particle swarm optimization algorithm to perform efficient route selection. Involvement of software-defined networking controller supports numerous users by providing a global view of the network, which includes network status and traffic information. Extensive simulation in NS-3 assures better interest satisfaction rate, interest satisfaction delay, forwarder interest packets, average hop count, and gain of scalability in software-defined networking controlled vehicular named-data networking than traditional vehicle ad hoc network.

APA, Harvard, Vancouver, ISO, and other styles

9

Zhu, Yian, Lin Zhang, Haobin Shi, Kao-Shing Hwang, Xianchen Shi, and Shuyan Luo. "An Adaptive Routing-Forwarding Control Scheme Based on an Intelligent Fuzzy Decision-Making System for Opportunistic Social Networks." Symmetry 11, no. 9 (September 2, 2019): 1095. http://dx.doi.org/10.3390/sym11091095.

Full text

Abstract:

Routing selection in opportunistic social networks is a complex and challenging issue due to intermittent communication connections among mobile devices and dynamic network topologies. The structural characteristics of opportunistic social networks indicate that the social attributes of mobile nodes play a significant role on data dissemination. To this end, in this paper, we propose an adaptive routing-forwarding control scheme (FPRDM) based on an intelligent fuzzy decision-making system. On the foundation of the conception of fuzzy inference logic, two techniques are used in the proposed routing algorithm. Information fusion of social characteristics of message users and node identification are implemented based on the fuzzy recognition strategy, and the fuzzy decision-making mechanism is applied to control message replication and optimize data transmission. Simulation results demonstrate that, in the best case, the proposed scheme presents an average delivery ratio of 0.8, reduces the average end-to-end delay by nearly 45% as compared with the Epidemic routing protocol, and lowers the network overhead by about 75% as compared to the Spray and Wait routing algorithm.

APA, Harvard, Vancouver, ISO, and other styles

10

Mao, Ming, Peng Yi, Tao Hu, Zhen Zhang, Xiangyu Lu, and Jingwei Lei. "Hierarchical Hybrid Trust Management Scheme in SDN-Enabled VANETs." Mobile Information Systems 2021 (August 16, 2021): 1–16. http://dx.doi.org/10.1155/2021/7611619.

Full text

Abstract:

One of the principal missions of security in the Internet of Vehicles (IoV) is to establish credible social relationships. The trust management system has been proved to be an effective security solution in a connected vehicle environment. The use of trust management can play a significant role in achieving reliable data collection and dissemination and enhanced user security in the Internet of Vehicles. However, due to a large number of vehicles, the limited computing power of individuals, and the highly dynamic nature of the network, a universal and flexible architecture is required to realize the trust of vehicles in a dynamic environment. The existing solutions for trust management cannot be directly applied to the Internet of Vehicles. To ensure the safe transmission of data between vehicles and overcome the problems of high communication delay and low recognition rate of malicious nodes in the current trust management scheme, an efficient flow forwarding mechanism of the RSU close to the controller in the Software-Defined Vehicular Network is used to establish a hierarchical hybrid trust management architecture. This method evaluates the dynamic trust change of vehicle behavior based on the trust between vehicles and the auxiliary trust management of the infrastructure to the vehicle, combined with static and dynamic information and other indicators. The proposed trust management scheme is superior to the comparative schemes in resisting simple attacks, selective misbehavior attacks, and time-dependent attacks under the condition of ensuring superior real-time performance. Its overall accuracy is higher than that of the baseline scheme.

APA, Harvard, Vancouver, ISO, and other styles

11

Qiang, Xu, Zhao Huiqi, Farhad Ali, and Shah Nazir. "Criterial Based Opinion Leader’s Selection for Decision-Making Using Ant Colony Optimization." Scientific Programming 2021 (July 28, 2021): 1–12. http://dx.doi.org/10.1155/2021/4624334.

Full text

Abstract:

The Internet has already become a medium for people to access information, express their views, and connect with one another through various media and tools as a result of its rapid global development. Web 2.0 has become increasingly important in people’s daily lives. With the passing of time, many online communities, such as blogs, forums, and websites, are becoming more interactive. Individuals can easily express their opinions publicly and see what others say about their opinions. In a social network, an opinion leader is a powerful individual who is an expert in a particular field and has a large number of people who follow his or her comments or ideas. Companies and governments may contact the most powerful people after discovering them in order to influence sales or guide public opinion, respectively. In heterogeneous communication networks, opinion leaders serve as an influencer for the acceptance and dissemination of new products and users in marketing. Others’ drives, values, perceptions, motivations, and actions can be influenced by opinion leaders. These influences have a major effect on other customers’ policymaking processes. Opinion leaders come in a variety of demographic shapes; in general, they are committed, ambitious, and dynamic individuals with excellent academic and social edifications who persuade customers through their expert knowledge. Opinions and values are the most important variables in human experiences in social phenomena. The method of assessing opinions is extremely difficult since people often change their minds when speaking with others. The study of the evolution and formation of opinions in a social group is known as opinion dynamics, and it is based on collective decision-making. The bounded confidence rule is one of the intrinsic interaction principles in the dynamics of human actions. Many models have been created to date to explore the dynamics of leaders’ decision-making. Due to the social network’s high complexity and the randomness and contingency of their behavior, identifying opinion leaders in the network is difficult. Organizations and entrepreneurs must choose which opinion leaders to partner with to gain a deeper understanding of how to communicate with them to promote various goods and services. For the opinion leader’s selection optimization, the proposed framework feature-based opinion leader selection is utilized using the ant colony optimization technique that selects the best opinion leader based on their unique features. The proposed method will address the opinion leader selection problem.

APA, Harvard, Vancouver, ISO, and other styles

12

Koubarakis, Manolis, Christos Tryfonopoulos, Stratos Idreos, and Yannis Drougas. "Selective information dissemination in P2P networks." ACM SIGMOD Record 32, no. 3 (September 2003): 71–76. http://dx.doi.org/10.1145/945721.945736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Agrawal, D., and A. Malpani. "Efficient Dissemination of Information in Computer Networks." Computer Journal 34, no. 6 (December 1, 1991): 534–41. http://dx.doi.org/10.1093/comjnl/34.6.534.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Wischhof, L., A. Ebner, and H. Rohling. "Information Dissemination in Self-Organizing Intervehicle Networks." IEEE Transactions on Intelligent Transportation Systems 6, no. 1 (March 2005): 90–101. http://dx.doi.org/10.1109/tits.2004.842407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Lv, Xiaojing, and Dongphil Chun. "Media Information Dissemination Model of Wireless Networks Using Deep Residual Network." Mobile Information Systems 2021 (July 2, 2021): 1–10. http://dx.doi.org/10.1155/2021/1711944.

Full text

Abstract:

Information dissemination and its prediction in wireless networks is a challenging task. Researchers have studied the prediction process of media information dissemination in wireless networks using various methods. In this paper, we analyze information dissemination in wireless networks using a deep residual network model. In the proposed model, the relative weight of nodes and the dissemination probability of media information in wireless networks are obtained. The obtained information is the inputs into the deep residual network as features. The convolution feature extractor is used to obtain the details of the input features. Finally, the propagation information is classified according to the extracted features through the full connection layer. We have used the SELU activation function to optimize the deep residual network. In this way, a complete media information dissemination prediction of wireless networks is obtained. The simulation results show that the proposed model has fast convergence and a low bit error rate of information dissemination. It reflects the characteristics of media information dissemination in a wireless network in real-time applications. The results show accurate prediction of media information dissemination in wireless networks.

APA, Harvard, Vancouver, ISO, and other styles

16

Yu-Feng Chou, Hsin-Heng Huang, and Ray-Guang Cheng. "Modeling Information Dissemination in Generalized Social Networks." IEEE Communications Letters 17, no. 7 (July 2013): 1356–59. http://dx.doi.org/10.1109/lcomm.2013.052013.130097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Shrestha, Rakesh, and Seung Yeob Nam. "Trustworthy Event-Information Dissemination in Vehicular Ad Hoc Networks." Mobile Information Systems 2017 (2017): 1–16. http://dx.doi.org/10.1155/2017/9050787.

Full text

Abstract:

In vehicular networks, trustworthiness of exchanged messages is very important since a fake message might incur catastrophic accidents on the road. In this paper, we propose a new scheme to disseminate trustworthy event information while mitigating message modification attack and fake message generation attack. Our scheme attempts to suppress those attacks by exchanging the trust level information of adjacent vehicles and using a two-step procedure. In the first step, each vehicle attempts to determine the trust level, which is referred to as truth-telling probability, of adjacent vehicles. The truth-telling probability is estimated based on the average of opinions of adjacent vehicles, and we apply a new clustering technique to mitigate the effect of malicious vehicles on this estimation by removing their opinions as outliers. Once the truth-telling probability is determined, the trustworthiness of a given message is determined in the second step by applying a modified threshold random walk (TRW) to the opinions of the majority group obtained in the first step. We compare our scheme with other schemes using simulation for several scenarios. The simulation results show that our proposed scheme has a low false decision probability and can efficiently disseminate trustworthy event information to neighboring vehicles in VANET.

APA, Harvard, Vancouver, ISO, and other styles

18

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

19

Ramamritham, Krithi, and Prashant Shenoy. "Guest Editors' Introduction: Dynamic Information Dissemination." IEEE Internet Computing 11, no. 4 (July 2007): 14–15. http://dx.doi.org/10.1109/mic.2007.85.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Nekovee, Maziar, and Yamir Moreno. "Dynamics of gossip-like information dissemination in complex computer networks." International Journal of Computer Mathematics 85, no. 8 (August 2008): 1165–73. http://dx.doi.org/10.1080/00207160701763065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Chen, Pin-Yu, Shin-Ming Cheng, and Kwang-Cheng Chen. "Optimal Control of Epidemic Information Dissemination Over Networks." IEEE Transactions on Cybernetics 44, no. 12 (December 2014): 2316–28. http://dx.doi.org/10.1109/tcyb.2014.2306781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hossain, A. K. M. Mahtab, Preechai Mekbungwan, and Kanchana Kanchanasut. "Directed information dissemination in vehicular ad-hoc networks." Wireless Networks 20, no. 5 (October 26, 2013): 899–916. http://dx.doi.org/10.1007/s11276-013-0655-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Ko, Young Myoung, and Natarajan Gautam. "Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks." IEEE/ACM Transactions on Networking 18, no. 6 (December 2010): 1738–51. http://dx.doi.org/10.1109/tnet.2010.2048122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Konstantas, Dimitri, and Jean-Henry Morin. "Agent-based commercial dissemination of electronic information." Computer Networks 32, no. 6 (May 2000): 753–65. http://dx.doi.org/10.1016/s1389-1286(00)00027-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ragab, K., N. Kaji, Y. Horikoshi, H. Kuriyama, and K. Mori. "Autonomous decentralized community communication for information dissemination." IEEE Internet Computing 8, no. 3 (May 2004): 29–36. http://dx.doi.org/10.1109/mic.2004.1297271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hromkovič, Juraj, Claus Dieter Jeschke, and Burkhard Monien. "Optimal algorithms for dissemination of information in some interconnection networks." Algorithmica 10, no. 1 (July 1993): 24–40. http://dx.doi.org/10.1007/bf01908630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Huang, Juanjuan. "Information Dissemination Control Algorithm of Ecological Changes in the New Media Communication Environment." Mobile Information Systems 2021 (August 10, 2021): 1–10. http://dx.doi.org/10.1155/2021/6274856.

Full text

Abstract:

Information dissemination has been a crucial social process, especially in modern information-centric societies; it has become one of the most critical ones. Social networks create a route for information dissemination with the use of social influence mechanisms. In order to improve the effectiveness of information dissemination control and influence the maximization of ecological change in the modern media communication environment, this paper combines the current network information dissemination methods and analyzes the community network model and the network dissemination states for spreading information. We propose an improved algorithm for information dissemination control of ecological changes in the new media dissemination environment. The fuzzy control algorithm is employed as the core algorithm to improve and optimize the information dissemination network model. Furthermore, the mobile-assisted patch distribution mechanism is used to repair all the infected nodes in the network, and the information interaction form is analyzed to develop the corresponding system model structure and build the information traceability process. The simulation results verify the feasibility of using the proposed algorithm to control effectively the information dissemination in the ecological changes of the new media environment. The proposed algorithm can meet the ecological information control needs of new media dissemination.

APA, Harvard, Vancouver, ISO, and other styles

28

Anagnostopoulos, Christos, Odysseas Sekkas, and Stathes Hadjiefthymiades. "An adaptive epidemic information dissemination model for wireless sensor networks." Pervasive and Mobile Computing 8, no. 5 (October 2012): 751–63. http://dx.doi.org/10.1016/j.pmcj.2011.06.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Wang, Weiguo, Chen Chu, Jinzhuo Liu, and Tairan Li. "An Epidemic Model of Information Dissemination in Mobile Social Networks." International Journal of u- and e-Service, Science and Technology 8, no. 1 (January 31, 2015): 221–30. http://dx.doi.org/10.14257/ijunesst.2015.8.1.20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Cheng, Yong. "Crowd-Sourcing Information Dissemination Based on Spatial Behavior and Social Networks." Mobile Information Systems 2021 (March 23, 2021): 1–16. http://dx.doi.org/10.1155/2021/6652740.

Full text

Abstract:

In the context of today’s network era, rich social networks and convenient network communication make different individuals and groups interact and transmit information in more diversified ways, which also bring new dissemination in information of crowd-sourcing tasks. The paper analyzes mobile behavior characteristics of users from different perspectives, such as spatial activity behavior and location type preference, and constructs a user space mobile behavior model based on the physical world. At the same time, it analyzes the social influence of users in social networks and mode of information transmission. In the paper, real data sets are adopted, mathematical modeling and computer simulation are combined to build an information communication model around the social influence of users in social networks, and the rules of information communication in new environment of social networks are depicted in combination with users’ spatial movement.

APA, Harvard, Vancouver, ISO, and other styles

31

Dinh, Ngoc-Thanh, and Younghan Kim. "Information-centric dissemination protocol for safety information in vehicular ad-hoc networks." Wireless Networks 23, no. 5 (February 20, 2016): 1359–71. http://dx.doi.org/10.1007/s11276-016-1225-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Bagchi, A., E. F. Schmeichel, and S. L. Hakimi. "Sequential information dissemination by packets." Networks 22, no. 4 (July 1992): 317–33. http://dx.doi.org/10.1002/net.3230220402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Liu, Dandan, Xiaodong Hu, and Xiaohua Jia. "Energy efficient information dissemination protocols by negotiation for wireless sensor networks." Computer Communications 29, no. 11 (July 2006): 2136–49. http://dx.doi.org/10.1016/j.comcom.2006.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Garbinato, Benoît, Denis Rochat, Marco Tomassini, and François Vessaz. "Injecting power-awareness into epidemic information dissemination in sensor networks." Future Generation Computer Systems 26, no. 6 (June 2010): 868–76. http://dx.doi.org/10.1016/j.future.2010.02.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Rong Zheng. "Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks." IEEE Transactions on Wireless Communications 7, no. 1 (January 2008): 251–59. http://dx.doi.org/10.1109/twc.2008.060474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Zheng, Hamid R. Sadjadpour, and J. J. Garcia-Luna-Aceves. "Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks." IEEE Transactions on Wireless Communications 10, no. 3 (March 2011): 803–13. http://dx.doi.org/10.1109/twc.2011.011211.100007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Gong-An, Qiu, and Zhang Xiao-Ge. "Path Situation Assessment of Multi-hop Information Dissemination-in Vehicular Wireless Networks." Information Technology Journal 12, no. 17 (August 15, 2013): 4328–31. http://dx.doi.org/10.3923/itj.2013.4328.4331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Murai, Fabricio, Diogo Rennó, Bruno Ribeiro, Gisele L. Pappa, Don Towsley, and Krista Gile. "Selective harvesting over networks." Data Mining and Knowledge Discovery 32, no. 1 (July 12, 2017): 187–217. http://dx.doi.org/10.1007/s10618-017-0523-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Han, Shao Chun, Yun Liu, Hui Ling Chen, and Zhen Jiang Zhang. "Influence Model of User Behavior Characteristics on Information Dissemination." International Journal of Computers Communications & Control 11, no. 2 (January 26, 2016): 209. http://dx.doi.org/10.15837/ijccc.2016.2.2441.

Full text

Abstract:

Quantitative analysis on human behavior, especially mining and modeling temporal and spatial regularities, is a common focus of statistical physics and complexity sciences. The in-depth understanding of human behavior helps in explaining many complex socioeconomic phenomena, and in finding applications in public opinion monitoring, disease control, transportation system design, calling center services, information recommendation. In this paper,we study the impact of human activity patterns on information diffusion. Using SIR propagation model and empirical data, conduct quantitative research on the impact of user behavior on information dissemination. It is found that when the exponent is small, user behavioral characteristics have features of many new dissemination nodes, fast information dissemination, but information continued propagation time is short, with limited influence; when the exponent is big, there are fewer new dissemination nodes, but will expand the scope of information dissemination and extend information dissemination duration; it is also found that for group behaviors, the power-law characteristic a greater impact on the speed of information dissemination than individual behaviors. This study provides a reference to better understand influence of social networking user behavior characteristics on information dissemination and kinetic effect.

APA, Harvard, Vancouver, ISO, and other styles

40

Lim, Alvin. "Distributed services for information dissemination in self-organizing sensor networks." Journal of the Franklin Institute 338, no. 6 (September 2001): 707–27. http://dx.doi.org/10.1016/s0016-0032(01)00020-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Schoch, Elmar, Moritz Keppler, Frank Kargl, and Michael Weber. "On the security of context‐adaptive information dissemination." Security and Communication Networks 1, no. 3 (May 2008): 205–18. http://dx.doi.org/10.1002/sec.29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Oikonomou, Konstantinos, Dimitrios Kogias, and Ioannis Stavrakakis. "Probabilistic flooding for efficient information dissemination in random graph topologies." Computer Networks 54, no. 10 (July 2010): 1615–29. http://dx.doi.org/10.1016/j.comnet.2010.01.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Chiti, Francesco, Romano Fantacci, Benedetta Picano, and Laura Pierucci. "A Capacitated House Allocation Game for the Energy Efficient Relays Selection in 5G Multicast Context." Sensors 20, no. 18 (September 18, 2020): 5347. http://dx.doi.org/10.3390/s20185347.

Full text

Abstract:

The upcoming fifth generation (5G) wireless networks making use of higher-frequency spectrum bands suffer from serious propagation issues due to high path loss and beam directivity requirements. This promotes the device-to-device communications to boost the transmission reliability at the network edges, providing remarkable benefits in terms of the energy and spectrum efficiency, essential for a wide class of sensors networks and Internet-of-Things. More in general, applications where devices are usually constrained in computational and transmission range capabilities. In such a context, the selection of the proper number of devices arranged as a relay plays a crucial role. Towards this goal, this paper proposes an efficient relay selection scheme minimizing both the delivery transmission delay and the overall energy consumption, i.e., the overall number of relays to be used. By focusing on a multicast content delivery application scenario the problem of interest is formulated as a one-sided preferences matching game. In addition, the strategy designed takes into account specific information, named reputation coefficient, associated to each device jointly with link propagation conditions for allowing the selection of suitable relays for disseminating the content among the devices. The effectiveness of the proposed solution is underpinned by computer simulations, and the performance is evaluated in terms of power consumption, end-to-end delay, and number of selected relays. As confirmed by results, the proposed approach improves network performance compared to the greedy approach, the random algorithm, a scheme previously proposed in literature, and with two game theory-based strategies.

APA, Harvard, Vancouver, ISO, and other styles

44

Topkis, Donald M. "Repeated uncoordinated information dissemination by flooding." Networks 26, no. 1 (August 1995): 13–23. http://dx.doi.org/10.1002/net.3230260103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Afonso, Ana Paula, and Mário J. Silva. "Dynamic Information Dissemination to Mobile Users." Mobile Networks and Applications 9, no. 5 (October 2004): 529–36. http://dx.doi.org/10.1023/b:mone.0000034706.03412.38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Zhang, Yu, and Mihaela van der Schaar. "Strategic Networks: Information Dissemination and Link Formation Among Self-Interested Agents." IEEE Journal on Selected Areas in Communications 31, no. 6 (June 2013): 1115–23. http://dx.doi.org/10.1109/jsac.2013.130613.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Zhou, Xiaohui, Salman Durrani, and Jing Guo. "Drone-Initiated D2D-Aided Multihop Multicast Networks for Emergency Information Dissemination." IEEE Access 8 (2020): 3566–78. http://dx.doi.org/10.1109/access.2019.2962224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Vojnović, Milan, Varun Gupta, Thomas Karagiannis, and Christos Gkantsidis. "Sampling Strategies for Epidemic-Style Information Dissemination." IEEE/ACM Transactions on Networking 18, no. 4 (August 2010): 1013–25. http://dx.doi.org/10.1109/tnet.2010.2051233.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Yu, Jianye, Junjie Lv, Yuanzhuo Wang, and Jingyuan Li. "Mechanism analysis of competitive information asynchronous dissemination on social networks." International Journal of Modern Physics C 30, no. 11 (November 2019): 1950094. http://dx.doi.org/10.1142/s0129183119500943.

Full text

Abstract:

Information dissemination groups, especially those disseminating the same kind of information such as advertising, product promotion, etc., compete with each other when their information spread on social networks. Most of the existing methods analyze the dissemination mechanism mainly upon the information itself without considering human characteristics, e.g. relation networks, cooperation/defection, etc. In this paper, we introduce a framework of social evolutionary game (SEG) to investigate the influence of human behaviors in competitive information dissemination. Coordination game is applied to represent human behaviors in the competition of asynchronous information diffusion. We perform a series of simulations through a specific game model to analyze the mechanism and factors of information diffusion, and show that when the benefits of competitive information is around 1.2 times of the original one, it can compensate the loss of reputation caused by the change of strategy. Furthermore, through experiments on a dataset of two films on Sina Weibo, we described the mechanism of competition evolution over real data of social network, and validated the effectiveness of our model.

APA, Harvard, Vancouver, ISO, and other styles

50

Garyfalos, A., and K. C. Almeroth. "Coupons: A Multilevel Incentive Scheme for Information Dissemination in Mobile Networks." IEEE Transactions on Mobile Computing 7, no. 6 (June 2008): 792–804. http://dx.doi.org/10.1109/tmc.2008.37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!