Loading…
Dynamic Cluster Members Scheduling for Target Tracking in Sensor Networks
The sensor scheduling for energy-efficient target tracking with high performance in wireless sensor networks (WSNs) is a dilemma problem. By analyzing the intrinsic relationship between tracking performance and energy consumption, we cast the scheduling problem of WSN as the optimal policy problem o...
Saved in:
Published in: | IEEE sensors journal 2016-10, Vol.16 (19), p.7242-7249 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The sensor scheduling for energy-efficient target tracking with high performance in wireless sensor networks (WSNs) is a dilemma problem. By analyzing the intrinsic relationship between tracking performance and energy consumption, we cast the scheduling problem of WSN as the optimal policy problem of partially observable Markov decision process (POMDP), and propose a dynamic cluster members scheduling (DCMS) algorithm to solve the tradeoff between tracking performance and energy consumption. First, we exploit an election method, based on the optimal mixed weights of the signal strength and the residual energy of node, to choose the cluster head node. Then, we seem each cluster members an agent, and model the scheduling problem of cluster members by POMDP. At last, a point-based online value iteration algorithm is presented to solve the DCMS to generate the collaboration strategy of sensor cluster members dynamically. The simulation results show that the proposed approach can improve the accuracy of target tracking, decrease the energy consumption of sensor nodes, and prolong the lifetime of sensor networks. |
---|---|
ISSN: | 1530-437X 1558-1748 |
DOI: | 10.1109/JSEN.2016.2597544 |