Telecommunications Science ›› 2017, Vol. 33 ›› Issue (12): 91-98.doi: 10.11959/j.issn.1000-0801.2017287

• research and development • Previous Articles     Next Articles

Polynomial time algorithm for solving k-coverage problem in wireless sensor networks

Qi WANG,Zheng’an XIAO,Huaixing WANG   

  1. School of Physics and Electromechanical Engineering,Hubei University of Education,Wuhan 430205,China
  • Revised:2017-09-30 Online:2017-12-01 Published:2018-01-12
  • Supported by:
    Hubei Provincial Department of Education Research Program(T201417)

Abstract:

How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,a series of definitions and theorems were proposed based on the geometric graph of growing disks,and the k-coverage problem was transformed into one of finding a series of adjacent borders.The simulation results show that the algorithm could compute the optimal k-breach path and k-support path in polynomial time,so as to avoid or select the network coverage reasonably.

Key words: wireless sensor network, k-coverage problem, growing disk, adjacent border, polynomial time algo-rithm

CLC Number: 

No Suggested Reading articles found!