Skip to main content

Advertisement

SpringerLink
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Habibi, J., Ghrayeb, A., & Aghdam, A. G. (2013). Energy-efficient cooperative routing in wireless sensor networks: A mixed-integer optimization framework and explicit solution. IEEE Transactions on Communications, 61(8), 3424–3437.

    Article  Google Scholar 

  2. Keeler, H. P., & Taylor, P. G. (2011). A model framework for greedy routing in a sensor network with a stochastic power scheme. ACM Transactions on Sensor Networks, 7(4), 34:1–34:28.

    Article  Google Scholar 

  3. Lai, W., & Paschalidis, I. Ch. (2007). Sensor network minimal energy routing with latency guarantees. In Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing (MobiHoc) (pp. 199–208).

  4. Zeydan, E., Kivanc, D., Comaniciu, C., & Tureli, U. (2012). Energy-efficient routing for correlated data in wireless sensor networks. Ad Hoc Networks, 10(6), 962–975.

    Article  Google Scholar 

  5. Zhang, H., & Shen, H. (2010). Energy-efficient beaconless geographic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 21(6), 881–896.

    Article  Google Scholar 

  6. Coutinho, R. W. L., Boukerche, A., Vieira, L. F. M., & Loureiro, A. A. F. (2014). Transmission power control-based opportunistic routing for wireless sensor networks. In Proceedings of the 17th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (MSWiM) (pp. 219–226).

  7. Mao, X., Tang, S., Xiahua, X., Li, X.-Y., & Ma, H. (2011). Energy-efficient opportunistic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1934–1942.

    Article  Google Scholar 

  8. Duquennoy, S., Landsiedel, O., & Voigt, T. (2013). Let the tree bloom: Scalable opportunistic routing with orpl. In Proceedings of the 11th ACM conference on embedded networked sensor systems (SenSys) (pp. 2:1–2:14).

  9. Ghadimi, E., Landsiedel, O., Soldati, P., & Johansson, M. (2012). A metric for opportunistic routing in duty cycled wireless sensor networks. In Proceedings of the 9th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (SECON) (pp. 335–343).

  10. Huang, P., Chen, H., Xing, G., & Tan, Y. (2009). Sgf: A state-free gradient-based forwarding protocol for wireless sensor networks. ACM Transactions on Sensor Networks, 5(2), 14:1–14:25.

    Article  Google Scholar 

  11. Pavković, B., Theoleyre, F., & Duda, A. (2011). Multipath opportunistic rpl routing over ieee 802.15.4. In Proceedings of the 14th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (MSWiM) (pp. 179–186).

  12. Kim, J., & Ravindran, B. (2009). Opportunistic real-time routing in multi-hop wireless sensor networks. In Proceedings of the 2009 ACM symposium on applied computing (SAC) (pp. 2197–2201).

  13. Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing-a review and the challenges ahead. Computer Networks, 55(15), 3592–3603.

    Article  Google Scholar 

  14. Darehshoorzadeh, A, & Cerdà-Alabern, L. (2010). Candidate selection algorithms in opportunistic routing. In Proceedings of the 5th ACM workshop on performance monitoring and measurement of heterogeneous wireless and wired networks (PM2HW2N) (pp. 48–54).

  15. Zeng, K., Yang, J., & Lou, W. (2012). On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks. Wireless Networks, 18(8), 967–983.

    Article  Google Scholar 

  16. Zhao, P., Yang, X., Wang, J., Liu, B., & Wang, J. (2012). Bor/ac: Bandwidth-aware opportunistic routing with admission control in wireless mesh networks. In Proceedings of the 31st annual IEEE international conference on computer communications (INFOCOM) (pp. 2701–2705).

  17. Shen, H., Bai, G., Tang, Z., & Zhao, L. (2014). Qmor: Qos-aware multi-sink opportunistic routing for wireless multimedia sensor networks. Wireless Personal Communications, 75(2), 1307–1330.

    Article  Google Scholar 

  18. Biswas, S., & Morris, R. (2005). Exor: Opportunistic multi-hop routing for wireless networks. In Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (pp. 133–144).

  19. Dubois-Ferrière, H., Grossglauser, M., & Vetterli, M. (2011). Valuable detours: Least-cost anypath routing. IEEE/ACM Transactions on Networking, 19(2), 333–346.

    Article  Google Scholar 

  20. Zhong, Z., & Nelakuditi, S. (2007). On the efficacy of opportunistic routing. In Proceedings of the 4th annual IEEE communications society conference on sensor, mesh and ad hoccommunications and networks (SECON) (pp. 441–450).

  21. Rozner, E., Seshadri, J., Mehta, Y., & Qiu, L. (2009). Soar: Simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing, 8(12), 1622–1635.

    Article  Google Scholar 

  22. De Couto, D. S.J., Aguayo, D., Bicket, J., & Morris, R. (2003). A high-throughput path metric for multi-hop wireless routing. In Proceedings of the 9th annual international conference on mobile computing and networking (MobiCom) (pp. 134–146).

  23. Li, S.-Y. R., Sun, Q. T., & Shao, Z. (2011). Linear network coding: Theory and algorithms. Proceedings of the IEEE, 99(3), 372–387.

    Article  Google Scholar 

  24. Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions Information Theory, 49(2), 371–381.

    Article  MATH  MathSciNet  Google Scholar 

  25. Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (pp. 169–180).

  26. Koutsonikolas, D., & Wang, C.-C. (2011). Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments. IEEE/ACM Transactions on Networking, 19(5), 1368–1381.

    Article  Google Scholar 

  27. Hsu, C.-J., Liu, H-I., & Seah, W. (2009). Economy: A duplicate free opportunistic routing. In Proceedings of the 6th ACM international conference on mobile technology, application & systems (mobility) (pp. 17:1–17:6).

  28. Myung, J., & Lee, W. (2012). Eliminating duplicate forwarding in wireless opportunistic routing. IEEE Communications Letters, 16(4), 510–513.

    Article  Google Scholar 

  29. Zhong, Z., Wang, J., Nelakuditi, S., & Guor-Huar, L. (2006). On selection of candidates for opportunistic anypath forwarding. ACM SIGMOBILE Mobile Computing and Communications Review, 10(4), 1–2.

    Article  Google Scholar 

  30. Laufer, R., Dubois-Ferrière, H., & Kleinrock, L. (2012). Polynomial-time algorithms for multirate anypath routing in wireless multihop networks. IEEE/ACM Transactions on Networking, 20(3), 742–755.

    Article  Google Scholar 

  31. Mazumdar, S. P., Bose, S. K., & Zhong, W.-D. (2012). Multicast least cost anypath routing: Route cost calculations and forwarding. IEEE Communications Letters, 16(10), 1652–1655.

    Article  Google Scholar 

  32. Darehshoorzadeh, A., Almulla, M., Boukerche, A., & Chaiwala, S. (2013). On the number of candidates in opportunistic routing for multi-hop wirelessnetworks. In Proceedings of the 11th ACM international symposium on mobility management and wireless access (MobiWac) (pp. 9–16).

