Abstract
Geographic routing in sensor networks and internet of things (IoT) prevails recent years as the localization technology advancing. The greedy forwarding is one of outstanding geographic routing schemes for its simplicity and efficiency. The greedy forwarding work efficiently in dense network, but may fails to send a packet further towards destination when encountering communication voids. Thus most geographic routing consists of two elements: 1) greedy forwarding scheme is used as long as possible, 2) a backup scheme resumes tasks when greedy forwarding fails due to local minimum. In this paper, we propose a novel void handling approach that detecting the boundary of voids and then a node in convex hull of boundary is selected as relay node. With the knowledge of relay node, the packets from source run around the void to construct path with less hop count. Simulation results indicate that this algorithm outperform classical geographic routing GPSR in several metrics.
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.
