Voronoi based Area Coverage Optimization for Directional Sensor Networks
Sensing coverage is a fundamental problem in sensors networks. Different from traditional isotropic sensors with sensing disk, directional sensors may have a limited angle of sensing range due to special applications. In this paper, we study the area coverage problem in directional sensor networks with the rotatable orientation for each sensor. We propose the optimal coverage in directional sensor networks (OCDSN) problem to cover maximal area while activating as few sensors as possible. Then we prove the OCDSN to be NP-complete and propose the greedy approximation algorithm of the solution to the OCDSN problem, based on the boundary Voronoi diagram. Finally, extensive simulation is executed to demonstrate the performance of the proposed algorithm.
Directional sensor networks Area coverage Voronoi diagram
Jing Li Ru-chuan Wang Hai-ping Huang Li-juan Sun
College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China Insti College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China Insti
国际会议
Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)
南昌
英文
488-493
2009-05-22（万方平台首次上网日期，不代表论文的发表时间）