Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks

Adel KHOSRAVI; Yousef SEIFI KAVIAN

doi:10.1631/FITEE.1500176

Your Location：

Home >

Browse articles >

Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks

Regular Papers | Updated：2022-05-19

- Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks
- 一种用于判断分布式网络中故障节点的自主故障诊断及决策算法
- Frontiers of Information Technology & Electronic Engineering Vol. 17, Issue 9, Pages: 885-896(2016)
- Affiliations：
  
  Electrical Engineering Department, Faculty of Engineering, Shahid Chamran University of Ahvaz, Ahvaz 61357-43337, Iran
- Author bio：
  
  E-mail:a-khosravi@phdstu.scu.ac.ir
- Funds：
- DOI：10.1631/FITEE.1500176
  CLC： TP393
- Received：02 June 2015，
  
  Accepted：26 July 2015，
  
  Published：2016-09
- Accepted：
Scan QR Code
Adel KHOSRAVI, Yousef SEIFI KAVIAN. Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks[J]. Frontiers of Information Technology & Electronic Engineering, 2016, 17(9): 885-896.
DOI：

Adel KHOSRAVI, Yousef SEIFI KAVIAN. Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks[J]. Frontiers of Information Technology & Electronic Engineering, 2016, 17(9): 885-896. DOI： 10.1631/FITEE.1500176.

摘要

本文解决了具有任意易错节点及健康接入点分布式网络（distributed wireless networks

DWNs）的故障诊断协定（fault-diagnosis agreement

FDA）问题。我们提出的新算法，可在故障树成员间对其中失效节点的认定达成一致。该算法虽为完全连接DWN设计，但易于适用部分连接网络。本文的贡献在于通过在所有故障树成员中检测同一失效单元列表，来减少拜占庭协议过程的比特复杂度，因而得以将恶意单元从其它相关进程中移除。同时，每个健康单元均对本地恶意单元列表进行检测，从而减少了网络中的包传输。本文提出的算法在2

+1个包传输轮次中解决了FDA问题，其单个无线节点的比特复杂度为

(

)。

Abstract

In this paper

we address fault-diagnosis agreement (FDA) problems in distributed wireless networks (DWNs) with arbitrary fallible nodes and healthy access points. We propose a new algorithm to reach an agreement among fault-free members about the faulty ones. The algorithm is designed for fully connected DWN and can also be easily adapted to partially connected networks. Our contribution is to reduce the bit complexity of the Byzantine agreement process by detecting the same list of faulty units in all fault-free members. Therefore

the malicious units can be removed from other consensus processes. Also

each healthy unit detects a local list of malicious units

which results in lower packet transmissions in the network. Our proposed algorithm solves FDA problems in 2

+1 rounds of packet transmissions

and the bit complexity in each wireless node is

