תקציר
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of antennas employed. Given a set S of transceivers with directional antennas, located in the plane. We investigate two types of directional antennas quadrant antennas and half-strip antennas, and show how to assign a direction to each antenna, such that the resulting communication graph is connected.
שפה מקורית | אנגלית |
---|---|
עמודים | 39-42 |
מספר עמודים | 4 |
סטטוס פרסום | פורסם - 2010 |
אירוע | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 - Winnipeg, MB, קנדה משך הזמן: 9 אוג׳ 2010 → 11 אוג׳ 2010 |
כנס
כנס | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 |
---|---|
מדינה/אזור | קנדה |
עיר | Winnipeg, MB |
תקופה | 9/08/10 → 11/08/10 |