Passive and greedy beaconless geographic routing for real-time data dissemination in wireless networks Online publication date: Mon, 19-Nov-2018
by Yongbin Yim; Jeongcheol Lee; Euisin Lee; Sang-Ha Kim
International Journal of Sensor Networks (IJSNET), Vol. 28, No. 2, 2018
Abstract: Real-time geographic routing is one of the most popular examples relying on a greedy algorithm to deliver real-time data in wireless networks. Each sender node decides a next-hop node among one-hop neighbours in stateless manner. However, this sender-side decision paradigm suffers from periodic and network-wide beaconing to discover neighbour nodes. To overcome the limitation, this paper suggests a passive and greedy beaconless real-time routing, called PGBR. To forward real-time data by receiver-side selection, PGBR focuses on two major challenging issues: a delay estimation procedure and a contention function design. The delay estimation procedure estimates both waiting delay and packet transmission delay used for the contention function. PGBR also redesigns receiver-side contention function with deliberating the estimated delay and discuss combinations of important metrics for the contention. The experimental results show that PGBR could improve the energy-efficiency as well as keeps high delivery deadline success ratio.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook