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. Copyright 2008 ACM.

, ,
20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08
School of Computer Science

Caragiannis, L. (Loannis), Kaklamanis, C. (Christos), Kranakis, E, Krizanc, D. (Danny), & Wiese, A. (Andreas). (2008). Communication in wireless networks with directional antennas. Presented at the 20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08. doi:10.1145/1378533.1378592