A load-balancing and energy-aware clustering algorithm in wireless ad-hoc networks

20Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Wireless ad-hoc network is a collection of wireless mobile nodes dynamically forming a temporary communication network without the use of any existing infrastructure or centralized administration. It is characterized by both highly dynamic network topology and limited energy. So, the efficiency of MANET depends not only on its control protocol, but also on its topology and energy management. Clustering strategy can improve the performance of flexibility and scalability in the network. With the aid of graph theory, genetic algorithm and simulated annealing hybrid optimization algorithm, this paper proposes a new clustering strategy to perform topology management and energy conservation. Performance comparison is made between the original algorithms and our two new algorithms, namely an improved weighting clustering algorithm and a novel Genetic Annealing based Clustering Algorithm (GACA), in the aspects of average cluster number, topology stability, load-balancing and network lifetime. The experimental results show that our clustering algorithms have a better performance on average. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Jin, W., Lei, S., Cho, J., Lee, Y. K., Lee, S., & Zhong, Y. (2005). A load-balancing and energy-aware clustering algorithm in wireless ad-hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 1108–1117). https://doi.org/10.1007/11596042_113

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