2-hop neighborhood information for cover set selection in mission-critical surveillance with Wireless Image Sensor Networks
Mamour Diop, Congduc Pham, Ousmane Thiaré · 2013
Mission-critical surveillance applications such as intrusion detection or disaster response have vital requirement in QoS. We consider a Wireless Image Sensor Network (WISN) with a scheduling of image sensor node's activity based on the application criticality level. Sentry nodes capable of detecting intrusions with a higher probability than others will alert neighbor nodes as well as activating cover sets member for image disambiguation or situation-awareness purposes. In order to optimize the performance of image transfer from multiple sensor nodes to the Sink we propose a 2-hop neighborhood information- based cover set selection to determine the most relevant cover sets. Then, in order to be consistent with our proposed approach, a multi-path extension of Greedy Perimeter Stateless Routing (called T-GPSR) wherein routing decisions are also based on 2-hop neighborhood information is proposed. Simulation results show that our proposal reduces packet losses, enabling fast packet delivery and higher visual quality of received images at the Sink.