Resource Efficient Key Distribution System for Manets

Dawit, Wubshet (2014) Resource Efficient Key Distribution System for Manets. Masters thesis, Addis Ababa University.

[img] PDF (Resource Efficient Key Distribution System for Manets)
Dawit, Wubshet.pdf - Accepted Version
Restricted to Repository staff only

Download (1MB) | Request a copy

Abstract

Given MANET's lack of static network infrastructure, lack of resource and the use of wireless medium for communication, its key management system is an excellent point of attack for intruders. By compromising on security and using shared keys to avoid the burden of asymmetric key management for each node, vulnerability is created in the network. Different types of applications run on MANET‟s. There are applications that may require hardened security like onsite emergency response applications and others which may not require hardened security like conference slide sharing applications. To ensure security for those applications that can‟t afford a security vulnerability due to sharing of keys, a system should use asymmetric keys of which its private key is only known by the owner nodes and its identity confirmed by a certificate authority. This work proposes a resource efficient asymmetric key distribution system for MANETs. We have used decentralized trust model where each node, can act as a certificate authority and is able to cache certified keys. The system is also supported through clustering. It is able to do its intended task by having a key server, key client, cache builder and key cache modules installed on every node. Each node will perform its task based on the role assigned to it by the clustering algorithm. Since clustering algorithms have their own resource foot prints, we had to search for a clustering algorithm among that will not burden the network with extra cluster formation communication. We were able to experimentally select a clustering algorithm called passive clustering algorithm that will not burden the network with its own clustering information exchange. This clustering algorithm uses existing traffic to maintain clustering information. We have evaluated the proposed key distribution system by simulating and comparing its efficiency and key delivery rate against zone based key distribution system and MOCA key distribution system. The result showed that the proposed system was able to deliver keys 8.06 ms average end to end delay, 5.22 average hop count and 71.33% key delivery rate, whereas zone based key distribution system scored 14.13 ms average end to end delay, 8.66 average hop count and 75.69% key delivery rate and finally MOCA scored 15.3 ms in average end to end delay, 10.42 hops in average hop count and 67.36% key delivery rate. The proposed key distribution was able to retrieve keys faster using less communication. This is because the key caching capability of the proposed system improved the amount of communication needed to retrieve a key. The errors recorded in the key delivery rate were due to packet losses that occurred during wireless transmission.

Item Type: Thesis (Masters)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Divisions: Africana
Depositing User: Selom Ghislain
Date Deposited: 01 Oct 2018 12:56
Last Modified: 01 Oct 2018 12:56
URI: http://thesisbank.jhia.ac.ke/id/eprint/5777

Actions (login required)

View Item View Item