Short and Robust Communication Paths in Dynamic Wireless Networks - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Short and Robust Communication Paths in Dynamic Wireless Networks

Résumé

We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.
Fichier principal
Vignette du fichier
Ants2010-Pigne-Guinand.pdf (158.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00553243 , version 1 (06-01-2011)

Identifiants

  • HAL Id : hal-00553243 , version 1

Citer

Yoann Pigné, Frédéric Guinand. Short and Robust Communication Paths in Dynamic Wireless Networks. Dorigo, Marco and et al. Swarm Intelligence, Springer Berlin / Heidelberg, pp.520-527, 2010. ⟨hal-00553243⟩
89 Consultations
100 Téléchargements

Partager

Gmail Facebook X LinkedIn More