earticle

논문검색

A Novel Coverage Holes Discovery Algorithm Based on Voronoi Diagram in Wireless Sensor Networks

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.