Landmark Based Circle Routing in Wireless Sensor Networks

Hole problem is a hot issue of Geographic Routing in Wireless Sensor Networks, which is caused by an area without active sensors that blocks the greedy forwarding process, thus long detour path is produced. One of the common solutions is to find a landmark and generate a routing path from the source sensor to the landmark node first, then the landmark resumes routing until to the destination to avoid long detour path. However, this approach results in a constant path prior to routing process, then the forwarding nodes in the path afford routing while other nodes are idle even if they are very close to the pre-setup routing path, thus the busy nodes run out of their energy soon and the hole is larger. In this paper, we present a novel approach, in which circles are created to guide routing thus the idle nodes near the routing path participate in the forwarding. As such, our new mechanism benefits both geographic routing and energy efficiency routing. Simulation results demonstrate that our approach significantly prolongs the lifetime of sensors over peer approaches while almost keeps the same short path as landmark based routing algorithms.

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

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

[3]  Leonidas J. Guibas,et al.  Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

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

[6]  David Simplot-Ryl,et al.  Position-Based Routing in Wireless Ad Hoc and Sensor Networks , 2011, Theoretical Aspects of Distributed Computing in Sensor Networks.

[7]  Ihor Tsvietkov A novel method of locating voids in MANET structure , 2014, 2014 First International Scientific-Practical Conference Problems of Infocommunications Science and Technology.

[8]  Stephan Winter,et al.  Including landmarks in routing instructions , 2010, J. Locat. Based Serv..

[9]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[10]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[11]  Alex Zelikovsky,et al.  DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

[12]  Nathalie Mitton,et al.  Greedy Routing Recovery Using Controlled Mobility in Wireless Sensor Networks , 2013, ADHOC-NOW.

[13]  Eunil Park,et al.  Energy Efficient and Reliable Geographic Routing in Wireless Sensor Networks , 2010 .

[14]  Armin Eberlein,et al.  Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing , 2009, Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[15]  Wenjing Lou,et al.  Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply , 2009, Wirel. Networks.

[16]  Zongming Fei,et al.  HDAR: Hole Detection and Adaptive Geographic Routing for Ad Hoc Networks , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[17]  Haibo Zhang,et al.  Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[18]  Zongming Fei,et al.  Broadcasting with Prediction and Selective Forwarding in Vehicular Networks , 2013, Int. J. Distributed Sens. Networks.

[19]  Haojun Huang,et al.  Energy‐aware geographic routing in wireless sensor networks with anchor nodes , 2013, Int. J. Commun. Syst..