Clustering Overhead and Convergence Time Analysis of the Mobility-based Multi-Hop Clustering Algorithm for Mobile Ad Hoc Networks

Authors:
Inn Inn ER;Winston K. G. Seah
Affiliations:
Institute for Infocomm Research Agency for Science Technology and Research Singapore;Department of Computer Science School of Computing National University of Singapore
Venue:
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Year:
2005

Citing 0
Cited 1

Review: Behavior of Ad Hoc routing protocols, analyzed for emergency and rescue scenarios, on a real urban area

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the emergence of large mobile ad hoc networks, the ability of existing routing protocols to scale well and function satisfactorily comes into question. Clustering has been proposed as a means to divide large networks into groups of suitably smaller sizes such that prevailing MANET routing protocols can be applied. However, the benefits of clustering come at a cost. Clusters take time to form and the clustering algorithms also introduce additional control messages that contend with data traffic for the wireless bandwidth. In this paper, we aim to analyze a distributed multi-hop clustering algorithm, Mobilitybased D-Hop(MobDHop), based on two key clustering performance metrics and compare it with other popular clustering algorithms used in MANETs. We show that the overhead incurred by multi-hop clustering has a similar asymptotic bound as 1-hop clustering while being able to reap the benefits of multi-hop clusters.