We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation.Expand

In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity Δ, and the congestion c of the networks.Expand

Selective families, a weaker variant of superimposed codes [KS64, F92, 197, CR96], have been recently used to design Deterministic Distributed Broadcast (DDB) protocols for unknown radio networks (a radio network is said to be unknown when the nodes know nothing about the network but their own label) .Expand

We introduce stochastic time-dependency in evolving graphs: starting from an arbitrary initial edge probability distribution, at every time step, every edge changes its state (existing or not) according to a two-state Markovian process with probabilities p (edge birth-rate) and q (edge death-rate).Expand

The minimum range assignment problem consists of assigning transmission ranges to the stations of a multi-hop packet radio network so as to minimize the total power consumption provided that the transmission range ensures the strong connectivity of the network (i.e. each station can communicate with any other station by multi-Hop transmission).Expand

We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties.Expand

We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs and observe that the problem remains APX-complete when restricted to dense graph.Expand

We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties and apply it to a class of concrete mobile networks.Expand