Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks Under Attack

Tselikis, C.; Mitropoulos, Sarandis; Komninos, Nikos; Douligeris, Christos

doi:10.1109/lcomm.2012.031912.112484

Cited by 31 publications

(16 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…b) Secondly, by exploiting the inherent characteristics of the wireless ad hoc network. To reduce the expensive rekeying calculations, we recommend to utilize the periodic hello messages which the ad hoc nodes (e.g., sensors) broadcast for building their two-hop Neighboring Lists [15]. The cluster head can utilize the Neighboring Lists to predict which are the distant mobile nodes that have the largest probability to join the cluster.…”

Section: Re-keying and Ckdsmentioning

confidence: 99%

Adaptation of a Conference Key Distribution System for the wireless ad hoc network

Tselikis

Douligeris

Mitropoulos

et al. 2017

2017 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

This is the accepted version of the paper.This version of the publication may differ from the final published version. Abstract-In this paper we review previous works done with respect to Conference Key Distribution Systems (CKDS). We focus on the system proposed by Kim et al. and we propose improvements on that scheme a) from the perspective of security and anonymity, b) from the perspective of efficient calculation of the Lagrange polynomial coefficients, and c) from the perspective of adaptation into the dynamic wireless ad hoc network. The security of the proposed scheme is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the pseudo-randomness of user coordinates. We demonstrate the effectiveness of the proposed scheme through the analysis of characteristic attack scenarios. Permanent repository link

show abstract

Section: Re-keying and Ckdsmentioning

confidence: 99%

Adaptation of a Conference Key Distribution System for the wireless ad hoc network

Tselikis

Douligeris

Mitropoulos

et al. 2017

2017 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors discussed in detail different type of node misbehaviors in MANET and WSN, bootstrapping mechanisms, trust evidence, trust computation and interactive decision making methods. Tselikis et al [5] developed degree-based clustering algorithm for the nodes in MANET. This method was attack-resistant without imposing significant overhead to the clustering performance.…”

Section: Literature Surveymentioning

confidence: 99%

Malicious Nodes Detection in MANET Using Back-Off Clustering Approach

Rajeswari¹,

Kulothungan²,

Ganapathy³

et al. 2016

View full text Add to dashboard Cite

Mobile Ad hoc Networks (MANET) are infrastructure less networks which provide multi-hop wireless links between nodes. The main applications of MANET in real time environment are military and emergency areas where the fixed infrastructure is not required. It is a temporary communication infrastructure network for quick communication with minimal configuration settings among the group of nodes. The security is one of the primary concerns in MANET. The malicious nodes in MANET environment degrade the performance of the network. In this paper, the nodes in MANET are grouped using back-off duration technique and further the malicious nodes are detected using this algorithm. The proposed clustering based malicious nodes detection in MANET achieves higher performance in terms of packet delivery ratio, latency and energy consumption. The proposed method achieves 89.35% of packet delivery ratio, 36.2 ms latency and 26.91 mJ of energy consumption.

show abstract

“…We adopt here for candidate selection a weighted clustering variable V i which is a simplified variation of the clustering criterion defined in [8]. In more detail, we assume that the energy e i along with the connectivity degree d i of each node i are included in the hello broadcasts.…”

Section: A Local Candidate Selectionmentioning

confidence: 99%

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Komninos

Tselikis

Douligeris

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results.

show abstract

Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks Under Attack

Cited by 31 publications

References 4 publications

Adaptation of a Conference Key Distribution System for the wireless ad hoc network

Adaptation of a Conference Key Distribution System for the wireless ad hoc network

Malicious Nodes Detection in MANET Using Back-Off Clustering Approach

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Contact Info

Product

Resources

About