Multi-step information-directed sensor querying in distributed sensor networks

Sensor tasking is essential to many sensing applications in resource-constrained wireless ad hoc sensor networks. In this paper, we present a multi-step lookahead algorithm for sensor selection and information routing. The algorithm is based on the information-driven sensor querying (IDSQ) that uses mutual information as a utility measure for potential information contribution of individual sensors, and extend it to prediction of information gain over a finite horizon while balancing cost such as the number of communication hops. Simulation results on target tracking problems have shown that the multi-step lookahead algorithm significantly improves the tracking performance compared to the original greedy algorithm, when "sensor holes" are present in a sensor network.

[1]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[2]  Gregory J. Pottie,et al.  Instrumenting the world with wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[3]  Feng Zhao,et al.  Collaborative In-Network Processing for Target Tracking , 2003, EURASIP J. Adv. Signal Process..

[4]  Richard R. Brooks,et al.  Self-Organized Distributed Sensor Network Entity Tracking , 2002, Int. J. High Perform. Comput. Appl..

[5]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..