A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
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.
- 2.Cerpa, A., Elson, J., Hamilton, M., Zhao, J., Estrin, D., Girod, L.: Habitat monitoring: Application driver for wireless communications technology. In: Proc. of ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean, pp. 3–5. ACM Press, Costa Rica (2001)Google Scholar
- 10.Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: 13th International Conference on Computer Communications and Networks (ICCCN 2004), pp. 373–378. IEEE Press, Chicago (2004)Google Scholar
- 11.Wu, J., Dai, F.: On constructing k-connected k-dominating set in wireless networks. In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), pp. 81a–81a. IEEE Press, Denver (2005)Google Scholar
- 13.Hefeeda, M., Ahmadi, H.: Network connectivity under probabilistic communication models in wireless sensor networks. In: 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2007), pp. 1–9. IEEE Press, Pisa (2007)Google Scholar
- 15.Ganeriwal, S., Kumar, R., Srivastava, M.B.: Network-Wide Time Synchronization in Sensor Networks. NESL Technical Report (2003)Google Scholar
- 19.Simulator can be downloaded from, http://www.isis.vanderbilt.edu/Projects/nest/prowler/