Last encounter routing under random waypoint mobility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3042, Issue , 2004, Pages 974-988

  Sarafijanovic Djukic, Natasa ^a   Grossglauser, Matthias ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

CONTROL TRAFFIC; MOBILITY MODEL; NODE MOBILITY; OPTIMAL PREDICTOR; RANDOM WALK; RANDOM WAYPOINTS; TIME HORIZONS; TOPOLOGY CHANGES;

MOBILE AD HOC NETWORKS;

EID: 35048869089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_80     Document Type: Article

References (8)

1. M. Grossglauser and M. Vetterli. Locating Nodes with EASE: Last Encounter Routing through Mobility Diffusion. IEEE Infocom, April 2003, San Francisco, CA.
2. H. Dubois-Ferriere, M. Grossglauser and M. Vetterli. Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages. In Proc. ACM MOBIHOC 03, Maryland, June 2003.
3. H. Dubois-Ferrière, M. Grossglauser and M. Vetterli. Space-Time Routing in Ad Hoc Networks, Ad Hoc Now 03, Montréal, Canada, October 2003.
4. David B. Johnson and David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Chapter 5, pages 153-181, Kluwer Academic Publishers, 1996.
5. J. Yoon, M. Liu and B. Noble. Random Waypoint Considered Harmful. In Proc. IEEE INFOCOM, vol 2, pp 1312-1321, April 2003, San Francisco, CA.
6. L. Kleinrock. Queueing Systems, Volume 1, Jhon Wiley & Sons, 1975.
7. R. Gray and L. Davisson. An Introduction to Statistical Signal Processing. http://www-ee.stanford.edu/ gray/sp.html
8. Jean-Yves Le Boudec. Performance Evaluation Lecture Notes. EPFL, 2003. http://icalwww.epfl.ch/perfeval/lectureNotes