This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Conference on Systems and Networks Communications (ICSNC 2007)
A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks
Cap Esterel, France
August 25-August 31
ISBN: 0-7695-2938-0
Fatiha Djemili Tolba, UHA/GRTC, France
Damien Magoni, ULP/LSIIT, France
Pascal Lorenz, UHA/GRTC, France
The dynamic topology of ad hoc networks is an important issue on which a lot of research is carried out. Because of higher speeds of movement and networks of larger scale, the algorithms of auto-organization and clustering may be inefficient. Therefore, we propose a fully distributed clustering algorithm for mobile ad hoc networks in which the nodes can move at higher speeds. The main objectives of this algorithm consists in reducing the reconstruction of the topology and stabilizing it as a long time as possible. This clustering algorithm can be used by several routing algorithms for ad hoc networks. Under proper simulations, we show that optimal cluster head characteristics: connectivity, energy and mobility, lead to a stable topology in terms of reconfiguration frequency.
Citation:
Fatiha Djemili Tolba, Damien Magoni, Pascal Lorenz, "A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks," icsnc, pp.11, Second International Conference on Systems and Networks Communications (ICSNC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.