Skip to main content

Advertisement

SpringerLink
Log in

CAPF: coded anycast packet forwarding for wireless mesh networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In wireless mesh networks, delay and reliability are two critical issues in the support of delay-sensitive applications. Due to sleep scheduling designed for energy efficiency, a node along an end-to-end path needs to wait for its next hop to wake up before it can transmit, which incurs extra delay. In addition, because of unreliable wireless communications, a node may not successfully receive the packet even when it is in active mode. In this paper, we propose a coded anycast packet forwarding (CAPF) scheme for both unicast and multicast communications such that the delay can be reduced and the reliability can be improved. We theoretically analyze the impact of nodes’ awake probability and the link loss probability on the end-to-end delay and the reliability. A tradeoff between the end-to-end delay and the reliability is also investigated. Simulation results demonstrate that CAPF provides a flexible mechanism to make good delay-reliability tradeoff and is effective to reduce the end-to-end delay and enhance the reliability.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Lu, G., Sadagopan, N., Krishnamachari, B., & Goel, A. (2005). Delay efficient sleep scheduling in wireless sensor networks. In Proceedings of the 24th annual joint conference of the IEEE computer and communications societies, INFOCOM, Miami, FL, USA, pp. 2470–2481.

  2. Ye, W., Heidemann, J., & Estrin, D. (2002). An energy-efficient MAC protocol for wireless sensor networks. In: Proceedings of the 21st annual joint conference of the IEEE computer and communications societies, INFOCOM, Vol. 3, pp. 1567–1576.

  3. Wireless mesh networking zigbee versus digimesh, available online: http://www.digi.com/pdf/wp_zigbeevsdigimesh.pd..

  4. Liang, N., Chen, P., Sun, T., Yang, G., Chen, L., & Gerla, M. (2006). Impact of node heterogeneity in ZigBee mesh network routing. In: IEEE international conference on systems, man and cybernetics, SMC ’06, 1, pp 187−191.

  5. Kim, J., Lin, X., Shroff, N. B., & Sinha, P. (2010). Minimizing delay and maximizing lifetime for wireless sensor networks with anycast. IEEE/ACM Transactions on Networking, 18(2), 515–528.

    Article  Google Scholar 

  6. Ahlswede, R., Cai, N., yen Robert Li, S., Yeung R. W., Member, S., & Member, S. (2000). Network information flow. IEEE Transactions on Information Theory, 46, 1204–1216.

    Article  MATH  Google Scholar 

  7. Lun, D. S., Medard, M., & Koetter, R. (2006). Network coding for efficient wireless unicast. In: Proceedings of the international Zurich seminar on communications, pp. 74–77.

  8. Zhan, C., Xu, Y., Wang, J., & Lee, V. (2009). Reliable multicast in wireless networks using network coding. In Proceedings of the 6th international conference on mobile Adhoc and Sensor systems, MASS, Macau, China, pp. 506–515.

  9. Ghaderi, M., Towsley, D., & Kurose, J. (2008). Reliability gain of network coding in lossy wireless networks. In Proceedings of the 27th IEEE conference on computer communications, pp. 2171–2179.

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

  11. Biswas, S., & Morris, R. (2004). Opportunistic routing in multi-hop wireless networks. SIGCOMM Computer Communication Review, 34(1), 69–74.

    Article  Google Scholar 

  12. Zorzi, M., & Rao, R. R. (2003). Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance. IEEE Transactions on Mobile Computing, 2(4), 349–365.

    Article  Google Scholar 

  13. Wang, H. (2006). Wireless sensor networks for acoustic monitoring. Ph.D. dissertation, University of California at Los Angeles.

  14. Lin, Y., Li, B., & Liang, B. (2008). Codeor: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of the 16th IEEE international conference on network protocols, Florida, pp. 13–22.

  15. Liu, C., Wu, K., Xiao, Y., & Sun, B. (2006). Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 17(6):562–575.

    Article  Google Scholar 

  16. Wicker, S. B. (2004). Reed-solomon codes and their applications. New York: IEEE Press.

    Google Scholar 

  17. Gallager, R. G. (1963). Low-density parity-check codes. Camberidge, MA: MIT Press.

    Google Scholar 

  18. Nguyen, U. T. (2008). On multicast routing in wireless mesh networks. Computer Communications 31(7):1385–1399.

    Article  Google Scholar 

  19. Swapna, B. T., Eryilmaz, A., & Shroff, N. (June 2010). Throughput-delay analysis of random linear network coding for wireless broadcasting. In Proceedings of the 2010 IEEE international symposium on network coding (NetCod 10), Toronton.

  20. Ding, J., Sivalingam, K., Kashyapa, R., & Chuan, L. J. (2003). A multi-layered architecture and protocols for large-scale wireless sensor networks. In Proceedings of IEEE 58th vehicular technology conference, October 6–9, Vol. 3, pp 1443–1447.

  21. Ma, G., Xu, Y., Lin, M., & Xuan, Y. (2007, January). A Content Distribution system based on sparse linear network coding. In Proceedings of the third workshop on network coding (Netcod).

Download references

Acknowledgments

This paper was supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61073038, and the National High-Tech Research and Development Plan of China under Grant No. 2009AA01A348.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology of China, Hefei, China

    Xiumin Wang & Yinlong Xu

  2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Xiumin Wang & Jianping Wang

  3. Department of Computer Science, University of Victoria, Victoria, Canada

    Kui Wu

Authors
  1. Xiumin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kui Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yinlong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kui Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, X., Wu, K., Wang, J. et al. CAPF: coded anycast packet forwarding for wireless mesh networks. Wireless Netw 17, 1273–1285 (2011). https://doi.org/10.1007/s11276-011-0348-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-011-0348-5

Keywords

Search

Navigation