(

关键词

Keywords

references

K Alekeish , , , P Ezhilchelvan . . Consensus in sparse, mobile ad hoc networks . . IEEE Trans. Parall. Distrib. Syst. , , 2012 . . 23 ( ( 3 ): ): 467 - - 474 . . DOI: 10.1109/TPDS.2011.182 http://doi.org/10.1109/TPDS.2011.182 . .

B Ayeb , , , A Farhat . . A flexible formal framework for masking/demasking faults . . Inform. Sci. , , 2004 . . 159 ( ( 1-2 ): ): 29 - - 52 . . DOI: 10.1016/j.ins.2003.03.004 http://doi.org/10.1016/j.ins.2003.03.004 . .

RW Buskens , , , RP Bianchini , , , 等 . . Distributed on-line diagnosis in the presence of arbitrary faults . . 1993 . . 23rd Int. Symp. on Fault-Tolerant ComputingV . . 470 - - 479 . . DOI: 10.1109/FTCS.1993.627350 http://doi.org/10.1109/FTCS.1993.627350 . .

ML Chiang , , , N Wang , , , SC Iske , , , LY Tseng , , , 等 . . An early fault diagnosis agreement under hybrid fault model . . Expert Syst. Appl. , , 2009 . . 36 ( ( 3 ): ): 5039 - - 5050 . . DOI: 10.1016/j.eswa.2008.06.009 http://doi.org/10.1016/j.eswa.2008.06.009 . .

FC Colon Osorio . . Using Byzantine agreement in the design of IPS systems . . 2007 . . Int. Performance, Computing, and Communications Conf. . . 528 - - 537 . . DOI: 10.1109/PCCC.2007.358936 http://doi.org/10.1109/PCCC.2007.358936 . .

M Elhadef , , , A Boukerche , , , H Elkadiki , , , 等 . . An adaptive fault identification protocol for an emergency/rescue- based wireless and mobile ad-hoc network . . 2007 . . IEEE Int. Parallel and Distributed Processing Symp. . . 1 - - 8 . . DOI: 10.1109/IPDPS.2007.370589 http://doi.org/10.1109/IPDPS.2007.370589 . .

MJ Fischer , , , NA Lynch , , , 等 . . A lower bound for the assure interactive consistency . . Inform. Process. Lett. , , 1982 . . 14 ( ( 4 ): ): 183 - - 186 . . DOI: 10.1016/0020-0190(82)90033-3 http://doi.org/10.1016/0020-0190(82)90033-3 . .

HS Hsiao , , , YH Chin , , , WP Yang , , , 等 . . Reaching fault diagnosis agreement under a hybrid fault model . . IEEE Trans. Comput. , , 2000 . . 49 ( ( 9 ): ): 980 - - 986 . . DOI: 10.1109/12.869331 http://doi.org/10.1109/12.869331 . .

HC Hsieh , , , ML Chiang , , , 等 . . Robustness improvement for mobile P2P network by the Byzantine Agreement problem . . 2013 . . 10th Annual Conf. on Wireless On-demand Network Systems and Services . . 104 - - 106 . . DOI: 10.1109/WONS.2013.6578329 http://doi.org/10.1109/WONS.2013.6578329 . .

J Jiang , , , C He . . A novel mutual authentication and key agreement protocol based on NTRU cryptography for wireless communications . . J. Zhejiang Univ.-Sci. , , 2005 . . 6A ( ( 5 ): ): 399 - - 404 . . DOI: 10.1631/jzus.2005.A0399 http://doi.org/10.1631/jzus.2005.A0399 . .

A Khosravi , , , K Mohammadi , , , M Shiroie , , , 等 . . Locating malicious links in fully-connected networks using a formal framework . . 2011 . . Proc. Int. Conf. on Systems Engineering . . 247 - - 250 . . DOI: 10.1109/ICSEng.2011.51 http://doi.org/10.1109/ICSEng.2011.51 . .

L Lamport , , , R Shostak , , , M Pease , , , 等 . . The Byzantine generals problem . . ACM Trans. Program. Lang. Syst. , , 1982 . . 4 ( ( 3 ): ): 382 - - 401 . . DOI: 10.1145/357172.357176 http://doi.org/10.1145/357172.357176 . .

MK Maggs , , , SG O'Keefe , , , DV Thiel , , , 等 . . Consensus clock synchronization for wireless sensor networks . . IEEE Sensors J. , , 2012 . . 12 ( ( 6 ): ): 2269 - - 2277 . . DOI: 10.1109/JSEN.2011.2182045 http://doi.org/10.1109/JSEN.2011.2182045 . .

M Okun , , , A Barak . . Efficient algorithms for anonymous Byzantine agreement . . Theory Comput. Syst. , , 2008 . . 42 ( ( 2 ): ): 222 - - 238 . . DOI: 10.1007/s00224-007-9006-9 http://doi.org/10.1007/s00224-007-9006-9 . .

F Pasqualetti , , , A Bicchi , , , F Bullo , , , 等 . . Consensus com-putation in unreliable networks: a system theoretic approach . . IEEE Trans. Autom. Contr. , , 2012 . . 57 ( ( 1 ): ): 90 - - 104 . . DOI: 10.1109/TAC.2011.2158130 http://doi.org/10.1109/TAC.2011.2158130 . .

M Pease , , , R Shostak , , , L Lamport , , , 等 . . Reaching agreement in the presence of faults . . J. ACM , , 1980 . . 27 ( ( 2 ): ): 228 - - 234 . . DOI: 10.1145/322186.322188 http://doi.org/10.1145/322186.322188 . .

D Silvestre , , , P Rosa , , , JP Hespanha , , , 等 . . Finite-time average consensus in a Byzantine environment using set-valued observers . . 2014 . . American Control Conf. . . 3023 - - 3028 . . DOI: 10.1109/ACC.2014.6859426 http://doi.org/10.1109/ACC.2014.6859426 . .

SC Wang , , , YH Chin , , , KQ Yan . . Reaching a fault detection agreement . . 1990 . . Proc. Int. Conf. on Parallel Processing . . 251 - - 258 . . . .

SC Wang , , , YH Chin , , , KQ Yan , , , 等 . . Byzantine Agreement in a generalized connected network . . IEEE Trans. Parall. Distrib. Syst. , , 1995 . . 6 ( ( 4 ): ): 420 - - 427 . . DOI: 10.1109/71.372796 http://doi.org/10.1109/71.372796 . .

SS Wang , , , KQ Yan , , , SC Wang , , , 等 . . An optimal solution for Byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network . . Comput. Electr. Eng. , , 2010 . . 36 ( ( 1 ): ): 100 - - 113 . . DOI: 10.1016/j.compeleceng.2009.06.002 http://doi.org/10.1016/j.compeleceng.2009.06.002 . .

S Wu , , , MG Rabbat . . Broadcast gossip algorithms for consensus on strongly connected digraphs . . IEEE Trans. Signal Process. , , 2013 . . 61 ( ( 16 ): ): 3959 - - 3971 . . DOI: 10.1109/TSP.2013.2264056 http://doi.org/10.1109/TSP.2013.2264056 . .

Views

Downloads

CSCD

Alert me when the article has been cited

Submit

Tools

Publicity Resources

Data-driven intermittent connection fault diagnosis for complex topology DeviceNet based on Bayesian inference

Impact of distance between two hubs on the network coherence of tree networks

Mixture test strategy optimization for analog systems

Bipartite asynchronous impulsive tracking consensus for multi-agent systems

Robust distributed model predictive consensus of discrete-time multi-agent systems: a self-triggered approach

Related Author

Yong LEI

Longkai WANG

Hongxiang HU

Weigang SUN

Daquan LI

Yongji LONG

Yusong MEI

Yuanzhang SU

Related Institution

State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University

School of Sciences, Hangzhou Dianzi University

School of Integrated Circuit Science and Engineering, University of Electronic Science and Technology of Chengdu

Glasgow College, University of Electronic Science and Technology of China

School of Foreign Languages, University of Electronic Science and Technology of China

Chat

Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
Tel：+86-571-88273162 Email：fitee@zju.edu.cn
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