Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks

H Cheng, S Yang - 2011 IEEE symposium on computational …, 2011 - ieeexplore.ieee.org
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 even energy consumption …

Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks

H Cheng, S Yang - 2011 - bura.brunel.ac.uk
In recent years, the static shortest path (SP) problem has been well addressed using
intelligent optimization techniques, eg, artificial neural networks, genetic algorithms (GAs) …

Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks

H Cheng, S Yang - 2011 IEEE Symposium on Computational Intelligence … - infona.pl
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 even energy consumption …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - academia.edu
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - Citeseer
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - scholar.archive.org
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - core.ac.uk
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - scholar.archive.org
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …

[PDF][PDF] Genetic Algorithms with Elitism-based Immigrants for Dynamic Load Balanced Clustering Problem in Mobile Ad Hoc Networks

H Cheng, S Yang - Citeseer
Clustering can help aggregate the topology infor-mation and reduce the size of routing
tables in a mobile ad hoc network (MANET). To achieve fairness and even energy …