For any angle α<2π, we show that any connected communication graph that is induced by a set P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.

Additional Metadata
Keywords Communication graph, Directional antennas, Hop spanner, Wireless networks
Persistent URL dx.doi.org/10.1007/s00453-012-9739-y
Journal Algorithmica
Citation
Bose, P, Carmi, P. (Paz), Damian, M. (Mirela), Flatland, R. (Robin), Katz, M.J. (Matthew J.), & Maheshwari, A. (2014). Switching to directional antennas with constant increase in radius and hop distance. Algorithmica, 69(2), 397–409. doi:10.1007/s00453-012-9739-y