Compressive sensing based random walk routing in wireless sensor networks

被引：42

作者：

Nguyen, Minh T. ^{[1
,2
]}

Teague, Keith A. ^{[1
]}

机构：

[1] Oklahoma State Univ, Stillwater, OK 74078 USA

[2] Thai Nguyen Univ Technol, Thai Nguyen, Vietnam

来源：

AD HOC NETWORKS | 2017年 / 54卷

关键词：

Wireless sensor networks; Compressive sensing; Random walk; Data collection; EFFICIENT DATA-COLLECTION; NUMBER;

D O I：

10.1016/j.adhoc.2016.10.009

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Random walk (RW) routing for monitoring purposes in Wireless Sensor Networks (WSNs) has been proven to be an energy-efficient method. In this paper, we exploit the integration between Compressive Sensing (CS) and RW to reduce energy consumption for such networks. All the sensory data is reconstructed at the base-station (BS) based on a smaller number of CS measurements compared to the total number of sensor nodes. Each CS measurement is collected through a RW routing with a predefined length. All random CS measurements are forwarded to the BS for the CS recovery process in two either ways: directly or by relaying through intermediate nodes. A trade-off between the sensor transmission range and the length of RWs is investigated for the networks to achieve the smallest energy consumption. We further formulate the average consumed energy of each random walk based on the sensor transmission range. The average consumed energy to send the measurements from RWs to the BS either directly or by relaying in multi-hop are formulated and analyzed. We calculate the total energy consumption in different conditions and suggest the optimal case for the networks to spend the least energy that significantly prolongs the network lifetime. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：99 / 110

页数：12

共 43 条

[1]

Achlioptas D, 2001, P 20 ACM SIGMOD SIGA, DOI [DOI 10.1145/375551.375608, 10.1145/375551.375608]

[2] Wireless sensor networks: a survey [J].

Akyildiz, IF ;

Su, W ;

Sankarasubramaniam, Y ;

Cayirci, E .

COMPUTER NETWORKS, 2002, 38 (04) :393-422

[3]

Angelopoulos CM, 2011, ACM INT SYM MOB MAN, P53

[4]

[Anonymous], 1958, On a Routing Problem Quarterly of Applied Mathematics

[5] 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

[6] IEEE-SPS and connexions - An open access education collaboration [J].

Baraniuk, Richard G. ;

Burrus, C. Sidney ;

Thierstein, E. Joel .

IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+

[7] Combining geometry and combinatorics: a unified approach to sparse signal recovery [J].

Berinde, R. ;

Gilbert, A. C. ;

Indyk, P. ;

Karloff, H. ;

Strauss, M. J. .

2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :798-+

[8]

Berinde R., 2008, Sparse recovery using sparse randommatrices

[9]

Boyd S, 2004, SIAM REV, V46, P667, DOI [10.1137/S0036144503423264, 10.1137/s0036144503423264]

[10]

Boyd Stephen P, 2005, P SIAM ANALCO, P240

← 1 2 3 4 5 →