Compressive sensing and random walk based data collection in wireless sensor networks

被引:17
作者
Zhang, Ping [1 ,2 ]
Wang, Jianxin [1 ]
Guo, Kehua [1 ]
机构
[1] Cent South Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China
[2] Hunan Univ Commerce, Coll Comp & Informat Engn, Changsha, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Data collection; Compressive sensing; Random walk; Wireless sensor network; COMPUTATION;
D O I
10.1016/j.comcom.2018.07.026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data collection is one of the most important research topics in wireless sensor networks. Compressive sensing can break through the classical Shannon-Nyquist boundary and reduce the total energy consumption. Random walk technology has a significant advantage in the energy balance. Random walk based compressive sensing data collection mechanism is a combination of these two technologies, which reinforce complementary advantages. However, the traditional scheme faces two challenges, i.e., large transmission energy consumption caused by the overlong multi-hop transmission path and the low recovery accuracy caused by poorly designed compressive sensing measurement. In this paper, we propose a ring topology based compressive sensing data collection scheme (RTCS). The total number of hops is reduced by a ring topology based random walk. The recovery accuracy is improved by the dual compensation based compressive sensing measurement. The theoretical analysis, as well as the experimental evaluation obtained from two different network deployment environments, demonstrates that the proposed scheme can achieve the performance superior to the most closely related work.
引用
收藏
页码:43 / 53
页数:11
相关论文
共 33 条
[1]  
Angelopoulos CM, 2011, ACM INT SYM MOB MAN, P53
[2]  
[Anonymous], 2009, INT THEOR APPL WORKS
[3]  
[Anonymous], P SIGMOD 15
[4]  
[Anonymous], P MOBIHOC 15
[5]  
[Anonymous], CLIM DAT GUID SST AM
[6]   On the cover time and mixing time of random geometric graphs [J].
Avin, Chen ;
Ercal, Gunes .
THEORETICAL COMPUTER SCIENCE, 2007, 380 (1-2) :2-22
[7]   A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol [J].
Beraldi, Roberto ;
Baldoni, Roberto ;
Prakash, Ravi .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2010, 9 (11) :1649-1661
[8]   Compressive Sensing in Quantum Chemistry: A Little Computation Goes a Long Way [J].
Beran, Gregory J. O. .
ACS CENTRAL SCIENCE, 2015, 1 (01) :14-15
[9]  
Boyd S, 2004, SIAM REV, V46, P667, DOI [10.1137/S0036144503423264, 10.1137/s0036144503423264]
[10]   CALCULATION OF NUMBER OF RELAY HOPS REQUIRED IN RANDOMLY LOCATED RADIO NETWORK [J].
CHANDLER, SAG .
ELECTRONICS LETTERS, 1989, 25 (24) :1669-1671