Link Availability Based Mobility-Aware Max-Min Multi-Hop Clustering (M4C) for Mobile Ad Hoc Networks

Yuebin BAI  Jun HUANG  Qingmian HAN  Depei QIAN  

IEICE TRANSACTIONS on Communications   Vol.E92-B   No.10   pp.3132-3142
Publication Date: 2009/10/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E92.B.3132
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
mobile ad hoc networks,  clustering,  link availability,  Markov chain model,  

Full Text: PDF>>
Buy this Article

Mobile Ad Hoc Networks (MANETs) have inherently dynamic topologies. Due to the distributed, multi-hop nature of these networks, random mobility of nodes not only affects the availability of radio links between particular node pairs, but also threatens the reliability of communication paths, service discovery, even quality of service of MANETs. In this paper, a novel Markov chain model is presented to predict link availability for MANETs. Based on a rough estimation of the initial distance between two nodes, the proposed approach is able to accurately estimate link availability in a random mobility environment. Furthermore, the proposed link availability estimation approach is integrated into Max-Min d-clustering heuristic. The enhanced clustering heuristic, called M4C, takes node mobility into account when it groups mobile nodes into clusters. Simulation results are given to verify the approach and the performance improvement of clustering algorithm. It also demonstrates the adaptability of M4C, and shows that M4C is able to achieve a tradeoff between the effectiveness of topology aggregation and cluster stabilities. The proposed algorithm can also be used to improve the availability and quality of services for MANETs.