有向传感网络中移动目标栅栏覆盖算法  

Barrier Coverage Algorithm for Moving Target in Directional Sensor Networks

作　　者：陶丹[1,2] 毛续飞[3] 吴昊[2] 

机构地区：[1]北京交通大学电子信息工程学院,北京100044 [2]北京交通大学轨道交通控制与安全国家重点实验室,北京100044 [3]清华大学软件学院,北京100084

出　　处：《北京邮电大学学报》2013年第5期6-9,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61271305;61272426);国家自然科学基金青年科学基金项目(61202431);国家自然科学基金博士后面上项目(2012M510029);高等学校博士学科点专项科研基金项目(20110009110001);中央高校基本科研业务费专项资金项目(2013JBM008);轨道交通控制与安全国家重点实验室(北京交通大学)开放课题基金项目(RCS2012K008);教育部留学回国人员科研启动基金项目

摘　　要：通过调整有向传感节点的传感方向,实现网络强栅栏路径的构建.定义交点集和关联节点集以刻画区域边界以及相邻节点间位置关系,将问题从二维连续空间映射到二维离散空间;其次,构建全局覆盖图对问题进行建模,采用图论方法快速判定已知网络布局能否构成强栅栏覆盖.若存在,则选取满足最少节点数目的栅栏路径.仿真结果对算法的性能进行了有效验证.Strong barrier path construction for directional sensor networks was focused on by optimizing the sensing orientations of directional sensors. The intersection point set and associated intersection point set were defined to describe the relationships between directional sensors and region boundaries. The so- lution space from continuous domain was reduced. Graph theory was utilized to construct a global barrier graph to model the pending problem, whether the directional sensors＇ sensing orientations are existed that can form strong barrier. A low-cost solution with the minimal number of directional sensors was designed as well. Simulation testifies the effectiveness of the proposed algorithm.

关 键 词：有向传感网络 栅栏覆盖 关联交点 全局覆盖图 

分 类 号：TN915.03[电子电信—通信与信息系统]