Abstract
In this paper the problem of wireless transmissions scheduling in the path-loss/SINR model is considered for different fixed power schemes. The lower bounds for the optimum schedule length proven by Kesselheim and Voecking are considered. It is shown that the lower bound for the linear power scheme is tight, by presenting a constant-factor approximation algorithm. On the other hand, it is shown that the lower bounds proven for many other interesting power schemes can be essentially far from the optima.
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
Chafekar, D., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. In: Proc. of 27th Annual IEEE Conference on Computer Communications, INFOCOM (2008)
Chafekar, D., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-Layer Latency Minimization in Wireless Networks with SINR Constraints. In: Proc. of 26th Annual IEEE Conference on Computer Communications, INFOCOM (2007)
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, Part II. LNCS, vol. 5556, pp. 447–458. Springer, Heidelberg (2009)
Goussevskaia, O., Halldórsson, M.M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: 28th Annual IEEE Conference on Computer Communications, INFOCOM (2009)
Goussevskaia, O., Oswald, Y., Wattenhofer, R.: Complexity in Geometric SINR. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC (2007)
Gronkvist, J., Hansson, A.: Comparison between Graph-Based and Interference-Based STDMA scheduling. In: Proc. of ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2001)
Halldórsson, M.M.: Wireless scheduling with power control (September 2010), http://arxiv.org/abs/1010.3427
Halldórsson, M.M., Mitra, P.: Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 625–636. Springer, Heidelberg (2011)
Halldórsson, M.M., Mitra, P.: Wireless Capacity with Oblivious Power in General Metrics. In: Proc. of ACM-SIAM Symposiun on Discrete Algorithms, SODA (2011)
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, Part I. LNCS, vol. 5555, pp. 525–536. Springer, Heidelberg (2009)
Hardy, G.H., Littlewood, J.E., Pólya, G.: Inequalities. Cambridge University Press (1934)
Keßelheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: Proc. of 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA (2011)
Kesselheim, T., Vöcking, B.: Distributed Contention Resolution in Wireless Networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 163–178. Springer, Heidelberg (2010)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proc. of 25th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
Moscibroda, T., Wattenhofer, R.: How Optimal are Wireless Scheduling Protocols? In: Proc. of 26th Annual IEEE Conference on Computer Communications, INFOCOM (2007)
Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. Hot Topics in Networks, HotNets (2006)
Rappaport, T.: Wireless Communications: Principles and Practice. Prentice Hall (2002)
Tonoyan, T.: On the Capacity of Oblivious Powers. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol. 7111, pp. 225–237. Springer, Heidelberg (2012)
Tonoyan, T.: On the Problem of Wireless Scheduling with Linear Power Levels, http://arxiv.org/abs/1107.4981
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
Tonoyan, T. (2013). On Some Bounds on the Optimum Schedule Length in the SINR Model. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_14
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)