Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29311
Title: Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks
Authors: Cheng, H
Yang, S
Cao, J 
Keywords: Dynamic genetic algorithm
Dynamic load balanced clustering problem (DLBCP)
Dynamic optimization problem (DOP)
Mobile ad hoc network (MANET)
Issue Date: 2013
Publisher: Pergamon Press
Source: Expert systems with applications, 2013, v. 40, no. 4, p. 1381-1392 How to cite?
Journal: Expert systems with applications 
Abstract: Clustering can help aggregate the topology information and reduce the size of routing tables in a mobile ad hoc network (MANET). To achieve fairness and uniform energy consumption, each clusterhead should ideally support the same number of clustermembers. However, a MANET is a dynamic and complex system and its one important characteristic is the topology dynamics, that is, the network topology changes over time due to the factors such as energy conservation and node movement. Therefore, in a MANET, an effective clustering algorithm should efficiently adapt to each topology change and produce the new load balanced clusterhead set quickly. The maintenance of the cluster structure should aim to keep it as stable as possible to reduce overhead. To meet this requirement, the new solution should keep as many good parts in the previous solution as possible. In this paper, we first formulate the dynamic load balanced clustering problem (DLBCP) into a dynamic optimization problem. Then, we propose to use a series of dynamic genetic algorithms (GAs) to solve the DLBCP in MANETs. In these dynamic GAs, each individual represents a feasible clustering structure and its fitness is evaluated based on the load balance metric. Various dynamics handling techniques are introduced to help the population to deal with the topology changes and produce closely related solutions in good quality. The experimental results show that these GAs can work well for the DLBCP and outperform traditional GAs that do not consider dynamic network optimization requirements.
URI: http://hdl.handle.net/10397/29311
ISSN: 0957-4174
EISSN: 1873-6793
DOI: 10.1016/j.eswa.2012.08.050
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

35
Last Week
0
Last month
2
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

29
Last Week
0
Last month
0
Citations as of Aug 22, 2017

Page view(s)

58
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.