A metric for opportunistic routing in duty cycled wireless sensor networks
Paper in proceedings, 2012

Opportunistic routing is widely known to have substantially better performance than traditional unicast routing in wireless networks with lossy links. However, wireless sensor networks are heavily duty-cycled, i.e. they frequently enter deep sleep states to ensure long network life-time. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this paper, we introduce a novel opportunistic routing metric that takes duty cycling into account. By analytical performance modeling and simulations, we show that our routing scheme results in significantly reduced delay and improved energy efficiency compared to traditional unicast routing. The method is based on a new metric, EDC, that reflects the expected number of duty cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding, i.e. the optimal subset of neighbors that each node should permit to forward its packets. We compare the performance of the new routing with ETX-optimal single path routing in both simulations and testbed-based experiments.


Euhanna Ghadimi

Royal Institute of Technology (KTH)

Olaf Landsiedel

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Pablo Soldati

Huawei Technologies Sweden

Mikael Johansson

Royal Institute of Technology (KTH)

Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops

21555486 (ISSN) 21555494 (eISSN)

Vol. 1 Article number 6275795 335-343 6275795

Subject Categories

Electrical Engineering, Electronic Engineering, Information Engineering





More information

Latest update