Coevolutionary genetic algorithms for Ad hoc injection networks design optimization

Abstract

Abstract-When considering realistic mobility patterns, nodes in mobile ad hoc networks move in such a way that the networks most often get divided in a set of disjoint partitions. This presence of partitions is an obstacle to communication within these networks. Ad hoc networks are generally based on technologies allowing nodes in a geographical neighborhood to communicate for free, in a P2P manner. These technologies include IEEE802.11 (Wi-Fi), Bluetooth, etc. In most cases a communication infrastructure is available. It can be a set of access point as well as GMS/UMTS network. The use of such an infrastructure is billed, but it permits distant nodes to get in communication, through what we call "bypass links". The objective of our work is to improve the network connectivity by defining a set of long distance connections. To do this we consider the number of bypass links, as well as the two properties that build on the "small-world" graph theory: the clustering coefficient, and the characteristic path length. A fitness function, used for genetic optimization, is processed out of these three metrics. In this paper we investigate the use of two Coevolutionary Genetic Algorithms (LCGA and CCGA) and compare their performance to a generational and a steadystate genetic algorithm (genGA and ssGA) for optimizing one instance of this topology control problem and present evidence of their capacity to solve it.

An Overlay Approach for Optimising Small-World Properties in VANETs

“…First, we propose a new paradigm based on an overlay-graph approach to cope with Watts original re-wiring process [19]. This new approach extends previous work [8,9,10] with a more realistic injection point model. Second, we tackle the problem in a multi-objective fashion with a well-known algorithm, namely NSGAII [11], in order to obtain a set of good compromise solutions.…”