网络边界勘查算法及其在栅栏覆盖中的应用  

Network Boundary Probing Algorithm and Its Application in Barrier Coverage

作　　者：李克清[1] 梁海华[1] 范家振[1] 

机构地区：[1]常熟理工学院计算机科学与工程学院,江苏常熟215500

出　　处：《常熟理工学院学报》2010年第4期102-105,共4页Journal of Changshu Institute of Technology

摘　　要：栅栏覆盖能有效地监测移动目标沿任意路径穿越热点区域,可应用于监测移动目标穿越边界等问题.从热点区域随机部署的传感器节点中挑选出某个边界节点,然后应用右手法则依次找出网络中的所有边界传感器节点,勘查出传感器网络的边界,同时构造出该热点区域的一个栅栏覆盖.该算法所涉及的传感器节点数少,收敛速度快,而且也便于实施.Barrier coverage, which was applied in moving objects crossing a barrier of sensor networks, was known to be an appropriate model for applications such as moving detection and boundary guard. One boundary node was chosen firstly from the stochastic deployed sensor nodes in the region of interest, and then all other boundary nodes were found in the light of right-hand principle one by one, thus probing the sensor networks boundary and constructing barrier coverage against region of interest. The algorithm mentioned above had the characters of less nodes involved, quick convergence, easy implementation and so on.

关 键 词：无线传感器网络 栅栏覆盖 右手法则 边界勘查 

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