北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2014, Vol. 37 ›› Issue (4): 103-107.doi: 10.13190/j.jbupt.2014.04.022

• 研究报告 • 上一篇    下一篇

基于改进Kruskal算法的WSN故障节点检测方法

李文璟, 袁野, 喻鹏, 邱雪松   

  1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876
  • 收稿日期:2013-11-03 出版日期:2014-08-28 发布日期:2014-08-09
  • 作者简介:李文璟(1973-),女,副教授,E-mail:wjli@bupt.edu.cn.
  • 基金资助:

    国家自然科学基金项目(61271187);国家高技术研究发展计划项目(2013AA013502);国家自然科学基金创新研究群体科学基金项目(61121061);国家科技支撑计划项目(2012BAH06B02)

Fault Detection Method Based on Improved Kruskal Algorithm for Wireless Sensor Network

LI Wen-jing, YUAN Ye, YU Peng, QIU Xue-song   

  1. State Key Laboratory of Networking and Switching, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2013-11-03 Online:2014-08-28 Published:2014-08-09

摘要:

提出了一种基于改进Kruskal算法的无线传感器网络(WSN)故障节点检测方法. 该方法首先通过集中式的改进Kruskal最小生成树算法来获取可信的节点集合,之后依据可信节点,采用邻居节点比较算法对传感器节点的感知值进行分布式分析和处理,判定发生故障的传感器节点. 同时为了容忍节点的临时故障,引入了时间冗余. 仿真结果表明,在节点故障率高达35%时,该方法依然能快速定位故障节点,并且同时保证很高的检测精确度.

关键词: 无线传感器网络, 故障检测, 最小生成树, 改进Kruskal算法

Abstract:

A fault detection method for wireless sensor network based on improved Kruskal algorithm was proposed. It adopts the centralized improved Kruskal algorithm to obtain credible node set. According to the credible node, it uses the distributed adjacent node comparing algorithm to locate the fault WSN node by analyzing and processing the sensing value. Time redundancy is also employed for tolerating the transient faults in sensing and communication. Simulation shows that, even the fault note rate raises to 35%, the proposed method can still locate the fault node quickly, and can also guarantee a high accuracy.

Key words: wireless sensor network, fault detection, minimum spanning tree, improved Kruskal algorithm

中图分类号: