Download now Free registration required
Coverage problem is a fundamental issue in wireless sensor networks. In this paper, the authors consider two sub-problems: k-coverage rate evaluation and k-coverage rate deployment. The former aims to evaluate the ratio of k-covered area relative to the monitored area, while the latter aims to determine the minimum number of sensors required and their locations to guarantee that k-coverage rate of the monitored area meets application requirements. For k-coverage rate evaluation problem, a non-uniform-grid-based approach for random deployments is proposed. For k-coverage rate deployment problem, a greedy-based approach is suggested to meet the requirement of k-coverage rate. Simulation results show that both their schemes are more time efficient than previous work.
- Format: PDF
- Size: 1669.12 KB