Brownian gossip: Exploiting node mobility to diffuse information in ad hoc networks

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing

Volumn 2005, Issue , 2005, Pages

  Choudhury, Romit Roy ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROWNIAN GOSSIP; DIFFUSE INFORMATION; NETWORK SERVICES; NODE MOBILITY; RANDOM PROPAGATION;

BANDWIDTH; COMMUNICATION; MOBILE COMPUTING; QUERY LANGUAGES; ROUTERS; ROUTING ALGORITHMS;

AD HOC NETWORKS;

EID: 33947639934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Yu-Chee Tseng, Sze-Yao Ni, Yuh-Shyan Chen, and Jang-Ping Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networking, 2002.
2. Jingyuan Zhang, Location management in cellular networks, 2002.
3. Y. Ko and N. H. Vaidya, Location aided routing (lar) in mobile ad hoc networks, in Mobile Computing and Networking, 1998.
4. Brad Karp and H. T. Kung, Gpsr: greedy perimeter stateless routing for wireless networks, in Proceedings of Mobicom, 2000.
5. Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A. Woodward, A distance routing effect algorithm for mobility (dream), in Proceedings of Mobicom, 1998.
6. Zygmunt J. Haas, Joseph Y. Halpern, and Li Li, Gossip-based ad hoc routing, in Infocom, 2002.
7. David Kempe, Alin Dobra, and Johannes Gehrke, Gossip-based computation of aggregate information, in IEEE Symposium on Foundations of Computer Science (FOCS'03), 2003.
8. Xiang-Yang Li, K. Moaveninejad, and O. Frieder, Regional gossip routing for wireless ad hoc networks, Mobile Networks and Applications, vol. 10, no. 1-2, 2005.
9. W. Zhao, M. Ammar, and E. Zegura, A message ferrying approach for data delivery in sparse mobile ad hoc networks, in Proceedings of Mobihoc, 2004.
10. M. Grossglauser and M. Vetterli, Locating nodes with ease, in Proceedings of Infocom, 2003.