Broadcast (distributing a message from a source node to all other nodes) is a fundamental problem in distributed computing. Several solutions for solving this problem in mobile wireless networks are available, in which mobility is dealt with either by the use of randomized retransmissions or, in the case of deterministic delivery protocols, by using conﬂict-free transmission schedules. Randomized solutions can be used only when unbounded delays can be tolerated. Deterministic conﬂictfree solutions require schedule recomputation when topology changes, thus becoming unstable when the topology rate of change exceeds the schedule recomputation rate. The deterministic broadcast protocols we introduce in this paper overcome the above limitations by using a novel mobility-transparent schedule, thus providing a delivery (time) guarantee without the need to recompute the schedules when topology changes. We show that the proposed protocol is simple and easy to implement, and that it is optimal in networks in which assumptions on the maximum number of the neighbors of a node can be made.
A mobility-transparent deterministic broadcast mechanism for Ad Hoc networks / S. Basagni, D. Bruschi, I. Chlamtac. - In: IEEE-ACM TRANSACTIONS ON NETWORKING. - ISSN 1063-6692. - 7:6(1999 Dec), pp. 799-807.
|Titolo:||A mobility-transparent deterministic broadcast mechanism for Ad Hoc networks|
BRUSCHI, DANILO MAURO (Secondo)
|Parole Chiave:||Ad hoc networks ; Broadcast protocols ; Distributed algorithms ; Mobile computing|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni
|Data di pubblicazione:||dic-1999|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/90.811446|
|Appare nelle tipologie:||01 - Articolo su periodico|