Ad-hoc routing using virtual coordinates based on rooted trees

Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

Volumn 2006 II, Issue , 2006, Pages 6-13

  Ben Asher, Yosi ^a   Feldman, Moran ^a   Feldman, Sharoni ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GLOBAL POSITIONING SYSTEM; TOPOLOGY; TREES (MATHEMATICS); VIRTUAL REALITY;

DYNAMIC EMBEDDING; GEOGRAPHICAL ROUTING; ROUTING ALGORITHMS; ROUTING TABLES;

ROUTERS;

EID: 33845449934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUTC.2006.1636153     Document Type: Conference Paper

References (17)

1. S. Basagni, I. Chlamatc, V. R. Syrotiuk, B. A. Woodward, "A Distance Routing Effect Algorithm for Mobility (DREAM). ACM/IEEE MobCom 1998
2. E. Kranakis, H. Singhy, J. Urrutia, "Compass Routing on Geometric Networks", In Proc. 11 Canadian Conference on Computational Geometry, pages 51-54, 1999.
3. C. E. Perkins, and E. M. Royer. "Ad-hoc On-Demand Distance Vector Routing," Second IEEE Workshop on Mobile Computing Systems and Applications, pp.90-100, February 1999
4. th Int. Workshop on Discreet Algorithms and Methods foe Mobile Computing and Communications (Dial-M), pages 24-33. ACM Press 2002.
5. J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, R. Morris. "A Scalable Location Service for Geographic Ad Hoc Routing," Proceedings of MobiCon, Boston, MA, 2000.
6. Misra .P, "Routing Protocols for Ad Hoc Mobile Wireless Networks," http://www.cse.ohio-state.edu/~jain/cis788-99/ftp/adhoc_routing/
7. B. Karp, H. T. Kung. "GPSR: Greedy Perimeter Stateless routing for wireless networks", in Proc. of MobiCom 1998, 2000.
8. P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," In workshop on Discreate Algorithms and Methods for Mobile Computing and Communications, 1999.
9. F. Araújo, L. Rodrigues, J. Kaiser, C. Liu, and C. Mitidieri, "A Distributed Hash Table for Wireless Ad Hoc Networks", Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS'05), Columbus, Ohio, USA, June 2005.
10. R. Bagrodia, R. Meyer, M. Takai, Y. Chen, X. Zeng, J. Martin, H. Y. Song, "PARSEC": A Parallel Simulation Environment for Complex Systems Computer," Volume 31, Issue 10, October 1998,Pps: 77 - 85
11. The ns Manuel, http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf, K. Fall, K. Varadhan, eds. Dec. 2003
12. A. Rao, S. Ratnasamy, C. Papadimitrou, S. Shenker, I. Stoica, "Geographic Routing withhout Location Information", ACM MobiCom 2003.
13. F. Kuhn, R. Wattenhofer, Y. Z, A. Zollinger,"Geometric Ad-Hoc Routing: Of Theory and Practice, "in Pricnciples of Didtributed Computing, 2003
14. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, New York, NY, USA 1997.
15. C. Chekuri, S. Kahanna, J. Naor, L. Ziskin, "Approximation Labeling Problem via a New Linear Programming Formulation", Proceedings of the thirtieth annual ACM symposium on Theory of computing, Dallas Texas, 1998.
16. M.L .Elkin, "A Faster Distributed Protocol for Constructing a Minimum Spanning Tree", in Proc. ACM-SIAM on Discrete Algorithms, SODA'04, pp. 352-361, New Orleans, LA, USA, Jan. 04
17. J. Eriksson, M. Faloutsos, S. Krishnamurthy, "Scalable Ad Hoc Routing: The Case for Dynamic Addressing"", IEEE INFOCOM 2004