Probabilistic Analysis of Power Assignments
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.
Unable to display preview. Download preview PDF.
- 6.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)Google Scholar
- 7.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)Google Scholar
- 8.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)Google Scholar
- 9.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)Google Scholar
- 13.Pahlavan, K., Levesque, A.H.: Wireless Information Networks. Wiley (1995)Google Scholar
- 14.Rappaport, T.S.: Wireless Communication. Prentice Hall (2002)Google Scholar
- 15.Warnke, L.: On the method of typical bounded differences. Computing Research Repository 1212.5796 [math.CO], arXiv (2012)Google Scholar
- 16.Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer, Heidelberg (1998)Google Scholar