| Auteur | Rechercher : Aloupis, G.; Rechercher : Damian, M.; Rechercher : Flatland, R.; Rechercher : Korman, M.; Rechercher : Özkan, Ö.; Rechercher : Rappaport, D.; Rechercher : Wuhrer, S.1 |
|---|
| Affiliation | - Conseil national de recherches du Canada. Institut de technologie de l'information du CNRC
|
|---|
| Format | Texte, Article |
|---|
| Conférence | 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 10 August 2011 through 12 August 2011, Toronto, ON |
|---|
| Sujet | Aperture angle; Communication graphs; Directional Antenna; Euclidean minimum spanning trees; Optimal radius; Strong connectivity; Strongly connected; Wireless devices; Directive antennas; Optimization; Computational geometry |
|---|
| Résumé | 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°. |
|---|
| Date de publication | 2011 |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 21271114 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 684304f8-5b55-4a87-afaa-bdd5ac04c341 |
|---|
| Enregistrement créé | 2014-03-24 |
|---|
| Enregistrement modifié | 2020-04-21 |
|---|
