Spherical coordinate routing for 3D wireless ad-hoc and sensor networks

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2008, Pages 144-151

  Tao, Shao ^a   Ananda, A L ^a   Mun, Choon Chan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Failure recovery; Geometric routing; Guaranteed delivery; Hop count vector; Path stretch

Indexed keywords

FAILURE RECOVERY; GEOMETRIC ROUTING; GUARANTEED DELIVERY; HOP COUNT VECTOR; PATH STRETCH;

AD HOC NETWORKS; COMPUTATIONAL GEOMETRY; COMPUTER SYSTEM RECOVERY; COMPUTERS; ELECTRIC NETWORK TOPOLOGY; INTERNET; METROPOLITAN AREA NETWORKS; RECOVERY; ROUTING ALGORITHMS; SENSOR NETWORKS; SPHERES; THREE DIMENSIONAL; TOPOLOGY; VECTORS; WIRELESS NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTING PROTOCOLS;

EID: 58049115103     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2008.4664163     Document Type: Conference Paper

References (16)

1. H. Frey and I. Stojmenović. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In Proceedings of the 12th ACM MobiCom, pages 390-401, 2006.
2. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In Proceedings of the 9th ACM MobiCom, pages 96-108, 2003.
3. R. Fonseca, S. Ratnasamy, J. Zhao, and et al. Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In Proceedings of the 2nd NSDI, volume 2, pages 329-342, 2005.
4. Q. Cao and T. Abdelzaher. Scalable logical coordinates framework for routing in wireless sensor networks. ACM Transactions on Sensor Networks, 2(4):557-593, 2006.
5. J. Newsome and D. Song. GEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In Proceedings of the 1st SenSys, pages 76-88, 2003.
6. C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proceedings of the WMCSA, pages 90-100, 1999.
7. Young-Jin Kim, Ramesh Govindan, Brad Karp, and Scott Shenker. On the pitfalls of geographic face routing. In Proceedings of the DialM, pages 34-43, 2005.
8. D. Tschopp, S. Diggavi, M. Grossglauser, and J. Widmer. Robust georouting on embeddings of dynamic wireless networks. In Proceedings of the 26th IEEE Infocom, pages 1730-1738, 2007.
9. Y. Zhao, B. Li, Q. Zhang, Y. Chen, and W. Zhu. Efficient hop id based routing for sparse ad hoc networks. In Proceedings of the 13th IEEE ICNP, pages 179-190, 2005.
10. A. Caruso, S. Chessa, S. De, and A. Urpi. GPS free coordinate assignment and routing in wireless sensor networks. In Proceedings of the 24th IEEE Infocom, volume 1, pages 150-160, 2005.
11. B. Leong, B. Liskov, and R. Morris. Geographic routing without planarization. In Proceedings of the 3rd NSDI, pages 339-352, 2006.
12. J. Hightower and G. Borriello. Location systems for ubiquitous computing. IEEE Computer, 34(8):57-66, 2001.
13. S. M. Nazrul Alam and Zygmunt J. Haas. Coverage and connectivity in three-dimensional networks. In Proceedings of the MobiCom, pages 346-357, 2006.
14. G. Kao, T. Fevens, and J. Opatrny. Position-based routing on 3d geometric graphs in mobile ad hoc networks. In Proceedings of the 17th CCCG, pages 88-91, 2005.
15. A. E. Abdallah, T. Fevens, and J. Opatrny. Power-aware 3d position-based routing algorithms for ad hoc networks. In Proceedings of the IEEE ICC, pages 3130-3135, 2007.
16. J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-313, 1965.