Energy‐Efficient Adaptive Dynamic Sensor Scheduling for Target Monitoring in Wireless Sensor Networks

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy‐efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless s...

Full description

Saved in:
Bibliographic Details
Published inETRI journal Vol. 33; no. 6; pp. 857 - 863
Main Authors Zhang, Jian, Wu, Cheng‐dong, Zhang, Yun‐zhou, Ji, Peng
Format Journal Article
LanguageEnglish
Published 한국전자통신연구원 01.12.2011
Subjects
Online AccessGet full text
ISSN1225-6463
2233-7326
DOI10.4218/etrij.11.0111.0027

Cover

Loading…
More Information
Summary:Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy‐efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.
Bibliography:G704-001110.2011.33.6.008
ISSN:1225-6463
2233-7326
DOI:10.4218/etrij.11.0111.0027