IEEEXplore (3) - Self-adaptable and Intrusion Tolerant...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Self-adaptable and Intrusion Tolerant Certificate Authority for Mobile Ad Hoc Networks Fernando Carlos Pereira † ∗ Joni da Silva Fraga † ∗ Ricardo Felipe Cust´odio ‡ † Departamento de Automac ¸˜ao e Sistemas, Universidade Federal de Santa Catarina – Brazil ‡ Laborat´orio de Seguranc ¸a em Computac ¸˜ao, Universidade Federal de Santa Catarina – Brazil { fernando,fraga } @das.ufsc.br custodio@inf.ufsc.br Abstract Dynamic distributed systems like peer-to-peer systems, overlay networks and mobile ad hoc networks must execute their applications using distributed resources and in a de- centralized way. The structure (composition and topology) of these systems changes frequently due to nodes joining or leaving the network, or due to mobility, faults and net- works partitions. Distributed algorithms projected to this class of systems must be able to deal with the occurrence of these events and to self-adapt dynamically the applica- tion according to changes in its execution environment. In this paper, we propose a dynamic, self-adaptable and intru- sion tolerant certificate authority (CA) designed to operate in mobile ad hoc networks. This CA is composed by a set of mobile devices present in the network, which forms a group of servers that supports CA functions. This architecture is based on a dynamic systems model and was conceived to manage changes in the membership of the servers group. This paper introduces an algorithmic base that allows the CA to reconfigure itself, guaranteeing the availability and the inviolability of the certification service. 1 Introduction Peer to Peer (P2P) environments found in mobile ad hoc networks (MANETS) must execute their applications using distributed resources and in a decentralized way. The chal- lenge of these environments is to guarantee the progress and termination of computations even if the system suffers from churn [3], i.e., mobile devices dynamically join and leave the system at arbitrary times. Dynamic Systems models [1, 6] has been proposed to al- low the distributed applications make progress in dynamic environments. To guarantee the progress of a computation some researchers state that a minimum number of nodes (mobile devices) should be available during a long enough ∗ Supported in part by CNPq. period in such systems. In [6] is introduced the concept of eventual stability , that is centered on a parameter α . This parameter is defined as the minimal number of devices (nodes) that have to be simultaneously alive during a long enough period to guarantee the progress of the distributed computation. No one node stays forever in the system, but α nodes always needs to be present in the system for it to progress....
View Full Document

This note was uploaded on 03/19/2012 for the course CS 1313 taught by Professor Aman during the Spring '12 term at Punjab Engineering College.

Page1 / 8

IEEEXplore (3) - Self-adaptable and Intrusion Tolerant...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online