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. In particular, we consider thisâ€¦ (More)

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â€¦ (More)

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a 4xed sourceâ€¦ (More)

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)â€¦ (More)

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â€¦ (More)

Given a set S of radio stations located on a line and an integer h (1 â‰¤ h â‰¤ |S| âˆ’ 1), the Min Assignment problem is to find a range assignment of minimum power consumption provided that any pair ofâ€¦ (More)

One of the main benefits of power controlled ad-hoc wireless networks is their ability to vary the range in order to reduce the power consumption. Minimizing energy consumption is crucial on suchâ€¦ (More)

We consider a Mobile Ad-hoc NETworks (MANET) formed by n nodes that move independently at random over a finite square region of the plane. Nodes exchange data if they are at distance at most r withinâ€¦ (More)

We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that for a suuciently large B, the recent 16/15â€¦ (More)