检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈磊[1,2] 解志斌 杨紫薇[1,2] 袁伟康 CHEN Lei;XIE Zhi-bin;YANG Zi-wei;YUAN Wei-kang(School of Oceanography,Jiangsu University of Science and Technology,Zhenjiang 212003,China;Intelligent Marine Information Sensing and Transmission Laboratory,Zhenjiang 212100,China)
机构地区:[1]江苏科技大学海洋学院,江苏镇江212003 [2]镇江市智慧海洋信息感知与传输实验室,江苏镇江212100
出 处:《舰船科学技术》2023年第17期149-153,共5页Ship Science and Technology
基 金:江苏省未来网络科研基金项目(FNSRFP-2021-YB-51);国家自然科学基金资助项目(61871203)。
摘 要:本文针对舰船无线传感器网络运行过程中因节点失效而产生多个覆盖空洞以及节点发生故障前所收集到的舰船航行数据丢失问题,提出一种基于时效性覆盖空洞修复(Timeliness Coverage Hole Repair,TCHR)算法。首先,基于备选移动节点的可持续最大移动时间,得到可选移动节点ID序列。然后,以可选移动节点总修复时间最小化为准则构造出目标函数。最后,构建时间代价矩阵,并基于匈牙利算法求得最优分配方案。所提算法能避免舰船航行数据丢失并选派合适的移动节点至相应的覆盖空洞处,从而完成舰船网络中多覆盖空洞及时修复的任务。仿真结果表明了所提算法的可行性与有效性。Aiming at the problems of multiple coverage holes caused by node failure and the loss of ship navigation data collected before node failure in the operation of ship wireless sensor networks,a Timeliness Coverage Hole Repair(TCHR)algorithm was proposed.Firstly,an optional mobile node ID sequence is obtained based on the sustainable maximum moving time of the candidate mobile nodes.Then,the objective function is constructed according to the minimization of the total repair time of the optional mobile nodes.Finally,the time cost matrix is constructed,and the optimal allocation scheme is solved and got based on the Hungarian algorithm.The proposed algorithm can avoid the loss of ship navigation data and select appropriate mobile nodes to the corresponding coverage holes,so as to complete the task of timely repairing multiple coverage holes.The simulation results show the feasibility and effectiveness of the proposed algorithm.
关 键 词:无线传感器网络 覆盖空洞修复 舰船航行数据 匈牙利算法 时效性
分 类 号:U675.7[交通运输工程—船舶及航道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.128.173.223