MOBILE AD HOC NETWORKS PUBLIC KEY CERTIFICATE MANAGEMENT WITH EFFICIENCY
Main Article Content
Article Sidebar
Abstract
Mobile ad hoc networks involve communications over a shared wireless channel without any centralized infrastructure. Consequently, in an optimal solution, management and security services depend exclusively on network members. The main contribution of this paper is an efficient public key management scheme that is suitable for fully self-organized mobile ad hoc networks where all nodes play identical roles. Our approach implies that the operations of creating, storing, distributing, and revoking nodes’ public keys are carried out locally by the nodes themselves. The goal of the presented methods is the improvement in the process of building local certificate repositories of nodes. In order to do it, an authentication solution based on the web of trust concept is combined with an element of routing based on the multipoint relay concept introduced in the optimized link state routing protocol. Our proposal leads to a good tradeoff among security, overhead, and flexibility. Experimental results show a considerable decrease in resource consumption while carrying out the certificate verification process.
Article Details
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
 All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€