电信科学 ›› 2017, Vol. 33 ›› Issue (12): 91-98.doi: 10.11959/j.issn.1000-0801.2017287

• 研究与开发 • 上一篇    下一篇

无线传感器网络中基于“k-覆盖问题”的多项式时间算法

王骐,肖正安,王怀兴   

  1. 湖北第二师范学院物理与机电工程学院,湖北 武汉 430205
  • 修回日期:2017-09-30 出版日期:2017-12-01 发布日期:2018-01-12
  • 作者简介:王骐(1970-),男,博士,湖北第二师范学院物理与机电工程学院副教授,主要研究方向为无线传感器网络安全、嵌入式系统应用。|肖正安(1974-),男,湖北第二师范学院物理与机电工程学院讲师,主要研究方向为图像数字信号处理。|王怀兴(1977-),男,湖北第二师范学院物理与机电工程学院副教授,主要研究方向为嵌入系统应用。
  • 基金资助:
    湖北省高等学校优秀中青年科技创新团队计划项目(T201417)

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)

摘要:

针对无线传感器网络的最差覆盖和最佳覆盖,探寻如何解决二维目标区域内的“k-覆盖问题”,提出了一种解决此问题的多项式时间算法。该算法基于扩展圆盘的几何图形提出了一系列的定义和定理,将“k-覆盖问题”转化成了寻找相邻分界线的问题。仿真结果表明,算法可在多项式时间内计算出最优k-违反路径和最优k-支持路径,从而合理规避或选取网络覆盖点。

关键词: 无线传感器网络, k?覆盖问题, 扩展圆盘, 相邻分界线, 多项式时间算法

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

中图分类号: 

No Suggested Reading articles found!