Encyclopedia of Wireless Networks

Living Edition
| Editors: Xuemin (Sherman) Shen, Xiaodong Lin, Kuan Zhang

Joint Network Coding and Opportunistic Forwarding

  • Chen ZhangEmail author
  • Yuanzhu Chen
  • Somayeh Kafaie
Living reference work entry
DOI: https://doi.org/10.1007/978-3-319-32903-1_241-1

Synonyms

Definition

Opportunistic routing and network coding are promising network paradigms. Both of them benefit from the broadcast nature of wireless media and will significantly improve network performance. Network coding applies algebraic algorithms to code data packets; each coded packet randomly combines partial information of different data packets, which extends the distribution of data packets in the network. Since each coded packet is equally beneficial and inherently different and each coded packet contains part of information from different original packets, no coded packet is special or indispensable. Thus, even though some coded packets are lost, the sender can keep forwarding coded packets without learning which packets are lost. Opportunistic routing considers multiple downstream nodes are potential next-hop forwarders, which can effectively reduce the possibilities of...

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

References

  1. Ahlswede R, Cai N, Li S-YR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216MathSciNetCrossRefGoogle Scholar
  2. Chou PA, Wu Y, Jain K, Chou PA (2003) Practical network coding. In: Proceedings of allerton conference on communication, control, and computing. [Online]. Available: https://www.microsoft.com/enus/research/publication/practical-network-coding-2
  3. Fragouli C, Boudec J-YL, Widmer J (2006a) Network coding: an instant primer. ACM SIGCOMM Comput Commun Rev 36(1):63–68CrossRefGoogle Scholar
  4. Fragouli C, Widmer J, Boudec J-YL (2006b) A network coding approach to energy efficient broadcasting: from theory to practice. In: Proceedings of IEEE international conference on computer communications, Barcelona, pp 1–11Google Scholar
  5. Ho T, Koetter R, Medard M, Karger DR, Effros M (2003) The benefits of coding over routing in a randomized setting. In: Proceedings of IEEE international symposium on information theory, Yokohama, pp 442–442Google Scholar
  6. Lidl R, Niederreiter H (1997) Finite fields, vol 20. Cambridge University PressGoogle Scholar
  7. Wagner NR (2003) The laws of cryptography with java code. Available online at Neal Wagner’s home pageGoogle Scholar
  8. Wu Y, Chou PA, Jain K (2004) A comparison of network coding and tree packing. In: Proceedings of IEEE international symposium on information theory, Chicago, pp 145–146Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceMemorial University of NewfoundlandSt. John’sCanada
  2. 2.Faculty of Engineering and Applied ScienceMemorial University of NewfoundlandSt. John’sCanada

Section editors and affiliations

  • Cheng Li

There are no affiliations available