Multicluster, mobile, multimedia radio network
Wireless Networks
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Genetic Algorithms for Tracking Changing Environments
Proceedings of the 5th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Comparative Study of Steady State and Generational Genetic Algorithms
Selected Papers from AISB Workshop on Evolutionary Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
Designing Evolutionary Algorithms for Dynamic Environments
Designing Evolutionary Algorithms for Dynamic Environments
Population-based incremental learning with memory scheme for changing environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Memory-based immigrants for genetic algorithms in dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Evolutionary Computation in Dynamic and Uncertain Environments (Studies in Computational Intelligence)
Forking genetic algorithms: Gas with search space division schemes
Evolutionary Computation
NLWCA Node and Link Weighted Clustering Algorithm for Backbone-Assisted Mobile Ad Hoc Networks
ICN '08 Proceedings of the Seventh International Conference on Networking
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments
Evolutionary Computation
A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks
Journal of Network and Systems Management
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
A load balance K-hop clustering algorithm for ad hoc networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A cluster-based trust-aware routing protocol for mobile ad hoc networks
Wireless Networks
A biologically inspired sensor wakeup control method for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Zone-Based clustering for intrusion detection architecture in ad-hoc networks
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
A Position-Based Clustering Technique for Ad Hoc Intervehicle Communication
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Evolutionary algorithms + domain knowledge = real-world evolutionary computation
IEEE Transactions on Evolutionary Computation
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
IEEE Transactions on Evolutionary Computation
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A PSO algorithm for constrained redundancy allocation in multi-state systems with bridge topology
Computers and Industrial Engineering
Hi-index | 12.05 |
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.