Elements of information theory
Elements of information theory
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Approximate distributed Kalman filtering in sensor networks with quantifiable performance
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Collaborative in-network processing for target tracking
EURASIP Journal on Applied Signal Processing
Maximum mutual information principle for dynamic sensor query problems
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Hi-index | 0.00 |
In this paper, an information-driven sensor selection algorithm is proposed to select sensors to participate in Kalman filtering for target state estimation in sensor networks. The mutual information between the measurements of sensors and the estimated distribution of the target state is considered as the information utility function to evaluate the information contribution of sensors. And only those sensors with larger mutual information are selected to participate in the Kalman filtering iterations. Then the geographic routing mechanism is utilized to visit these selected sensors sequentially and set up a path to transport the state estimation information to the sink node. Simulation results show that compared with the shortest path tree algorithm, the information-driven sensor selection algorithm involves smaller participated sensors, and shorter total communication distance, while the estimation performance approaches the same bound.