Connectivity guarantees for wireless networks with directional antennas
From MaRDI portal
Publication:654284
DOI10.1016/j.comgeo.2011.05.003zbMath1233.05123OpenAlexW2060388851MaRDI QIDQ654284
Adi Rosén, Matthew J. Katz, Paz Carmi, Zvi Lotker
Publication date: 28 December 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.05.003
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (19)
A 4-approximation of the \(\frac{2\pi }{3} \)-MST ⋮ Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem ⋮ Symmetric connectivity with directional antennas ⋮ Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas ⋮ Fault-tolerant spanners in networks with symmetric directional antennas ⋮ Improved algorithms in directional wireless sensor networks ⋮ Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas ⋮ Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas ⋮ Connectivity with directional antennas in the symmetric communication model ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ Switching to directional antennas with constant increase in radius and hop distance ⋮ The complexity of symmetric connectivity in directional wireless sensor networks ⋮ Bounded-angle minimum spanning trees ⋮ Minimum Scan Cover with Angular Transition Costs ⋮ Modeling and solving the angular constrained minimum spanning tree problem ⋮ A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST ⋮ Probabilistic connectivity threshold for directional antenna widths ⋮ Probabilistic Connectivity Threshold for Directional Antenna Widths ⋮ Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of a semi-dynamic convex hull algorithm
- Power consumption in packet radio networks
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Angle-restricted tours in the plane.
- Energy-efficient wireless network design
- The Ultimate Planar Convex Hull Algorithm?
- Paths with no Small Angles
- Principles of Distributed Systems
This page was built for publication: Connectivity guarantees for wireless networks with directional antennas