Skip to main content

Research of Network Coding Data Collection Mechanism Based on the Rough Routing in Wireless Multi-hop Network

  • Conference paper
Web-Age Information Management (WAIM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7901))

Included in the following conference series:

  • 1465 Accesses

Abstract

In wireless sensor networks, network coding technology can enhance the data persistence. The classic wireless sensor network distributed storage algorithm LTCDS-1 may cause serious cliff effect in decoding process. To address this issue, this paper proposed a strategy BRRCD which is based on the rough routing for collecting data in packet-degree increments in wireless sensor network coding. A collector broadcasts a signal to form a layered network. Meanwhile, each node records the neighbors which are upper one layer of the network of itself, as the optional paths to reach the collector. The experiment results show that the BRRCD algorithm restrains the cliff effect in the extent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Yan, W., Fahmy, S., Shroff, N.B.: On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorith. In: INFOCOM, pp. 356–360 (2008)

    Google Scholar 

  2. Albano, M., Gao, J.: In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection. In: Scheideler, C. (ed.) ALGOSENSORS 2010. LNCS, vol. 6451, pp. 105–117. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Aly, S.A., Zhenning, K., Soljanin, E.: Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks. In: International Conference on Information Processing in Sensor Networks, IPSN 2008, pp. 171–182 (2008)

    Google Scholar 

  4. Luby, M.: LT Codes. C. in Processing. In: IEEE Symp. Foundations of Computer Science (FOCS 2002), pp. 271–282 (2002)

    Google Scholar 

  5. Talari, A., Shahrasbi, B., Rahnavard, N.: Efficient symbol sorting for high intermediate recovery rate of LT codes. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2443–2447 (2010)

    Google Scholar 

  6. Plank, J.S., Xu, L.: Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications. In: Fifth IEEE International Symposium on Network Computing and Applications, NCA 2006, pp. 173–180 (2006)

    Google Scholar 

  7. James, S.P.: A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications. In: International Conference on Dependable Systems and Networks, pp. 115–125 (2004)

    Google Scholar 

  8. Puducheri, S., Kliewer, J., Fuja, T.E.: Distributed LT Codes. In: 2006 IEEE International Symposium on Information Theory, pp. 987–991 (2006)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Dimakis, A.G., Prabhakaran, V.: Ramchandran, K.: Distributed Fountain Codes for Networked Storage. In: Proceedings of 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP (2006)

    Google Scholar 

  11. Lin, Y., Liang, B., Li, B.: Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes. In: 26th IEEE International Conference on Computer Communications, INFOCOM 2007, pp. 1658–1666. IEEE (2007)

    Google Scholar 

  12. Hagedorn, A., Agarwal, S., Starobinski, D., et al.: Rateless Coding with Feedback. In: IEEE INFOCOM 2009, pp. 1791–1799 (2009)

    Google Scholar 

  13. Wan, J., Xiong, N., Zhang, W., Zhang, Q., Wan, Z.: Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method. SENSORS 12(12), 17128–17154 (2012)

    Article  Google Scholar 

  14. Zhang, W., He, L., Feng, J., Xu, X., Wan, J.: Distributed Rateless Coding Method for Wireless Sensor Networks Based on Data Oriented Exchanging Strategy. Journal of Computational Information Systems 8(4), 1425–1432 (2012)

    Google Scholar 

  15. Zhang, W., Xiong, N., Yang, L.T., Jia, G., Zhang, J.: BCHED – Energy Balanced Sub-Round Local Topology Management for Wireless Sensor Network. Journal of Internet Technology 13(3), 385–394 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, J. et al. (2013). Research of Network Coding Data Collection Mechanism Based on the Rough Routing in Wireless Multi-hop Network. In: Gao, Y., et al. Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39527-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39527-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39526-0

  • Online ISBN: 978-3-642-39527-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics