Dynamic Event Coverage in Hybrid Wireless Sensor Networks

For cost effective deployment and implementation, mobility is introduced in sensor networks to provide dynamic event coverage. A hybrid network of static and mobile nodes, can yield the same desired accuracy and robustness of a static k-coverage detection model with fewer nodes. Since node movement is a costly operation and the movement strategy has to be decided instantly after event occurrence, it is desirable to have a lightweight distributed node selection and movement scheme. In this work, we propose a game theoretic model to provide dynamic event coverage that achieves the desired detection accuracy with significantly fewer number of nodes while balancing the energy consumption due to mobility and keeping the travelling distance minimum. We address and exploit the spatial clustering nature of events to maximize the overall detection performance over the network lifetime.