Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Mohsin, Mansoor; Cavin, David; Sasson, Yoav; Prakash, Ravi; Schiper, André

doi:10.1109/hicss.2006.413

Cited by 25 publications

(15 citation statements)

References 20 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their correctness rely on strong synchronization or stability assumptions. In [38], deterministic Broadcast in MANETs was studied under the assumption that nodes move in a one-dimensional grid knowing their position. Two deterministic Multicast protocols are presented in [28,41].…”

Section: Previous Workmentioning

confidence: 99%

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

et al. 2012

View full text Add to dashboard Cite

The topic of this paper is the study of information dissemination in mobile ad-hoc networks by means of deterministic protocols. We assume a weak set of restrictions on the mobility of nodes, parameterized by α, the disconnection time, and β, the link stability time, such that the mobile ad-hoc networks considered are connected enough for dissemination. Such a connectivity model generalizes previous models in that we assume much less connectivity, or make explicit the assumptions in previous papers. The protocols studied are classified into three classes: oblivious (the transmission schedule of a node is only a function of its ID), quasi-oblivious (the transmission schedule may also depend on a global time), and adaptive. The main contribution of this work concerns negative results. Contrasting the lower and upper bounds derived, interesting complexity gaps among protocol-classes are observed. These results show that the gap in time complexity between oblivious and quasi-oblivious A preliminary version of this work is included in [21].

show abstract

Section: Previous Workmentioning

confidence: 99%

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

et al. 2012

View full text Add to dashboard Cite

show abstract

“…Finally, reliable broadcasting over mobile grid networks is studied in [15,16]. At each time slot, a node can move from one grid point to an arbitrary adjacent one.…”

Section: Related Theoretical Workmentioning

confidence: 99%

“…• In some theoretical studies [15][16][17], dynamic network models are considered where nodes and edges may change at any time slot. However, such changes are somewhat locally declared in the previous time slot.…”

Section: Our Contributionmentioning

confidence: 99%

Broadcasting in dynamic radio networks

Clementi¹,

Monti²,

Pasquale³

et al. 2009

Journal of Computer and System Sciences

View full text Add to dashboard Cite

It is reasonable to claim that almost all major questions related to radio broadcasting can be considered closed as far as static networks are considered: the network never changes during the entire protocol's execution. On the other hand, theoretical results on communication protocols in any scenario where the network topology may change during protocol's execution (i.e. a dynamic radio network) are very few. In this paper, we present a theoretical study of broadcasting in radio networks having dynamic unknown topology. The dynamic network is modeled by means of adversaries: we consider two of them. We first analyze an oblivious, memoryless random adversary that can be seen as the dynamic version of the average-case study presented by ElsÃ¤sser and Gasieniec in JCSS, 2006. We then consider the deterministic worst-case adversary that, at each time slot, can make any network change (thus the strongest adversary). This is the dynamic version of the worst-case study provided by Bar-Yehuda, Goldreich and Itai in JCSS, 1992. In both cases we provide tight bounds on the completion time of randomized broadcast protocols. Â© 2008 Elsevier Inc. All rights reserved

show abstract

“…In forthcoming papers, we shall present "deterministic" MAC protocols that guarantee the existence of time bounds for channel access delays in the presence of highest traffic density (hence highest contention). Some of them derive from [17], adapted to mobile wireless settings -see [18] for an early example.…”

Section: Existing V2v Communication Protocols Are Not Suitablementioning

confidence: 99%

On the Power of Cohorts -- Multipoint Protocols for Fast and Reliable Safety-Critical Communications in Intelligent Vehicular Networks

Lann

2012

2012 International Conference on Connected Vehicles and Expo (ICCVE)

View full text Add to dashboard Cite

Abstract-We report on recent findings related to safety-critical V2V multipoint communications in ad hoc networks of fully automated vehicles, in the presence of communication failures. Neither classical failure assumptions nor multipoint protocols at the core of existing communication standards can be considered, since they do not meet the high reliability and strict timeliness requirements set for safety-critical scenarios. We introduce a novel unbounded omission failure model, the concept of proxy sets which builds on the cohort construct, and Zebra, a suite of geocast, convergecast, and multicast protocols specifically designed for safety-critical 1-hop multipoint communications. Analytical expressions of worst-case termination time bounds are given for each Zebra protocol, which is mandatory with safety requirements. These results have a number of practical implications, which are discussed. They should be of interest to safety authorities and to the transportation industry involved in future deployments of intelligent vehicular networks.

show abstract

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

Cited by 25 publications

References 20 publications

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

Broadcasting in dynamic radio networks

On the Power of Cohorts -- Multipoint Protocols for Fast and Reliable Safety-Critical Communications in Intelligent Vehicular Networks

Contact Info

Product

Resources

About