Title :
Hybrid greedy/face routing for ad-hoc sensor network
Author :
Li, J. ; Gewali, L. ; Selvaraj, H. ; Muthukumar, Vishak
Author_Institution :
Nevada Univ., Las Vegas, NV, USA
fDate :
31 Aug.-3 Sept. 2004
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.
Keywords :
ad hoc networks; data structures; mobile computing; telecommunication network routing; wireless sensor networks; ExtDCEL; ad-hoc sensor network; data structure; greedy most forward routing; hybrid greedy face routing algorithm; location-based routing algorithms; mobile computing; network properties; planar components; unit disk graphs; Ad hoc networks; Algorithm design and analysis; Computational geometry; Computer networks; Data structures; Joining processes; Mobile ad hoc networks; Mobile computing; Routing; Switches;
Conference_Titel :
Digital System Design, 2004. DSD 2004. Euromicro Symposium on
Print_ISBN :
0-7695-2203-3
DOI :
10.1109/DSD.2004.1333327
