OLSR Trees: A Simple Clustering Mechanism for OLSR

Emmanuel Baccelli 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : The main ad hoc routing protocols that were proposed generally provide only flat networks. However the Internet has always been of a hierarchical nature, for scalability and manageability reasons. This paper therefore introduces a simple mechanism providing dynamic clustering with OLSR, one of the MANET routing solutions, chosen for its ease of integration in the Internet infrastructure. This clustering can have many different applications. This work describes how it can be used to provide hierarchical routing with OLSR. However, it is not limited to this use.
Type de document :
Chapitre d'ouvrage
International Federation for Information Processing (IFIP). Challenges in Ad Hoc Networking, 197, Springer, pp.265-274, 2006, 978-0-387-31173-9
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00775902
Contributeur : Emmanuel Baccelli <>
Soumis le : lundi 14 janvier 2013 - 16:44:08
Dernière modification le : mardi 17 avril 2018 - 11:33:45
Document(s) archivé(s) le : lundi 15 avril 2013 - 04:06:55

Fichier

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

Identifiants

  • HAL Id : hal-00775902, version 1

Collections

Citation

Emmanuel Baccelli. OLSR Trees: A Simple Clustering Mechanism for OLSR. International Federation for Information Processing (IFIP). Challenges in Ad Hoc Networking, 197, Springer, pp.265-274, 2006, 978-0-387-31173-9. 〈hal-00775902〉

Partager

Métriques

Consultations de la notice

218

Téléchargements de fichiers

132