An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network-Reference-Cited by-同舟云学术

An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network

Published:2010-01 Issue:1 Volume:36 Page:100-113
ISSN:0045-7906
Container-title:Computers & Electrical Engineering
language:en
Short-container-title:Computers & Electrical Engineering

Author:

Wang Shun-Sheng,Yan Kuo-Qin,Wang Shu-Ching

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,General Computer Science,Control and Systems Engineering

Reference20 articles.

1. Chen G, Nocetti FG, Gonzalez JS, Stojmenovic I. Connectivity-based k-hop clustering in wireless networks. In: Proceedings of the 35th Hawaii international conference on system sciences (HICSS-35); 2002.

2. Securing reliable server pooling in MANET against byzantine adversaries;Crescenzo;IEEE J Selected Areas Commun,2006

3. Bounds on information exchange for byzantine agreement;Dolev;J ACM,1985

4. A lower bound for the assure interactive consistency;Fischer;Inf Process Lett,1982

5. Data links;Halsall,1995

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Feature-Oriented Fault Diagnosis Agreement Protocol in Distributed Systems;J INTERNET TECHNOL;2019

2. A Secure Service Agreement Underlying Cloud Computing Environment;J INTERNET TECHNOL;2018

3. An Agreement Under Early Stopping and Fault Diagnosis Protocol in a Cloud Computing Environment;IEEE Access;2018

4. The diagnosis of consensus agreement in a MANET;International Journal of Ad Hoc and Ubiquitous Computing;2017

5. Agreement-Based Interference-Aware Dynamic Channel Allocation in Cognitive Radio Network (CRN);Advances in Intelligent Systems and Computing;2017