Broadcasting with random faults
Discrete Applied Mathematics
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Using Network Fault Predictions to Enable IP Traffic Management
Journal of Network and Systems Management
Sparse networks supporting efficient reliable broadcasting
Nordic Journal of Computing
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Communication in networks with random dependent faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Broadcasting in sensor networks of unknown topology in the presence of swamping
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio stations with the same communication range, distributed in a random uniform way on a unit square region. In order to capture fault dependencies, we introduce the ranged spotmodel in which damaging events, called spots, occur randomly and independentlyon the region, causing faults in all nodes located within distance sfrom them. Node faults within distance 2sbecome dependent in this model and are positively correlated. We investigate the impact of the spot arrival rate on the feasibility and the time of communication in the fault-free part of the network. We provide an algorithm which broadcasts correctly with probability 1 驴 驴in faulty random geometric radio networks of diameter Din time O(D+ log1/驴).