DocumentCode :
1537227
Title :
Dynamic Bit Allocation for Object Tracking in Wireless Sensor Networks
Author :
Masazade, Engin ; Niu, Ruixin ; Varshney, Pramod K.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY, USA
Volume :
60
Issue :
10
fYear :
2012
Firstpage :
5048
Lastpage :
5063
Abstract :
In this paper, we study the target tracking problem in wireless sensor networks (WSNs) using quantized sensor measurements where the total number of bits that can be transmitted from sensors to the fusion center is limited. At each time step of tracking, a total of R available bits need to be distributed among the N sensors in the WSN for the next time step. The optimal solution for the bit allocation problem can be obtained by using a combinatorial search which may become computationally prohibitive for large N and R. Therefore, we develop two new suboptimal bit allocation algorithms which are based on convex optimization and approximate dynamic programming (A-DP). We compare the mean squared error (MSE) and computational complexity performances of convex optimization and A-DP with other existing suboptimal bit allocation schemes based on generalized Breiman, Friedman, Olshen, and Stone (GBFOS) algorithm and greedy search. Simulation results show that, A-DP, convex optimization and GBFOS yield similar MSE performance, which is very close to that based on the optimal exhaustive search approach and they outperform greedy search and nearest neighbor based bit allocation approaches significantly. Computationally, A-DP is more efficient than the bit allocation schemes based on convex optimization and GBFOS, especially for a large sensor network.
Keywords :
approximation theory; convex programming; mean square error methods; object tracking; search problems; wireless sensor networks; A-DP; GBFOS algorithm; MSE performances; WSN; approximate dynamic programming; combinatorial search; computational complexity performances; convex optimization; dynamic bit allocation; greedy search approach; mean squared error performances; object tracking; optimal exhaustive search approach; optimal solution; quantized sensor measurements; suboptimal bit allocation algorithms; suboptimal bit allocation schemes; wireless sensor networks; Bit rate; Convex functions; Dynamic scheduling; Heuristic algorithms; Mutual information; Target tracking; Wireless sensor networks; Convex optimization; dynamic bit allocation; dynamic programming; posterior Cramér–Rao lower bound; target tracking; wireless sensor networks;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2012.2204257
Filename :
6215065
Link To Document :
بازگشت