Hybrid Greedy/Face Routing for Ad-Hoc Sensor Network

Authors:
J. Li;L. Gewali;H. Selvaraj;V. Muthukumar
Affiliations:
University of Nevada, Las Vegas;University of Nevada, Las Vegas;University of Nevada, Las Vegas;University of Nevada, Las Vegas
Venue:
DSD '04 Proceedings of the Digital System Design, EUROMICRO Systems
Year:
2004

Citing 0
Cited 2

Routing in wireless networks with position trees

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Flattening the gap between source-destination paths in energy efficient greedy georouting in wireless sensor networks

MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructing a route connecting a source node to a destination node is one of the central problems in sensor networks and mobile computing. In this paper we consider the application of a data structure called ExtDCEL that can be very effective in implementing several location-based routing algorithms that include face routing, greedy most forward routing, and hybrid routing. The ExtDCEL data structure is very convenient for representing unit disk graphs as well as planar components. Many network properties can be computed locally when the graph is represented in ExtDCEL. In particular, we show how the popular hybrid greedy face routing algorithm can be implemented efficiently by using ExtDCEL.