Gossip-based ad hoc routing

IEEE/ACM Transactions on Networking

Volumn 14, Issue 3, 2006, Pages 479-491

  Haas, Zygmunt J ^a   Halpern, Joseph Y ^b   Li, Li ^b,c  

^a Cornell University   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Ad hoc networks; Gossiping; Percolation theory; Phase transition; Routing

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER SIMULATION; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS;

GOSSIP-BASED AD HOC ROUTING; PERCOLATION THEORY; ROUTING PROTOCOLS;

CONGESTION CONTROL (COMMUNICATION);

EID: 33745603239     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2006.876186     Document Type: Article

References (30)

1. S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, "A distance routing effect algorithm for mobility (DREAM)," in Proc. ACM MobiCom, 1998, pp. 76-84.
2. C. Bettstetter, G. Resta, and P. Santi, "The node distribution of the random waypoint mobility model for wireless ad hoc networks," IEEE Trans. Mobile Comput., vol. 2, no. 3, pp. 257-269, Jul.-Sep. 2003.
3. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, "Bimodal multicast," ACM Trans. Comput. Syst., vol. 17, no. 2, pp. 41-88, May 1999.
4. D. Braginsky and D. Estrin, "Rumor routing algorthim for sensor networks," in Proc. 1st ACM Int. Workshop on Wireless Sensor Networks and Applications, 2002, pp. 22-31.
5. J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," in Proc. ACM MobiCom, Oct. 1998, pp. 85-97.
6. R. Chandra, V. Ramasubramanian, and K. Birman, "Anonymous gossip: improving multicast reliability in mobile ad hoc networks," in Proc. 21st Int. Conf. Distributed Computing Systems (ICDCS), 2001, pp. 275-283.
7. B. Chlebus, L. Gasieniec, A. Lingas, and A. Pagourtzis, "Oblivious gossiping in ad hoc radio networks," in Proc. 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'2001), 2001, pp. 44-51.
8. S. R. Das, C. E. Perkins, and E. M. Royer, "Performance comparison of two on-demand routing protocols for ad hoc networks," in Proc. IEEE INFOCOM, Mar. 2000, pp. 3-12.
9. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic algorithms for replicated database maintenance," in Proc. ACM Symp. Principles of Distributed Computing, 1987, pp. 1-12.
10. G. Grimmett, Percolation. New York: Springer-Verlag, 1989.
11. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
12. Z. Haas and M. Pearlman, "The performance of query control schemes for the zone routing protocol," in Proc. ACM SIGCOMM, 1998, pp. 167-177.
13. W. Heinzelman, J. Kulik, and H. Balakrishnan, "Adaptive protocols for information dissemination in wireless sensor networks," in Proc. ACM MobiCom, 1999, pp. 174-185.
14. D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Boston, MA: Kluwer Academic, 1996.
15. B. Karp and H. T. Kung, "Greedy perimeter stateless routing (GPSR) for wireless networks," in Proc. ACM MobiCom, 2000, pp. 243-254.
16. Y. B. Ko and N. H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks," in Proc. ACM MobiCom, 1998, pp. 66-75.
17. J. Li, C. Blake, D. S. J. De Couto, H. I. Lee, and R. Morris, "Capacity of ad hoc wireless networks," in Proc. ACM MobiCom, 2001, pp. 61-69.
18. X.-Y. Li, K. Moaveninejad, and O. Frieder, "Regional gossip routing for wireless ad hoc networks," Mobile Networks and Applications (MONET), vol. 10, no. 1-2, pp. 61-77, 2005
19. J. Luo, P. T. Eugster, and J. P. Hubaux, "Route driven gossip: Probabilistic reliable multicast in ad hoc networks," in Proc. IEEE INFOCOM, Apr. 2003, pp. 2229-2239.
20. R. Meester and R. Roy, Continuum Percolation. Cambridge, U.K.: Cambridge Univ., 1996.
21. P. Nain, D. Towsley, B. Liu, and Z. Liu, "Properties of random direction models," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1897-1907.
22. S. Y. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu, "The broadcast storm problem in a mobile ad hoc network," in Proc. ACM MobiCom, 1999, pp. 151-162.
23. V. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proc. IEEE INFOCOM, Apr. 1997, pp. 1405-1413.
24. C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100.
25. The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. Online. Available: http://www.isi.edu/nsnam/ns
26. T. S. Rappaport, Wireless Communications: Principles and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1996.
27. Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic broadcast for flooding in wireless mobile ad hoc networks," in Proc. IEEE Wireless Communications and Networking Conf. (WCNC), 2003, pp. 1124-1130.
28. B. Tuch, "Development of WaveLAN, an ISM band wireless LAN," AT&T Tech. J., vol. 72, no. 4, pp. 27-33, 1993.
29. A. Vahdat and D. Becker, Epidemic routing for partially-connected ad hoc networks. Duke University Tech. Rep. CS-2000-06, Jul. 2000.
30. J. Yoon, M. Liu, and B. Noble, "Random waypoint considered harmful," in Proc. IEEE INFOCOM, 2003, pp. 1312-1321.