In mobile ad hoc networks (MANETs), the network topology is autonomously formed and continuously changes, due to the mobility of the nodes. Clustering allows us to organize the topology in a structured manner. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence reconfiguration of the system is often unavoidable. Several existing on-demand clustering algorithms update that topology if needed. In this paper, we aim to anticipate these updates by predicting the mobility of the nodes, so we propose a new distributed Mobility Prediction-based Weighted Clustering Algorithm based on an on-demand distributed clustering algorithm. Simulation experiments are conducted to evaluate performances of our algorithm and compare them to those of the weighted clustering algorithm (WCA), which does not consider prediction. Results show that our algorithm performs better than WCA, in terms of updates of the dominant set, handovers of a node between two clusters and average number of clusters in a dominant set..
[1]
Sajal K. Das,et al.
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
,
2002,
Cluster Computing.
[2]
Mario Gerla,et al.
GloMoSim: a library for parallel simulation of large-scale wireless networks
,
1998
.
[3]
Jörg Habetha,et al.
Central controller handover procedure for ETSI-BRAN HiperLAN/2 ad hoc networks and clustering with quality of service guarantees
,
2000,
2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).
[4]
Arkady Zaslavsky,et al.
Link State Routing Protocol with Cluster Based Flooding for Mobile Ad-hoc Computer Networks
,
1998
.
[5]
Tzu-Jane Tsai,et al.
A access-based clustering protocol for multihop wireless ad hoc networks
,
2001,
IEEE J. Sel. Areas Commun..
[6]
Mario Gerla,et al.
Multicluster, mobile, multimedia radio network
,
1995,
Wirel. Networks.
[7]
M. Jiang,et al.
Cluster based routing protocol (CBRP)
,
1999
.