Virtual convex polygon based hole boundary detection and time delay based hole detour scheme in WSNs

10Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Shin, I., Pham, N. D., & Choo, H. (2009). Virtual convex polygon based hole boundary detection and time delay based hole detour scheme in WSNs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5617 LNCS, pp. 619–627). https://doi.org/10.1007/978-3-642-02556-3_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free