Establishing strong connectivity using optimal radius half-disk antennas

Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer

Research output: Contribution to conferencePaperpeer-review

4 Citations (Scopus)

Abstract

Given a set S of points in the plane representing wireless devices, each point equipped with a directional antenna of radius r and aperture angle α ≥ 180°, our goal is to find orientations and a minimum r for these antennas such that the induced communication graph is strongly connected. We show that r = √ 3 suffices to establish strong connectivity, assuming that the longest edge in the Euclidean minimum spanning tree for S is 1. This result is optimal in the sense that r = √ 3 is necessary in the worst-case for α ∈ [180°; 240°). In contrast, r = 2 is sometimes necessary when α < 180°.

Original languageEnglish
Publication statusPublished - 2011
Event23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 - Toronto, ON, Canada
Duration: 2011 Aug 102011 Aug 12

Other

Other23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
Country/TerritoryCanada
CityToronto, ON
Period11/8/1011/8/12

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Establishing strong connectivity using optimal radius half-disk antennas'. Together they form a unique fingerprint.

Cite this