Earticle

초록

영어

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

키워드

저자

• Guoyong Dai [ College of Information Science and Technology, Zhejiang Shuren University, 310014, Hangzhou, P.R. China, College of Computer Science and Technology, Zhejiang University of Technology, 310023, Hangzhou, P.R. China ]
• Hexin Lv [ College of Information Science and Technology, Zhejiang Shuren University, 310014, Hangzhou, P.R. China ]
• Luyi Chen [ College of Information Science and Technology, Zhejiang Shuren University, 310014, Hangzhou, P.R. China ]
• Binbin Zhou [ College of Information Science and Technology, Zhejiang Shuren University, 310014, Hangzhou, P.R. China ]
• Ping Xu [ College of Information Science and Technology, Zhejiang Shuren University, 310014, Hangzhou, P.R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605