Clustering Algorithm Based on Genetic Algorithm in Mobile Ad Hoc Network

In this paper we propose a novel clustering algorithm in mobile adhoc network. By selecting the node optimally in both time connectivity and space connectivity as the cluster head with Genetic Algorithm (GA), the resulting clustering algorithm can provide a generic, stable and lower communication overhead cluster structure for the upper-layer protocols. For this clustering scheme, we give analytical model and evaluate the performance by simulation.

[1]  K. S. Tang,et al.  Genetic Algorithms: Concepts and Designs with Disk , 1999 .

[2]  Sam Kwong,et al.  Genetic Algorithms : Concepts and Designs , 1998 .

[3]  Yang Yun.  A multi-object genetic algorithm of QoS routing , 2004 .

[4]  George Pavlou,et al.  Stable clustering through mobility prediction for large-scale multihop intelligent ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[5]  Tzu-Jane Tsai,et al.  A access-based clustering protocol for multihop wireless ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[6]  Sajal K. Das,et al.  An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).