download0 view162
twitter facebook

공공누리This item is licensed Korea Open Government License

Title
Passive and greedy beaconless geographic routing for real-time data dissemination in wireless networks
Author(s)
임용빈김상하이의신이정철
Publication Year
2018-10-01
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.
Keyword
beaconless; real-time; delay estimation; contention function; routing protocol
Journal Title
International Journal of Sensor Networks
Citation Volume
28
ISSN
1748-1279
Files in This Item:
There are no files associated with this item.
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
URI
https://repository.kisti.re.kr/handle/10580/14725
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART94540469
Export
RIS (EndNote)
XLS (Excel)
XML

Browse