GRACO: a geographic greedy routing with an ACO based void handling technique
by Mouna Rekik; Nathalie Mitton; Zied Chtourou
International Journal of Sensor Networks (IJSNET), Vol. 26, No. 3, 2018

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.

Online publication date: Thu, 01-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com