A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant distributed protocols, we provide an OðDnÞ lower bound where n is the number of nodes of the network and D is the source eccentricity in the fault-free part of the network. Rather surprisingly, this lower bound implies that the simple Round Robin protocol, working in OðDnÞ time, is an optimal fault-tolerant obliviousdoi:10.1016/j.jpdc.2003.09.002 fatcat:atpnlglv7jchppyrioi6ekfc5u