Open AccessPerformance analysis of centralised and distributed scheduling schemes for mobile multihop relay systems
Author(s) -
Kim Taejoon,
An Kwanghoon,
Yu Heejung
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0402
Subject(s) - computer science , relay , link adaptation , scheduling (production processes) , network packet , computer network , queue , distributed computing , real time computing , channel (broadcasting) , mathematical optimization , fading , mathematics , power (physics) , physics , quantum mechanics
For a mobile multihop relay (MMR) system, a centralised packet scheduling method is compared with a distributed packet scheduling method. The performance of the MMR system considering the joint effect of a finite‐length queue and an adaptive modulation and coding scheme for base station and relay station is analysed. A finite state Markov chain (FSMC) describing the queue and channel state pairs’ transitions for the MMR system is built. Moreover, a method of reducing the state space of the FSMC, which enables a hop‐by‐hop performance analysis of the MMR system without explosive growth in the number of states, is presented. Numerical and simulation results show that the proposed FSMC modelling is accurate and the performance of centralised scheduling becomes degraded because of increased mismatches between a scheduled modulation and coding scheme (MCS) level and the actual MCS level.