Article

Approximation algorithms for wireless link scheduling with flexible data rates

Author:

Thomas KesselheimAuthors Info & Claims

ESA'12: Proceedings of the 20th Annual European conference on Algorithms

Pages 659 - 670

https://doi.org/10.1007/978-3-642-33090-2_57

Published: 10 September 2012 Publication History

Abstract

We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to the respective data rates. We have to decide which transmissions are performed simultaneously and (depending on the problem variant) also which transmission powers are used.

In the capacity-maximization problem, one strives to maximize the overall network throughput, i.e., the summed utility of all links. For arbitrary utility functions (not necessarily continuous ones), we present an O(logn)-approximation when having n communication requests. This algorithm is built on a constant-factor approximation for the special case of the respective problem where utility functions only consist of a single step. In other words, each link has an individual threshold and we aim at maximizing the number of links whose threshold is satisfied. On the way, this improves the result in [Kesselheim, SODA 2011] by not only extending it to individual thresholds but also showing a constant approximation factor independent of assumptions on the underlying metric space or the network parameters.

In addition, we consider the latency-minimization problem. Here, each link has a demand, e.g., representing an amount of data. We have to compute a schedule of shortest possible length such that for each link the demand is fulfilled, that is, the overall summed utility (or data transferred) is at least as large as its demand. Based on the capacity-maximization algorithm, we show an O(log²n)-approximation for this problem.

References

[1]

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).

[2]

Chiang, M., Tan, C.W., Palomar, D., O'Neill, D., Julian, D.: Power control by geometric programming. IEEE Transactions on Wireless Communication 6(7), 2640- 2651 (2007).

Digital Library

[3]

Dams, J., Hoefer, M., Kesselheim, T.: Convergence Time of Power-Control Dynamics. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 637-649. Springer, Heidelberg (2011).

Digital Library

[4]

Dams, J., Hoefer, M., Kesselheim, T.: Scheduling in wireless networks with Rayleigh-fading interference. In: Proc. 24th SPAA, pp. 327-335 (2012).

Digital Library

[5]

Fanghänel, A., Geulen, S., Hoefer, M., Vöcking, B.: Online capacity maximization in wireless networks. In: Proc. 22nd SPAA, pp. 92-99 (2010).

Digital Library

[6]

Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: Proc. 28th PODC, pp. 220-229 (2009).

Digital Library

[7]

Fanghänel, A., Kesselheim, T., Vöcking, B.: Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science 412(24), 2657-2667 (2011).

Digital Library

[8]

Foschini, G.J., Miljanic, Z.: A simple distributed autonomous power control algorithm and its convergence. IEEE Transactions on Vehicular Technology 42(4), 641-646 (1992).

[9]

Goussevskaia, O., Wattenhofer, R., Halldórsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: Proc. 28th INFOCOM, pp. 1872-1880 (2009).

[10]

Halldórsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications 4, 1-16 (2000).

[11]

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).

[12]

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).

Digital Library

[13]

Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: Proc. 22nd SODA, pp. 1538-1548 (2011).

Digital Library

[14]

Halldórsson, M.M., Mitra, P.: Wireless capacity and admission control in cognitive radio. In: Proc. 31st INFOCOM, pp. 855-863 (2012).

[15]

Huang, J., Berry, R., Honig, M.: Distributed interference compensation for wireless networks. IEEE Journal on Sel. Areas in Comm. 24(5), 1074-1084 (2006).

Digital Library

[16]

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).

Digital Library

[17]

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).

Digital Library

[18]

Lotker, Z., Parter, M., Peleg, D., Pignolet, Y.A.: Distributed power control in the SINR model. In: Proc. 30th INFOCOM, pp. 2525-2533 (2011).

[19]

Santi, P., Maheshwari, R., Resta, G., Das, S., Blough, D.M.: Wireless link scheduling under a graded SINR interference model. In: Proc. 2nd FOWANC, pp. 3-12 (2009).

Digital Library

[20]

Singh, V., Kumar, K.: Literature survey on power control algorithms for mobile ad-hoc network. Wireless Personal Communications, 1-7 (2010).

Digital Library

[21]

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).

Digital Library

Cited By

