By Topic

An enhanced algorithm for MANET clustering based on multi hops and network density

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hajami, A. ; Nat. Sch. of Comput. & Syst. Anal., Rabat, Morocco ; Oudidi, K. ; Elkoutbi, M.

Mobile ad hoc networks (MANETs) have been proposed as an extremely flexible technology tor establishing wireless communications. In comparison with fixed networks, some new security issues have arisen with the introduction of MANETs. Secure routing, in particular, is an important and complicated issue. Clustering is commonly used in order to limit the amount of secure routing information. In this work, we propose an enhanced solution for ad hoc clustering based on multi hops and network density. This solution will be used as a framework to manage cryptographic keys in a distributed way. This paper details the density-based clustering algorithm for the standard OLSR protocol. Our algorithm takes into account the node mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reduced and less mobile cluster heads that will serve for keys exchange.

Published in:

New Technologies of Distributed Systems (NOTERE), 2010 10th Annual International Conference on

Date of Conference:

May 31 2010-June 2 2010