Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/8174
Title: On the minimum latency transmission scheduling in wireless networks with power control under SINR constraints
Authors: Charalambous, Themistoklis 
Klerides, Evelina 
Wiesemann, Wolfram 
Vassiliou, Angelos 
Deliparaschos, Kyriakos M. 
Major Field of Science: Engineering and Technology
Field Category: Electrical Engineering - Electronic Engineering - Information Engineering
Keywords: Wireless network;Communication links
Issue Date: Mar-2015
Source: Transactions on Emerging Telecommunications Technologies, 2015, vol. 26, no. 3, pp. 367–379
Volume: 26
Issue: 3
Start page: 367
End page: 379
Journal: Transactions on Emerging Telecommunications Technologies 
Abstract: In order to alleviate interference and contention in a wireless network, we may exploit the existence of multiple orthogonalchannels or time slots, thus achieving a substantial improvement in performance. In this paper, we study a joint transmissionscheduling 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, specifiedquality-of-service requirements are met, and the number of required time slots is minimised. First, we formulate theproblem as a mixed-integer linear programming. Then, we show that the problem considered is non-deterministicpolynomial-time hard, and subsequently, we propose non-trivial bounding techniques to solve it. Optimisation methodsare also discussed, including a column generation approach, specifically designed to find bounds for the transmissionscheduling problem. Moreover, we develop optimisation techniques in which the bounding techniques are integrated inorder to derive the optimal solution to the problem faster. We close with an extensive computational study, which showsthat despite the complexity of the problem, the proposed methodology scales to problems of non-trivial size. Our algorithmscan therefore be used for static wireless networks where propagation conditions are almost constant and a centralised agentis available (e.g. cellular networks where the base station can act as a centralised agent or wireless mesh networks), andthey can also serve as a benchmark for the performance evaluation of heuristic, approximation or distributed algorithmsthat aim to find near-optimal solutions without information about the whole network.
URI: https://hdl.handle.net/20.500.14279/8174
ISSN: 21613915
DOI: 10.1002/ett.2616
Rights: © John Wiley & Sons
Attribution-NonCommercial-NoDerivs 3.0 United States
Type: Article
Affiliation : Royal Institute of Technology 
Imperial College London 
Cyprus University of Technology 
University of Cyprus 
Publication Type: Peer Reviewed
Appears in Collections:Άρθρα/Articles

CORE Recommender
Show full item record

SCOPUSTM   
Citations

3
checked on Nov 9, 2023

WEB OF SCIENCETM
Citations 20

3
Last Week
0
Last month
0
checked on Oct 29, 2023

Page view(s)

423
Last Week
2
Last month
0
checked on Nov 21, 2024

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons