Low power, low delay: Opportunistic routing meets duty cycling
Paper in proceeding, 2012

Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a dutycycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art.

Energy utilization

Routing protocols

Energy efficiency

Duty-cycling

MAC protocol

Data processing

Next-hop

Wireless sensor networks

Low delay

State of the art

Duty cycle

Wireless sensor network

Low Power

Duty cycles

Wireless link

Link dynamics

Medium access control

Opportunistic routing

Wakes

Dynamics

Spatial diversity

Author

Olaf Landsiedel

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

Euhanna Ghadimi

Royal Institute of Technology (KTH)

Simon Duquennoy

Swedish Institute of Computer Science

Mikael Johansson

Royal Institute of Technology (KTH)

IPSN'12 - ACM/IEEE Proceedings of the 11th International Conference on Information Processing in Sensor Networks, (Beijing;16 - 20 April 2012)

185-196
9781450312271 (ISBN)

Subject Categories

Computer and Information Science

DOI

10.1145/2185677.2185731

ISBN

9781450312271

More information

Latest update

2/26/2018