• Aucun résultat trouvé

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

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Improving performance overhead of a trust-clustering key management protocol in ad hoc networks"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

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

Authors

Mustapha Sadi, Mourad Amad, Nadjib Badache Publication date

2020 Journal

International Journal of Electronic Security and Digital Forensics Volume 12 Issue 2 Pages 214-228 Publisher

Inderscience Publishers (IEL) Description

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 …

Références

Télécharger maintenant ( PDF - 1 Page - 248.01 KB )

Documents relatifs

Designing routing protocol for mobile ad hoc networks

An alter- native simple loop-free bandwidth-efficient distributed routing algorithm, denoted as distributed dynamic routing (DDR), is also presented which can provide a

Investigating Data Broadcast Performance in Mobile Ad Hoc Networks

Reverse Path Forwarding Flooding [4] (RPF) augments the mechanism of CF by the requirement that a node may only forward a packet if the “previous hop” of the packet is on the

Theoretical results on flooding performance in mobile ad hoc networks

Figure 2: average number of correct reception in independence hypothesis with respect to relay node density D (expressed in inverse of average area σ λ 0

A secure architecture for mobile ad hoc networks

We use the combination of fully self-organized security for trust model like PGP adapted to ad-hoc technology and the cluster- ing algorithm which is based on the use of trust

A Survey on Identity-based Key Management Schemes in Mobile Ad hoc networks

To support more flexible cryptographic algorithms, encryption systems and node multiple keys, a new identity-based node key management scheme combined with next generation pro-

Clustering-Based Data in Ad-hoc Networks

If the node has the maximum γ among its neighbors then it becomes the cluster-head (Status = CH) and sends requests to join the cluster to the other. If the node receives

A Self-stabilizing Protocol for an Ad hoc Networks of Mobile Robots

However, due to the values of the timer, it may happen that for a state e with M ( e ) being deadlock-free, a M ISS action happens (for instance, on timer expiration of a waiting

A Survey of Connectivity in Mobile Ad Hoc Networks

However it is possible to compute probability density function of the nodes moving according to random waypoint mobility model within an environment closed, bounded, limited and