Surviving holes and barriers in geographic data reporting for Wireless Sensor Networks

Geographic forwarding is a favorable scheme for data reporting in Wireless Sensor Networks (WSNs) due to its simplicity and low-overhead. However, WSNs are usually subject to complicated environmental factors. Network holes (i.e., the areas where no nodes inside) and barriers (i.e., those blocking the communication between two close nodes) are inevitable in practical deploying environments. These issues pose an obstacle to adopting geographic forwarding in WSNs, while current approaches lack an efficient method to tolerate such negative factors. In this paper we specifically tailor a waypoint-based Geographic Data Reporting Protocol (GDRP) for WSNs. Inherited from geographic forwarding, GDRP is light-weighted and hence well-suits WSNs. But unlike current approaches that often find suboptimal paths, GDRP adopts an intelligent strategy to select a best set of waypoints via which packets can efficiently circumvent holes and barriers, and it can thus find better paths. Extensive simulations are conducted to verify the advantages of GDRP in tolerating network holes and obstacles in WSNs.

[1]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[2]  Christos Faloutsos,et al.  An environmental sensor network to determine drinking water quality and security , 2003, SGMD.

[3]  John A. Stankovic,et al.  LUSTER: wireless sensor network for environmental research , 2007, SenSys '07.

[4]  Jean-Yves Le Boudec,et al.  A location-based routing method for mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[5]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

[6]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[7]  Ming-Jer Tsai,et al.  VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[8]  Xiaohua Jia,et al.  Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks , 2006, IEEE Transactions on Communications.

[9]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[10]  Hong Huang Adaptive algorithms to mitigate inefficiency in greedy geographical routing , 2006, IEEE Communications Letters.

[11]  Anne-Marie Kermarrec,et al.  Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing , 2009, IEEE INFOCOM 2009.

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

[13]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[14]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[15]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[16]  Min-Te Sun,et al.  Anchor-Based Geographic Routing for Sensor Networks Using Projection Distance , 2007, 2007 2nd International Symposium on Wireless Pervasive Computing.

[17]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[18]  Mark G. Terwilliger,et al.  Overview of Sensor Networks , 2004 .

[19]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[20]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

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

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

[23]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

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