Abstract
Various recent theoretical studies have achieved considerable progress in understanding combined link scheduling and power control in wireless networks with SINR constraints. These analyses were mainly focused on designing and analyzing approximation algorithms with provable approximation guarantees. While these studies revealed interesting effects from a theoretical perspective, so far there has not been a systematic evaluation of the theoretical results in simulations. In this paper, we examine the performance of various approximation algorithms and heuristics for the common scheduling problems on instances generated by different random network models, e.g., taking clustering effects into account. Using non-convex optimization, we are able to compute the theoretical optima for some of these instances such that the performance of the different algorithms can be compared with these optima.
The simulations support the practical relevance of the theoretical findings. For example, setting transmission power by a square-root power assignment, the network’s capacity increases significantly in comparison to uniform power assignments. Furthermore, the developed approximation algorithms are able to exploit this gap providing in general a better performance than any algorithm using uniform transmission powers, even with unlimited computational power. The obtained results are robust against changes in parameters and network generation models.
This work has been supported by the UMIC Research Centre, RWTH Aachen University.
This is a preview of subscription content, log in via an institution to check access.
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
Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: Proc. 28th INFOCOM, pp. 1332–1340 (2009)
Charalambous, T., Klerides, E., Wiesemann, W.: On the transmission scheduling of wireless networks under SINR constraints. CUED/F-INFENG/TR.649 (2010)
Cruz, R., Santhanam, A.V.: Optimal routing, link scheduling and power control in multihop wireless networks. In: Proc. 22nd INFOCOM, pp. 702–711 (2003)
ElBatt, T.A., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communication 3(1), 74–85 (2004)
Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: Proc. 28th PODC, pp. 220–229 (2009)
Fu, L., Liew, C., Huang, J.: Joint power control and link scheduling in wireless networks for throughput optimization. In: Proc. IEEE International Conference on Communications (ICC), pp. 3066–3072 (2008)
Goussevskaia, O., Wattenhofer, R., Halldórsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: Proc. 28th INFOCOM, pp. 1872–1880 (2009)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46, 388–404 (2000)
Halldórsson, M.M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361–372. Springer, Heidelberg (2009)
Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: Proc. 22nd SODA, pp. 1538–1548 (2011)
Halldórsson, M.M., Wattenhofer, R.: Computing wireless capacity (2010) (unpublished manuscript)
Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proc. 22nd SODA, pp. 1549–1559 (2011)
Kompella, S., Wieselthier, J.E., Ephremides, A.: Revisiting the optimal scheduling problem. In: Proc. 42nd Annual Conference on Information Sciences and Systems (CISS), pp. 492–497 (2008)
Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: Proc. 26th INFOCOM, pp. 1433–1441 (2007)
Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proc. 25th INFOCOM, pp. 1–13 (2006)
Wan, P.-J., Ma, C., Tang, S., Xu, B.: Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 84–95. Springer, Heidelberg (2011)
Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)
Zander, J.: Performance of optimum transmitter power control in cellular radio systems. IEEE Transactions on Vehicular Technology 41(1), 57–62 (1992)
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
Belke, L., Kesselheim, T., Koster, A.M.C.A., Vöcking, B. (2013). Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_5
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)