Ad Hoc网络区域最小覆盖方法研究  

Algorithms of Coverage Control for Ad Hoc net

作　　者：赵建军[1] 丛海鹏[2] 刘培培[2] 雷久德[2] 

机构地区：[1]海军航空工程学院201教研室,264001 [2]海军航空工程学院研究生二队,264001

出　　处：《微计算机信息》2007年第27期173-174,167,共3页Control & Automation

基　　金：海军重大科研项目(编号不公开)

摘　　要：覆盖控制作为无线传感器网络中的一个基本问题,反映了网络所能提供的"感知"服务质量,可以使无线传感器网络的空间资源得到优化分配,进而更好地完成环境感知、信息获取和有效传输的任务.如何计算同时满足"覆盖要求"(工作节点必须能够完全覆盖目标区域)和"连通性要求"(工作节点组成的通信网络必须是连通的)的最小节点集合,是一个NP难问题.本文设计了一种基于目标区域Voronoi划分的改进集中式近似算法,用于计算完全覆盖目标区域所需要的近似最小节点集.One of the most fundamental problems in wireless sensor networks is the coverage control problem, which reflects how well a region is apperceived. The coverage control theories and algorithms can result in not only network resources’optimial allocation but also efficient sensing and collecting of the environmental information, and communicating with neighboring nodes by wireless sensor networks. The problem of computing such minimal active sensor set is NP-hard. In this paper, a centralized Voronoi tessellation （CVT） based approximate algorithm is proposed to construct a near optimal cover set of active sensors required to cover the target region completely.

关 键 词：AD HOC网络 最小连通覆盖集 Voronoi算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]