A mobility aware technique for clustering on mobile ad-hoc networks

Authors:
Charalampos Konstantopoulos;Damianos Gavalas;Grammati Pantziou
Affiliations:
Research Academic Computer Technology Institute and, University of Patras, Greece;Department of Cultural Technology and Communication, University of the Aegean, Greece;Department of Informatics, Technological Education Institution of Athens, Greece
Venue:
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Year:
2006

Citing 7
Cited 4

Text compression

Text compression
Multicluster, mobile, multimedia radio network

Wireless Networks
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks

Wireless Networks - Selected Papers from Mobicom'99
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks

ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
A mobility-based framework for adaptive clustering in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction

Computer Networks: The International Journal of Computer and Telecommunications Networking
CASAN: Clustering algorithm for security in ad hoc networks

Computer Communications
REputation based Clustering Algorithm for security management in ad hoc networks with liars

International Journal of Information and Computer Security
Survey Flying Ad-Hoc Networks (FANETs): A survey

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering for mobile ad-hoc networks (MANETs) has attracted the interest of many researchers as it offers enhanced scalability and performance improvement. The main challenge of the clustering algorithms is the formation of stable clusters despite the topological changes due to the host mobility. In this paper, we present a novel clustering algorithm, which first predicts the future host mobility and then uses this information to build a stable clustering structure over hosts that will probably exhibit low mobility in the future. In this way, long lifetime for the clustering structure is guaranteed, thereby eliminating the need for frequent reclustering. For predicting the future host mobility, we use provably good information theoretic techniques, which allow on-line learning of a reliable probabilistic model for future mobility.