STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE

DOI10.1142/S1793830912500383zbMath1253.68031MaRDI QIDQ3166749

Stefan Dobrev, Oscar Morales-Ponce, Ladislav Stacho, Jaroslav Opatrny, Danny Krizanc, Evangelos Kranakis

Publication date: 15 October 2012

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

zbMATH Keywords

NP-hardminimum spanning treesensorsstrongly connecteddirectional antennaspanning graphsantenna

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Improved algorithms in directional wireless sensor networks ⋮ Strong connectivity of sensor networks with double antennae ⋮ Euclidean bottleneck bounded-degree spanning tree ratios ⋮ Bounded-angle minimum spanning trees ⋮ Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae

Cites Work

• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• Balancing minimum spanning trees and shortest-path trees
• The capacity of wireless networks

This page was built for publication: STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE