article

Online capacity maximization in wireless networks

Authors:

Alexander Fanghänel,

Berthold VöckingAuthors Info & Claims

Journal of Scheduling, Volume 16, Issue 1

Pages 81 - 91

https://doi.org/10.1007/s10951-011-0227-z

Published: 01 February 2013 Publication History

Abstract

In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points in Euclidean space of constant dimension d arrive iteratively over time. When a new request arrives, an online algorithm needs to decide whether or not to accept the request and to assign one out of k channels and a transmission power to the request. Accepted requests must satisfy constraints on the signal-to-interference-plus-noise (SINR) ratio. The objective is to maximize the number of accepted requests.

Using competitive analysis we study algorithms using distance-based power assignments, for which the power of a request relies only on the distance between the points. Such assignments are inherently local and particularly useful in distributed settings. We first focus on the case of a single channel. For request sets with spatial lengths in [1,Δ] and duration in [1, Γ ] we derive a lower bound of ( Γ Δ^{d /2}) on the competitive ratio of any deterministic online algorithm using a distance-based power assignment. Our main result is a near-optimal deterministic algorithm that is O ( Γ Δ^{( d /2)+})-competitive, for any constant >0.

Our algorithm for a single channel can be generalized to k channels. It can be adjusted to yield a competitive ratio of O ( k Γ ^{1/ k} Δ^{( d /2 k )+}) for any factorization ( k , k ) such that k k = k . This illustrates the effectiveness of multiple channels when dealing with unknown request sequences. In particular, for (log Γ log Δ) channels this yields an O (log Γ log Δ)-competitive algorithm. Additionally, we show how this approach can be turned into a randomized algorithm, which is O (log Γ log Δ)-competitive even for a single channel.

References

[1]

Andrews, M., & Dinitz, M. (2009). Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In Proc. 28th IEEE conf. computer communications (INFOCOM) .

[2]

Assouad, P. (1983). Binary contraction of graphs. Discrete Mathematics, 47 , 315-319.

Digital Library

[3]

Avin, C., Lotker, Z., & Pignolet, Y. A. (2009). On the power of uniform power: capacity of wireless networks with bounded resources. In Proc. 17th European symposium on algorithms (ESA) (pp. 373- 384).

[4]

Balakrishnan, H., Barrett, C. L., Kumar, V. A., Marathe, M. V., & Thite, S. (2004). The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal of Selected Areas in Communications, 22 (6), 1069-1079.

Digital Library

[5]

Chafekar, D., Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2008). Approximation algorithms for computing capacity of wireless networks with SINR constraints. In Proc. 27th IEEE conf. computer communications (INFOCOM) (pp. 1166-1174).

[6]

Clarkson, K. L. (1999). Nearest neighbor queries in metric spaces. Discrete & Computational Geometry, 22 (1), 63-93.

[7]

Clarkson, K.L. (2006). Nearest-neighbor search and metric space dimensions. In G. Shakhnarovich, T. Darell, & P. Indyk (Eds.), Nearest-neighbor methods for learning and vision: theory and practice (pp. 15-59). Cambridge: MIT Press.

[8]

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

[9]

Fanghänel, A., Kesselheim, T., & Vöcking, B. (2009). Improved algorithms for latency minimization in wireless networks. In Proc. 36th intl. colloq. automata, languages and programming (ICALP) (Vol. 2, pp. 208-219).

[10]

Goussevskaia, O., Halldórsson, M. M., Wattenhofer, R., & Welzl, E. (2009). Capacity of arbitrary wireless networks. In Proc. 28th IEEE conf. computer communications (INFOCOM) .

[11]

Goussevskaia, O., Oswald, Y. A., & Wattenhofer, R. (2007). Complexity in geometric SINR. In Proc. 8th intl. symp. mobile ad-hoc networking and computing (MOBIHOC) (pp. 100-109).

[12]

Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46 , 388-404.

Digital Library

[13]

Halldorsson, M. & Wattenhofer, R. 2010 Computing wireless capacity. Unpublished manuscript.

[14]

Halldorsson, M. M. (2009). Wireless scheduling with power control. In Proc. 17th European symposium on algorithms (ESA) (pp. 361- 372).

[15]

Kesselheim, T. (2011). A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In Proc. 22nd symp. discrete algorithms (SODA) (pp. 1549-1559).

[16]

Moscibroda, T., & Wattenhofer, R. (2006). The complexity of connectivity in wireless networks. In Proc. 25th IEEE conf. computer communications (INFOCOM) (pp. 1-13).

[17]

Moscibroda, T., Wattenhofer, R., Zollinger, A. (2006). Topology control meets SINR: the scheduling complexity of arbitrary topologies. In Proc. 7th intl. symp. mobile ad-hoc networking and computing (MOBIHOC) (pp. 310-321).

Cited By

Hoefer MKesselheim T(2015)Secondary Spectrum Auctions for Symmetric and Submodular BiddersACM Transactions on Economics and Computation10.1145/27390413:2(1-25)Online publication date: 20-Apr-2015
https://dl.acm.org/doi/10.1145/2739041
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
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

Online capacity maximization in wireless networks
1. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Online capacity maximization in wireless networks
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures

In this paper we study a dynamic version of capacity maximization is the physical model of wireless communication. In our model, requests for connections between pairs of points in Euclidean space of constant dimension d arrive iteratively over time. ...
Transmit selection diversity with maximal-ratio combining for multicarrier DS-CDMA wireless networks over Nakagami-m fading channels

We propose the scheme to integrate transmit selection diversity/maximal-ratio combining (TSD/MRC) with multicarrier (MC) direct-sequence code-division multiple access (DS-CDMA) for various wireless networks. Applying this TSD/MRC-based scheme, the ...
Capacity bounds for Cooperative diversity

In a cooperative diversity network, users cooperate to transmit each others' messages; to some extent nodes therefore collectively act as an antenna array and create a virtual or distributed multiple-input multiple-output (MIMO) system. In this paper, ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Scheduling

Journal of Scheduling Volume 16, Issue 1

February 2013

143 pages

ISSN:1094-6136

Issue’s Table of Contents

Copyright © Copyright © 2013 Springer Science+Business Media New York.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 February 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hoefer MKesselheim T(2015)Secondary Spectrum Auctions for Symmetric and Submodular BiddersACM Transactions on Economics and Computation10.1145/27390413:2(1-25)Online publication date: 20-Apr-2015
https://dl.acm.org/doi/10.1145/2739041
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
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

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents