Multi-rate power-controlled link scheduling for mesh broadband wireless access networks

V Friderikos; K Papadaki; D Wisely; H Aghvami

doi:10.1049/iet-com:20060260

Multi-rate power-controlled link scheduling for mesh broadband wireless access networks

V Friderikos, K Papadaki, D Wisely, H Aghvami

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation algorithms that are based on linear programming relaxation and randomised rounding are studied. The proposed framework, which aims to maximise the spatial timeslot reuse under predefined signal-to-interference noise ratio thresholds, is suitable for providing centralised scheduling in the mesh mode of the IEEE 802.16 standard. Performance aspects of the approximation algorithms under different scenarios are investigated

Original language	English
Pages (from-to)	909 - 914
Number of pages	6
Journal	IET Communications
Volume	1
Issue number	5
DOIs	https://doi.org/10.1049/iet-com:20060260
Publication status	Published - 2007

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1049/iet-com:20060260

Cite this

@article{78436f4f8ae344cca278ab7afbeef6d7,

title = "Multi-rate power-controlled link scheduling for mesh broadband wireless access networks",

abstract = "The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation algorithms that are based on linear programming relaxation and randomised rounding are studied. The proposed framework, which aims to maximise the spatial timeslot reuse under predefined signal-to-interference noise ratio thresholds, is suitable for providing centralised scheduling in the mesh mode of the IEEE 802.16 standard. Performance aspects of the approximation algorithms under different scenarios are investigated",

author = "V Friderikos and K Papadaki and D Wisely and H Aghvami",

year = "2007",

doi = "10.1049/iet-com:20060260",

language = "English",

volume = "1",

pages = "909 -- 914",

journal = "IET Communications",

publisher = "Institution of Engineering and Technology",

number = "5",

}

TY - JOUR

T1 - Multi-rate power-controlled link scheduling for mesh broadband wireless access networks

AU - Friderikos, V

AU - Papadaki, K

AU - Wisely, D

AU - Aghvami, H

PY - 2007

Y1 - 2007

N2 - The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation algorithms that are based on linear programming relaxation and randomised rounding are studied. The proposed framework, which aims to maximise the spatial timeslot reuse under predefined signal-to-interference noise ratio thresholds, is suitable for providing centralised scheduling in the mesh mode of the IEEE 802.16 standard. Performance aspects of the approximation algorithms under different scenarios are investigated

AB - The problem of multi-rate power-controlled collision-free scheduling in spatial time division multiple access (STDMA) wireless mesh networks is formulated as a mathematical program utilising cross layer information. As these mixed integer linear programs are intractable (NP-hard problems), optimal collision-free schedules can be found only for topologies consisting of a few nodes. To this end, approximation algorithms that are based on linear programming relaxation and randomised rounding are studied. The proposed framework, which aims to maximise the spatial timeslot reuse under predefined signal-to-interference noise ratio thresholds, is suitable for providing centralised scheduling in the mesh mode of the IEEE 802.16 standard. Performance aspects of the approximation algorithms under different scenarios are investigated

U2 - 10.1049/iet-com:20060260

DO - 10.1049/iet-com:20060260

M3 - Article

VL - 1

SP - 909

EP - 914

JO - IET Communications

JF - IET Communications

IS - 5

ER -

Multi-rate power-controlled link scheduling for mesh broadband wireless access networks

Abstract

UN SDGs

Access to Document

Fingerprint

Cite this