A Distributed Group Mobility Adaptive Clustering Algorithm for Mobile Ad Hoc Networks
Authors:
- Y. ZhangYZY. Zhang
- J. M. NgJNJ. M. Ng
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 3161-3165
Abstract
This paper proposes a distributed group mobility adaptive (DGMA) clustering algorithm for mobile ad hoc networks (MANETs) on the basis of a revised group mobility metric, spatial dependency, which is derived from the linear distance of a node's movement instead of its instantaneous speed and direction. In particular, it is suitable for reflecting group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. The proposed clustering scheme aims to form stable clusters by prolonging cluster lifetime and reducing the clustering iterations even in a highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to another widely used clustering approach, the Lowest-ID clustering scheme, in terms of average clusterhead lifetime, average resident time and number of cluster reaffiliations.Keywords
This publication has 5 references indexed in Scilit:
- A Mobility Model with Group Partitioning for Wireless Ad Hoc Networks2005
- Mobility-based d-hop clustering algorithm for mobile ad hoc networks2004
- IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks2003
- Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm2001
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987