Adaptive scheduling of wireless video sensor nodes for surveillance applications
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Multiple coverage with controlled connectivity in wireless sensor networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Journal of Network and Computer Applications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Energy-efficient optical acquisition schemes in wireless sensor networks
Wireless Networks
Sensor redundancy check without geometric information
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Computers and Electronics in Agriculture
Coverage and activity management of wireless video sensor networks for surveillance applications
International Journal of Sensor Networks
Capillary networks: a novel networking paradigm for urban environments
Proceedings of the first workshop on Urban networking
A Co-optimization Routing Algorithm in Wireless Sensor Network
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors are determined at the beginning of each round. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random timeout and listens to messages sent by other nodes before the timeout expires. Sensor nodes whose sensing area is not fully covered (or fully covered but with a disconnected set of active sensors) when the deadline expires decide to remain active for the considered round, and transmit an activity message announcing it. There are four variants in our approach, depending on whether or not withdrawal and retreat messages are transmitted. Covered nodes decide to sleep, with or without transmitting withdrawal message to inform neighbors about the status. After hearing from more neighbors, active sensors may observe that they became covered, and may decide to alter their original decision and transmit a retreat message. Our simulation shows reduced message overhead while preserving coverage quality compared to existing method based on hello messages followed by retreat ones.