infocom10 - On Distributed Time-Dependent Shortest Paths...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks Shouwen Lai, Binoy Ravindran Department of Electrical and Computer Engineering Virginia Tech,Blacksburg, VA 24061 Email: { swlai,binoy } @vt.edu Abstract —We revisit the shortest path problem in asyn- chronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and distance from each node to the sink as periodic functions. We show that the time-cost function satisfies the FIFO property, which makes the time-dependent shortest path problem solvable in polynomial-time. Using the β-synchronizer, we propose a fast distributed algorithm to build all-to-one shortest paths with polynomial message complexity and time complexity. The algorithm determines the shortest paths for all discrete times with a single execution, in contrast with multiple executions needed by previous solutions. We further propose an efficient distributed algorithm for time-dependent shortest path maintenance. The proposed algorithm is loop-free with low message complexity and low space complexity of O ( maxdeg ) , where maxdeg is the maximum degree for all nodes. The performance of our solution is evaluated under diverse network configurations. The results suggest that our algorithm is more efficient than previous solutions in terms of message complexity and space complexity. I. INTRODUCTION The problem of routing over wireless sensor networks (WSNs) has attracted extensive attention in the recent years. Some WSN routing protocols [1], [2] presented in the litera- ture are extended from routing protocols over wired/wireless ad-hoc networks. They find a path with the minimum hop count to the destination, which is based on the assumption that the link cost (or one-hop transmission delay) is relatively static for all links. However, for asynchronous duty-cycled WSNs, that assumption may not be valid. In asynchronous duty-cycled WSNs, i.e., WSNs operating with MAC-layer protocols such as B-MAC [3] or X-MAC [4], sensor nodes operate in low power listening (LPL) mode. In the LPL mode, a node periodically switches between active and sleep state. The period for one active/sleep switching is called the LPL checking interval, which can be identical, or can be adaptively varied for different nodes, refereed to as ALPL [5]. The asynchronous duty-cycled mechanism have been shown to achieve excellent idle energy savings, scalability, and easiness in implementation. However, they suffer from time-varying neighbor discovery latencies which is also pointed out by Ye et.al. [6]. As shown in Figure 1, the neighbor discovery latency between two neighbors is varied with different departure times....
View Full Document

This note was uploaded on 10/29/2010 for the course KFC 1234 taught by Professor Know during the Spring '10 term at Uni Wien.

Page1 / 9

infocom10 - On Distributed Time-Dependent Shortest Paths...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online