Abstract
Let P be a set of points in the plane, representing transceivers equipped with a directional antenna of angle α and range r. The coverage area of the antenna at point p is a circular sector of angle α and radius r, whose orientation can be adjusted. For a given assignment of orientations, the induced symmetric communication graph (SCG) of P is the undirected graph, in which two vertices (i.e., points) u and v are connected by an edge if and only if v lies in u’s sector and vice versa. In this paper we ask what is the smallest angle α for which there exists an integer n = n(α), such that for any set P of n antennas of angle α and unbounded range, one can orient the antennas so that (i) the induced SCG is connected, and (ii) the union of the corresponding wedges is the entire plane. We show (by construction) that the answer to this problem is α = π/2, for which n = 4. Moreover, we prove that if Q 1 and Q 2 are two quadruplets of antennas of angle π/2 and unbounded range, separated by a line, to which one applies the above construction, independently, then the induced SCG of Q 1 ∪ Q 2 is connected. This latter result enables us to apply the construction locally, and to solve the following two further problems.
In the first problem (replacing omni-directional antennas with directional antennas), we are given a connected unit disk graph, corresponding to a set P of omni-directional antennas of range 1, and the goal is to replace the omni-directional antennas by directional antennas of angle π/2 and range r = O(1) and to orient them, such that the induced SCG is connected, and, moreover, is an O(1)-spanner of the unit disk graph, w.r.t. hop distance. In our solution \(r = 14\sqrt{2}\) and the spanning ratio is 9. In the second problem (orientation and power assignment), we are given a set P of directional antennas of angle π/2 and adjustable range. The goal is to assign to each antenna p, an orientation and a range r p , such that the resulting SCG is (i) connected, and (ii) \(\sum_{p \in P} r_p^\beta\) is minimized, where β ≥ 1 is a constant. For this problem, we devise an O(1)-approximation algorithm.
Work by R. Aschner was partially supported by the Lynn and William Frankel Center for Computer Sciences. Work by M.J. Katz was partially supported by grant 1045/10 from the Israel Science Foundation, and by grant 2010074 from the United States – Israel Binational Science Foundation. Work by G. Morgenstern was partially supported by the Caesarea Rothschild Institute (CRI).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackerman, E., Gelander, T., Pinchasi, R.: Ice-creams and wedge graphs. CoRR abs/1106.0855 (2011)
Aschner, R., Katz, M.J., Morgenstern, G.: Symmetric connectivity with directional antennas. CoRR abs/1108.0492 (2011)
Ben-Moshe, B., Carmi, P., Chaitman, L., Katz, M.J., Morgenstern, G., Stein, Y.: Direction assignment in wireless networks. In: Proc. 22nd Canadian Conf. on Computational Geometry, pp. 39–42 (2010)
Bose, P., Carmi, P., Damian, M., Flatland, R., Katz, M.J., Maheshwari, A.: Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 134–146. Springer, Heidelberg (2011)
Calinescu, G.: Min-power strong connectivity. In: Proc. 13th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 67–80 (2010)
Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proc. 2nd IFIP Internat. Conf. on Theoretical Computer Science, pp. 119–130 (2002)
Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennas. In: Proc. 20th ACM Sympos. on Parallelism in Algorithms and Architectures, pp. 344–351 (2008)
Carmi, P., Katz, M.J., Lotker, Z., Rosén, A.: Connectivity guarantees for wireless networks with directional antennas. Computational Geometry: Theory and Applications 44(9), 477–485 (2011)
Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM-APPROX 1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999)
Damian, M., Flatland, R.: Connectivity of graphs induced by directional antennas. CoRR abs/1008.3889 (2010)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Kranakis, E., Krizanc, D., Morales, O.: Maintaining connectivity in sensor networks using directional antennae. In: Nikoletseas, S., Rolim, J.D.P. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks, ch. 3, pp. 83–110. Springer
van Nijnatten, F.: Range Assignment with Directional Antennas. Master’s Thesis, Technische Universiteit Eindhoven (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aschner, R., Katz, M.J., Morgenstern, G. (2013). Symmetric Connectivity with Directional Antennas. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)