A stable linked structure flooding for mobile ad hoc networks with fault recovery

Authors:
Tom Leclerc;Laurent Ciarletta;André Schaff
Affiliations:
LORIA, Vandœuvre-les-Nancy Cedex;LORIA, Vandœuvre-les-Nancy Cedex;LORIA, Vandœuvre-les-Nancy Cedex
Venue:
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Year:
2010

Citing 8
Cited 0

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Self Organized Terminode Routing

Cluster Computing
A high performance cluster-based broadcasting algorithm for wireless ad hoc networks based on a novel gateway selection approach

PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
JANE-The Java Ad Hoc Network Development Environment

ANSS '07 Proceedings of the 40th Annual Simulation Symposium
HyTrace Backbone-Assisted Path Discovery in Hybrid Networks

CTRQ '08 Proceedings of the 2008 International Conference on Communication Theory, Reliability, and Quality of Service
NLWCA Node and Link Weighted Clustering Algorithm for Backbone-Assisted Mobile Ad Hoc Networks

ICN '08 Proceedings of the Seventh International Conference on Networking
OLSR and WCPD as Basis for Service Discovery in MANETs

UBICOMM '08 Proceedings of the 2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
SLSF: stable linked structure flooding for mobile ad hoc networks

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.