Skip to main content
SpringerLink
Log in

Active intersession network coding-aware routing

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Coding-aware routing can create more coding opportunities by selecting the proper routing path. The main challenge in exploiting network coding is how to develop an effective network coding conditions. In this paper, we develop the active intersession network coding (AINC) which can create more intersession network coding opportunities than the general intersession network coding (GINC) by actively exploiting the redundancy information in the network with the deliberately built bridge links. With the aim to find multiple candidate parallel paths for each unicast, the conventional Bellman–Ford algorithm is enhanced. Built on AINC and the enhanced Bellman-Ford algorithm, we propose the active intersession network coding-aware routing (AINC-AR) scheme for the wireless network which supports multiple unicasts. The basic idea of AINC-AR is to select the path from all available candidate ones by jointly considering the effects of network coding gains and path costs on the overall network costs, so as to minimize the total network costs. Simulations are conducted to demonstrate the advantages of AINC-AR over GINC-AR and the conventional routing scheme without considering network coding.

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

Similar content being viewed by others

References

  1. Widmer, J., Capalbo, A., Fernandez Anta, A., & Banchs, A. (2015). Efficient interlayer network codes for fair layered multicast streaming. IEEE/ACM Transactions on Networking, 23(4), 1107–1120.

    Article  Google Scholar 

  2. Reddy, V., Shakkottai, S., Sprintson, A., & Gautam, N. (2010). Multipath wirless network coding: a population game perspective. In Proceedings of 29th IEEE Conference on Computer Communication (INFOCOM), March 2010.

  3. Bourtsoulatze, E., Thomos, N., & Frossard, P. (2014). Distributed rate allocation in inter-session network coding. IEEE Transactions on Multimedia, 16(6), 1752–1765.

    Article  Google Scholar 

  4. Alvandi, M., Mehmet-Ali, M., & Hayes, J. F. (2015). Delay optimization and cross-layer design in multihop wireless networks with network coding and successive interference cancelation. IEEE Journal on Selected Areas in Communications, 33(2), 295–308.

    Article  Google Scholar 

  5. Koutsonikolas, D., Hu, Y. C., & Wang, C.-C.. (2008). An empirical study of performance benefits of network coding in multihop wireless networks. In Proceedings of 27th IEEE Conference on Computer Communication (INFOCOM), April 2008.

  6. Sengupta, S., Rayanchu, S., & Banerjee, S. (2007). An analysis of wireless network coding for unicast sessions: the case for coding-aware routing. In Proceedings of 27th IEEE Conference on Computer Communication (INFOCOM), May 2007.

  7. Peng, Y., Yang, Y., Lu, X., & Ding, X. (2010). Coding-aware routing for unicast sessions in multi-hop wireless networks. In Proceedings of. IEEE Global Telecommunications Conference (Globecom), December 2010.

  8. Fan, K., Ling-xiong, Li, & Dong-yang, Long. (2009). Study of on-demand COPE-aware routing protocol in wireless mesh networks. Journal on Communications, 30(1), 128–134.

    Google Scholar 

  9. Vu, T.-V., Nguyen, T. M. T., & Pujolle, G. (2012). Distributed opportunistic and diffused coding in multi-hop wireless networks. In Proceedings of IEEE International Conference on Communications (ICC), June, 2012.

  10. Guo, Bin, Li, Hongkun, Zhou, Chi, & Cheng, Yu. (2011). Analysis of general network coding conditions and design of a free-ride-oriented routing metric. IEEE Transactions on Vehicular Technology, 60(4), 1714–1727.

    Article  Google Scholar 

  11. Bellman, R. (1958). On a routing problem. Quarterly Applied Mathematics, 16(1), 87–90.

    Article  MathSciNet  MATH  Google Scholar 

  12. Woungang, I., et al. (2013). Routing in Opportunistic Networks. New York: Springer book.

    Book  MATH  Google Scholar 

  13. Vasilakos, A. V., et al. (2012). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press.

    Google Scholar 

  14. Youssef, M., et al. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  15. Meng, T., Wu, F., Yang, Z., Chen, G., & Vasilakos, A. V. (2016). Spatial reusability-aware routing in multi-hop wireless networks. IEEE Transactions on Computer, 65(1), 244–255.

    Article  MathSciNet  Google Scholar 

  16. Liu, L., et al. (2015). Physarum optimization: A biology-inspired algorithm for the Steiner tree problem in networks. IEEE Transactions on Computers, 64(3), 819–832.

    MathSciNet  Google Scholar 

  17. Busch, C., et al. (2012). Approximating congestion + dilation in networks via “Quality of Routing” games. IEEE Trans. Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  18. Yuanyuan, Zeng, et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  19. Li P., Guo S., Yu S., & Vasilakos, A. V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In Proceedings of IEEE International Conference on Computer Communications (INFOCOM) (pp. 100–108).

  20. Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2014). Reliable multicast with pipelined network coding using opportunistic feeding and routing. IEEE Transactions on Parallel and Distributed Systems, 25(12), 3264–3273.

    Article  Google Scholar 

  21. Lun, D. S., Ratnakar, N., Medard, M., & Koetter, R. (2006). Minimum-cost multicast over coded packet networks. IEEE Transactions on Information Theory, 52(6), 2608–2623.

    Article  MathSciNet  MATH  Google Scholar 

  22. Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1(1), 269–271.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China

    Zhonghui Mei & Zhen Yang

Authors
  1. Zhonghui Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhen Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhonghui Mei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mei, Z., Yang, Z. Active intersession network coding-aware routing. Wireless Netw 23, 1161–1168 (2017). https://doi.org/10.1007/s11276-016-1221-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-016-1221-3

Keywords

Search

Navigation