By Topic

A Distributed Group Mobility Adaptive Clustering Algorithm for Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. Zhang ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; J. M. Ng

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.

Published in:

2008 IEEE International Conference on Communications

Date of Conference:

19-23 May 2008