Abstract
In this work we study the following problem of scheduling with power control in wireless networks: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of parallelly transmitting nodes. The signal interference is modeled by SINR constraints. We correct and complement one of recent papers on this theme, by giving approximation algorithms for scheduling with power control for the case, when the nodes of the network are located in a doubling metric space.
Keywords
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: 29th Annual IEEE Conference on Computer Communications, INFOCOM (2009)
Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. In: 28th Annual Symposium on Principles of Distributed Computing, PODC (2009)
Avin, C., Lotker, Z., Pasquale, F., Pignolet, Y.-A.: A note on uniform power connectivity in the SINR model. In: 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS (2009)
Chafekar, D., Kumar, V., Marathe, M., Parthasarathi, S., Srinivasan, A.: Cross-layer Latency Minimization for Wireless Networks using SINR Constraints. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2007)
Fanghänel, A., Keßelheim, T., Räcke, H., Vöking, B.: Oblivious interference scheduling. In: Proc. 28th Symposium on Principles of Distributed Computing, PODC (2009)
Fanghänel, A., Keßelheim, T., Vöcking, B.: Improved algorithms for latency minimization in wireless networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 447–458. Springer, Heidelberg (2009)
Gronkvist, J., Hansson, A.: Comparison between Graph-Based and Interference-Based STDMA scheduling. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2001)
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.: Wireless Scheduling with Power Control, http://arxiv.org/abs/1010.3427
Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 525–536. Springer, Heidelberg (2009)
Heinonen, J.: Lectures on Analysis on Metric Spaces. Springer, Heidelberg (1999)
Hochbaum, D.S.: Efficient bounds for the Stable Set, Vertex Cover and Set Packing problems. Diskrete Applied Mathematics 6 (1983)
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for Unit Disk Graphs. Networks 25 (1995)
Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond Graph-Based models. In: Hot Topics in Networks, HotNets (2006)
Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2006)
Szekeres, G., Wilf, H.S.: An Inequality for the Chromatic Number of a Graph. Journal of Combinatorial Theory 4(1) (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonoyan, T. (2011). Algorithms for Scheduling with Power Control in Wireless Networks. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)