Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs

In wireless sensor networks, an important issue often faced in geographic routing is the "local minimum phenomenon." To mitigate the local minimum issue, when the routing process becomes stuck at hole boundary nodes, the existing perimeter routing tends to route data packets along the boundaries of the holes. However, this may enlarge the hole, causing the "first hole diffusion" problem. On the other hand, the existing hole detour scheme based on the virtual ellipse forwards data packets to outside the virtual ellipse. This may generate other holes around the existing hole - the "second hole diffusion" problem. Therefore, we propose a novel virtual convex polygon based hole boundary detection and time delay based hole detour scheme. The proposed scheme solves first and second hole diffusion problems. Comprehensive simulation results show that the proposed scheme provides approximately 22% and 16% improvements in terms of the packet delivery ratio and the network lifetime, respectively.

[1]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

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

[3]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[5]  Sajal K. Das,et al.  On the Energy Hole Problem of Nonuniform Node Distribution in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[6]  Ivan Stojmenovic,et al.  Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[8]  Donghun Lee,et al.  A modeling for hole problem in wireless sensor networks , 2007, IWCMC.

[9]  Ye Tian,et al.  An Edge Nodes Energy Efficient Hole Modeling in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[10]  Ye Tian,et al.  Energy-Efficient Data Dissemination Protocol for Detouring Routing Holes in Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Communications.

[11]  Ye Tian,et al.  Efficient Hole Detour Scheme for Geographic Routing in Wireless Sensor Networks , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[12]  Ye Tian,et al.  Virtual Circle Based Geometric Modeling of Holes for Geographic Routing , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[13]  Jie Wu,et al.  An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.