一种分簇WSN最小跳数路由算法研究  

Minimum Hop Routing Algorithm for Clustering Wireless Sensor Networks

作　　者：范书平[1] 马宝英[2] 高晨光[2] 姚念民[3] 

机构地区：[1]牡丹江师范学院工学院,黑龙江牡丹江157011 [2]牡丹江医学院卫生管理学院,黑龙江牡丹江157011 [3]哈尔滨工程大学计算机学院,哈尔滨150001

出　　处：《小型微型计算机系统》2014年第8期1775-1779,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61073047)资助;黑龙江省智能教育与信息工程重点实验室开放基金项目(IEF2012-01)资助;中央高校基本科研业务费专项资金项目(HEUCFT1202;HEUCF100609)资助;黑龙江省教育厅人文社会科学项目(12532393)资助;黑龙江省教育厅科学技术研究项目(12513094)资助;牡丹江市科学技术计划项目(Z2013s042)资助

摘　　要：能量高效是无线传感器网络中的关键问题之一.提出一种基于最小跳数的分簇路由算法,算法优化了HEED算法中簇头的选择策略,此外,算法中节点根据其邻节点的广播信息计算最小跳数,在下一跳节点的选择过程中考虑了候选节点到基站的最小跳数、节点的能量以及节点到基站的距离,并在不同情况下令三个因素所起的作用不同,进而提高路由效率.最后将所提出算法与现有路由算法进行了对比,理论分析与Matlab模拟实验结果表明,所提出的最小跳数路由算法适用于大规模的无线传感器网络,在降低节点能量耗费的同时,延长了网络的生存周期.The energy efficiency is one of the key issues in wireless sensor networks. A new clustering routing algorithm based on minimum hop is proposed. The algorithm optimizes cluster heads selection for HEED. Besides, nodes calculate the minimum number of hops for routing according to broadcasting information of its neighbor nodes. The energy and the distance to the Base Station as well as the minimum hop of nodes are considered in the choice of the next hop node to enhance the efficiency of routing nodes. Final- ly, a comparison is made among the proposed algorithm and existing routing algorithms. Theoretical analysis and Matlab simulation results show that the proposed multi-hop routing algorithm is suitable for large-scale wireless sensor networks, and the lifetime of the network is extended while lowered nodes energy.

关 键 词：无线传感器网络 分簇 最小跳数 路由算法 能量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]