CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks

Euhanna Ghadimi ; Olaf Landsiedel (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) ) ; Pablo Soldati ; Simon Duquennoy ; Mikael Johansson
ACM Transactions on Sensor Networks (1550-4859). Vol. 10 (2014), 4,
[Artikel, refereegranskad vetenskaplig]

Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are usually duty cycled, i.e., they frequently enter 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 ORW, a practical opportunistic routing scheme for wireless sensor networks. ORW uses a novel opportunistic routing 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 and demonstrate using analytical performance models and simulations that EDC-based opportunistic routing results in significantly reduced delay and improved energy efficiency compared to traditional unicast routing. In addition, we evaluate the performance of ORW in both simulations and testbed-based experiments. 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.

Nyckelord: Wireless Sensor Networks, Opportunistic Routing, duty cycle



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-06-18. Senast ändrad 2015-01-20.
CPL Pubid: 199391

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)