Journal of Communications and Networks

  • 제18권3호
  • /
  • Pages.493-501
  • /
  • 2016
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

Coding-based Storage Design for Continuous Data Collection in Wireless Sensor Networks

  • Zhan, Cheng (School of Computer and Information Science, Southwest University) ;
  • Xiao, Fuyuan (School of Computer and Information Science, Southwest University)
  • 투고 : 2015.01.12
  • 심사 : 2015.08.02
  • 발행 : 2016.06.30
⟨ 이전 논문 다음 논문 ⟩

초록

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

키워드

과제정보

연구 과제 주관 기관 : Central Universities

참고문헌

  1. R. Huang et al., "Real-world sensor network for long-term volcano monitoring: Design and findings," IEEE Trans. Parallel Distrib. Syst., vol. 23, no 2, pp. 321-329, Feb. 2012. https://doi.org/10.1109/TPDS.2011.170
  2. J. Xu, X. Tang, and W.-C. Lee, "A new storage scheme for approximate location queries in object tracking sensor networks," IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 2, pp. 262-275, Feb. 2008. https://doi.org/10.1109/TPDS.2007.70740
  3. A. Balasubramanian, B. N. Levine, and A. Venkataramani, "DTN routing as a resource allocation problem," in Proc. ACM SIGCOMM, Kyoto, Japan, Aug. 2007, pp. 373-384.
  4. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," Proc. IEEE, vol. 99, no. 3, pp. 476-489, Mar. 2011. https://doi.org/10.1109/JPROC.2010.2096170
  5. B.Li and D.Niu, "Random network coding in peer-to-peer networks: From theory to practice," Proc. IEEE, vol. 99, no. 3, pp. 513-523, Mar. 2011. https://doi.org/10.1109/JPROC.2010.2091930
  6. V. Bioglio, M. Grangetto, R. Gaeta, and M. Sereno, "A practical random network coding scheme for data distribution on peer-to-peer networks using rateless Codes," Perform. Eval., vol. 70, no. 1, pp. 1-13, 2013. https://doi.org/10.1016/j.peva.2012.09.001
  7. A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE Trans. Inf. Theory,, vol. 52, no. 6, June 2006.
  8. L. Al-Awami and H. Hassanein, "Data survaivability for WSN via decentralized erasure codes," in Proc. IWCMC, 2012, pp. 94-99.
  9. Y. Lin, B. Li, and, B. Liang, "Geometric random linear codes in sensor networks," in Proc. IEEE ICC, Beijing, China, May 19-23, 2008.
  10. D. Wang, Q. Zhang, and J. Liu, "Partial network coding: Theory and application for continuous sensor data collection," ACM Trans. Sensor Netw., vol. 4., no. 3, Aug. 2008.
  11. R. Ahlswede, N. Cai, S. Li, and R. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000. https://doi.org/10.1109/18.850663
  12. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. 41st Annu. Allerton Conf. Commun., Control, Comput., Oct. 2003.
  13. R. Curtmola, O. Khan, R. Burns, and G. Ateniese, "Mr-pdp: Multiplereplica provable data possession," in Proc. ICDCS, 2008, pp. 411-420.
  14. K. Rzadca, A. Datta, and S. Buchegger, "Replica placement in P2P storage: Complexity and game theoretic analyses," in Proc ICDCS, 2010, pp. 599-609.
  15. M. Li, J. Shu, and W. Zheng, "GRID codes: Strip-based erasure codes with high fault tolerance for storage systems," ACM Trans. Storage, vol. 4, no. 4, pp. 1-22, Jan. 2009.
  16. C. Huang et al., "Erasure coding in windows azure storage," in Proc. ATC, 2012.
  17. R. Rodrigues and B. Liskov, "High availability in DHTs: Erasure coding vs. replication," in Proc. IPTPS, 2005.
  18. S.-Y.R. Li, R.W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003. https://doi.org/10.1109/TIT.2002.807285
  19. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003. https://doi.org/10.1109/TNET.2003.818197
  20. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, pp. 471-480, July 1973.
  21. B. Sheng, Q. Li, and W. Mao, "Data Storage Placement in Sensor Networks," in Proc. ACM MobiHoc, Florence, Italy, May 2006, pp. 344-355.
  22. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM MobiCom, 2000.
  23. C. Cooper, "On the distribution of rank of a random matrix over a finite field," Random Struct. Algorithms, vol. 17, no. 3-4, pp. 197-212, 2000. https://doi.org/10.1002/1098-2418(200010/12)17:3/4<197::AID-RSA2>3.0.CO;2-K
  24. F. S. Hillier and G. J. Lieberman, Introduction to operations research, 7th ed. New York: McGraw-Hill, 2002
  25. M. B. Richey and A. P. Punnen, "Minimum weight perfect bipartite matching and spanning trees under categorisation," Discrete Applied Mathematics, 39: 147-153, 1992. https://doi.org/10.1016/0166-218X(92)90165-7