A Brownian motion model for last encounter routing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Ioannidis, Stratis ^a   Marbach, Peter ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL EFFICIENCY; MATHEMATICAL MODELS; TELECOMMUNICATION NETWORKS;

BROWNIAN MOTION MODEL; LAST ENCOUNTER ROUTING (LER);

ROUTING PROTOCOLS;

EID: 39049120894     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.301     Document Type: Conference Paper

References (19)

1. C. E. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," in ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications, October 1994, pp. 234-244.
2. S. Murthy and J. J. Garcia-Luna-Aceves, "An efficient routing protocol for wireless networks," Mobile Networks and Applications, vol. 1, no. 2, pp. 183-197, 1996.
3. C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in MILCOM '97 panel on Ad Hoc Networks, 1997.
4. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing. Kluwer Academic Publishers, 1996, vol. 353.
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 Mobile Computing and Networking, 1998, pp. 85-97.
6. E. M. Royer and C.-K. Toh, "A review of current routing protocols for ad-hoc mobile wireless networks," IEEE Personal Communications, 1999.
7. M. Grossglauser and M. Vetterli, "Locating nodes with EASE: Mobility diffusion of last encounters in ad hoc networks," in IEEE Infocom2003, San Francisco, 2003.
8. H. Dubois-Ferriére, M. Grossglauser, and M. Vetterli, "Generalized route establishment protocol (GREP): A proof of loop-free operation," EPFL, Technical Report IC/2003/40, 2003.
9. _, "Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages," in Proceeding of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), 2003.
10. S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, "A distance routing effect algorithm for mobility," in Proc. ACM/IEEE MobiCom, Oct. 1999, pp. 76-84.
11. A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T,-W. Chen, "Scalable routing strategies for ad-hoc wireless networks," IEEE Personal Communications, vol. 17, no. 8, pp. 1369-1379, August 1999.
12. N. Sarafijanovic-Djukic and M. Grossglauser, "Last encounter routing under random waypoint mobility," in NETWORKING 2004, Athens, Greece, May 2004.
13. N. Chang and M. Liu, "Optimal controlled flooding search in a large wireless network," in WlOpt, Trentino, Italy, Apr. 2005, pp. 229-237.
14. S. Ioannidis and P. Marbach, "Towards an understanding of EASE and its properties," in WiOpt, Trentino, Italy, Apr. 2005, pp. 267-276.
15. H. Dubois-Ferriére, M. Grossglauser, and M. Vetterli, "Space-time routing in ad hoc networks," in Ad Hoc Now 03, Montréal, Canada, October 2003.
16. B. Karp and H. Kung, "Greedy perimeter stateless routing for wireless networks," in Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000.
17. P. Révész, Random Walks of Infinitely Many Particles. World Scientific Publishing, 1994.
18. H. Brunner and P. J. van der Houwen, The Numerical Solution of Volterra Equations, ser. CWI monograph. Elsevier Science Pub. Co., 1986.
19. E. Ioannidis, 'Towards an understanding of Last Encounter Routing in ad hoc networks," Master's thesis, University of Toronto, 2004.