Abstract: A wireless ad-hoc network consists of several transceivers (nodes)
located in the plane, communicating by radio. The underlying physical topology
of the network depends on the distribution of the wireless nodes (location)
as well as the transmission power (range) assignment of each node.

In this talk we present several range assignment algorithms so that
the induced communication graphs are low cost spanners of the Euclidean graph.
We propose two spanner models: distance and energy. The former aims to minimize
the energy spent by relay nodes in propagating a message, while the latter
minimizes the total distance traveled by a message - implicating a lower delay.

Joint work with Michael Segal.