Halldórsson MTonoyan T(2017)Wireless Link Capacity under Shadowing and FadingProceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3084041.3084068(1-10)Online publication date: 10-Jul-2017
https://dl.acm.org/doi/10.1145/3084041.3084068
Kumar VMarathe MParthasarathy SSrinivasan A(2016)Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc NetworksACM Transactions on Algorithms10.1145/281281112:3(1-25)Online publication date: 25-Apr-2016
https://dl.acm.org/doi/10.1145/2812811
Halldorsson MTonoyan TServedio RRubinfeld R(2015)How Well Can Graphs Represent Wireless Interference?Proceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746585(635-644)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746585
Show More Cited By

Approximation algorithms for wireless link scheduling with flexible data rates

Recommendations

Distributed wireless link scheduling in the SINR model

We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of $$n$$n links in a metric space, each of which is a sender---receiver pair, and the ...
Approximation algorithms for wireless link scheduling with SINR-based interference

In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node depends on the signa-to-interference-plus-noise ratio (SINR). While most ...
Approximation algorithms for multiprocessor scheduling under uncertainty
SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

Motivated by applications in grid computing and project management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs when assigned to processors. We consider the problem of multiprocessor ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA'12: Proceedings of the 20th Annual European conference on Algorithms

September 2012

839 pages

ISBN:9783642330896

Editors:
Leah Epstein
Department of Mathematics, University of Haifa, Mount Carmel, Haifa, Israel
,
Paolo Ferragina
Dipartimento di Informatica, Università di Pisa, Largo B. Pontecorvo 3, Pisa, Italy

Sponsors

EATCS: European Association for Theoretical Computer Science

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 10 September 2012

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Halldórsson MTonoyan T(2017)Wireless Link Capacity under Shadowing and FadingProceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3084041.3084068(1-10)Online publication date: 10-Jul-2017
https://dl.acm.org/doi/10.1145/3084041.3084068
Kumar VMarathe MParthasarathy SSrinivasan A(2016)Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc NetworksACM Transactions on Algorithms10.1145/281281112:3(1-25)Online publication date: 25-Apr-2016
https://dl.acm.org/doi/10.1145/2812811
Halldorsson MTonoyan TServedio RRubinfeld R(2015)How Well Can Graphs Represent Wireless Interference?Proceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746585(635-644)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746585
Halldórsson MKonrad CTonoyan T(2015)Limitations of Current Wireless Scheduling AlgorithmsRevised Selected Papers of the 11th International Symposium on Algorithms for Sensor Systems - Volume 953610.1007/978-3-319-28472-9_6(71-84)Online publication date: 17-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-28472-9_6
Hoefer MKesselheim TVöcking B(2014)Approximation Algorithms for Secondary Spectrum AuctionsACM Transactions on Internet Technology10.1145/266349614:2-3(1-24)Online publication date: 28-Oct-2014
https://dl.acm.org/doi/10.1145/2663496
Gudmundsdottir HÁsgeirsson EBodlaender MFoley JHalldórsson MVigfusson YPrakash RBoukerche ALi CDressler F(2014)Extending wireless algorithm design to arbitrary environments via metricityProceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems10.1145/2641798.2641811(275-284)Online publication date: 21-Sep-2014
https://dl.acm.org/doi/10.1145/2641798.2641811
Bodlaender MHalldorsson MHalldórsson MDolev S(2014)Beyond geometryProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611476(347-356)Online publication date: 15-Jul-2014
https://dl.acm.org/doi/10.1145/2611462.2611476
Halldórsson MMitra P(2014)Wireless capacity with arbitrary gain matrixTheoretical Computer Science10.1016/j.tcs.2013.09.035553:C(57-63)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1016/j.tcs.2013.09.035
Wang CYu JYu DHuang B(2014)An Improved Approximation Algorithm for the Shortest Link Scheduling Problem in Wireless Networks under SINR and Hypergraph ModelsProceedings of the 9th International Conference on Wireless Algorithms, Systems, and Applications - Volume 849110.1007/978-3-319-07782-6_14(150-160)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07782-6_14
Halldórsson MHolzer SMitra PWattenhofer RKhanna S(2013)The power of non-uniform wireless powerProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627931(1595-1606)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627931
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents