Abstract
Consider the task of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the unit disk and each uses a directional antenna covering a sector of a given angle α, where the orientation of the sector is either random or not.
The width required for a connectivity problem is to find out the necessary and sufficient conditions of α that guarantee connectivity when an antenna’s location is uniformly distributed and the direction is either random or not.
We prove basic and fundamental results about this (reformulated) problem. We show that when the number of network nodes is big enough, the required \(\check{\alpha}\) approaches zero. Specifically, on the unit disk it holds with high probability that the threshold for connectivity is \(\check{\alpha}=\Theta(\sqrt[4]{\frac{\log n}{n}})\). This is shown by the use of Poisson approximation and geometrical considerations. Moreover, when the model is relaxed to allow orientation towards the center of the area, we demonstrate that \(\check{\alpha}=\Theta(\frac{\log n}{n})\) is a necessary and sufficient condition.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ackerman, E., Gelander, T., Pinchasi, R.: Ice-creams and wedge graphs. In: Computational Geometry (2012)
Aschner, R., Katz, M.J., Morgenstern, G.: Do directional antennas facilitate in reducing interferences? In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 201–212. Springer, Heidelberg (2012)
Biglieri, E.: MIMO wireless communications. Cambridge University Press (2007)
Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennas. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pp. 344–351. ACM (2008)
Carmi, P., Katz, M.J., Lotker, Z., Rosn, A.: Connectivity guarantees for wireless networks with directional antennas. Computational Geometry 44(9), 477–485 (2011)
Daltrophe, H., Dolev, S., Lotker, Z.: Probabilistic connectivity threshold for directional antenna widths. The Lynne and William Frankel Center for Computer Science, Technical Reports 13-04 (2013)
Damian, M., Flatland, R.: Spanning properties of graphs induced by directional antennas. In: Electronic Proc. 20th Fall Workshop on Computational Geometry. Stony Brook University, Stony Brook (2010)
Gupta, P., Kumar, P.: Critical power for asymptotic connectivity. In: Proceedings of the 37th IEEE Conference on Decision and Control, pp. 1106–1110. IEEE (1998)
Kozma, G., Lotker, Z., Stupp, G.: On the connectivity threshold for general uniform metric spaces. Information Processing Letters 110(10), 356–359 (2010)
Kranakis, E., MacQuarrie, F., Morales-Ponce, O.: Stretch factor in wireless sensor networks with directional antennae. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 25–36. Springer, Heidelberg (2012)
Kumar, U., Gupta, H., Das, S.: A topology control approach to using directional antennas in wireless mesh networks. In: IEEE International Conference on Communications, ICC 2006, vol. 9, pp. 4083–4088 (2006)
Meester, R., Roy, R.: Continuum percolation. Cambridge University Press (1996)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)
Penrose, M.: A strong law for the longest edge of the minimal spanning tree. The Annals of Probability 27(1), 246–260 (1999)
Tse, D., Viswanath, P.: Fundamentals of wireless communication. Cambridge University Press (2005)
Xue, F., Kumar, P.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10(2), 169–181 (2004)
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
Daltrophe, H., Dolev, S., Lotker, Z. (2013). Probabilistic Connectivity Threshold for Directional Antenna Widths. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)