Switching to directional antennas with constant increase in radius and hop distance

DOI10.1007/s00453-012-9739-yzbMath1360.68640OpenAlexW2010596631MaRDI QIDQ517801

Anil Maheshwari, Prosenjit Bose, Mirela Damian, Paz Carmi, Matthew J. Katz, Robin Y. Flatland

Publication date: 27 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9739-y

zbMATH Keywords

wireless networkscommunication graphdirectional antennashop spanner

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Fault-tolerant spanners in networks with symmetric directional antennas ⋮ Capacitated covering problems in geometric spaces ⋮ Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas ⋮ Unique Coverage with Rectangular Regions ⋮ Bounded-angle minimum spanning trees ⋮ Capacitated Covering Problems in Geometric Spaces

Cites Work

• Connectivity guarantees for wireless networks with directional antennas
• Ice-creams and wedge graphs
• SPANNING PROPERTIES OF GRAPHS INDUCED BY DIRECTIONAL ANTENNAS
• Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
• The Floodlight Problem
• Maintaining Connectivity in Sensor Networks Using Directional Antennae