检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨佳 刘晓丽 许强[2] YANG Jia;LIU Xiaoli;XU Qiang(School of Electrical and Electronic Engineering,Chongqing University of Technology,Chongqing 400054,China;School of Computer Science and Information Engineering,Chongqing Technology and Business University,Chongqing 400067,China)
机构地区:[1]重庆理工大学电气与电子工程学院,重庆400054 [2]重庆工商大学计算机科学与信息工程学院,重庆400067
出 处:《传感器与微系统》2020年第4期121-124,128,共5页Transducer and Microsystem Technologies
基 金:重庆市科委自然科学基金资助项目(CSTC2012JJA40061);重庆市教委科学技术研究计划资助项目(KJ130834);重庆市教委科学技术研究计划资助项目(KJ1500619)。
摘 要:针对异构无线传感器网络(WSNs)中存在簇头节点负载过重、附近节点能量消耗不均和系统鲁棒性差的问题,提出了一种基于双簇头的异构无线传感器网络分簇路由算法。利用量子优化算法与粒子群优化算法结合构建双簇头的网络模型来解决节点能量消耗的问题;优化主副簇头适应值函数,使簇头分布合理,提高系统鲁棒性;建立簇头与基站边的权值,构建有向连通图,采用最小生成树进行簇间通信,减少节点能耗。通过大量仿真实验验证表明:该算法有效降低网络能耗,提高系统鲁棒性,延长网络生命周期。Aiming at the problem that the cluster head node is overloaded,the energy consumption of nearby nodes is unbalanced and the system robustness is poor in heterogeneous wireless sensor networks( WSNs),a clustering routing algorithm based on dual cluster heads for heterogeneous WSNs is proposed. Firstly,the algorithm uses quantum optimization algorithm and particle swarm optimization( PSO) algorithm to construct a network model for dual cluster heads to solve the problem of node energy consumption. Then,optimize the primary and secondary cluster head fitness functions,so that the cluster head distribution is resonable and can improve the system robustness. Establish the weight of the cluster head and the base station side to construct a directed connectivity graph,use the minimum spanning tree for inter-cluster communication,reduce node energy consumption. The simulation results show that the algorithm effectively reduces the network energy consumption,improves the system robustness,and prolongs the network life cycle.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.206.193