Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Abstract

We are interested in wireless sensor networks which are used to detect intrusion objects such as enemy tanks, cars, submarines, etc. Since sensor nodes have a limited energy supply, sensor networks are configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. Ignored by many studies, an intrusion object's size and shape are important factors that greatly affect the performance of sensor networks. For example, an extremely large object in a small sensor field can easily be detected by even one sensor node, no matter where the sensor node is deployed. The larger an intrusion object is, the fewer sensor nodes that are required for detection. Furthermore, using fewer sensor nodes can save resources and reduce the waste of dead sensor nodes in the environment. Therefore, studying coverage based on intrusion object's size is important. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity. In particular, we study cases where intrusion objects occupy areas in a two-dimensional plane and where intrusion objects occupy areas in a three-dimensional space, respectively. We also study the deployment of sensor nodes when intrusion objects are of different sizes and shapes. First, sensor nodes are deployed in a two-dimensional plane and a three-dimensional space with uniform distributions. Then, they are deployed in a two-dimensional plane and a three-dimensional space in two-dimensional and three-dimensional Gaussian distributions, respectively. Therefore, our study not only demonstrates the impact of the size and shape of intrusion objects on the performance of sensor networks, but also provides a guideline on how to configure sensor networks to meet a certain detecting capability in more realistic situations.