Improving performance overhead of a trust-clustering key management protocol in ad hoc networks
by Mustapha Sadi; Mourad Amad; Nadjib Badache
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 12, No. 2, 2020

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.

Online publication date: Thu, 02-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com