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)

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)

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)

Given a setS of radio stations located on a line and an integer h 1, the MIN ASSIGNMENTproblem consists in finding a range assignment of minimum power consu mption provided that any pair of stationsâ€¦ (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)

Given a finite set S of points (i.e. the stations of a radio network) on the plane and a positive integer 1 â‰¤ h â‰¤ |S| âˆ’ 1, the 2d Min h R. Assign. problem consists of assigning transmission ranges toâ€¦ (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)