.png){kind=icon}
.png){kind=icon}
Return
Node Scheduling and Compressed Sampling for Event Reporting in WSNs
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSE.2018.2799845.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work focuses on developing a node scheduling algorithm for detecting events in a sensor field such that few random samples from a set of the active sensor nodes are transmitted to the cluster head and are further used for almost complete reconstruction of the cluster data. A node scheduling algorithm is proposed to achieve maximum coverage of the physical sensor field with correlated sensor readings. Random samples of the correlated data, obtained from the active nodes, are collected at the cluster head using the compressed sensing principle. Targeting the importance of minimum in-network communication, the node scheduling algorithm and the compressed sensing based data gathering, aim at generating random yet correlated sampling matrices for accurate data recovery. A pseudo probabilistic model is proposed to perceive the essential understanding of the monitoring region, ensuring that the joint sensing probability of the event is always more than the predefined threshold epsilon. Experimental analysis on different sized networks of TelosB motes and extensive simulation analysis demonstrate that the proposed scheme outperforms the existing schemes in terms of average coverage ratio, in-network transmissions and network lifetime.
Keywords:
Compressed sensing
coverage
event detection
in-network transmissions
node scheduling
network lifetime
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K