Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29609

Select areas to restrict search in scientific publication database:
Peer-to-Peer Epidemic Algorithms for Reliable Multicasting in Ad Hoc Networks
Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, services and applications designed for ad hoc networks should adapt to this dynamic and distributed environment. In particular, multicast algorithms having reliability and scalability requirements should abstain from centralized approaches. We aspire to define a reliable and scalable multicast protocol for ad hoc networks. Our target is to utilize epidemic techniques for this purpose. In this paper, we present a brief survey of epidemic algorithms for reliable multicasting in ad hoc networks, and describe formulations and analytical results for simple epidemics. Then, P2P anti-entropy algorithm for content distribution and our prototype simulation model are described together with our initial results demonstrating the behavior of the algorithm.
Digital Object Identifier (DOI):


[1] M. Frodigh, et al, "Wireless Ad Hoc Networking: The Art of Networking without a Network," Ericsson Review, No. 4, 2000.
[2] E. Pagani and G. P. Rossi, "Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks,"Mobile Networks and Applications, vol. 5, no. 4, pp. 175- 192, 1999.
[3] S.K.S. Gupta and P.K. Srimani, "An adaptive protocol for reliable multicast in mobile multi-hop radio networks," in IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 111-122.
[4] J. Luo, P.Th Eugster, and J.-P. Hubaux, "Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks," Proc. INFOCOM, pp. 2229-2239, 2003.
[5] R. Chandra, V. Ramasubramanian, and K. Birman, "Anonymous gossip: Improving multicast reliability in mobile ad-hoc networks". In Proc. 21st International Conference on Distributed Computing Systems (ICDCS), pages 275-283, 2001.
[6] VINT Project. The UCB/LBNL/VINT network simulator-ns (Version 2).
[7] J. Luo, P.Th Eugster, and J.-P. Hubaux, "Pilot: Probabilistic Lightweight Group Communication System for Ad Hoc Networks," IEEE Transactions on Mobile Computing, Vol. 3, No.2, April-June 2004.
[8] Haas, J. Halpern, and L. Li, "Gossip-based Ad Hoc Routing,"Proc. of IEEE INFOCOM 2002.
[9] A. Vahdat and D. Becker. "Epidemic routing for partiallyconnected ad hoc networks". Duke Technical Report CS- 2000-06, July 2000.
[10] Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D. and Terry, D., "Epidemic Algorithms for Replicated Database Maintenance", Proc. of the Sixth ACM Symp. on Principles of Distributed Computing, 1-12p, 1987.
[11] Birrell, A.D., Levin, R., Needham, R.M. and Schroeder, M.D., "Grapevine, An Exercise in Distributed Computing", Communications of the ACM, 25(4), 260-274p, 1982.
[12] Golding, R.A. and Taylor K., "Group Membership in the Epidemic Style", Technical Report, UCSC-CRL-92-13, University of California at Santa Cruz, 1992.
[13] Ladin, R., Lishov, B., Shrira, L. and Ghemawat, S., "Providing Availability using Lazy Replication", ACM Transactions on Computer Systems, 10(4), 360-391p, 1992.
[14] Guo, K., "Scalable Message Stability Detection Protocols", Ph.D. dissertation, Cornell University Dept. of Computer Science, 1998.
[15] van Renesse, R., Minsky, Y. and Hayden, M., "A Gossip-style Failure Detection Service", Proceedings of Middleware-98, 55-70p, 1998.
[16] Xiao, Z. and Birman, KP., "A Randomized Error Recovery Algorithm for Reliable Multicast", Proceedings, IEEE Infocom 2001.
[17] van Renesse, R., Birman, K.P., Vogels, W., "Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining", ACM Transactions on Computer Systems, Vol. 21, No. 2, pp. 164-206, May 2003.
[18] Bailey, N.T.J., "The Mathematical Theory of Infectious Diseases and its Applications", second edition, Hafner Press, 1975.
Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007