Connectivity of Graphs Induced by Directional Antennas

This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which antenna angles are fixed at 90 and 180 degrees, and establish upper and lower bounds for the minimum radius necessary to guarantee strong connectivity. In the case of 90-degree angles, we establish a lower bound of 2 and an upper bound of 7. In the case of 180-degree angles, we establish a lower bound of sqrt(3) and an upper bound of 1+sqrt(3). Underlying our results is the assumption that the unit disk graph for S is connected.

💡 Research Summary

The paper investigates a geometric network design problem that arises in wireless sensor and ad‑hoc networks when each node is equipped with a directional antenna of fixed beamwidth. Given a planar point set S, the authors ask: how should each antenna be oriented and what is the smallest transmission radius r that guarantees the directed communication graph induced by the antennas is strongly connected? The study focuses on two canonical beamwidths—90° (quarter‑plane) and 180° (half‑plane)—and assumes that the unit‑disk graph (UDG) of S is already connected, i.e., every point has at least one neighbor within distance 1.

For the 90° case, the authors first construct a worst‑case configuration based on a square grid. By placing points at the corners of unit squares and forcing each antenna to cover only a quarter‑plane, they show that if r < 2, some points cannot reach any neighbor in the required direction, establishing a lower bound of 2. To obtain an upper bound, they design a “spiral” arrangement where each point has at most seven other points within a distance of 7 that lie inside its feasible quarter‑plane. By rotating each antenna appropriately, every vertex can reach at least one of those seven, and the resulting directed graph is provably strongly connected. Hence the radius needed for any planar set S with a connected UDG lies between 2 and 7.

In the 180° case the antenna’s coverage is a half‑plane. The authors use a regular hexagonal tiling to argue the lower bound. The distance between opposite vertices of a hexagon is √3; if r < √3, a point placed at a hexagon’s center cannot communicate with any point in an adjacent cell while respecting the half‑plane orientation, so strong connectivity fails. For the upper bound they observe that any two neighboring hexagon centers are at most √3 apart, and a radius of 1 covers the interior of a cell. Consequently, with r = 1 + √3 every point can reach a neighbor inside its own cell and also a point in each adjacent cell, guaranteeing a strongly connected directed graph.

The paper’s contributions are threefold. First, it translates the physical limitation of antenna beamwidth into precise geometric constraints on the communication radius. Second, it provides constructive proofs for both lower and upper bounds, showing that the bounds are tight up to a constant factor but leaving a noticeable gap (2–7 for 90°, √3–(1+√3) for 180°). Third, it highlights that the connectivity of the underlying undirected UDG is a necessary precondition; without it, no choice of orientation or radius can compensate for isolated components.

The authors discuss several implications. In practice, designers can use the derived bounds to estimate the minimum transmission power required when deploying directional antennas with known beamwidths. The relatively large gap between lower and upper bounds suggests that further refinement—perhaps using more sophisticated point‑set decompositions, probabilistic analysis for random point distributions, or adaptive beam steering—could shrink the interval. Moreover, extending the analysis to arbitrary beamwidths, to three‑dimensional point sets, or to scenarios where antennas can be re‑oriented dynamically would broaden the applicability of the results.

In summary, the paper establishes foundational geometric limits for strong connectivity in directed graphs induced by fixed‑angle antennas, offering both theoretical insight and practical guidance for energy‑efficient network design.