A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
- Cite this paper as:
- Wu Y., Li M., Cai Z., Zhu E. (2008) A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks. In: Preparata F.P., Wu X., Yin J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg
The fundamental issue in sensor networks is providing a certain degree of coverage and maintaining connectivity under the energy constraint. In this paper, the connected k-coverage problem is investigated under the probabilistic sensing and communication models, which are more realistic than deterministic models. Furthermore, different weights for nodes are added in order to estimate the real power consumption. Because the problem is NP-hard, a distributedprobabilisticcoverageandconnectivitymaintenancealgorithm (DPCCM) for dense sensor networks is proposed. DPCCM converts task requirement into two parameters by using the consequence of Chebyshev’s inequality, then activate sensors based on the properties of weighted ε-net. It is proved that the sensors chosen by DPCCM have (θ,k)-coverage and α-connectivity. And the time and communication complexities are theoretically analyzed. Simulation results show that compared with the distributed randomized k-coverage algorithm, DPCCM significantly maintain coverage in probabilistic model and prolong the network lifetime in some sense.
Keywordsprobabilistic model (θandk)-coverage α-connectivity dense sensor networks
Unable to display preview. Download preview PDF.