Change search
ReferencesLink to record
Permanent link

Direct link
On the Minimum Latency Transmission Scheduling in Wireless Networks with Power Control under SINR Constraints
KTH, School of Electrical Engineering (EES), Automatic Control.
Imperial College London.
Imperial College London.
University of Cyprus.
Show others and affiliations
2013 (English)In: European transactions on telecommunications, ISSN 1124-318X, E-ISSN 2161-3915, Vol. 26, no 3, 367--379 p.Article in journal (Refereed) Published
Abstract [en]

In order to alleviate interference and contention in a wireless network, we may exploit the existence of multiple orthogonal channels or time slots, thus achieving a substantial improvement in performance. In this paper, we study a joint transmission scheduling and power control problem that arises in wireless networks. The goal is to assign channels (or time slots) and transmitting powers to communication links such that all communication requests are processed correctly, specified quality-of-service requirements are met, and the number of required time slots is minimised. First, we formulate the problem as a mixed-integer linear programming. Then, we show that the problem considered is non-deterministic polynomial-time hard, and subsequently, we propose non-trivial bounding techniques to solve it. Optimisation methods are also discussed, including a column generation approach, specifically designed to find bounds for the transmission scheduling problem. Moreover, we develop optimisation techniques in which the bounding techniques are integrated in order to derive the optimal solution to the problem faster. We close with an extensive computational study, which shows that despite the complexity of the problem, the proposed methodology scales to problems of non-trivial size. Our algorithms can therefore be used for static wireless networks where propagation conditions are almost constant and a centralised agent is available (e.g. cellular networks where the base station can act as a centralised agent or wireless mesh networks), and they can also serve as a benchmark for the performance evaluation of heuristic, approximation or distributed algorithms that aim to find near-optimal solutions without information about the whole network. 

Place, publisher, year, edition, pages
2013. Vol. 26, no 3, 367--379 p.
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-136162DOI: 10.1002/ett.2616ISI: 000351207600010OAI: diva2:675494

QC 20150419

Available from: 2013-12-04 Created: 2013-12-04 Last updated: 2015-04-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Charalambous, Themistoklis
By organisation
Automatic Control
In the same journal
European transactions on telecommunications
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link