Abstract
A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order to maximize the life-time of the network. Our aim is a probabilistic analysis of this power assignment problem. We prove complete convergence for arbitrary combinations of the dimension d and the distance-power gradient p. Furthermore, we prove that the expected approximation ratio of the simple spanning tree heuristic is strictly less than its worst-case ratio of 2.
Our main technical novelties are two-fold: First, we find a way to deal with the unbounded degree that the communication network induced by the optimal power assignment can have. Minimum spanning trees and traveling salesman tours, for which strong concentration results are known in Euclidean space, have bounded degree, which is heavily exploited in their analysis. Second, we apply a recent generalization of Azuma-Hoeffding’s inequality to prove complete convergence for the case p ≥ d for both power assignments and minimum spanning trees (MSTs). As far as we are aware, complete convergence for p > d has not been proved yet for any Euclidean functional.
A full version with all proofs is available at http://arxiv.org/abs/1403.5882.
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
Althaus, E., Calinescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Networks 12(3), 287–299 (2006)
Bläser, M., Manthey, B., Rao, B.V.R.: Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica 66(2), 397–418 (2013)
Bläser, M., Panagiotou, K., Rao, B.V.R.: A probabilistic analysis of Christofides’ algorithm. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 225–236. Springer, Heidelberg (2012)
Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications 9(2), 125–140 (2004)
Funke, S., Laue, S., Lotker, Z., Naujoks, R.: Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours. Ad Hoc Networks 9(6), 1028–1035 (2011)
de Graaf, M., Boucherie, R.J., Hurink, J.L., van Ommeren, J.K.: An average case analysis of the minimum spanning tree heuristic for the range assignment problem. Memorandum 11259 (revised version), Department of Applied Mathematics, University of Twente (2013)
Halldórsson, M.M., Holzer, S., Mitra, P., Wattenhofer, R.: The power of non-uniform wireless power. In: Proc. of the 24th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1595–1606. SIAM (2013)
Halldórsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: Rabani, Y. (ed.) Proc. of the 23rd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 516–526. SIAM (2012)
Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proc. of the 22nd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1549–1559. SIAM (2011)
Khan, M., Pandurangan, G., Pei, G., Vullikanti, A.K.S.: Brief announcement: A fast distributed approximation algorithm for minimum spanning trees in the SINR model. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 409–410. Springer, Heidelberg (2012)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243(1-2), 289–305 (2000)
Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. Mobile Networks and Applications 10(1-2), 19–34 (2005)
Pahlavan, K., Levesque, A.H.: Wireless Information Networks. Wiley (1995)
Rappaport, T.S.: Wireless Communication. Prentice Hall (2002)
Warnke, L.: On the method of typical bounded differences. Computing Research Repository 1212.5796 [math.CO], arXiv (2012)
Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Graaf, M., Manthey, B. (2014). Probabilistic Analysis of Power Assignments. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)