Journal of Computer Applications ›› 2012, Vol. 32 ›› Issue (04): 920-923.DOI: 10.3724/SP.J.1087.2012.00920

• Network and communications • Previous Articles     Next Articles

Clustering algorithm based on backup path in wireless sensor network

DING Ding1,2,LIU Fang-ai1,2,LI Qian-qian1,2,YANG Guang-xu1,2   

  1. 1. School of Information Science and Engineering, Shandong Normal University, Jinan Shandong 250014, China
    2. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology, Jinan Shandong 250014, China
  • Received:2011-10-14 Revised:2011-11-24 Online:2012-04-20 Published:2012-04-01
  • Contact: DING Ding

无线传感器网络备份路径分簇算法

丁鼎1,2,刘方爱2,3,李倩倩1,2,杨光旭1,2   

  1. 1. 山东省分布式计算机软件新技术重点实验室,济南 250014
    2. 山东师范大学 信息科学与工程学院,济南 250014
    3. 山东师范大学信息科学与工程学院
  • 通讯作者: 丁鼎
  • 作者简介:丁鼎(1986-),男,山东济南人,硕士研究生,CCF会员,主要研究方向:无线传感器网络、分布式计算;
    刘方爱(1962-),男,山东青岛人,教授,博士,主要研究方向:分布式计算、传感器网络、P2P网络;
    李倩倩(1988-),女,山东东营人,硕士研究生,主要研究方向:无线传感器网络;
    杨光旭(1987-),男,山东聊城人,硕士研究生,主要研究方向:传感器仿真。
  • 基金资助:
    国家自然科学基金资助项目;山东省科技发展计划项目;济南市高校院所自主创新项目

Abstract: Clustering can be used in the routing algorithm to enhance the scalability of Wireless Sensor Network (WSN). Concerning the defects of traditional clustering algorithm, a new strategy EDC (Energy-efficient, Dual-path, Clustering) was proposed, in which the member node has an optimal backup path. The strategy guaranteed that member node can still transmit data through its backup path when its cluster head was dying in the WSN. The results of the simulation experiment on the platform OMNeT ++ indicate that EDC performs much better than other protocols of WSN in terms of network reconstruction time and number of failed nodes.

Key words: Wireless Sensor Network (WSN), cluster-head node selection, backup node, clustering hierarchy algorithm, network lifetime

摘要: 在路由协议中利用分簇技术可以提高无线传感器网络的可扩展性。针对无线传感器网络(WSN)中分簇算法的不足,提出了基于备份节点策略的EDC算法,传感器节点在其簇头失效后仍可以通过其备份路径传输数据。通过OMNeT++平台上的仿真实验表明,EDC在网络重建时间、失效节点数量较其他WSN协议有明显的改善。

关键词: 无线传感器网络, 簇头节点选择, 备份节点, 分簇算法, 网络生命周期

CLC Number: