Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Overcoming partitioning in large ad hoc networks using genetic algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Towards connectivity improvement in VANETs using bypass links
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A multi-agent organizational framework for coevolutionary optimization
Transactions on Petri nets and other models of concurrency IV
An overlay approach for optimising small-world properties in VANETs
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
| Hi-index | 0.00 |
This work aims at optimizing injection networks, which consist in adding a set of long-range links (called bypass links) in mobile multi-hop ad hoc networks so as to improve connectivity and overcome network partitioning. To this end, we rely on small-world network properties, that comprise a high clustering coefficient and a low characteristic path length. We investigate the use of two genetic algorithms (generational and steady-state) to optimize three instances of this topology control problem and present results that show initial evidence of their capacity to solve it.