Fast Localized Sensor Self-Deployment for Focused Coverage

Abstract

We consider the focused coverage self-deployment problem in mobile sensor networks, where an area with maximum radius around a Point of Interest (POI) must be covered without sensing holes. Li et al. [9, 10] described several algorithms solving this problem. They showed that their algorithms terminate in finite time. We present a modified version of the Greedy-Rotation-Greedy (GRG) algorithm by Li et al., which drive sensors along the equilateral triangle tessellation (TT) graph to surround a POI. We prove that our modified GRG (mGRG) algorithm is collision free and always ends up in a hole-free network around the POI with maximum radius in $O(D)$ steps, where $D$ is the sum of the initial distances of the sensors from the POI. This significantly improves the previous bound on the coverage time. The theoretical results are also validated by simulations.

Partially supported by the EU EIT project SmartUC and the grant EITKIC-12-1-2012-0001 of the National Development Agency. Performed in cooperation with the EIT ICT Labs Budapest Associate Partner Group. Partially supported by the European Union and the European Social Fund through project FuturICT.hu (grant no.: TAMOP-4.2.2.C-11/1/KONV-2012-0013) organized by VIKING Zrt. Balatonfüred. Partially supported by the Hungarian Government, managed by the National Development Agency, and financed by the Research and Technology Innovation Fund (grant no.: KMR_12-1-2012-0441). This work is connected to the scientific program of the “Development of quality-oriented and cooperative R+D+I strategy and functional model at BUTE" project.