Title: Passive and greedy beaconless geographic routing for real-time data dissemination in wireless networks
Authors: Yongbin Yim; Jeongcheol Lee; Euisin Lee; Sang-Ha Kim
Addresses: Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, V6T 1Z4, BC, Canada ' Computational Science and Engineering Center, Korea Instititue of Science and Technology Information (KISTI), Daejeon, 34141, South Korea ' School of Information and Communication Engineering, Chungbuk National University, Cheongju, 28644, South Korea ' Department of Computer Engineering, Chungnam National University, Daejeon, 34134, South Korea
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.
Keywords: beaconless; real-time; delay estimation; contention function; routing protocol.
International Journal of Sensor Networks, 2018 Vol.28 No.2, pp.114 - 124
Received: 02 Feb 2017
Accepted: 15 Sep 2017
Published online: 15 Sep 2018 *