Title: Improving performance overhead of a trust-clustering key management protocol in ad hoc networks

Authors: Mustapha Sadi; Mourad Amad; Nadjib Badache

Addresses: Laboratoire d'Informatique Médicale, Faculté des Sciences Exactes, Université de Bejaia, 06000 Bejaia, Algeria ' Laboratoire LIMPAF, Département d'Informatique, Faculté des Sciences et Sciences Appliquées, Université de Bouira, Algeria ' Centre de Recherche sur l'Information, Scientifique et Technique (CERIST), DTISI, 3 rue des frères Aissou, 16030 Ben-Aknoun, Alger, Algeria

Abstract: Group key management is a challenge for securing group communications in the networks. This area is well studied in the literature. The strict characteristics of mobile ad hoc networks makes the adaptation of classical existing solutions a real challenge. Elliptic curves cryptography (ECC) became the choice of encryption for wireless ad hoc and sensor networks. It uses very small keys and is mathematically very effective, which makes them ideal in communication for small devices used today. Scalability is a basic factor that determines the efficiency of any group key management protocol. Recent solutions for MANETs are oriented towards hierarchical solutions of group key agreement using clustering. Trust oriented clustering scheme is the most adequate for secure group communication. We focus in this paper on ECC technology and its contribution for group key agreement solutions in mobile ad hoc networks using trust criteria for cluster's formation. We propose a novel solution to reduce the group key establishment overhead. The effectiveness of our solution lies in its avoidance of malicious members from being chosen as group controllers (clusterheads). The performance evaluation of the proposed solution shows that is globally satisfactory.

Keywords: group key management; trust clustering; elliptic curve cryptography; ECC; mobile ad hoc network; MANETs.

DOI: 10.1504/IJESDF.2020.10027596

International Journal of Electronic Security and Digital Forensics, 2020 Vol.12 No.2, pp.214 - 228

Received: 20 Apr 2018
Accepted: 11 Apr 2019

Published online: 02 Apr 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article