GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A modeling for hole problem in wireless sensor networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Detection and mitigation of sinkhole attacks in wireless sensor networks
Journal of Computer and System Sciences
Hi-index | 0.00 |
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.