Full Text:   <1027>

Summary:  <334>

CLC number: TP393

On-line Access: 2016-08-31

Received: 2015-06-02

Revision Accepted: 2015-07-26

Crosschecked: 2016-08-16

Cited: 1

Clicked: 1992

Citations:  Bibtex RefMan EndNote GB/T7714

 ORCID:

Adel Khosravi

http://orcid.org/0000-0002-8493-4462

-   Go to

Article info.
Open peer comments

Frontiers of Information Technology & Electronic Engineering  2016 Vol.17 No.9 P.885-896

10.1631/FITEE.1500176


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


Author(s):  Adel Khosravi, Yousef Seifi Kavian

Affiliation(s):  Electrical Engineering Department, Faculty of Engineering, Shahid Chamran University of Ahvaz, Ahvaz 61357-43337, Iran

Corresponding email(s):   a-khosravi@phdstu.scu.ac.ir

Key Words:  Fault diagnosis, Decision making, Byzantine agreement, Distributed wireless networks, Consensus


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(3): 885-896.

@article{title="Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks",
author="Adel Khosravi, Yousef Seifi Kavian",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="17",
number="9",
pages="885-896",
year="2016",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1500176"
}

%0 Journal Article
%T Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks
%A Adel Khosravi
%A Yousef Seifi Kavian
%J Frontiers of Information Technology & Electronic Engineering
%V 17
%N 9
%P 885-896
%@ 1869-1951
%D 2016
%I Zhejiang University Press & Springer

TY - JOUR
T1 - Autonomous fault-diagnosis and decision-making algorithm for determining faulty nodes in distributed wireless networks
A1 - Adel Khosravi
A1 - Yousef Seifi Kavian
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 17
IS - 9
SP - 885
EP - 896
%@ 1869-1951
Y1 - 2016
PB - Zhejiang University Press & Springer
ER -


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 2t+1 rounds of packet transmissions, and the bit complexity in each wireless node is O(nt+1).

一种用于判断分布式网络中故障节点的自主故障诊断及决策算法

概要:本文解决了具有任意易错节点及健康接入点分布式网络(distributed wireless networks, DWNs)的故障诊断协定(fault-diagnosis agreement, FDA)问题。我们提出的新算法,可在故障树成员间对其中失效节点的认定达成一致。该算法虽为完全连接DWN设计,但易于适用部分连接网络。本文的贡献在于通过在所有故障树成员中检测同一失效单元列表,来减少拜占庭协议过程的比特复杂度,因而得以将恶意单元从其它相关进程中移除。同时,每个健康单元均对本地恶意单元列表进行检测,从而减少了网络中的包传输。本文提出的算法在2t+1个包传输轮次中解决了FDA问题,其单个无线节点的比特复杂度为O(nt+1)。
关键词:故障诊断;决策;拜占庭协议;分布式无线网络;一致性

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1]Alekeish, K., Ezhilchelvan, P., 2012. Consensus in sparse, mobile ad hoc networks. IEEE Trans. Parall. Distrib. Syst., 23(3):467-474.

[2]Ayeb, B., Farhat, A., 2004. A flexible formal framework for masking/demasking faults. Inform. Sci., 159(1-2):29-52.

[3]Buskens, R.W., Bianchini, R.P., 1993. Distributed on-line diagnosis in the presence of arbitrary faults. 23rd Int. Symp. on Fault-Tolerant Computing, p.470-479.

[4]Chiang, M.L., Wang, S.C., Tseng, L.Y., 2009. An early fault diagnosis agreement under hybrid fault model. Expert Syst. Appl., 36(3):5039-5050.

[5]Colon Osorio, F.C., 2007. Using Byzantine agreement in the design of IPS systems. Int. Performance, Computing, and Communications Conf., p.528-537.

[6]Elhadef, M., Boukerche, A., Elkadiki, H., 2007. An adaptive fault identification protocol for an emergency/rescue-based wireless and mobile ad-hoc network. IEEE Int. Parallel and Distributed Processing Symp., p.1-8.

[7]Fischer, M.J., Lynch, N.A., 1982. A lower bound for the assure interactive consistency. Inform. Process. Lett., 14(4):183-186.

[8]Hsiao, H.S., Chin, Y.H., Yang, W.P., 2000. Reaching fault diagnosis agreement under a hybrid fault model. IEEE Trans. Comput., 49(9):980-986.

[9]Hsieh, H.C., Chiang, M.L., 2013. Robustness improvement for mobile P2P network by the Byzantine Agreement problem. 10th Annual Conf. on Wireless On-demand Network Systems and Services, p.104-106.

[10]Jiang, J., He, C., 2005. A novel mutual authentication and key agreement protocol based on NTRU cryptography for wireless communications. J. Zhejiang Univ.-Sci., 6A(5): 399-404.

[11]Khosravi, A., Mohammadi, K., Shiroie, M., 2011. Locating malicious links in fully-connected networks using a formal framework. Proc. Int. Conf. on Systems Engineering, p.247-250.

[12]Lamport, L., Shostak, R., Pease, M., 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401.

[13]Maggs, M.K., O’Keefe, S.G., Thiel, D.V., 2012. Consensus clock synchronization for wireless sensor networks. IEEE Sensors J., 12(6):2269-2277.

[14]Okun, M., Barak, A., 2008. Efficient algorithms for anonymous Byzantine agreement. Theory Comput. Syst., 42(2): 222-238.

[15]Pasqualetti, F., Bicchi, A., Bullo, F., 2012. Consensus computation in unreliable networks: a system theoretic approach. IEEE Trans. Autom. Contr., 57(1):90-104.

[16]Pease, M., Shostak, R., Lamport, L., 1980. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234.

[17]Silvestre, D., Rosa, P., Hespanha, J.P., et al., 2014. Finite-time average consensus in a Byzantine environment using set-valued observers. American Control Conf., p.3023-3028.

[18]Wang, S.C., Chin, Y.H., Yan, K.Q., 1990. Reaching a fault detection agreement. Proc. Int. Conf. on Parallel Processing, p.251-258.

[19]Wang, S.C., Chin, Y.H., Yan, K.Q., 1995. Byzantine Agreement in a generalized connected network. IEEE Trans. Parall. Distrib. Syst., 6(4):420-427.

[20]Wang, S.S., Yan, K.Q., Wang, S.C., 2010. An optimal solution for Byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network. Comput. Electr. Eng., 36(1):100-113.

[21]Wu, S., Rabbat, M.G., 2013. Broadcast gossip algorithms for consensus on strongly connected digraphs. IEEE Trans. Signal Process., 61(16):3959-3971.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276/87952783; E-mail: jzus@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE