Skip to main content
Log in

Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

NC (Network Coding) provides a new approach to packet retransmission problems in wireless networks, which are named as WPRTPs (Wireless Packet Retransmission Problems) in this paper. Some research has been conducted on P-WPRTPs (Perfect WPRTPs) where, for one receiver, a packet is either being requested by or already known to it. However, very few efforts are focused on IP-WPRTPs (Imperfect WPRTPs) where, for one receiver, a packet can be neither requested by nor already known to it. In this paper, we focus on IP-WPRTPs. Firstly, a WPRTP reduction theorem for simplifying WPRTPs is proposed and proved. Then, the upper and lower bounds of the number of necessary packet transmissions in optimal NC-based solutions to IP-WPRTPs are analyzed. Next, a scheme named as IP-WPRTP-DC (Divide and Conquer based scheme for IP-WPRTPs) is proposed based on the WPRTP reduction theorem using a divide and conquer approach. Extensive simulations show that the IP-WPRTP-DC scheme is effective in saving the number of packet transmissions for solving IP-WPRTPs.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kunz, T. (2003). Multicasting in mobile ad-hoc networks: Achieving high packet delivery ratios [C]. In Proceedings of the 2003 Conference of the Centre for Advanced Studies on Collaborative research (pp. 156–170). Toronto: IBM Press.

  2. Ouyang, B., Hong, X., & Yi, Y. (2005). A Comparison of reliable multicast protocols for mobile Ad hoc networks [C]. In Proceedings of IEEE Southeast Conference. Fort Lauderdale (pp. 339–344). FL: IEEE Press.

  3. El Rouayheb, S. Y., Chaudhry, M. A. R., & Sprintson, A. (2007). On the minimum number of transmissions in single-hop wireless coding networks [C].In: Proceeding of IEEE Information Theory Workshop (pp. 120–125). Lake Tahoe, California: IEEE Press.

  4. Ahlswede R., Cai N., Shuo-Yen Robert Li, Yeung R. W. (2000) Network information flow [J]. IEEE Transactions on Information Theory 46(4): 1204–1216

    Article  MATH  Google Scholar 

  5. Koetter, R. (2009). Network coding homepage [EB/OL]. http://www.ifp.illinois.edu/~koetter/NWC/index.html.2009-11-10.

  6. Fragouli, C., Katabi, D., Markopoulou, A., Médard, M., & Rahul, H. (2007). Wireless network coding: Opportunities & challenges. In IEEE Military Communications Conference, 2007 (pp. 1–8). MILCOM 2007.

  7. Wu, Y., & Sun-Yuan, K. (2005). Reduced-complexity network coding for multicasting over ad hoc networks [C]. In IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP’05) (pp. 18–23).

  8. Sengupta, S., Rayanchu, S., & Banerjee, S. (2007). An analysis of wireless network coding for unicast sessions: The case for coding-aware routing [C]. In The 26th Annual IEEE Conference on Computer Communications (INFOCOM’07). Anchorage, AK, USA.

  9. Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., & Crowcroft, J. (2006). XORs in the air: Practical wireless network coding (pp. 243–254). ACM SIGCOMM, Pisa, Italy.

  10. Lun, D. S., Médard, M., & Koetter, R. (2005). Efficient operation of wireless packet networks using network coding [C]. In Proceedings International Workshop on Convergent Technologies (IWCT’05).

  11. Zhang, X., & Wicker, S. B. (2005). Robustness vs efficiency in sensor networks [C]. In Proceedings 4th International Symposium on Information Processing in Sensor Networks (IPSN’05) (pp.225–230).

  12. Ho, T., Leong, B., Koetter, R., Médard, M., Effros, M., & D. R. Karger, (2004). Byzantine modification detection in multicast networks using randomized network coding [C]. In IEEE International Symposium on Information Theory (ISIT’04). Chicago, IL, USA.

  13. Ho, T., Médard, M., Shi, J., Effros, M., & Karger, D. R. (2003). On randomized network coding [C]. In Proceedings of 41st Annual Allenton Conference on Communication, Control, and Computing. Monticello, IL.

  14. Xu Y., Zhan C., Luo W., Li P. (2008) Network coding based reliable multicast for wireless ad hoc networks [J]. Journal of University of Science and Technology of China 38(7): 860–866 (in Chinese)

    MathSciNet  Google Scholar 

  15. Nguyen D., Tran T., Nguyen T., Bose B. (2009) Wireless broadcast using network coding [J]. IEEE Transactions on Vehicular Technology 58(2): 914–925

    Article  Google Scholar 

  16. Gao Z., Zhao Y., Cai S., Zhao J. (2010) A random network coding based optimal scheme for wireless packet retransmission problems [J]. Journal of BeiJing University of Aeronautics & Astronautics (in Chinese) 36(2): 231–234

    Google Scholar 

  17. Gauss-Jordan Elimination [EB/OL]. http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-KANPUR/mathematics-2/node20.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhenguo Gao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, Z., Yang, M., Wang, J. et al. Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach. Wireless Pers Commun 62, 937–958 (2012). https://doi.org/10.1007/s11277-010-0102-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-010-0102-9

Keywords

Navigation