Strong connectivity of sensor networks with double antennae

DOI10.1016/j.tcs.2015.02.017zbMath1332.68169OpenAlexW2173002974MaRDI QIDQ896697

Fraser MacQuarrie, Oscar Morales-Ponce, Lata Narayanan, Evangelos Kranakis, Mohsen Eftekhari

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.017

zbMATH Keywords

connectivityrangeunit disk graphstretch factordouble antenna

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• The square of every two-connected graph is Hamiltonian
• Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
• STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE
• Stretch Factor in Wireless Sensor Networks with Directional Antennae
• The capacity of wireless networks
• Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
• Maintaining Connectivity in Sensor Networks Using Directional Antennae
• Principles of Distributed Systems

This page was built for publication: Strong connectivity of sensor networks with double antennae