DocumentCode
1625503
Title
A Distributed Group Mobility Adaptive Clustering Algorithm for Mobile Ad Hoc Networks
Author
Zhang, Yan ; Ng, Jim Mee
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fYear
2008
Firstpage
3161
Lastpage
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
ad hoc networks; distributed algorithms; mobile radio; pattern clustering; MANET; distributed group mobility adaptive clustering algorithm; group mobility pattern; lowest-ID clustering scheme; mobile ad hoc network; Clustering algorithms; Communications Society; Electronic mail; History; Mobile ad hoc networks; Network topology; Paper technology; Partitioning algorithms; Peer to peer computing; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2008. ICC '08. IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2075-9
Electronic_ISBN
978-1-4244-2075-9
Type
conf
DOI
10.1109/ICC.2008.595
Filename
4533631
Link To Document