L2OR: Low-Cost Low-Complexity Opportunistic Routing for Wireless Sensor Networks

Opportunistic routing can greatly improve energy efficiency in wireless sensor networks (WSNs). An important challenge is the design of a coordination protocol to implement an effective relay selection and prioritization scheme to minimize expected cost. Many existing opportunistic routing protocols often assumed an ideal link-layer, and thus the computed forwarder list may be suboptimal. Worth noting that, the computation complexity of optimal result grows rapidly with size of candidate set when the nonideal link-layer conditions are taken into account. It is, however, not feasible for energy and processing capability constrained WSNs. To address this problem, we propose a low-cost low-complexity opportunistic routing (L2OR) protocol to achieve an energy-efficient data delivery over WSNs. Our research work begins with a thorough investigation and understanding of properties of forwarder list under nonideal link-layer conditions. On this basis, a low-complexity heuristic algorithm is designed to efficiently find a reasonable choice of forwarder list, with an objective of reducing the search space to the size of candidate set. We conduct theoretical analysis and a set of simulation experiments to evaluate the performance of our L2OR. It is shown that, when comparing to typical energy-aware opportunistic protocol, the L2OR can achieve performance improvement in terms of data transmission efficiency as well as energy consumption.

[1]  Martin Vetterli,et al.  Valuable Detours: Least-Cost Anypath Routing , 2011, IEEE/ACM Transactions on Networking.

[2]  Srihari Nelakuditi,et al.  On selection of candidates for opportunistic anypath forwarding , 2006, MOCO.

[3]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[4]  Ali Ghrayeb,et al.  Energy-Efficient Cooperative Routing in Wireless Sensor Networks: A Mixed-Integer Optimization Framework and Explicit Solution , 2013, IEEE Transactions on Communications.

[5]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[6]  Shaojie Tang,et al.  Energy-Efficient Opportunistic Routing in Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[7]  Dimitrios Koutsonikolas,et al.  CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Ioannis Ch. Paschalidis,et al.  Sensor network minimal energy routing with latency guarantees , 2007, MobiHoc '07.

[9]  Azzedine Boukerche,et al.  On the number of candidates in opportunistic routing for multi-hop wireless networks , 2013, MobiWac '13.

[10]  Holger Paul Keeler,et al.  A model framework for greedy routing in a sensor network with a stochastic power scheme , 2011, TOSN.

[11]  Wen-De Zhong,et al.  Multicast Least Cost Anypath Routing: Route Cost Calculations and Forwarding , 2012, IEEE Communications Letters.

[12]  Engin Zeydan,et al.  Energy-efficient routing for correlated data in wireless sensor networks , 2012, Ad Hoc Networks.

[13]  Lu Zhao,et al.  QMOR: QoS-Aware Multi-sink Opportunistic Routing for Wireless Multimedia Sensor Networks , 2014, Wirel. Pers. Commun..

[14]  Haibo Zhang,et al.  Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[15]  Wenjing Lou,et al.  On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks , 2012, Wirel. Networks.

[16]  Lili Qiu,et al.  SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks , 2009, IEEE Transactions on Mobile Computing.

[17]  Olaf Landsiedel,et al.  Let the tree Bloom: scalable opportunistic routing with ORPL , 2013, SenSys '13.

[18]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[19]  Dimitrios Koutsonikolas,et al.  CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, INFOCOM 2010.

[20]  Fabrice Theoleyre,et al.  Multipath opportunistic RPL routing over IEEE 802.15.4 , 2011, MSWiM '11.

[21]  Srihari Nelakuditi,et al.  On the Efficacy of Opportunistic Routing , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[22]  Guoliang Xing,et al.  SGF: A state-free gradient-based forwarding protocol for wireless sensor networks , 2009, TOSN.

[23]  Winston Khoon Guan Seah,et al.  Economy: a duplicate free Opportunistic Routing , 2009, Mobility Conference.

[24]  Leonard Kleinrock,et al.  Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks , 2010, IEEE/ACM Transactions on Networking.

[25]  Azzedine Boukerche,et al.  Transmission power control-based opportunistic routing for wireless sensor networks , 2014, MSWiM '14.

[26]  Xinyu Yang,et al.  BOR/AC: Bandwidth-aware opportunistic routing with admission control in wireless mesh networks , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Euhanna Ghadimi,et al.  A metric for opportunistic routing in duty cycled wireless sensor networks , 2012, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[28]  Shuo-Yen Robert Li,et al.  Linear Network Coding: Theory and Algorithms , 2011, Proceedings of the IEEE.

[29]  Wonjun Lee,et al.  Eliminating Duplicate Forwarding in Wireless Opportunistic Routing , 2012, IEEE Communications Letters.

[30]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[31]  Llorenç Cerdà-Alabern,et al.  Candidate selection algorithms in opportunistic routing , 2010, PM2HW2N '10.

[32]  Winston Khoon Guan Seah,et al.  Survey Paper: Opportunistic routing - A review and the challenges ahead , 2011 .

[33]  Binoy Ravindran,et al.  Opportunistic real-time routing in multi-hop wireless sensor networks , 2009, SAC '09.