A Stable Linked Structure Flooding for Mobile Ad Hoc Networks with Fault Recovery

The original publication is available at www.springerlink.com International audience Efficient message dissemination in ad hoc networks can be fostered by exploiting stable (sub-)structures. By efficient we mean low network resource usage regarding reachability. In this paper we build a hierarchical...

Full description

Bibliographic Details
Main Authors: Leclerc, Tom, Ciarletta, Laurent, Schaff, André
Other Authors: Management of dynamic networks and services (MADYNES), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Evgeny Osipov, Andreas Kassler, Thomas Michael Bohnert and Xavier Masip-Bruin, ANR-06-TCOM-0028,SARAH,Services Avancés pour Réseaux Ad Hoc(2006)
Format: Conference Object
Language:English
Published: HAL CCSD 2010
Subjects:
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Luleå
Online Access:https://inria.hal.science/inria-00490306
https://inria.hal.science/inria-00490306/document
https://inria.hal.science/inria-00490306/file/SLSFwRecovery-Leclerc.pdf
https://doi.org/10.1007/978-3-642-13315-2
Description
Summary:The original publication is available at www.springerlink.com International audience Efficient message dissemination in ad hoc networks can be fostered by exploiting stable (sub-)structures. By efficient we mean low network resource usage regarding reachability. In this paper we build a hierarchical protocol. We first create single-hop clusters among stable-connected devices. On top of those clusters, we further determine inter-cluster relays (ICR), finally providing an overall stable-connected structure. Our proposed stable linked structure flooding (SLSF) protocol efficiently disseminates data among stable nodes. Additional fault recovery mechanisms are employed to compensate for local intermittent node failures if needed. The experiments show that our approach increases flooding performances with a low bandwidth usage. Furthermore SLSF remains very efficient with or without the fault recovery mechanism that provides robustness.

Similar Items