Skip to Main Content
Typical real-time routing data dissemination schemes employ 1-hop transmission speed based on the 1-hop lookahead manner that proactively obtains information of 1-hop neighbor nodes and selects one that satisfies a desired delivery speed as next hop. To improve performance of 1-hop lookahead based real-time routing protocols, THVR (Two-Hop Velocity-based Routing) is proposed. THVR reduces deadline miss ratio that the ratio of the number of data that exceeds the time limit to total number of sending data via routing decision based on 2-hop neighborhood information obtained from the 2-hop lookahead information. However, since the 2-hop lookahead manner makes every sensor node proactively obtain 2-hop neighborhood information whether the sensor node has data to forward or not, THVR carries two inefficiencies: heavy control message exchange overhead and high computing complexity. In this paper, we propose a noble real-time routing protocol based on reactive and restricted zone search. The proposed protocol minimizes the deadline miss ratio and eliminates the two inefficiencies mentioned above by on-demand multi-hop lookahead. In the proposed scheme, reactive multi-hop neighborhood information obtainment is fulfilled only by a small number of sensor nodes within a restricted zone around a data forwarding path from the source to the destination.
Date of Conference: 20-23 April 2010