Optimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms

Simple item page
dc.creatorDanoy, Gregoire
dc.creatorBouvry, Pascal
dc.creatorBrust, Matthias R.
dc.creatorAlba, Enrique
dc.date2007-07-20
dc.date.accessioned2026-07-07T08:19:23Z
dc.date.available2026-07-07T08:19:23Z
dc.descriptionThis 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.
dc.description1 page, 1 figure
dc.identifierhttps://arxiv.org/abs/0707.3030
dc.identifierhttp://arxiv.org/abs/0707.3030
dc.identifierGenetic and Evolutionary Computation Conference (GECCO 2007), ISBN 978-1-59593-697-4
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134744
dc.subjectNeural and Evolutionary Computing
dc.subjectArtificial Intelligence
dc.subjectNetworking and Internet Architecture
dc.subjectI.2.8
dc.titleOptimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms
dc.typetext

Files

Collections

arXiv