灾后煤矿物联网网络空洞覆盖重构算法  

Network hole coverage reconstruction algorithm for post-disaster coal mine Internet of things

作　　者：胡青松[1,2,3] 范莘舸 李鹤 HU Qingsong;FAN Xinge;LI He(Engineering Research Center of Intelligent Control for Underground Space,Ministry of Education,China University of Mining and Technology,Xuzhou 221116,China;School of Information and Control Engineering,China University of Mining and Technology,Xuzhou 221116,China;Xuzhou Engineering Research Center of Intelligent Industry Safety and Emergency Collaboration,China University of Mining and Technology,Xuzhou 221116,China;Xuzhou Combustion Control Research Institute Co.,Ltd.,Xuzhou 221000,China)

机构地区：[1]中国矿业大学地下空间智能控制教育部工程研究中心,江苏徐州221116 [2]中国矿业大学信息与控制工程学院,江苏徐州221116 [3]中国矿业大学徐州市智能安全与应急协同工程研究中心,江苏徐州221116 [4]徐州燃烧控制研究院有限公司,江苏徐州221000

出　　处：《工矿自动化》2022年第5期39-45,共7页Journal Of Mine Automation

基　　金：国家自然科学基金资助项目(51874299);山东省重大科技创新工程项目(2019JZZY020505);中国矿业大学“工业物联网与应急协同”创新团队资助计划项目(2020ZY002)。

摘　　要：灾后煤矿物联网因部分节点损毁或障碍物遮挡,会导致网络空洞问题,阻碍网络连通。现有网络空洞覆盖算法未考虑井下灾后地理环境因素,且未对修复后的网络进行优化,无法满足灾后煤矿物联网重构需求。针对该问题,提出了一种煤矿物联网灾后有障碍物情况下的网络空洞覆盖重构算法-NHCRA-O。建立了灾后煤矿物联网模型和节点感知模型,采用Delaunay三角剖分对网络中残存节点及障碍物角点进行区域划分,通过节点感知模型判断区域内是否存在网络空洞;计算Delaunay三角形质心位置,利用质心和Delaunay三角形顶点之间的距离确定虚拟修复节点位置;对虚拟修复节点和移动节点进行可视化判断,并基于距离因子和能量因子计算二者优先级,通过预剪枝操作删除部分计算结果来提高算法收敛速度,根据可视化判断结果和节点优先级进行虚拟修复节点和移动节点双向匹配,从而确定移动节点最终位置,完成网络空洞修复;融合剩余能量因子、节点连通度和方向介数计算节点优先级,根据优先级选举簇头节点,其他成员节点就近入簇,实现网络重构。采用Matlab2016a软件对NHCRA-O的节点匹配效率、网络覆盖效率和网络生存时间进行仿真研究,结果表明:NHCRA-O完成移动节点与虚拟修复节点匹配的次数较Gale-Shapley算法减少31.4%,网络覆盖率较C-V算法和PSO算法高且移动节点平均移动距离短,NHCRA-O重构的网络生存时间明显高于SEP算法和LEACH算法重构的网络。Due to the damage of some nodes or obstacles in the post-disaster coal mine Internet of things,network hole would appear to hinder network connectivity.The existing network hole coverage algorithm does not consider the geographical environment factors after the underground disaster,and does not optimize the repaired network.Therefore,the algorithm cannot meet the reconstruction requirements of the post-disaster coal mine Internet of things.In order to solve this problem,this paper proposes a network hole coverage reconstruction algorithm with obstacles,NHCRA-O,for post-disaster coal mine Internet of things.The post-disaster coal mine Internet of things model and the node perception model are established.Delaunay triangulation is used to divide residual nodes and corner points of obstacles in the network.The node perception model is used to judge whether there is a network hole in the area.The centroid position of the Delaunay triangle is calculated.The distance between the centroid and the vertex of the Delaunay triangle is used to determine the virtual repair node position.The virtual repair node and mobile node are visualized,and the priority of both is calculated based on distance factor and energy factor.The pre-pruning operation is used to delete some calculation results to improve the convergence speed of the algorithm.According to the visual judgment result and node priority,the virtual repair node and the mobile node are matched in both directions.Therefore,the final position of the mobile node is determined and the network hole repair is completed.The node priority is calculated by fusing the residual energy factor,node connectivity and directional betweenness.The cluster head node is elected according to the priority,and other member nodes join the cluster nearby to realize network reconstruction.Matlab2016a software is used to simulate the node matching efficiency,network coverage efficiency and network time-to-live of NHCRA-O.The results show that the number of times that NHCRA-O completes the matchin

关 键 词：煤矿物联网 事故区域物联网 网络空洞覆盖 网络空洞修复 网络重构 节点可视化 节点双向匹配 

分 类 号：TD655[矿业工程—矿山机电]