Clustering algorithm based on Genetic Algorithm in mobile ad hoc network

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Shang, Y., & Cheng, S. (2005). Clustering algorithm based on Genetic Algorithm in mobile ad hoc network. In Lecture Notes in Computer Science (Vol. 3645, pp. 968–977). Springer Verlag. https://doi.org/10.1007/11538356_100

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free