Reaching Trusted Byzantine Agreement in a Cluster-Based Wireless Sensor Network

被引:5
作者
Wang, Shun-Sheng [1 ]
Wang, Shu-Ching [2 ]
Yan, Kuo-Qin [3 ]
机构
[1] Chaoyang Univ Technol, Dept Ind Engn & Management, Taichung, Taiwan
[2] Chaoyang Univ Technol, Dept Informat Management, Taichung, Taiwan
[3] Chaoyang Univ Technol, Dept Business Adm, Taichung, Taiwan
关键词
Wireless sensor network; Cluster-based wireless sensor network; Byzantine agreement; Internet of things; Fault tolerant; CONSENSUS;
D O I
10.1007/s11277-014-1802-3
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A wireless sensor network (WSN) consists of spatially distributed autonomous devices which use sensor nodes to monitor physical or environmental conditions cooperatively. Currently, WSNs are expected to be integrated into the internet of things (IoT), where sensor nodes join the internet dynamically and collaborate to accomplish their tasks. In the application of the IoT, WSNs can play an important role by collecting surrounding contextual and environmental information. However, ensuring a stable and reliable topology is an important issue with regard to WSNs. To cope with the influence of faulty components, it is essential to reach a common agreement in the presence of faults, before performing certain tasks. However, the Byzantine agreement (BA) problem is a fundamental issue in fault-tolerant distributed systems. To enhance the fault tolerance and reliability of the WSN, the BA problem in the cluster-based WSN (CWSN) is revisited in this study. The proposed protocol can achieve agreement on a common value among all functional nodes in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in the CWSN.
引用
收藏
页码:1079 / 1094
页数:16
相关论文
共 16 条
  • [1] A survey on sensor networks
    Akyildiz, IF
    Su, WL
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) : 102 - 114
  • [2] [Anonymous], 2012, TXB GRAPH THEORY
  • [3] An unequal cluster-based routing protocol in wireless sensor networks
    Chen, Guihai
    Li, Chengfa
    Ye, Mao
    Wu, Jie
    [J]. WIRELESS NETWORKS, 2009, 15 (02) : 193 - 207
  • [4] Christin D., 2009, P 8 GIITG KUVS FACHG, P31, DOI [10.1007/978-3-642-11917-0, DOI 10.1007/978-3-642-11917-0]
  • [5] Low complexity Byzantine-resilient consensus
    Correia, M
    Neves, NF
    Lung, LC
    Veríssimo, P
    [J]. DISTRIBUTED COMPUTING, 2005, 17 (03) : 237 - 249
  • [6] FISCHER MJ, 1983, LECT NOTES COMPUT SC, V158, P127
  • [7] Gupta I, 2005, PROCEEDINGS OF THE 3RD ANNUAL COMMUNICATION NETWORKS AND SERVICES RESEARCH CONFERENCE, P255
  • [8] Fast Asynchronous Byzantine Agreement and Leader Election with Full Information
    Kapron, Bruce M.
    Kempe, David
    King, Valerie
    Saia, Jared
    Sanwalani, Vishal
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (04)
  • [9] THE BYZANTINE GENERALS PROBLEM
    LAMPORT, L
    SHOSTAK, R
    PEASE, M
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03): : 382 - 401
  • [10] CONSENSUS WITH DUAL FAILURE MODES
    MEYER, FJ
    PRADHAN, DK
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1991, 2 (02) : 214 - 222