Abstract
Abstract In this paper we present a new approach to route packets in the presence of routing holes. In our proposal, nodes cooperate to determine the approximate polygon of a specific hole and then exchange information about the approximate polygon. Based on the hole covering parallelogram and the hole view angle of a specific node, packets can be forwarded along an escape route that bends around the hole. We rigorously prove that the Euclidean stretch of an escape route is bounded. Simulation results show that the proposed scheme can save more than 16% of the energy consumption and 7% of the network lifetime in the comparison with existing routing algorithms. The average length of routing paths in our approach is less than 60% of other routing schemes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
