Abstract
Geographic routing has gained much attention as a basic routing primitive in wireless sensor networks (WSNs) due to its memory-less, scalability, efficiency and low overhead features. However, it suffers from communication holes, where no next hop candidate is closer to the destination than the node currently holding the packet. This paper proposes greedy with ACO-based recovery routing protocol (GRACO), an efficient geographic routing protocol with a novel void recovery strategy based on ant colony optimisation (ACO). GRACO is able to adaptively adjust the forwarding mechanism to avoid the blocking situation and effectively deliver data packets. Compared to greedy-face-greedy (GFG), one of the best performing geographic routing protocols, simulation results demonstrate that GRACO can successfully find shorter routing paths with higher delivery rate, less control packet overhead and shorter end-to-end delay.
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.
