微信服务号

微信订阅号

2025-4-3- 19
Home > Archive>Volume 28, Issue 12, 2017 >3257-3273. DOI:10.13328/j.cnki.jos.005246
PDF HTML XML Export Cite reminder
Data Gathering Algorithm Based on Compressive Sensing Under Lossy WSN
Author:
Affiliation:

Fund Project:

National Science and Technology Major Projects of China (2014zx03006003)

  • Article
    • | |
  • Metrics
    • |
  • Reference [22]
    • |
  • Related [20]
    • | | |
  • Comments
    Abstract:

    Data gathering algorithm based on compressive sensing(CS) has enormous application potential in wireless sensor network(WSN) in which there is limited energy and a lot of redundant data. However, most existing studies assume that network is based on ideal link. This paper illustrates a situation by experiment that existing CS reconstruction quality will be seriously affected by lossy link, and proposes a CS data gathering algorithm based on retransmission and time series correlation prediction(CS-RTSC). The type of packet loss is modeled as element random loss(ERL) and block random loss(BRL). The loss type prediction algorithm based on sliding window statistics is designed to determine the type of packet loss when link packet loss occurs. Retransmission recovery is applied for ERL, and time series correlation prediction algorithm is designed to recover the loss for BRL. The simulation result indicates that the proposed algorithm can effectively reduce the impact of lossy link in CS data gathering. When the packet loss ratio is up to 30%, the relative error of CS reconstruction signal is only 0.1% higher than that of the CS reconstruction signal in the ideal link.

    Reference
    [1] Shi GM, Liu DH, Gao DH, Liu Z, Lin J, Wang LJ. Advances in theory and application of compressed sensing. Chinese Jourual of Electronics, 2009,37(5):1070-1081(in Chinese with English abstract).[doi:10.3321/j.issn:0372-2112.2009.05.028.]
    [2] Luo C, Wu F, Sun J, Chen CW. Compressive data gathering for large-scale wireless sensor networks. In:Proc. of the 15th Annual Int'l Conf. on Mobile Computing and Networking. New York:ACM Press, 2009. 145-156.[doi:10.1145/1614320.1614337]
    [3] Luo C, Wu F, Sun J, Chen CW. Efficient measurement generation and pervasive sparsity for compressive data gathering. IEEE Trans. on Wireless Communications, 2010,9(12):3728-3738.[doi:10.1109/TWC.2010.092810.100063]
    [4] Ebrahimi D, Assi C. Compressive data gathering using random projection for energy efficient wireless sensor networks. Ad Hoc Networks, 2014,16(1570-8705):105-119.[doi:10.1016/j.adhoc.2013.12.004]
    [5] Nguyen MT, Teague KA. Tree-Based energy-efficient data gathering in wireless sensor networks deploying compressive sensing. In:Proc. of the 23rd Wireless and Optical Communication Conf. (WOCC). New York:IEEE Press, 2014. 1-6.
    [6] Wang W, Garofalakis M, Ramchandran K. Distributed sparse random projections for refinable approximation. In:Proc. of the 6th Int'l Conf. on Information Processing in Sensor Networks. New York:ACM Press, 2007. 331-339.[doi:10.1109/IPSN.2007. 4379693]
    [7] Zhang C, Zhang X, Li O, Wang C, Zhang DL. Data gathering using dynamic clustering based on WSN compressive sensing algorithm. Journal of Computer Research and Development, 2016,53(9):2000-2008(in Chinese with English abstract).[doi:10. 7544/issn1000-1239.2016.20150459]
    [8] Mahmudimanesh M, Khelil A, Suri N. Balanced spatio-temporal compressive sensing for multi-hop wireless sensor networks. In:Proc. of the 9th Int'l Conf. on Mobile Ad-Hoc and Sensor Systems (MASS). New York:IEEE Press, 2012. 389-397.[doi:10.1109/MASS.2012.6502539]
    [9] Wang J, Ji SQ, Cheng Y. Spatial-Temporal correlation-based low-latency compressed sensing in WSNs. Int'l Journal of Grid and Distributed Computing, 2015,8(3):53-64.[doi:10.14257/ijgdc.2015.8.3.06]
    [10] Li P, Hastie TJ, Church KW. Very sparse random projections. In:Proc. of the 12th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. New York:ACM Press, 2006. 287-296.[doi:10.1145/1150402.1150436]
    [11] Kong LH, Xia MY, Liu XY, Wu MY, Liu X. Data loss and reconstruction in sensor networks. In:Proc. of the 2013 IEEE INFOCOM. New York:IEEE Press, 2013. 1654-1662.[doi:10.1109/INFCOM.2013.6566962]
    [12] Wu XG, Yang PL, Jung T, Xiong Y, Zheng X. Compressive sensing meets unreliable link:Sparsest random scheduling for compressive data gathering in lossy WSNs. In:Proc. of the 15th ACM Int'l Symp. on Mobile Ad Hoc Networking and Computing. New York:ACM Press, 2014. 13-22.[doi:10.1145/2632951.2632969]
    [13] Srinivasan K, Kazandjieva MA, Agarwal S, Levis P. The β-factor:Measuring wireless link burstiness. In:Proc. of the 6th ACM Conf. on Embedded Network Sensor Systems. New York:ACM Press, 2008. 29-42.[doi:10.1145/1460412.1460416]
    [14] Munir S, Lin S, Hoque E, Nirjon SM, Stankovic JA, Whitehouse K. Addressing burstiness for reliable communication and latency bound generation in wireless sensor networks. In:Proc. of the 9th ACM/IEEE Int'l Conf. on Information Processing in Sensor Networks. New York:ACM/IEEE Press, 2010. 303-314.[doi:10.1145/1791212.1791248]
    [15] Guo ZQ, Wang Q, Wan YD, Wu L. Modeling of burstiness for IEEE 802.15.4 radio link and optimizing for retransmission mechanism in industrial environments. Ruan Jian Xue Bao/Journal of Software, 2012,23:77-86(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/12009.htm
    [16] Wan CY, Campbell AT, Krishnamurthy L. Pump-Slowly, fetch-quickly (PSFQ):A reliable transport protocol for sensor networks. IEEE Journal on Selected Areas in Communications, 2005,23(4):862-872.[doi:10.1109/JSAC.2005.843554]
    [17] Liu YH, He Y, Li M, Wang JL, Liu KB, Mo LF, Dong W,Yang Z, Xi M, Zhao JZ, Li XY. Does wireless sensor network scale? A measurement study on GreenOrbs. IEEE Trans. on Parallel and Distributed Systems, 2013,24(10):1983-1993.[doi:10.1109/TPDS. 2012.216]
    [18] Kapgate D. Weighted moving average forecast model based prediction service broker algorithm for cloud computing. Int'l Journal of Computer Science and Mobile Computing, 2014,3(2):71-79.
    [19] Wang C, Zhang X, Li O. Sparse random projection algorithm based on minimum energy tree in wireless sensor network. Journal of Communications, 2015,10(9):740-746.
    附中文参考文献:[1] 石光明,刘丹华,高大化,刘哲,林杰,王良君.压缩感知理论及其研究进展.电子学报,2009,37(5):1070-1081.[doi:10.3321/j.issn:0372-2112.2009.05.028]
    [7] 张策,张霞,李鸥.基于压缩感知的无线传感网动态分簇数据收集算法.计算机研究与发展,2016,53(9):2000-2008.[doi:10.7544/issn1000-1239.2016.20150459]
    [15] 郭志强,王沁,万亚东,吴龙.工业环境中IEEE 802.15.4链路突发性建模及重传机制优化.软件学报,2012,23:77-86. http://www.jos.org.cn/1000-9825/12009.htm
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

韩哲,张霞,李鸥,张策,张大龙.面向有损链路的传感网压缩感知数据收集算法.软件学报,2017,28(12):3257-3273

Copy
Share
Article Metrics
  • Abstract:2921
  • PDF: 4099
  • HTML: 1527
  • Cited by: 0
History
  • Received:August 25,2016
  • Revised:October 21,2016
  • Online: March 27,2017
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032408Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063