检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范兴刚[1] 侯佳斌[1] 介靖[1] 王万良[1] 王翊[1]
机构地区:[1]浙江工业大学计算机科学与技术学院,杭州310023
出 处:《传感技术学报》2011年第4期593-600,共8页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目(60573123);博士后科学基金项目(20090451486);浙江省自然科学基金项目(Y1080374)
摘 要:主要针对无线传感网络经典分簇协议LEACH(Low Energy Adaptive Clustering Hierarchy)中存在的三个使能量消耗过大的问题,提出了一种新的智能无线传感网络分簇路由算法DPSO—CR(Discrete Particle Swarm Optimization—Clustering Rou-ting)。针对LEACH中分簇不均匀的问题,提出用改造后的离散粒子群优化DPSO直接计算全局最优簇首的位置,使簇结构分布均匀合理;针对LEACH簇首与基站单跳通信能量消耗过大的问题,根据能量传输代价作为权值计算每个簇首到基站的多跳最小能耗路径;针对LEACH按轮进行全局簇首重选机制带来能耗过大的问题,提出了局部簇首更新机制来进一步节省能量消耗。实验结果表明,与LEACH协议相比,DPSO—CR算法不但分簇结构合理均匀,网络的生命周期也大大延长。This paper presents a new intelligent clustering routing algorithm of WSN(Wireless Sensor Network),DPSO—CR(Discrete Particle Swarm Optimization—Clustering Routing),to solve three major problems that can consume energy heavily in LEACH(Low Energy Adaptive Clustering Hierarchy),a classical clustering protocol in WSN.To solve the problem of uneven clustering in LEACH,this paper proposes to calculate the positions of global best cluster heads to make the clustering structure even through modified DPSO.To solve the heavy energy consumption of one-hop communication between cluster head and base station in LEACH,this paper proposes to calculate multi-hop minimum energy consumption path between each cluster head and base station.To solve the heavy energy consumption of global cluster heads re-election mechanism,this paper proposes local cluster heads update mechanism to save the energy consumption further.The experiment shows in comparison with LEACH,DPSO—CR not only has a reasonable and even cluster,the lifetime of network is also prolonged greatly.
关 键 词:LEACH DPSO—CR 多跳最小能耗路径 全局最优簇首 局部簇首更新
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.85