Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks

Abstract

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. In this paper, we propose a novel multi-candidate selection (MCS) scheme for greedy routing that makes the best effort to find minimum latency routes in the sensor networks. In MCS, each source node sends an RREQ to a list of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. The route found by MCS may be longer than that of distance-based greedy forwarding (DGF) ( Finn, 1987). Hence, we introduce a latency-adaptive distance-based multi-candidate selection scheme for greedy forwarding to find routes with a small number of hops and acceptable delivery latency. Probabilistic analysis and simulation results demonstrate that MCS increases the routing performance significantly compared with DGF and ODML ( Su et al., 2008) in terms of delivery latency.