By Topic

Sample Assignment for Ensuring Sensing Quality and Balancing Energy in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chu, E.T. ; Dept. of Electron. & Comput. Sci. Inf. Eng., Nat. Yunlin Univ. of Sci. & Technol., Yunlin, Taiwan ; Hsin-Ju Lee ; Tai-Yi Huang ; Chung-Ta King

The quality of an environmental monitoring application can often be measured by the number of samples collected per unit time. This is to guarantee the reconstruction of the monitored signal. For applications that use wireless sensors for untethered monitoring at rural areas, the challenge is to satisfy the sensing quality while maintaining a long-running operation. Due to the spatial locality of the monitored signal and the oftentimes dense deployment of sensors, the samples taken by a set of nearby sensors can be regarded as equivalent. The problem is how to assign the sampling workload to this set of sensors and maintain a long-running operation. This requires taking account of the energy required to sample as well as to transmit and relay the data to the sink. Previous works on energy-aware routing are not applicable due to the added complexity of sampling assignment. In this paper, we formulate this problem as an optimization problem and present the optimal solution. We compare our algorithm with two commonly used sampling workload assignment algorithms for balancing energy consumption through PowerTOSSIM. The results show that our algorithm can achieve as much as a 25 percent improvement in the residual energy of the critical node, which is the node with the lowest residual energy among all nodes.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:22 ,  Issue: 9 )