Can I read Online Capacity Maximization in Wireless Networks on EtoBox?

Online Capacity Maximization in Wireless Networks by Alexander Fanghänel; Sascha Geulen; Martin Hoefer; Berthold Vöcking is a scholarly article available to read on EtoBox.

What is Online Capacity Maximization in Wireless Networks about?

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 channel. 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)+ε " -compe

Author

Alexander Fanghänel; Sascha Geulen; Martin Hoefer; Berthold Vöcking

Publisher

ACM

Published

2010

Language

EN