Connectivity of Graphs Induced by Directional Antennas - Computer Science > Computational GeometryReport as inadecuate




Connectivity of Graphs Induced by Directional Antennas - Computer Science > Computational Geometry - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper addresses the problem of finding an orientation and a minimumradius for directional antennas of a fixed angle placed at the points of aplanar set S, that induce a strongly connected communication graph. We considerproblem instances in which antenna angles are fixed at 90 and 180 degrees, andestablish upper and lower bounds for the minimum radius necessary to guaranteestrong connectivity. In the case of 90-degree angles, we establish a lowerbound of 2 and an upper bound of 7. In the case of 180-degree angles, weestablish a lower bound of sqrt3 and an upper bound of 1+sqrt3. Underlyingour results is the assumption that the unit disk graph for S is connected.



Author: Mirela Damian, Robin Flatland

Source: https://arxiv.org/







Related documents