We consider the following Antenna Orientation Problem: Given a connected Unit Disk Graph (UDG) formed by n identical omnidirectional sensors, what is the optimal range (or radius) which is necessary and sufficient for a given antenna beamwidth (or angle) ϕ so that after replacing the omnidirectional sensors by directional antennas of beamwidth ϕ it is possible to find an appropriate orientation of each antenna so that the resulting graph is strongly connected?In this paper we study beamwidth/range tradeoffs for the Antenna Orientation Problem. Namely, for the full range of angles in the interval [0, 2π] we compare the antenna range provided by an orientation algorithm to the optimal possible for the given beamwidth. We propose new antenna orientation algorithms that ensure improved bounds for given angle ranges and analyze their complexity. We also examine the Antenna Orientation Problem with Constant Stretch Factor, where we wish to optimize both the transmission range and the hop-stretch factor of the induced communication network. We present approximations to this problem for antennas with angles π/2 ≤ ϕ ≤ 2π.

Additional Metadata
Keywords (2, ϕ)-Connectivity, Antenna Orientation Problem, Beamwidth, Connectivity, Directional antenna, Stretch factor, Wireless sensor networks
Persistent URL dx.doi.org/10.1016/j.tcs.2015.04.035
Journal Theoretical Computer Science
Kranakis, E, MacQuarrie, F. (Fraser), & Morales Ponce, O. (Oscar). (2015). Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae. Theoretical Computer Science, 590, 55–72. doi:10.1016/j.tcs.2015.04.035