Void areas (holes) are hardly avoided in sensor networks either because of various actual geographical environments. Generally, a data packet will be either forwarded along a hole boundary by the right hand rule or pushed back to find another route to its destination when the data packet encounters the hole boundary. The right hand rule, on one hand, consumes more of the nodes' energy on the boundaries of holes, thus possibly enlarging the holes; on the other hand, it may incur data collisions if multiple communication sessions share the same boundaries of holes simultaneously. In this paper, we will propose a holes geometric modeling to solve hole problem in wireless sensor networks. Our hole geometric modeling has two goals: one is to prevent data packets from traveling along the boundaries of holes, the other is to avoid the problem of local minimum phenomenon. By achieving the first goal we can not only reduces the energy consumption of the nodes on the boundaries of holes, thus prevents holes' diffusion, but also reduces the data collisions in the nodes on the boundaries of holes. The second goal can reduce the packets rerouting overhead.
[1]
Elwood S. Buffa,et al.
Graph Theory with Applications
,
1977
.
[2]
Leonidas J. Guibas,et al.
Locating and bypassing routing holes in sensor networks
,
2004,
IEEE INFOCOM 2004.
[3]
Robert Morris,et al.
Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding
,
2001
.
[4]
Chenyang Lu,et al.
A spatiotemporal communication protocol for wireless sensor networks
,
2005,
IEEE Transactions on Parallel and Distributed Systems.
[5]
Brad Karp,et al.
GPSR: greedy perimeter stateless routing for wireless networks
,
2000,
MobiCom '00.
[6]
Ivan Stojmenovic,et al.
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
,
1999,
DIALM '99.