检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵凌[1] ZHAO Ling(Rail Transit Security Department,Railway Police College,Zhengzhou 450053,China)
机构地区:[1]铁道警察学院轨道交通安全保卫系
出 处:《重庆理工大学学报(自然科学)》2019年第7期124-131,共8页Journal of Chongqing University of Technology:Natural Science
基 金:公安部技术研究计划项目“高速铁路线路重要部位物联网安防系统技术研究”(2016JSYJC61);河南省重点研发与推广专项(科技攻关)项目“爆炸物/毒品室外日盲紫外拉曼光谱检测关键技术研究”(192102310515)
摘 要:为及时感知、预警入侵高铁线路低矮路基、低矮桥墩等危及行车安全的行为和对在建高铁线路建材的偷盗行为,设计了基于遗传算法的节点覆盖集算法。首先,利用二元感知模型对目标监测区域进行建模,在充分考虑无线传感器网络节点通信的前提下,将节点交叉覆盖率和节点数量同时满足最小化的目标描述为一个最优化问题;然后,基于遗传算法运算流程对优化节点覆盖集进行了详细设计,并给出了局部搜索优化策略。仿真结果表明:所提算法具有良好的收敛性,当节点数目为54、感知半径为10m时节点覆盖率最大,解决了随机部署节点引发的网络冗余问题。In order to ensure timely detection and early warning of the intrusion behavior to Low Subgrade and pier of high-speed railway line which could bring potential safety hazards to the high-speed railway operation and the behavior theft to building materials of high-speed railway line under construction,wireless sensor networks provides a feasible scheme.Therefore,a node coverage set algorithm based on genetic algorithm is designed.Firstly,the binary perception model is used to model the target monitoring area.On the premise of fully considering the nodes’ communication of wireless sensor networks,the goal of minimizing the number of nodes and the cross coverage of nodes is described as an optimization problem.And secondly,based on the operation flow of genetic algorithm,the optimal node coverage set is designed in detail and the local search optimization strategy was given as well.The simulation results show that the proposed algorithm has good convergence.When the number of nodes is 54 and the perception radius is 10m,the coverage of the network is the largest,which solves the network redundancy problem caused by random deployment of nodes.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117