IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v15y2019i6p1550147719853978.html
   My bibliography  Save this article

Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network

Author

Listed:
  • Cuixiang Wang
  • Xing Shao
  • Zhi Gao
  • Chuanxin Zhao
  • Jun Gao

Abstract

Network coding–based routing has been widely considered as a promising technology to improve the network throughput of wireless multihop network. However, existing network coding aware routings have the problem of failure decoding and usually neglect the transmission scheduling, which degrades the gain of network coding. In this article, a common network coding condition and traffic matching supported network coding aware routing is proposed for wireless multihop network. In this, common network coding condition is proposed to avoid the problem of failed decoding. In addition, traffic matching mechanism is presented to promote the occurrence of network coding. Besides, a coding and load aware routing metric, which jointly considers the network coding opportunity and node load, is designed to evaluate the discovered paths. Extensive simulations on NS2 demonstrate that CTNR increases the number of coding opportunities and network coding occurrence, and improves network throughput.

Suggested Citation

  • Cuixiang Wang & Xing Shao & Zhi Gao & Chuanxin Zhao & Jun Gao, 2019. "Common network coding condition and traffic matching supported network coding aware routing for wireless multihop network," International Journal of Distributed Sensor Networks, , vol. 15(6), pages 15501477198, June.
    • Handle: RePEc:sae:intdis:v:15:y:2019:i:6:p:1550147719853978
    DOI: 10.1177/1550147719853978
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719853978
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147719853978?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:15:y:2019:i:6:p:1550147719853978. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.