Robust geo-routing on embeddings of dynamic wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1730-1738

  Tschopp, Dominique ^a   Diggavi, Suhas ^a   Grossglauser, Matthias ^a   Widmer, Jörg ^b  

^a EPFL   (Switzerland)

^b DOCOMO EURO LABS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; EMBEDDED SYSTEMS; NETWORK ROUTING; ROBUST CONTROL;

EMBEDDING ALGORITHMS; GEOGRAPHIC ROUTING; TOPOLOGY-BASED ROUTING;

WIRELESS NETWORKS;

EID: 34548349251     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.202     Document Type: Conference Paper

References (22)

1. C. E. Perkins and E. M. Royer, "Ad hoc on-demand distance vector routing," in Proc. of 2nd IEEE Workshop on Mobile Computing Systems and Applications, Feb. 1999.
2. D. B. Johnson, D. A. Maltz, and J. Broch, Ad Hoc Networking. Addison-Wesley, 2001, ch. DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks, pp. 139-172.
3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in Proc. of 3rd ACM DIALM, Seattle, US, 1999.
4. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM Mobicom, Aug. 2000.
5. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing: Of theory and practice," in Proc. ACM PODC, July 2003.
6. S. M. Das, H. Pucha, and Y. C. Hu, "Performance comparison of scalable location services for geographic ad hoc routing," in Proc. IEEE Infocom, Mar. 2005.
7. M. Grossglauser and M. Vetterli, "Locating Mobile Nodes with EASE: Learning Efficient Routes from Encounter Histories Alone," IEEE/ACM Trans. on Networking, vol. 14, no. 3, June 2006.
8. P. Indyk and J. Matousek, "Low-distortion embeddings of finite metric spaces," in CRC Handbook of Discrete and Computational Geometry, 2004, chapter 8.
9. D. K. Agrafiotis and H. Xu, "A geodesic framework for analyzing molecular similarities," J. Chem. Info. Comput. Sci., vol. 43, pp. 475-484, 2003.
10. L. Tang and M. Crovella, "Virtual landmarks for the internet," in Proc. ACM Sigcomm, 2003, pp. 143-152.
11. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A decentralized network coordinate system," in Computer Communication Review, vol. 34, 2004, pp. 15-26.
12. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, "Geographic routing without location information," in Proc. ACM Mobicom, 2003, pp. 96-108.
13. R. Fonseca, S. Ratnasamy, J. Zhao, C. T. Ee, D. Culler, S. Shenker, and I. a. Stoica, "Beacon-vector routing: Scalable point-to-point routing in wireless sensor networks," in NSDI, 2005.
14. J. Newsome and D. Song, "Gem: graph embedding for routing and datacentric storage in sensor networks without geographic information," in Proc. ACM SenSys'03, Los Angeles, USA, 2003.
15. J. Bruck, J. Gao, and A. Jiang, "MAP: Medial axis based geometric routing in sensor networks," in Proc. ACM Mobicom, Koeln, Germany, 2005, pp. 88-102.
16. Q. Fang, J. Gao, L. J. Guibas, V. de Silva, and L. Zhang, "Glider: gradient landmark-based distributed routing for sensor networks," in IEEE Infocom, Miami, FL, Mar. 2005.
17. Y. Shang, W Ruml, Y. Zhang, and M. Fromherz, "Localization from connectivity in sensor networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 11, p. 961, 2004.
18. J. Kleinberg, A. Slivkins, and T. Wexler, "Triangulation and embedding using small sets of beacons," in FOCS, 2004, pp. 444-453.
19. I. Abraham, Y. Bartal, T-H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins, "Metric embeddings with relaxed guarantees," in 46th IEEE Symposium on Foundations of Computer Science, 2005.
20. T. Moscibroda, R. O'Dell, M. Wattenhofer, and R. Wattenhofer, "Virtual coordinates for ad hoc and sensor networks," in Proc. DIALM-POMC, Philadelphia, PA, USA, Oct. 2004.
21. D. Tschopp, S. Diggavi, M. Grossglauser, and J. Widmer, "Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings," in Proc. Information Theory and Applications workshop (ITA), San Diego, CA, January 2007.
22. K. A. Dimitris, "Stochastic proximity embedding," Journal of Computational Chemistry, vol. 24, no. 10, pp. 1215-1221, 2003, 10.1002/jcc.10234.