A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Lightweight deployment-aware scheduling for wireless sensor networks
Mobile Networks and Applications
Intrusion Objects with Shapes under Randomized Scheduling Algorithm in Sensor Networks
ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
| Hi-index | 0.00 |
Wireless sensor networks have been widely used in environment and habitat monitoring, as well as in military applications such as battlefield surveillance. In this paper, we focus on detecting intruders in such surveillance systems. Our goal is to optimize the network coverage when the network is deployed to detect an intrusion object with the shape of a disc or a rectangle. We study how the size and shape of the intrusion object influence the configuration of the sensor network. We prove many mathematical results related to detection probability and intrusion coverage intensity and study the asymptotic properties of these detection metrics. We also study the problem of maximizing network lifetime under some QoS constraints. We prove the existence of the solution and derive the explicit form of the solution under certain conditions.