Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Power consumption in packet radio networks
Theoretical Computer Science
On the performance of ad hoc networks with beamforming antennas
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Congestion, Dilation, and Energy in Radio Networks
Theory of Computing Systems
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Energy-Efficient Wireless Network Design
Theory of Computing Systems
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Strong connectivity in sensor networks with given number of directional antennae of bounded angle
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry: Theory and Applications
Switching to directional antennas with constant increase in radius and hop distance
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Strong orientations of planar graphs with bounded stretch factor
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
Strong connectivity of sensor networks with double antennae
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Do directional antennas facilitate in reducing interferences?
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Strongly connected orientations of plane graphs
Discrete Applied Mathematics
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Symmetric connectivity with directional antennas
Computational Geometry: Theory and Applications
Approximation algorithms for the antenna orientation problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
We study the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the plane and each uses a directional antenna modeled by a sector with a given angle and radius. The connectivity problem is to decide whether or not it is possible to orient the antennas so that the directed graph induced by the node transmissions is strongly connected. We present algorithms for simple polynomial-time-solvable cases of the problem, show that the problem is NP-complete in the $2$-dimensional case when the sector angle is small, and present algorithms that approximate the minimum radius to achieve connectivity for sectors with a given angle. We also discuss several extensions to related problems. To the best of our knowledge, the problem has not been studied before in the literature.