Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Entropy-based sensor selection heuristic for target localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
The sensor selection problem for bounded uncertainty sensing models
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
Sensor selection heuristic in sensor networks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Hi-index | 0.00 |
We consider estimating the location of a target moving in a 2D plane by combining distance measurements from multiple sensors. Given that available energy in sensors is at a premium, it must be conserved by selecting fewer number of sensors to measure distance and communicate to a central tracker. While elsewhere we have presented various heuristics which together can form the basis for selection of a minimum of three sensors, in this paper we provide a theoretical basis for the heuristic that suggests that the three sensors must not be colinear.