基于移动无线传感器节点的栅栏覆盖研究  

ON BARRIER COVERAGE BASED ON MOBILE WIRELESS SENSOR NODES

作　　者：宋志强[1,2] 周献中[1] 李华雄[1] 

机构地区：[1]南京大学工程管理学院控制与系统工程系,江苏南京210093 [2]苏州经贸职业技术学院信息系,江苏苏州215009

出　　处：《计算机应用与软件》2014年第9期122-124,共3页Computer Applications and Software

基　　金：江苏省自然科学基金项目(BK2011564);江苏省高校科研成果产业化推进项目(JHZD2012-51);苏州市科技支撑项目(SG201256)

摘　　要：栅栏覆盖可用于入侵检测。研究具有有限移动能力的无线传感器节点在狭长区域中的栅栏覆盖问题。首先将狭长区域划分成网格,然后将移动节点和基准栅栏上的网格中心点构成二部图。基于二部图理论对1-栅栏覆盖问题进行数学描述,提出基于拍卖算法的1-栅栏覆盖算法(A1-BCA),并与基于匈牙利算法的栅栏覆盖算法进行性能比较。仿真结果表明A1-BCA算法在传感器节点较多时,优化性能好于匈牙利算法。Barrier coverage can be used in intrusion detection.In this paper we study the barrier coverage issue of wireless sensor nodeswith limited locomotive ability in long and narrow area.First,the long and narrow area is divided into grids,then the mobile nodes and thecentral points of grids on reference barrier are formed to a bipartite graph.Secondly,the 1-barrier coverage issue is mathematically depictedbased on bipartite graph theory,and the auction algorithm-based 1-barrier coverage construction algorithm （A1-BCA）is proposed.Finally,the performance comparison is made between the A1-BCA and the 1-barrier coverage algorithm based on Hungarian algorithm.Simulationresults show that the A1-BCA algorithm outperforms the latter in performance when there are more numbers of sensor nodes.

关 键 词：栅栏覆盖 移动无线传感器网络 二部图 重新部署 拍卖算法 

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