An efficient void resolution method for geographic routing in wireless sensor networks

Geographic routing is an attractive choice for routing data in wireless sensor networks because of lightweight and scalable characteristics. Most geographic routing approaches combine a greedy forwarding scheme and a void resolution method to detour a void area that has no active sensor. The previous solutions, including the well-known GPSR protocol, commonly use the right-hand rule for void resolution. However, the detour path produced by the right-hand rule is not energy-efficient in many cases. In this paper, we propose a new void resolution method, called void resolution-forwarding, which can overcome voids in the sensor network energy-efficiently. It exploits the quadrant-level right-hand rule to select the next hop for the current node during circumventing a void area. We show by experiments that the proposed method is efficient and scalable with respect to the various voids and network density and that it outperforms the GPSR protocol significantly.

[1]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[2]  Guangbin Fan,et al.  Avoid 'void' in geographic routing for data aggregation in sensor networks , 2006, Int. J. Ad Hoc Ubiquitous Comput..

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  H. T. Kung,et al.  Geographic routing for wireless networks , 2000 .

[5]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[6]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[7]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[8]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[9]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[10]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[11]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[12]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[13]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[15]  A. Gleason,et al.  Advanced Mathematics: Precalculus With Discrete Mathematics and Data Analysis , 1992 .

[16]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[17]  Parameswaran Ramanathan,et al.  Distributed target classification and tracking in sensor networks , 2003 .

[18]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .