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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avizienis, A., Laprie, J.-C., Randell, B., Landwehr, C.: Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Transactions on Dependable and Secure Computing 1(1), 11–33 (2004)
Chessa, S., Di Pietro, R., Maestrini, P.: Dependable and Secure Data Storage in Wireless Ad Hoc Networks: An Assessment of DS2. In: Battiti, R., Conti, M., Cigno, R.L. (eds.) Wireless On-Demand Network Systems. LNCS, vol. 2928, pp. 184–198. Springer, Heidelberg (2004)
Chessa, S., Maestrini, P.: Dependable and Secure Data Storage and Retrieval in Mobile, Wireless Network. In: DSN 2003. Proceedings of the International Conference on Dependable System and Networks, San Francisco, CA, USA (2003)
Deswarte, Y., Blain, L., Fabre, J.-C.: Intrusion Tolerance in Distributed Computing Systems. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, USA, pp. 110–121 (May 1991)
Fraga, J., Powell, D.: A Fault- and Intrusion-Tolerant File System. In: IFIP/SEC 1985. Proceedings of the 3rd International Conference on Computer Security, Dublin, Ireland, pp. 203–218 (August 1985)
Mei, A., Mancini, L.V., Jajodia, S.: Secure Dynamic Fragment and Replica Allocation in Large-Scale Distributed File Systems. IEEE Transactions on Parallel and Distributed Systems 14(9), 885–896 (2003)
Montresor, A., et al.: Messor: Load-Balancing through a Swarm of Autonomous Agents. Technical Report UBLCS-2002-11. University of Bologna. Italy (2002)
Rabin, M.O.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of the ACM 36(2) (1989)
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Trouessin, G., Deswarte, Y., Fabre, J.-C., Randell, B.: Improvement of Data Processing Security by Means of Fault Tolerance. In: Proceedings of the 14th National Computer Security Conference, pp. 295–304. Washington, USA (1991)
Veríssimo, P., Neves, N.F., Correia, M.: Intrusion-Tolerant Architectures: Concepts and Design. Technical Report DI/FCUL TR03-5. Department of Computer Science, University of Lisbon (2003)
Wilensky, U.: NetLogo. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL (1999), http://ccl.northwestern.edu/netlogo/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ball, R., Grant, J., So, J., Spurrett, V., de Lemos, R. (2007). Dependable and Secure Distributed Storage System for Ad Hoc Networks. In: Kranakis, E., Opatrny, J. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2007. Lecture Notes in Computer Science, vol 4686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74823-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74823-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74822-9
Online ISBN: 978-3-540-74823-6
eBook Packages: Computer ScienceComputer Science (R0)