Secured Clustering Algorithm for Mobile Ad Hoc Networks

Summary Future Mobile ad hoc networks may increase in size to reach the threshold of thousands of nodes per system (commercial or military). A way to handle this increasing number of nodes is to manage them in a hierarchically structure also called clustering. In this paper, we propose a secured weight-based clustering algorithm allowing more effectiveness, protection and trust in the management of cluster size variation. This algorithm is called Secured Clustering Algorithm (SCA), since it includes security requirements by using a trust value defining how much any node is trusted by its neighbourhood, and using the certificate as node’s identifier to avoid any possible attacks (Spoofing). SCA elects cluster-head according to its weight computed by combining a set of system parameters (Stability, Battery, Degree … etc). It also overcomes some limits in existed algorithms by defining new mechanisms as cluster division, merging diminution and extension. We also propose to use efficient flooding to send beacons within the cluster to avoid overhead due to flooding. SCA forms a hierarchical structure which can be used for both security and routing protocols.

[1]  Jinyang Li,et al.  Cluster Based Routing Protocol(CBRP) Functional Specification , 1999 .

[2]  Panagiotis Papadimitratos,et al.  Secure data communication in mobile ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

[3]  Hans-Joachim Hof,et al.  A cluster-based security architecture for ad hoc networks , 2004, IEEE INFOCOM 2004.

[4]  N. Beijar Zone Routing Protocol ( ZRP ) , 2002 .

[5]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[6]  Peng Wei,et al.  A Cluster-Based Multipath Routing for MANET , 2004 .

[7]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[8]  Haiyun Luo,et al.  Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks , 2000 .

[9]  Winston Khoon Guan Seah,et al.  Mobility-based d-hop clustering algorithm for mobile ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[10]  Mario Gerla,et al.  EFFICIENT FLOODING IN AD HOC NETWORKS USING ON-DEMAND (PASSIVE) CLUSTER FORMATION , 2003 .

[11]  Silvia Giordano,et al.  Mobile ad hoc networks , 2002 .

[12]  Béatrice Paillassa,et al.  A Cluster Procedure for the Dynamic Source Routing Protocol in Ad hoc Networks , 2004 .

[13]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[14]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.