Randomized 3D geographic routing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1508-1516

  Flury, Roland ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; ELECTRIC NETWORK TOPOLOGY; NETWORK ROUTING; TWO DIMENSIONAL; WIRELESS TELECOMMUNICATION SYSTEMS;

GEOGRAPHIC ROUTING;

ROUTING ALGORITHMS;

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

References (33)

1. I. Abraham, D. Dolev, and D. Malkhi, LLS: a Locality Aware Location Service for Mobile Ad Hoc Networks. In DIALM-POMC, pages 75-84, 2004.
2. I. Abraham, C. Gavoille, A. Goldberg, and D. Malkhi, Routing in Networks with Low Doubling Dimension. In ICDCS, 2006.
3. C. Avin and G. Ercal. On the Cover Time and Mixing Time of Random Geometric Graphs, Theor. Comput. Sci., 380(1-2):2-22, 2007.
4. C. Avin and B. Krishnamachari. The Power of Choice in Random Walks: An Empirical Study. In MSWiM, pages 219-228, 2006.
5. G. Barnes and U. Feige, Short Random Walks on Graphs. In STOC, pages 728-737, 1993.
6. P. Bose and P. Morin, Online Routing in Triangulations. In ISAAC, pages 113-122, 1999.
7. P. Bose and P. Morin, An Improved Algorithm for Subdivision Traversal without Extra Storage. In ISAAC, pages 444-455, 2000.
8. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, Routing With Guaranteed Delivery in Ad Hoc Wireless Networks. In DIAL-M, pages 48-55, 1999.
9. J. Bruck, J. Gao, and A. A. Jiang, Localization and Routing in Sensor Networks by Local Angle Information. In MobiHoc, pages 181-192, 2005.
10. A. K. Chandra. P. Raghavan, W. L. Ruzzo, and R. Smolensky. The Electrical Resistance of a Graph Captures its Commute and Cover Times. In STOC, pages 574-586, 1989.
11. S. M. Das. H. Pucha, and Y. C. Hu. Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing. In Infocom, 2005.
12. S. Datta, I. Stojmenovic, and J. Wu. Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks. Cluster Computing, 5(2): 169-178, 2002.
13. S. Dobrev, J. Jansson, K. Sadakane, and W.-K. Sung, Finding Short Right-Hand-on-the-Wall Walks in Graphs. In SIROCCO, pages 127-139, 2005.
14. S. Durocher, D. Kirkpatrick, and L. Narayanan, On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. In ICDCN, pages 546-557, 2008.
15. Q. Fang, J. Gao, and L. J. Guibas, Locating and Bypassing Routing Holes in Sensor Networks. In INFOCOM, 2004.
16. U. Feige. A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms, 6(1):51-54, 1995.
17. R. Flury and R. Wattenhofer. MLS: An Efficient Location Service for Mobile Ad Hoc Networks. In MobiHoc, 2006.
18. C. Gavoille and M. Gengler, Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distrib. Comput., 61(5):679-687, 2001.
19. M. Grossglauser and M. Vetterli, Locating Mobile Nodes With EASE: Learning Efficient Routes From Encounter Histories Alone. IEEE/ACM Trans. Netw., 14(3):457-469, 2006.
20. T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher, Range-Free Localization Schemes for Large Scale Sensor Networks. In MobiCom, pages 81-95, 2003.
21. R. Kleinberg, Geographic Routing Using Hyperbolic Space. In Infocom, 2007.
22. E. Kranakis, H. Singh, and J. Urrutia. Compass Routing on Geometric Networks. In Proc. II th Canadian Conference on Computational Geometry, pages 51-54, 1999.
23. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Ad-Hoc Routing: of Theory and Practice. In PODC, pages 63-72, 2003.
24. F. Kuhn, R. Wattenhofer, and A. Zollinger, Asymptotically Optimal Geometric Mobile Ad Hoc Routing. In DIAL-M, 2002.
25. L. Lovász. Random Walks on Graphs: A Survey. Combinatorics. 2:353-398, 1996.
26. D. Moore, J. Leonard, D. Rus, and S. Teller. Robust Distributed Network Localization With Noisy Range Measurements. In SenSys, pages 50-61, 2004.
27. M. Penrose, The Longest Edge of the Random Minimal Spanning Tree, Ann. Appl. Probab, 7(2):340-361, 1997.
28. C. Perkins, E. Belding-Royer, and S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing. RFC3561, 2003.
29. P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, 2005.
30. Sinalgo, Simulator for Nerwork Algorithms. http://dcg.ethz.ch/ projects/sinalgo, 2007.
31. A. Slivkins. Distance Estimation and Object Location via Rings of Neighbors. In PODC, pages 41-50, 2005.
32. P.-J. Wan, K. M. Alzoubi, and O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Hetworks. Mob. Netw. Appl., 9(2): 141-149, 2004.
33. R. Wattenhofer and A. Zollinger, XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks. In WMAN, April 2004.