检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:纪妙 宋煜[1] 曾强 张思明[1] JI Miao;SONG Yu;ZENG Qiang;ZHANG Siming(Wuhan Cigarette Factory,China Tobacco Hubei Industrial Co.,Ltd.,Wuhan 430048,China)
机构地区:[1]湖北中烟工业有限责任公司武汉卷烟厂,湖北武汉430048
出 处:《电子设计工程》2024年第9期156-160,共5页Electronic Design Engineering
摘 要:工业无线通信网络节点覆盖冗余度过高,使得节点调度难度上升,针对该问题提出了工业无线通信网络多重覆盖节点调度数学建模方法。构建工业无线通信网络的三维网格覆盖结构,计算任意一个覆盖节点与网格节点之间的距离,结合差分算法和混合二进制编码确定多重覆盖节点状态。采用退避机制确定容忍覆盖区域,判别节点覆盖冗余度。结合覆盖冗余度分析结果,采用蚁群算法更新蚂蚁信息素浓度,构建多重复覆盖节点调度模型,得到最优调度路径。由实验结果可知,在初始重复覆盖率分别为100%、95%、90%、85%情况下,使用该方法在通信时间分别为800、600、500、300 s时的网络重复覆盖率均为0,说明该方法的节点调度效果较好。Due to the high redundancy of node coverage in industrial wireless communication network,the difficulty of node scheduling is increased.Aiming at this problem,a mathematical modeling method for multiple coverage node scheduling in industrial wireless communication network is proposed.The three-dimensional grid coverage structure of industrial wireless communication network is constructed,the distance between any coverage node and grid node is calculated,and the state of multiple coverage nodes is determined by combining the difference algorithm and mixed binary coding.The backoff mechanism is used to determine the tolerance coverage area and determine the node coverage redundancy.Combined with the results of coverage redundancy analysis,the ant colony algorithm is used to update the pheromone concentration of ants,build a scheduling model of multiple coverage nodes,and obtain the optimal scheduling path.According to the experimental results,when the initial repeat coverage is 100%,95%,90%and 85%,the network repeat coverage using this method is 0 when the communication time is 800,600,500 and 300 s,indicating that the node scheduling effect of this method is good.
关 键 词:工业无线通信 多重覆盖节点 调度数学建模 覆盖冗余度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229