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 spot model in which damaging events, called spots, occur randomly and independently on the region, causing faults in all nodes located within distance s from them. Node faults within distance 2s become 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 algor...
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It con...
Wireless networks in which the node locations are random are best modelled as random geometric graph...
Abstract. In this paper we study connectivity in wireless ad-hoc networks by modeling the network as...
We study the feasibility and time of communication in random geometric radio networks, where nodes f...
The aim of this paper is to study communication in networks where nodes fail in a random dependent w...
The line-of-sight networks is a network model introduced recently by Frieze et al. It considers wire...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
In this paper we analyze the computational power of random geometric networks in the presence of ran...
We study the connectivity and diameter of the fault-free part of n-node networks where nodes fail in...
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration ...
We study deterministic fault-tolerant gossiping protocols in geometric radio networks. Node and link...
Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
We study the complexity of distributed protocols for the classical information dissemination problem...
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It con...
Wireless networks in which the node locations are random are best modelled as random geometric graph...
Abstract. In this paper we study connectivity in wireless ad-hoc networks by modeling the network as...
We study the feasibility and time of communication in random geometric radio networks, where nodes f...
The aim of this paper is to study communication in networks where nodes fail in a random dependent w...
The line-of-sight networks is a network model introduced recently by Frieze et al. It considers wire...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
We consider broadcasting in radio networks that are subject to permanent node failures of unknown lo...
In this paper we analyze the computational power of random geometric networks in the presence of ran...
We study the connectivity and diameter of the fault-free part of n-node networks where nodes fail in...
In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration ...
We study deterministic fault-tolerant gossiping protocols in geometric radio networks. Node and link...
Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are...
AbstractWe consider the problem of broadcasting in an n-vertex graph a message that originates from ...
We study the complexity of distributed protocols for the classical information dissemination problem...
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It con...
Wireless networks in which the node locations are random are best modelled as random geometric graph...
Abstract. In this paper we study connectivity in wireless ad-hoc networks by modeling the network as...