원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.9 No.3
2016.03
pp.273-282
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Coverage is a key and fundamental problem in wireless sensor networks. To provide high quality of service, high coverage ratio of sensor nodes in monitored area should be assured. Coverage holes may lead to routing failure and degrade the quality of service. A novel coverage hole discovery algorithm, VCHDA, is proposed for wireless sensor networks in this paper. The proposed algorithm is based on the well-known Voronoi diagram. It can recognize coverage holes and label the border nodes of coverage holes effectively. Simulations are conducted and the results show that the proposed algorithm is effective and with high accuracy.
목차
Abstract
1. Introduction
2. System Model and Preliminaries
2.1. System Model
2.2. Preliminaries
2.3. Problem and Goal
3. VCHDA: Coverage Hole Discovery Algorithm based on Voronoi Diagram
3.1. Voronoi Diagram
3.2. Coverage Hole Discovery Algorithm
4. Simulations
4.1. Experiment Setting and Metrics
4.2. Results and Analysis
5. Conclusion
Acknowledgements
References
1. Introduction
2. System Model and Preliminaries
2.1. System Model
2.2. Preliminaries
2.3. Problem and Goal
3. VCHDA: Coverage Hole Discovery Algorithm based on Voronoi Diagram
3.1. Voronoi Diagram
3.2. Coverage Hole Discovery Algorithm
4. Simulations
4.1. Experiment Setting and Metrics
4.2. Results and Analysis
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보