Journal of Computer Applications ›› 2015, Vol. 35 ›› Issue (12): 3331-3335.DOI: 10.11772/j.issn.1001-9081.2015.12.3331

• Network and communications • Previous Articles     Next Articles

Clustering routing algorithm based on attraction factor and hybrid transmission

ZHAO Zuopeng, ZHANG Nana, HOU Mengting, GAO Meng   

  1. College of Computer Science and Technology, China University of Mining and Technology, Xuzhou Jiangsu 221116, China
  • Received:2015-05-12 Revised:2015-07-02 Online:2015-12-10 Published:2015-12-10

基于吸引因子和混合传输的分簇路由算法

赵作鹏, 张娜娜, 侯梦婷, 高萌   

  1. 中国矿业大学计算机科学与技术学院, 江苏徐州 221116
  • 通讯作者: 张娜娜(1990-),女,江苏徐州人,硕士研究生,主要研究方向:无线传感器网络
  • 作者简介:赵作鹏(1977-),男,江苏徐州人,副教授,博士,主要研究方向:无线传感器网络、智慧矿山;侯梦婷(1991-),女,宁夏吴忠人,硕士研究生,主要研究方向:无线传感器网络;高萌(1991-),女,河南漯河人,硕士研究生,主要研究方向:无线传感器网络。
  • 基金资助:
    中央高校基本科研业务费专项资金资助项目(2014QNB25);江苏省自然科学基金资助项目(BK2012129)。

Abstract: In order to effectively reduce the energy consumption of Wireless Sensor Network (WSN) and extend the life cycle of the network, Low Energy Adaptive clustering Hierarchy (LEACH) and other clustering routing protocols were analyzed. For improving their weaknesses, a Clustering Routing algorithm based on Attraction factor and Hybrid transmission (CRAH algorithm) was proposed. Firstly, in order to solve the problem of unreasonable selection of Cluster Head (CH) nodes, the node residual energy and the node location were combined as a new index of CH nodes selection by adopting the method of weighted sum. Then, the tasks of the CH nodes were reassigned, and new fusion nodes were chosen. The fusion nodes sent data to Base Station (BS) according to a hybrid of single hop and multiple hops, and combined attraction factor and the Dijkstra algorithm to present a new algorithm, Attraction Factor-Dijkstra (AF-DK) algorithm was proposed with the combination of attract factor and Dijkstra algorithm for finding the optimal paths for fusion nodes. The simulation results show that, compared with the protocols of LEACH, LEACH-Centralized (LEACH-C) and Hybrid Energy-Efficient Distributed clustering (HEED), the CRAH algorithm improved the network lifetime by about 51.56%, 47.1% and 42% respectively, and slowed the network energy consumption significantly. The amount of data receiving by Base Station (BS) decreased 69.9% in average. The CRAH algorithm makes CH selection more reasonable, effectively reduces the redundant data in the process of communication, balances the network energy consumption, and extends the life cycle of the network.

Key words: Wireless Sensor Network (WSN), clustering routing protocol, attraction factor, multi-hop, Dijkstra algorithm

摘要: 为了能够有效地降低无线传感器网络(WSN)的能耗,延长网络生命周期,对低功耗自适应集簇分层型(LEACH)协议等多个分簇路由协议进行分析,并针对其算法存在的缺陷提出基于吸引因子和多跳传输的分簇路由算法(CRAH)。针对不合理的簇头选择问题,采用加权和的方法将节点剩余能量与节点位置两个参数,作为簇头选择的新指标;对簇头节点的任务进行重新分配,选出新的融合节点;融合节点和基站的通信采用单跳与多跳相结合的混合传输方式,结合吸引因子和Dijkstra算法提出新的基于吸引因子的Dijkstra(AF-DK)算法,为融合节点找到最优转发路径。仿真结果表明,与LEACH、集中式低功耗自适应集簇分层型(LEACH-C)路由和固定簇半径的分簇(HEED)等协议相比,CRAH使网络寿命分别提高了约51.56%、47.1%和42%,网络能耗速度明显减缓,基站接收的数据量平均减少了69.9%。CRAH使簇头选择更加合理,有效减少了通信过程中的冗余数据,均衡了网络能耗,延长了网络生命周期。

关键词: 无线传感器网络, 分簇路由协议, 吸引因子, 多跳, Dijkstra算法

CLC Number: