Dual agreement virtual subnet protocol for mobile ad-hoc networks

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 953-954

  Yan, K Q ^a   Wang, S C ^a   Zheng, G Y ^a  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Byzantine agreement; Distributed system; Mobile ad hoc network; Parallel processing

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; MOBILE DEVICES; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; TOPOLOGY;

BYZANTINE AGREEMENT (BA); DISTRIBUTED SYSTEM; MOBILE AD-HOC NETWORK; MOBILE PROCESSOR;

AD HOC NETWORKS;

EID: 35248837799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244210     Document Type: Conference Paper

References (3)

1. A. Bar-Noy, et al., Shifting gears: changing algorithms on the fly to expedite Byzantine agreement, Symposium on Principles of Distributed Computing, pp. 42-51, 1987.
2. L. Lamport, R. Shostak and M. Pease, The Byzantine general problem, ACM Transactions on Programming Language and Systems, Vol. 4, No. 3, pp. 382-401, 1982.
3. T.C. Chiang, H.M. Tsai and Y.M. Huang, A Partition Network Model for Ad Hoc Networks, IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, Vol. 3, pp.467-472, 2005.