Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

Afonso Ferreira 1 Alfredo Goldman 2 Julian Monteiro 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks' dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model -- the evolving graphs -- was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad-hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.
Type de document :
Article dans une revue
Wireless Networks, Springer Verlag, 2010, 16 (3), pp.627-640. <10.1007/s11276-008-0158-6>
Liste complète des métadonnées


https://hal.inria.fr/inria-00496219
Contributeur : Julian Monteiro <>
Soumis le : mardi 29 juin 2010 - 20:11:25
Dernière modification le : mercredi 30 juin 2010 - 08:27:23
Document(s) archivé(s) le : jeudi 30 juin 2011 - 13:08:04

Fichier

FGM09.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Afonso Ferreira, Alfredo Goldman, Julian Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, Springer Verlag, 2010, 16 (3), pp.627-640. <10.1007/s11276-008-0158-6>. <inria-00496219>

Partager

Métriques

Consultations de
la notice

336

Téléchargements du document

244