Intrusion objects with shapes under randomized scheduling algorithm in sensor networks
- Yang Xiaoc(Author),
- Hui Chena(Author),
- ,
- Xiaojiang Dud(Author),
- Bo Sune(Author),
- Kui Wub(Author)
- aVirginia State University,
- bUniversity of Victoria,
- cDepartment of Computer Science,
- dNorth Dakota State University,
- eLamar University Department of Computer Science
Research Output: Chapter in Book/Report/Conference proceeding Conference contribution
Abstract
Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc. Since sensor nodes have limited energy supply, sensor networks may be configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity when an intrusion object occupies an area. We study the impact of the size of intrusion object on the sensor network's configuration.