检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马千里[1] 袁易 申朝晖 MA Qianli;YUAN Yi;SHEN Zhaohui(School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China;Taiyuan Ouryear Science and Technology Development Co.,Ltd.,Taiyuan 030006,China)
机构地区:[1]山西大学计算机与信息技术学院,太原030006 [2]太原欧亚科技发展有限公司,太原030006
出 处:《计算机工程》2020年第12期171-178,共8页Computer Engineering
基 金:山西省自然科学基金(201701D121054)。
摘 要:针对无线传感器网络因节点多且密集造成的网络拥塞问题,提出一种基于节点权重及边长的中继节点部署算法,以减少网络节点部署数量。改进异构环境下中继节点部署方式,利用两节点之间距离及节点性质计算边的权重,按权重和边长对边进行排序,采用最小生成树算法结合图增量理论改变中继节点加入条件,并使用迭代方式依次加入中继节点,从而减少相同环境下部署中继节点的数量。不同规模的仿真实验结果表明,与GA-RD、IWGA-RD算法相比,该算法所得网络中继节点部署数量更少且网络性能更好,在大样本情况下其能显著降低网络负载和部署成本。To relieve the network congestion caused by the large number of nodes deployed in Wireless Sensor Networks(WSNs),this paper proposes a relay node deployment algorithm based on node weight and edge length to reduce the number of network nodes.The deployment mode of relay nodes is improved in heterogeneous environment.The edges are weighted based on the distance between two nodes and the properties of the nodes,and then are sorted according to their weight and side length.By using the Minimum Spanning Tree(MST)algorithm and the graph increment theory,the joining conditions of relay nodes are changed,and the relay nodes are added in an iterative manner to reduce the number of relay nodes in the same environment.Results of different scales of simulation experiments show that compared with GA-RD and IWGA-RD algorithm,the proposed algorithm has fewer relay nodes and better network performance.In the case of large sample,it can significantly reduce the network loads and deployment cost.
关 键 词:无线传感器网络 中继节点 部署策略 网络连通 异构网络
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173