Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 1st Edition by Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri ISBN 9783540744566

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 1st Edition by Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri – Ebook PDF Instant Download/Delivery. 9783540744566
Full download Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 1st Edition after payment

Product details:

ISBN 10: 
ISBN 13: 9783540744566
Author: Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri

We study deterministic fault-tolerant gossiping protocols in directed Geometric Radio Networks (in short, directed GRN). Unpredictable node and link faults may happen during every time slot of the protocol’s execution.

We first consider the single-message model where every node can send at most one message per time slot. We provide a protocol that, in any directed GRN G of n nodes, completes gossiping in O(n Δ) time (where Δ is the maximal in-degree of G) and has message complexity O(n ²). Both bounds are then shown to be optimal.

As for the combined-message model, we give a protocol working in optimal completion time O(DΔ) (where D is the maximal source eccentricity) and message complexity O(Dn). Finally, our protocol performs the (single) broadcast operation within the same optimal time and optimal message complexity O(n).

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 1st Table of contents:

1 Introduction
2 Collision-free families and fault-tolerant gossiping
3 Explicit constructions of collision-free families
4 Optimal Bounds
5 Future work

People also search for Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 1st:

optimal gossiping in directed geometric
    
optimal structure identification with greedy search
    
gossiping algorithm
    
optimal spatial policies geography and sorting
    
optimal algorithms for decentralized stochastic variational inequalities