Self-Limiting Epidemic Forwarding

作者: Jean-Yves Le Boudec , Alaeddine El Fawal , Kave Salamatian

DOI:

关键词:

摘要: We define a self-limiting epidemic service as dissemination for ad-hoc environments that is broadcast in nature, but limited to local scope around each source. Example applications are chatting or bulletin boards traffic jam, an instant crowd campus or, contrast, along desert highway. Our goal support such across wide range of conditions (dense sparse). The main problems adaptively control scoping and rates avoid congestion. propose system design with the following elements: (1) manipulation TTL by adaptive aging mechanisms; (2) forwarding factor self-inhibition inter-inhibition (3) rate injection sources. validate implementation Java analyze it using both simulation ordinary differential equations. show how can be tuned achieve appropriate balance between limitation information. entirely self-organized, free any form clustering leader election.

参考文章(12)
Dina Katabi, Sachin Katti, Wenjun Hu Hariharan, Rahul Muriel Médard, The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments ,(2005)
Xiaolan Zhang, Giovanni Neglia, Jim Kurose, Don Towsley, Performance Modeling of Epidemic Routing NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. ,vol. 3976, pp. 827- 839 ,(2006) , 10.1007/11753810_69
M. Durvy, P. Thiran, Reaction-diffusion based transmission patterns for ad hoc networks international conference on computer communications. ,vol. 3, pp. 2195- 2205 ,(2005) , 10.1109/INFCOM.2005.1498494
Abdelmajid Khelil, Christian Becker, Jing Tian, Kurt Rothermel, An epidemic model for information diffusion in MANETs Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems - MSWiM '02. pp. 54- 60 ,(2002) , 10.1145/570758.570768
Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, Jang-Ping Sheu, The broadcast storm problem in a mobile ad hoc network acm/ieee international conference on mobile computing and networking. pp. 151- 162 ,(1999) , 10.1145/313451.313525
Paul Tennent, Malcolm Hall, Barry Brown, Matthew Chalmers, Scott Sherwood, Three applications for mobile epidemic algorithms human computer interaction with mobile devices and services. pp. 223- 226 ,(2005) , 10.1145/1085777.1085815
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks acm special interest group on data communication. pp. 252- 259 ,(2005) , 10.1145/1080139.1080143
F. Cali, M. Conti, E. Gregori, Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit IEEE ACM Transactions on Networking. ,vol. 8, pp. 785- 799 ,(2000) , 10.1109/90.893874
P. Gupta, P.R. Kumar, The capacity of wireless networks IEEE Transactions on Information Theory. ,vol. 46, pp. 388- 404 ,(2000) , 10.1109/18.825799
Z.J. Haas, J.Y. Halpern, Li Li, Gossip-based ad hoc routing international conference on computer communications. ,vol. 3, pp. 1707- 1716 ,(2002) , 10.1109/INFCOM.2002.1019424