Hybrid greedy/face routing for ad-hoc sensor network

Proceedings of the EUROMICRO Systems on Digital System Design, DSD 2004

Volumn , Issue , 2004, Pages 574-578

  Li, J ^a   Gewali, L ^a   Selvaraj, H ^a   Muthukumar, V ^a  

^a UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE AD-HOC NETWORKS (MANET); ROUTING; SENSOR NETWORKS; WIRELESS TRANSMISSION DEVICES;

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; MOBILE COMPUTING; RADIO LINKS; ROUTERS; SENSORS; TELECOMMUNICATION NETWORKS;

COMPUTER NETWORKS;

EID: 13944256572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSD.2004.1333327     Document Type: Conference Paper

References (7)

1. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia, "Routing With guaranteed delivery in ad-hoc networks," ACM Wireless Networks, 7, Nov. 2001, pp.609-616.
2. Susanta Datta, Ivan Stojmenovic, and Jie Wu, "Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks," Cluster Computing 5, 2002, pp. 169-178.
3. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger, "Asymptotically Optimal GeometricMobile Ad-Hoc Routing," Proceedings of DIALM, 2002.
4. Fabian Kuhn, Roger Wattenhofer, and Aaron Zollinger, "Worst Case Optimal and Average Case Efficient Geometric Ad-Hoc Routing," Proceedings of the ACM MOBIHOC, 2003, pp. 267-278.
5. Ivan Stojmenovic (Editor), Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, 2002.
6. Joseph O'Rourke, Computational Geometry in C, Cambridge University Press, 1998.
7. M. de Berg, M. Krteveld, M. Overmars, and O. Schwarkoft, Computational Geometry: Algorithms and Applications, Springer Verlag, Berlin, 1997.