检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《现代电子技术》2017年第5期14-18,共5页Modern Electronics Technique
基 金:国家青年基金资助项目(61405156);国家自然科学基金地区人才培养联合项目(U1304618);国家863高技术研究发展计划(2012AA101608)
摘 要:无线传感网络中低功耗自适应聚类分簇(LEACH)路由算法等概率选取簇首节点,容易导致整个网络节点能量损耗出现极端化,减少网络生存时间。为此,提出一种针对簇首节点选取和分簇的改进LEACH算法。该算法把整个网络区域分为四个扇形区域,在每个区域内独立进行分簇路由;然后基站根据节点剩余能量和与基站的距离进行簇首节点选择,节点根据簇首节点和基站接收信号强度选择路由方式,以均衡网络能量消耗。仿真结果表明,改进LEACH算法的网络寿命是原有LEACH算法的150%,数据吞吐量提升了3倍。The low energy adaptive clustering hierarchy (LEACH) routing algorithm for wireless sensor network selects the cluster head node by means of equal probability, which is easy to result in the extreme energy loss of the whole network nodes, and reduce the network lifetime. Therefore, an improved LEACH algorithm for the selection and clustering of the cluster head node is proposed. The whole network area is divided into four fan-shaped subareas with the algorithm to perform the clustering routing in each subarea independently. The cluster head node of the base station is selected according to the node residual ener- gy and distance to the base station. The routing mode of the node is selected according to the cluster head node and the received signal strength of the base station to balance the network energy consumption. The simulation results show that the network life- time of the improved LEACH algorithm is 150% of the original LEACH algorithm, and its data throughout is increased by three times.
关 键 词:无线传感器网络 能量均衡 扇形分簇 簇首 路由算法
分 类 号:TN915-3[电子电信—通信与信息系统] TP393.2[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38