This paper considers the following Neighborhood Broadcast problem: Distribute a message to all neighbors of a network node v under the assumption that v does not participate due to being corrupted or damaged. We present practical network... more
This paper considers the following Neighborhood Broadcast problem: Distribute a message to all neighbors of a network node v under the assumption that v does not participate due to being corrupted or damaged. We present practical network protocol that can be used completely reactive. It is parameterized with a positive integer k ∈ N and it is proven to guarantee delivery for k ≥ 2d − 1, if node v is d-locally connected, which means that the set of nodes with distance between 1 and d to v induces a connected subgraph of the communication graph. It is also shown that the number of participating nodes is optimal under the restriction to 1-hop neighborhood information. The protocol is also analyzed in simulations that demonstrate very high success rates for very low values of k. K EYWORDS ad-hoc sensor network, network protocols, fault tolerance, failure recovery, neighborhood broadcast
