A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks

Authors:
Romain Mellier;Jean-Frederic Myoupo
Affiliations:
LaRIA, CNRS FRE 2733, Amiens Cedex, 1, France;LaRIA, CNRS FRE 2733, Amiens Cedex, 1, France
Venue:
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2005

Citing 8
Cited 1

On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
Broadcast Protocols for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents distributed broadcast algorithms for Mobile Ad Hoc NETworks (MANETs for short) with unknown time-varying topology. The first one is an improvement of a protocol of Basagni, Bruschi and Chlamtac (1999), solving in an other way the problem of sharing communication channels. The second one introduces a technique inspired by the Magic Packet technology presented by AMD in 1995 and the principle of controlled-mobility to minimize the energy consumption of mobiles. The last one improves this mechanism to save much more energy. We show that each of these algorithms need at most O(n.log n) broadcast rounds in a complete layered MANET.