Real-Time Routing Based on On-Demand Multi-Hop Lookahead in Wireless Sensor Networks

Soochang PARK  Euisin LEE  Juhyun JUNG  Sang-Ha KIM  

IEICE TRANSACTIONS on Communications   Vol.E94-B   No.2   pp.569-572
Publication Date: 2011/02/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.569
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
real-time routing,  multi-hop lookahead,  

Full Text: PDF(332.8KB)>>
Buy this Article

In wireless sensor networks, real-time data delivery schemes typically achieve the desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio with respect to the desired delivery speed, a study has proposed a real-time data delivery scheme based on proactively performing two-hop lookahead. However, the recent proposal might cause heavy message exchange overhead and high computing complexity in order to proactively obtain two-hop neighbor speed information in all sensor nodes whether data are delivered or not. In this paper, we propose a novel real-time data delivery scheme that applies on-demand multi-hop lookahead only around data forwarding paths. Hence, the scheme can provide lower deadline miss ratio for real-time data delivery with low message exchange overhead than existing schemes.