Energy Adaptive Sensor Scheduling for Noisy Sensor Measurements
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
On the roles of smoothing in planning of informative paths
ACC'09 Proceedings of the 2009 conference on American Control Conference
Optimal rate allocation for multi-sensor distributed estimation
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
An efficient energy routing algorithm based on dynamic programming in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Nonlinear synchronization for automatic learning of 3D pose variability in human motion sequences
EURASIP Journal on Advances in Signal Processing - Image processing and analysis in biomechanics
Energy aware iterative source localization for wireless sensor networks
IEEE Transactions on Signal Processing
Tracking a moving object via a sensor network with a partial information broadcasting scheme
Information Sciences: an International Journal
A dynamic programming approach: Improving the performance of wireless networks
Journal of Parallel and Distributed Computing
Optimizing network lifetime for distributed tracking with wireless sensor networks
Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
PCRLB-based sensor selection for maneuvering target tracking in range-based sensor networks
Future Generation Computer Systems
Scheduling sensors for monitoring sentient spaces using an approximate POMDP policy
Pervasive and Mobile Computing
| Hi-index | 35.69 |
Resource management in distributed sensor networks is a challenging problem. This can be attributed to the fundamental tradeoff between the value of information contained in a distributed set of measurements versus the energy costs of acquiring measurements, fusing them into the conditional probability density function (pdf) and transmitting the updated conditional pdf. Communications is commonly the highest contributor among these costs, typically by orders of magnitude. Failure to consider this tradeoff can significantly reduce the operational lifetime of a sensor network. While a variety of methods have been proposed that treat a subset of these issues, the approaches are indirect and usually consider at most a single time step. In the context of object tracking with a distributed sensor network, we propose an approximate dynamic programming approach that integrates the value of information and the cost of transmitting data over a rolling time horizon. We formulate this tradeoff as a dynamic program and use an approximation based on a linearization of the sensor model about a nominal trajectory to simultaneously find a tractable solution to the leader node selection problem and the sensor subset selection problem. Simulation results demonstrate that the resulting algorithm can provide similar estimation performance to that of the common most informative sensor selection method for a fraction of the communication cost.