Dependable and secure distributed storage system for ad hoc networks

Authors:
Rudi Ball;James Grant;Jonathan So;Victoria Spurrett;Rogério De Lemos
Affiliations:
Computing Laboratory, University of Kent, UK;Computing Laboratory, University of Kent, UK;Computing Laboratory, University of Kent, UK;Computing Laboratory, University of Kent, UK;Computing Laboratory, University of Kent, UK
Venue:
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Year:
2007

Citing 4
Cited 1

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Basic Concepts and Taxonomy of Dependable and Secure Computing

IEEE Transactions on Dependable and Secure Computing
Secure dynamic fragment and replica allocation in large-scale distributed file systems

IEEE Transactions on Parallel and Distributed Systems

Information dependability in distributed systems: The dependable distributed storage system

Integrated Computer-Aided Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The increased use of ubiquitous computing devices is resulting in networks that are highly mobile, well connected and growing in processing and storage capabilities. The nature of these ubiquitous systems, however, also increases the risk of building systems that are undependable and potentially insecure. This paper investigates the use of autonomous agents combined with an intrusion tolerance technique for providing secure and dependable storage for ad hoc networks. The proposed approach is based on the fragmentation-redundancy-scattering (FRS) technique that is able to tolerate both accidental and intentional faults by fragmenting confidential information into insignificant fragments, and by scattering these fragments in a redundant fashion across a network. Two algorithms that are able to maintain a constant number of fragments replicas were developed for this study: one based on the game of life, and the other based on roaming ants. Both algorithms were simulated in NetLogo, and simulated further in a cluster of computers for evaluation of their scalability.