Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Proceedings of the 7th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient mechanism for processing similarity search queries in sensor networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
We propose and evaluate an energy-efficient scheduling algorithm for detection of mobile targets in wireless sensor networks. We consider a setting where the sensors are deployed for both road surveillance and mobile target tracking. A typical example would be where some sensors are deployed along the entrance roads of a city to detect the vehicles entering the city and other sensors can wake up and track the vehicles after detection. We show an important relationship between the overall energy consumed by the sensors and the average detection time of a target, both of which are very critical aspects in our problem. To this end, we define the quality of surveillance (QoSv)as the reciprocal value of the average detection time for vehicles. We propose an optimal scheduling algorithm that guarantees the detection of every target with specified QoSv and at the same time minimizes the overall energy consumed by the sensor nodes. By minimizing the energy consumed, we maximize the lifetime of the sensor network. Also, along with the quality of surveillance guarantee, we ensure that no target goes undetected. We theoretically derive the upper bound on the lifetime of the sensor network for a given QoSv guarantee and prove that our method can always achieve this upper bound. Our simulation results validate the claims made on the algorithm optimality and QoSv guarantee.