节点分簇和最佳距离相融合的传感器网络路由算法  

Sensor Network Routing Algorithm Based on Node Clustering and Optimal Distance

作　　者：徐音[1] 原立格[1] 朱旭普 

机构地区：[1]河南理工大学万方科技学院 [2]72749部队

出　　处：《吉林大学学报（理学版）》2016年第6期1373-1377,共5页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:61272490);河南省"十二五"规划项目(批准号:2015JKCHZD0027;2015JKCHYB0681)

摘　　要：针对当前路由算法由于无线传感器网络节点分布不均匀、节点能耗过快等因素严重影响其生存时间的问题,提出一种传感器节点分簇与最佳距离相融合的无线传感器网络路由算法.该算法先模拟生物细胞的连接过程实现传感器网络节点的分簇,再权衡网络生存时间和能量消耗间的关系,根据簇首与基站间的距离确定数据路由的最优路径,最后采用MATLAB R2014b工具箱编程实现路由算法.将该算法与其他算法进行对比实验,结果表明,该算法可以延长整个传感器网络的生存时间,有效减少网络能耗,提高了能量的利用率.Aiming at the problem that distribution of nodes was not uniform and energy consumption of nodes was too fast and current routing algorithms seriously affected the survival time of wireless sensor networks, we proposed a wireless sensor network routing algorithm based on node clustering and optimal distance. Firstly, the algorithm simulated the connection process of bioiogical cells to realize clustering process of sensor network nodes, then balanced the relationship between network survival time and energy consumption, and determined optimal path of data routing according to distance between cluster head and base station. Finally, the routing algorithm was realized by using MATLAB R2014b toolbox. Compared with other algorithms, experimental results show that the proposed algorithm can prolong the survival time of the whole sensor network, effectively reduce energy consumption, and improve the utilization rate of energy.

关 键 词：无线传感器网络 路由策略 最佳距离 生存时间 能量消耗 生物细胞 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]