skip to main content
research-article

Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks

Published:20 June 2014Publication History
Skip Abstract Section

Abstract

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, that is, they frequently enter sleep states to ensure long network lifetime. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this article 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.

References

  1. M. H. Alizai, O. Landsiedel, J. A. Bitsch Link, S. Gotz, and K. Wehrle. 2009. Bursty traffic over bursty links. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Allen, P. Swieskowski, and M. Welsh. 2005. Motelab: A wireless sensor network testbed. In Proceedings of the ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN'05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. Ashref, R. H. Kravets, and N. H. Vaidya. 2010. Exploiting routing redundancy using MAC layer anycast to improve delay in WSN. SIGMOBILE Mobile Comput. Comm. Rev. 14, 49--51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Autenrieth and H. Frey. 2011. PaderMAC: A low-power, low-latency MAC layer with opportunistic forwarding support for wireless sensor networks. In Proceedings of the 10th International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW'11). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Basu and C.-K. Chau. 2008. Opportunistic forwarding in wireless networks with duty cycling. In Proceedings of the ACM Workshop on Challenged Networks (CHANTS'08). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Becher, O. Landsiedel, G. Kunz, and K. Wehrle. 2008. Towards short-term wireless link quality estimation. In Proceedings of the 5th ACM Workshop on Embedded Networked Sensors (HotEmNetS'08).Google ScholarGoogle Scholar
  7. S. Biswas and R. Morris. 2005. ExOR: Opportunistic multi-hop routing for wireless networks. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm'05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Buettner, G. V. Yee, E. Anderson, and R. Han. 2006. X-MAC: A short preamble MAC protocol for duty-cycled wireless sensor networks. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Chachulski, M. Jennings, S. Katti, and D. Katabi. 2007. Trading structure for randomness in wireless opportunistic routing. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigComm'07). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. R. Choudhury and N. H. Vaidya. 2004. MAC-layer anycasting in ad hoc networks. ACM Comput. Comm. Rev. 34, 1, 75--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. 2003. A high-throughput path metric for multi-hop wireless routing. In Proceedings of the ACM International Conference on Mobile Computing and Networking (MobiCom'03). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Doddavenkatappa, M. C. Chan, and A. Ananda. 2011. Indriya: A low-cost, 3D wireless sensor network testbed. In Proceedings of the International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom'11).Google ScholarGoogle Scholar
  13. A. Dubois-Ferrie. 2006. Anypath routing. Ph.D. thesis, EPFL. http://infoscience.epfl.ch/record/89172.Google ScholarGoogle Scholar
  14. A. Dubois-Ferrie, M. Grossglauser, and M. Vetterli. 2011. Valuable detours: Least-cost anypath routing. IEEE/ACM Trans. Netw. 19, 2, 333--346. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Duquennoy, O. Landsiedel, and T. Voigt. 2013. Let the tree bloom: Scalable opportunistic routing with orpl. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'13). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Dutta, S. Dawson-Haggerty, Y. Chen, C.-J. M. Liang, and A. Terzis. 2010. Design and evaluation of a versatile and efficient receiver-initiated link layer for low-power wireless. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'10). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Fonseca, O. Gnawali, K. Jamieson, and P. Levis. 2007. Four bit wireless link estimation. In Proceedings of the Workshop on Hot Topics in Networks (HotNets'07).Google ScholarGoogle Scholar
  18. E. Ghadimi, O. Landsiedel, P. Soldati, and M. Johansson. 2012. A metric for opportunistic routing in duty cycled wireless sensor networks. In Proceedings of IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'12).Google ScholarGoogle Scholar
  19. O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis. 2009. Collection tree protocol. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Y. Gu and T. He. 2007. Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'07). Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. V. Handziski, A. Kopke, A. Willig, and A. Wolisz. 2006. TWIST: A scalable and reconfigurable testbed for wireless indoor experiments with sensor networks. In Proceedings of the International Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality (REALMAN'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Hansen, B. Kusy, R. Jurdak, and K. Langendoen. 2012. AutoSync: Automatic duty-cycle control for synchronous low-power listening. In Proceedings of the IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'12).Google ScholarGoogle Scholar
  23. R. Jurdak, P. Baldi, and Lopes, C. Videir. 2007. Adaptive low power listening for wireless sensor networks. IEEE Trans. Mobile Comput. 6, 8, 988--1004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. D. Kim and M. Liu. 2008. Optimal stochastic routing in low duty-cycled wireless sensor networks. In Proceedings of the 4th Annual International Conference on Wireless Internet (WICON'08). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. J. Kim, X. Lin, N. B. Shroff, and P. Sinha. 2008. On maximizing the lifetime of delay-sensitive wireless sensor networks with anycast. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom'08).Google ScholarGoogle Scholar
  26. J. Kim, X. Lin, N. B. Shroff, and P. Sinha. 2010. Minimizing delay and maximizing lifetime for wireless sensor networks with anycast. IEEE/ACM Trans. Netw. 18, 515--528. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. O. Landsiedel, E. Ghadimi, S. Duquennoy, and M. Johansson. 2012. Low power, low delay: Opportunistic routing meets duty cycling. In Proceedings of the 11th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN'12). Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. P. Larsson. 2001. Selection diversity forwarding in a multihop packet radio network with fading channel and capture. ACM Mobile Comput. Comm. Rev. 5, 47--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Liu, K.-W. Fan, and P. Sinha. 2007. CMAC: An energy efficient MAC layer protocol using convergent packet forwarding for wireless sensor networks. In Proceedings of IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'07).Google ScholarGoogle Scholar
  30. S. Liu, K.-W. Fan, and P. Sinha. 2009. CMAC: An energy-efficient MAC layer protocol using convergent packet forwarding for wireless sensor networks. ACM Trans. Sensor Netw. 5, 29:1--29:34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. S. Liu, M. Sha, and L. Huang. 2010. ORAS: Opportunistic routing with asynchronous sleep in wireless sensor networks. In Proceedings of the 2nd International Conference on Future Computer and Communication (ICFCC'10).Google ScholarGoogle Scholar
  32. T. Liu and A. Cerpa. 2011. Foresee (4C): Wireless link prediction using link features. In Proceedings of the 10th International Conference on Information Processing in Sensor Networks (IPSN'10).Google ScholarGoogle Scholar
  33. T. Liu and A. Cerpa. 2012. TALENT: Temporal adaptive link estimator with no training. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'12). Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. M. Lu and J. Wu. 2009. Opportunistic routing algebra and its applications. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom'09).Google ScholarGoogle Scholar
  35. X. Mao, S. Tang, X. Xu, X. Li, and H. Ma. 2011. Energy-efficient opportunistic routing in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 22, 11, 1934--1942. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. A. F. Meier, M. Woehrle, M. Zimmerling, and L. Thiele. 2010. Zerocal: Automatic MAC protocol calibration. In Proceedings of 6th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS'10). Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. S. Moeller, A. Sridharan, B. Krishnamachari, and O. Gnawali. 2010. Routing without routes: The backpressure collection protocol. In Proceedings of the ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN'10). Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. D. Moss and P. Levis. 2008. BoX-macs: Exploiting physical and link layer boundaries in low-power networking. Tech. rep, SING-08-00, Stanford.Google ScholarGoogle Scholar
  39. V. Paruchuri, S. Basavaraju, A. Durresi, R. Kannan, and S. Iyengar. 2004. Random asynchronous wakeup protocol for sensor networks. In Proceedings of the 1st International Conference on Broadband Networks (BroadNets'04). Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. B. Pavkovic, F. Theoleyre, and A. Duda. 2011. Multipath opportunistic rpl routing over IEEE 802.15.4. In Proceedings of the ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM'11). Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. J. Polastre, J. Hill, and D. Culler. 2004. Versatile low power media access for wireless sensor networks. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (Sen-Sys'04). Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. D. Puccinelli, M. Zuniga, S. Giordano, and P. J. Marron. 2012. Broadcast-free collection protocol. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'12). Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. G. Schaefer, F. Ingelrest, and M. Vetterli. 2009. Potentials of opportunistic routing in energy-constrained wireless sensor networks. In Proceedings of the European Conference on Wireless Sensor Networks (EWSN'09). Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. K. Srinivasan, M. Jain, J. I. Choi, T. Azim, E. S. Kim, P. Levis, and B. Rishnamachari. 2010. The factor: Inferring protocol performance using inter-link reception correlation. In Proceedings of the ACM International Conference on Mobile Computing and Networking (MobiCom'10). Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. K. Srinivasan, M. A. Kazandjieva, S. Agarwal, and P. Levis. 2008. The β factor: Measuring wireless link burstiness. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'08). Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. S. Unterschutz, C. Renner, and V. Turau. 2012. Opportunistic, receiver-initiated data-collection protocol. In Proceedings of the European Conference on Wireless Sensor Networks (EWSN'12). Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. J. Vanhie-Van Gerwen, E. De Poorter, B. Latre, I. Moerman, and P. Demeester. 2010. Real-life performance of protocol combinations for wireless sensor networks. In Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'10). Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. T. Winter, P. Thubert, A. Brandt, J. Hui, R. Kelsey, P. Levis, K. Pister, R. Struik, J. Vasseur, and R. Alexander. 2012. RPL: IPv6 routing protocol for low-power and lossy networks. RFC 6550 (proposed standard). http://tools.ietf.org/html/rfc6550.Google ScholarGoogle Scholar
  49. A. Woo, T. Tong, and D. Culler. 2003. Taming the underlying challenges of reliable multihop routing in sensor networks. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'03). Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Y. Xue, M. Vuran, and B. Ramamurthy. 2010. Cost efficiency of anycast-based forwarding in duty-cycled WSNS with lossy channel. In Proceedings of the IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'10).Google ScholarGoogle Scholar
  51. W. Ye, F. Silva, and J. Heidemann. 2006. Ultra-low duty cycle MAC with scheduled channel polling. In Proceedings of the ACM International Conference on Embedded Networked Sensor Systems (SenSys'06). Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Z. Zhong and S. Nelakuditi. 2007. On the efficacy of opportunistic routing. In Proceedings of the IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'07).Google ScholarGoogle Scholar
  53. M. Zorzi and R. R. Rao. 2003a. Geographic random forwarding (geraf) for ad hoc and sensor networks: Energy and latency performance. IEEE Trans. Mobile Comput. 2, 349--365. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. M. Zorzi and R. R. Rao. 2003b. Geographic random forwarding (geraf) for ad hoc and sensor networks: Multihop performance. IEEE Trans. Mobile Comput. 2, 337--348. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Sensor Networks
        ACM Transactions on Sensor Networks  Volume 10, Issue 4
        June 2014
        480 pages
        ISSN:1550-4859
        EISSN:1550-4867
        DOI:10.1145/2633905
        Issue’s Table of Contents

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 20 June 2014
        • Accepted: 1 September 2013
        • Revised: 1 August 2013
        • Received: 1 January 2013
        Published in tosn Volume 10, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader