DocumentCode
2502817
Title
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Author
Tolba, Fatiha Djemili ; Magoni, Damien ; Lorenz, Pascal
Author_Institution
Univ. of Haute Alsace, Colmar
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
2786
Lastpage
2790
Abstract
In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The aim of CEMCA consists in appropriately choosing the cluster head to reduce routing overhead. In order to reduce traffic and energy consumption, the control messages are sent only when needed, according to the speed of the node. Each node has a quality that indicates its suitability as a cluster head. This quality takes into account the node connectivity, battery energy and mobility. These parameters are very important for the stability of the cluster. Simulation experiments are carried out to validate our algorithm in terms of stability of the clusters and their members and the quality of the connectivity. The results are compared to a previous approach called Weight Clustering Algorithm (WCA) and they show that CEMCA is performing better.
Keywords
ad hoc networks; mobile radio; pattern clustering; telecommunication network routing; telecommunication traffic; Weight Clustering Algorithm; connectivity, energy and mobility driven clustering algorithm; mobile ad hoc networks; routing overhead reduction; traffic reduction; Ad hoc networks; Batteries; Clustering algorithms; Communication system traffic control; Energy consumption; Mobile ad hoc networks; Network topology; Nominations and elections; Routing; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.527
Filename
4411437
Link To Document