一种概率栅栏覆盖模型及其构建算法

发布时间：2018-04-16 05:29

本文选题：无线传感器网络 + 概率感知模型　；参考：《计算机研究与发展》2017年05期

【摘要】：K-栅栏覆盖是有向传感器网络的研究热点之一.概率感知模型要比0-1模型更贴近实际.而基于概率感知模型的栅栏覆盖还鲜有研究.根据感知概率阈值和感知距离要求,确定节点的虚拟半径.提出一种二元概率栅栏覆盖模型.在这个模型中,相邻2个节点的虚拟感知圆两两相切.在此基础上提出了最少节点的概率栅栏构建算法(construction of probabilistic barrier of minimum node,CPBMN).首先根据二元概率栅栏模型确定节点的目标位置,再通过匈牙利算法选用移动距离之和最少的移动节点移动到目标位置形成栅栏覆盖,缺少移动节点的子区域,选择附近区域的剩余移动节点修补形成1-栅栏覆盖.水平相邻的2个子区域之间构建竖直栅栏,这些子区域的概率1-栅栏合起来构成整个区域的概率K-栅栏覆盖.仿真结果证明:该方法能够有效形成概率栅栏,最多比其他栅栏构建算法节省70%能耗.
[Abstract]:K-fence coverage is one of the research hotspots in directed sensor networks.The probabilistic perception model is more realistic than the 0-1 model.However, palisade coverage based on probabilistic perception model is rarely studied.The virtual radius of nodes is determined according to the threshold of perceived probability and the requirement of perceptual distance.A binary probabilistic palisade coverage model is proposed.In this model, the virtual perceptual circles of two adjacent nodes are tangent.On this basis, the construction of probabilistic barrier of minimum node is proposed.Firstly, according to the binary probabilistic fence model, the target position of the node is determined, and then the moving node with the least sum of the moving distance is selected to move to the target position to form a fence covering by the Hungarian algorithm, which lacks the sub-region of the moving node.Select the remaining mobile nodes in the nearby area to repair to form a 1-fence overlay.A vertical fence is constructed between the two sub-regions which are adjacent to each other horizontally. The probabilistic 1-fence of these sub-regions forms the probabilistic K-fence covering the whole area.The simulation results show that the proposed method can effectively form probabilistic fences and save 70% energy consumption compared with other algorithms.
【作者单位】：浙江工业大学计算机科学与技术学院;
【基金】：国家自然科学基金项目(40241461,11405145)~~
【分类号】：TP212.9;TN929.5

【相似文献】