Skip to main content

Hybrid Random Network Coding

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6843))

  • 983 Accesses

Abstract

To avoid possible dependence among coded packets, most research works of random linear network coding suggest encoding packets over a Galois field with enough many elements, e.g., \(GF\left( 2^{8}\right) \) or \(GF\left( 2^{16}\right) \). However, Galois operations are with higher computational cost than ordinary integer operations. On the other hand, random Boolean network coding, based on the Boolean algebra in which XOR is the only operation needed for encoding and encoding, is a computation-friendly random network coding scheme but at the same time suffered for the possible dependence among coded packets. In this work, a hybrid coding scheme is proposed. Most coded packets are encoded over the Boolean field and only a few augmented coded packets, more precisely 4 packets, are needed to be encoded over the Galois field. Both the computational efficiency and bandwidth effectiveness are taken into consideration. The proposed scheme is theoretically verified by probabilistic analysis.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chou, P.A., Wu, Y., Jain, K.: Practical network coding. In: Proceedings of the 41st Allerton Conference on Communication, Control, and Computing, October 1-3 (2003)

    Google Scholar 

  3. Gkantsidis, C., Miller, J., Rodriguez, P.: Anatomy of a P2P content distribution system with network coding. In: The 5th International Workshop on Peer-to-Peer Systems (IPTPS 2006), February 27-28 (2006)

    Google Scholar 

  4. Ho, T., Koetter, R., Médard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: IEEE International Symposium on Information Theory (ISIT 2003), June 29-July 4, p. 442 (2003)

    Google Scholar 

  5. Lee, U., Park, J., Yeh, J., Pau, G., Gerla, M.: CodeTorrent: Content distribution using network coding in VANET. In: Proceedings of the 1st International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking (MobiShare 2006), September 25 (2006)

    Google Scholar 

  6. Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Wang, M., Li, B.: Network coding in live peer-to-peer streaming. IEEE Transactions on Multimedia 9(8), 1554–1567 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yi, CW. (2011). Hybrid Random Network Coding. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2011. Lecture Notes in Computer Science, vol 6843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23490-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23490-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23489-7

  • Online ISBN: 978-3-642-23490-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics