Information dissemination in highly dynamic graphs

Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'05

Volumn , Issue , 2005, Pages 104-110

  O'Dell, Regina ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Dynamic graphs; Flooding; Mobile network; Routing

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; REQUIREMENTS ENGINEERING; TELECOMMUNICATION NETWORKS;

DYNAMIC GRAPHS; FLOODING; MOBILE NETWORKS; ROUTING;

INFORMATION DISSEMINATION;

EID: 33745832709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1080810.1080828     Document Type: Conference Paper

References (13)

1. Baruch Awerbuch. Reducing complexities of distributed magimum flow and breadth-first search algorithms by means of network synchronization. Networks, 15:425-437, 1985.
2. Henri Dubois-Ferriere, Matthias Grossglauser, and Martin Vetterli. Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2004.
3. Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3), 2003.
4. Eli Gafni and Dimitri Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 29(1), January 1981.
5. Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar. ZRP: A Hybrid Framework for Routing in Ad Hoc Networks. In Ad Hoc Networking. Addison-Wesley, 2001.
6. Marc Heissenbüttel. Networking in Ad-hoc Networks. PhD thesis, University of Bern, CH-3012 Bern, Switzerland, June 2005.
7. David B. Johnson, David A. Maltz, and Josh Broch. DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. In Ad Hoc Networking. Addison-Wesley, 2001.
8. Fabian Kühn, Roger Wattenhofer, Yan Zhang, and Aaron Zollinger. Geometric ad-hoc routing: Of theory and practice. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003.
9. Daniel Lang. A comprehensive overview about selected ad hoc networking routing protocols. Technical report, Technische Universität München, Department of Computer Science, March 2003.
10. Moni Naor and Larry Stockmeyer. What can be computed locally? In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), 1993.
11. David Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (SIAM), 2000.
12. Charles E. Perkins and Elizabeth M. Royer. Ad hoc On-Demand Distance Vector Routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 1999.
13. Prince Samar, Marc R. Pearlman, and Zygmunt J. Haas. Independent Zone Routing: An Adaptive Hybrid Routing Framework for Ad Hoc Wireless Networks. IEEE/ACM Transactions on Networking (TON), 12(4), 2004.