SPANNING PROPERTIES OF GRAPHS INDUCED BY DIRECTIONAL ANTENNAS

DOI10.1142/S1793830913500080zbMath1276.05113OpenAlexW2009782889MaRDI QIDQ2864850

Mirela Damian, Robin Y. Flatland

Publication date: 26 November 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830913500080

zbMATH Keywords

strong connectivityspannerdirectional antenna

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Detection theory in information and communication theory (94A13) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (9)

Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem ⋮ Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas ⋮ Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas ⋮ Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas ⋮ Unique Coverage with Rectangular Regions ⋮ Switching to directional antennas with constant increase in radius and hop distance ⋮ Bounded-angle minimum spanning trees ⋮ Probabilistic Connectivity Threshold for Directional Antenna Widths ⋮ Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae

Cites Work

• Minimum connected dominating sets and maximal independent sets in unit disk graphs

This page was built for publication: SPANNING PROPERTIES OF GRAPHS INDUCED BY DIRECTIONAL ANTENNAS