Author | Search for: Aloupis, G.; Search for: Damian, M.; Search for: Flatland, R.; Search for: Korman, M.; Search for: Özkan, Ö.; Search for: Rappaport, D.; Search for: Wuhrer, S.1 |
---|
Affiliation | - National Research Council of Canada. NRC Institute for Information Technology
|
---|
Format | Text, Article |
---|
Conference | 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 10 August 2011 through 12 August 2011, Toronto, ON |
---|
Subject | Aperture angle; Communication graphs; Directional Antenna; Euclidean minimum spanning trees; Optimal radius; Strong connectivity; Strongly connected; Wireless devices; Directive antennas; Optimization; Computational geometry |
---|
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°. |
---|
Publication date | 2011 |
---|
In | |
---|
Language | English |
---|
Peer reviewed | Yes |
---|
NPARC number | 21271114 |
---|
Export citation | Export as RIS |
---|
Report a correction | Report a correction (opens in a new tab) |
---|
Record identifier | 684304f8-5b55-4a87-afaa-bdd5ac04c341 |
---|
Record created | 2014-03-24 |
---|
Record modified | 2020-04-21 |
---|