The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Virtual trees for the byzantine generals algorithm
Proceedings of the 35th SIGCSE technical symposium on Computer science education
A Dynamic Trust Metric for P2P Systems
GCCW '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing Workshops
Security Issues in Wireless Sensor Networks
ICSNC '06 Proceedings of the International Conference on Systems and Networks Communication
Selecting a distributed agreement algorithm
Proceedings of the 2007 ACM symposium on Applied computing
Cognitive Networks: Towards Self-Aware Networks
Cognitive Networks: Towards Self-Aware Networks
AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
| Hi-index | 0.00 |
Dynamic trust models and replication approaches that adequately address the security needs of wireless cognitive ad hoc networks have proven quite difficult to develop. As established by Qusay H. Mahmoud in the 2007 book titled Cognitive Networks: Towards Self-Aware Networks [1], reliable and robust security models need to be developed. The inherent decentralized nature of ad hoc networks and their collaborative services give rise to a series of vulnerabilities that can be exploited by malicious entities [5]. Instead of assuming a "home egualis" approach to security, where there is no centralized structure or governance, a Byzantine generals' approach could be used. This centralized approach has been successfully used to provide fault tolerance to distributed systems [10] [11] [12]. This paper presents a novel approach to distribute trust data utilizing the 3m+1 solution to the Byzantine general's problem.