Download references

Acknowledgments

The authors gratefully acknowledge the support and financial assistance provided by the National Natural Science Foundation of China under Grant Nos. 60673185 and 61073197, the Scientific & Technological Support Project (Industry) of Jiangsu Province under No. BE2011186, Prospective Research Project on Future Networks of Jiangsu Future Networks Innovation Institute under Grant No. BY2013095-4-09, as well as the Key Lab Program of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications), Ministry of Education under Grant No. NYKL201304.

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, Nanjing University of Science and Technology, Xiaolingwei Street 200, Nanjing, 210094, JiangSu Province, China

    Hang Shen, Guangwei Bai, Lu Zhao & Zhenmin Tang

  2. Department of Computer Science and Technology, Nanjing Tech University, No. 30, PuZhu Road (South), Pukou District, Nanjing, 211816, JiangSu Province, China

    Hang Shen, Guangwei Bai & Jinfeng Ge

  3. Key Lab of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, XinMofan Road 66, Nanjing, 210003, JiangSu Province, China

    Guangwei Bai

Authors
  1. Hang Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guangwei Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lu Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jinfeng Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhenmin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guangwei Bai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shen, H., Bai, G., Zhao, L. et al. L2OR: Low-Cost Low-Complexity Opportunistic Routing for Wireless Sensor Networks. Wireless Pers Commun 82, 401–422 (2015). https://doi.org/10.1007/s11277-014-2214-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-2214-0

Keywords

Search

Navigation