Tugas Presentasi Kelompok-6

Jaringan Komunikasi Broadband ENEE801201

Scheduling, Link Adaptation

and Hybrid ARQ
Disusun dan dipresentasikan oleh :
Alvin Senjaya
B. Pratiknyo Adi M.
Fajar Rahayu
Daftar Isi

1. Link Adaptation : Power and Rate Control.

2. Channel Dependent Scheduling.
3. Advanced Retransmission Scheme.
4. Hybrid ARQ with Soft Combining.

2
1. Link Adaptation

 Link adaptation mempunyai definisi sebagai sebuah kemampuan

dasar dari sebuah channel dalam menghadapi fading.

 Tipe link adaptation :

1. Dynamic transmit power control dan
2. Dynamic rate control.

3
1.1 Dynamic Transmit Power Control

Dynamic transmit power control digunakan untuk mengatur power transmit dari
suatu link radio untuk mengatasi variations dan differences pada kondisi saluran
pada saat tertentu.
Teknologi ini sudah dipakai pada sistem CDMA, CDMA2000 dan WCDMA.
Tujuan dari pengaturan tersebut adalah untuk menjaga kestabilan nilai Eb/No di sisi
penerima yang berhasil mengirimkan data tanpa error probability yang besar.
Pada prinsipnya, pada teknologi ini transmitter akan menyesuaikan powernya
ketika kondisi link radio berubah menjadi buruk dan hasil yang didapatkan adalah
nilai data rate yang stabil.

4
 1.2 Dynamic rate control

Pada tipe link adaptation dynamic rate control, penyesuaian nilai data rate dilakukan
secara dinamis untuk mengatasi kondisi saluran yang bervariasi.
Dynamic rate control menjaga nilai Eb/No sesuai dengan nilai yang diinginkan, tidak dengan
cara mengatur power transmisi akan tetapi dengan mengatur data ratenya.
Dapat dilihat bahwa dynamic rate control lebih efisien dibandingkan dengan dynamic
transmit power control. Pada prinsipnya pada teknologi dynamic rate cotrol, power amplifier
selalu dalam kondisi full power dalam mengirimkan data dan oleh karena itu efisiensi sangat
diperlukan.
Pada teknologi power control, hasil dari power amplifier dalam banyak kondisi tidak efisien
dikarenakan power transmisi lebih kecil daripada nilai maksimum yang dapat ditransmisikan.

5
Dynamic Transmit
Power Control
& Dynamic Rate
Control
6
Link Adaptation in LTE-Advanced/ 4G

Pada kenyataanya, data rate pada radio link diatur oleh modulation scheme dan channel
coding rate.
Pada kondisi radio link yang bagus, nilai Eb/No pada penerima bernilai cukup bagus dan
batasan utama dari nilai data ratenya adalah bandwidth dari radio linknya.
Pada situasi yang membutuhkan tipe modulasi tinggi maka digunakan 16QAM dan 64QAM
dengan channel coding rate yang tinggi, akan tetapi jika kondisi radio link buruk maka
digunakanlah QPSK dan tipe channel coding rate yang lebih rendah.
Link adaptation dengan menggunakan dynamic rate control sering disebut sebagai
Adaptive Modulation and Coding (AMC).

7
Daftar Isi

1. Link Adaptation : Power and Rate Control.

2. Channel Dependent Scheduling.
3. Advanced Retransmission Scheme.
4. Hybrid ARQ with Soft Combining.

8
2. Channel-Dependent Scheduling

Scheduling digunakan mengatur peng-alokasian dari shared

resources (waktu, frekuensi, code, power) diantara para pengguna
pada saat yang bersamaan.
Scheduling sangat berhubungan erat dengan link adaptation,
terkadang dapat dikatakan sebagai satu kesatuan fungsi.

9
2. Channel-Dependent Scheduling
2.1 Downlink Scheduling

 In the downlink, transmissions to different terminals within a cell are typically mutually
orthogonal, implying that, at least in theory, there is no interference between the
transmissions (no intra-cell interference).
 Downlink intra-cell orthogonality can be achieved in the time domain (Time-Division
Multiplexing, TDM), in the frequency domain (Frequency-Domain Multiplexing, FDM), or in
the code domain (Code-Domain Multiplexing, CDM), In Spatial-Division Multiplexing
(SDM).
 in the case of HSPA (see Chapter 19), downlink multiplexing is a combination of TDM and
CDM. On the other hand, in the case of LTE, downlink multiplexing is a combination of
TDM and FDM.

10
Max-C/I (or Maximum Rate) Scheduling

 Penjadwalan maksimum C/I selalu memilih user yang memiliki nilai CQI yang maksimum.
Pada permulaan Transmission Time Interval, penjadwalan ini membandingkan nilai CQI
dari tiap-tiap user, kemudian memberikan kemampuan kepada user dengan nilai CQI
tertinggi untuk mengakses kanal. Dengan kata lain, teknik ini benar-benar memperhatikan
kondisi propagasi dan karakteristik kanal dan mendukung adanya keragaman (diversity)
multi-user.

11
CQI= Channel Quality Indicator
Round-Robin Scheduling

 Penjadwalan Round Robin disebut juga Fair Time Scheduling, memiliki prinsip dasar, yaitu
“semua sumber antrian dianggap sama dan diberi waktu yang disebut time quantum, jika
time quantum habis atau proses selesai, maka proses berlanjut ke antrian berikutnya”.
Penjadwalan ini cukup adil karena tidak ada antrian yang diprioritaskan, semua
mendapat jatah waktu yang sama.

12
CQI= Channel Quality Indicator
Proportional-Fair Scheduler

 Ide dasar dari algoritma ini adalah memilih user untuk dijadwalkan berdasarkan rasio
antara transfer rate user terhadap nilai rata-rata transfer rate, bagi user yang sedang aktif.
Rasio inilah yang kemudian didefinisikan sebagai preference metric. Dalam kasus khusus,
jika user memiliki nilai CQI yang identik (preference metric yang sama), maka akan
digunakan penjadwalan Round Robin.

13
Channel-Dependent Scheduling

14
Perbandingan Tipe Scheduler

 We analyzed the performances of round robin, proportional fair and max C/I scheduling
methods for downlink transmission modes in LTE :
 It is found that proportional fair will give very good data rate in most cases.
 Round robin provides the UE with good fairness but proportional fair maintain a balance
between fairness and throughput and so,
 proportional fair may still be a better choice.
 Also results shows that proportional fair provide good result than max C/I and Round
Robin.

15
2. Channel-Dependent Scheduling
2.2 Uplink Scheduling

Fundamentally, the uplink power resource is distributed among the users, while in the
downlink the power resource is centralized within the base station.
Furthermore, the maximum uplink transmission power of a single terminal is typically
significantly lower than the output power of a base station.
This has a significant impact on the scheduling strategy.
Unlike the downlink, where pure TDMA can often be used, uplink scheduling typically has to
rely on sharing in the frequency and/or code domain in addition to the time domain, as a
single terminal may not have sufficient power for efficiently utilizing the link capacity.

16
Non-orthogonal multiple-access scheme

17
Orthogonal multiple-access scheme

 Greedy filling

18
 The schedulers above all assume knowledge of the instantaneous radio-link conditions, knowledge that can
be hard to obtain in the uplink scenario, as discussed in Section 7.2.4. In situations when no information
about the uplink radio-link quality is available at the scheduler, round-robin scheduling can be used. Similar
to the downlink, round-robin implies terminals taking turns in transmitting, thus creating a TDMA-like operation
with inter-user orthogonality in the time domain. Although the round-robin scheduler is simple, it is far from
the optimal scheduling strategy
 However, as already discussed in Chapter 4, the transmission power in a terminal is limited and therefore
additional sharing of the uplink resources in the frequency and/or code domain is required. This also impacts
the scheduling decisions. For example, terminals far from the base station typically operate in the power-
limited region, in contrast to terminals close to the base stations, which often are in the bandwidth-limited
region (for a discussion on power-limited vs. bandwidth-limited operation, see Chapter 2). Thus, for a terminal
far from the base station, increasing the bandwidth will not result in an increased data rate and it is better to
only assign a small amount of the bandwidth to this terminal and assign the remaining bandwidth to other
terminals. On the other hand, for terminals close to the base station, an increase in the assigned bandwidth
will provide a higher data rate

19
2. Channel-Dependent Scheduling
2.3 Link Adaptation and Channel-Dependent Scheduling
in the Frequency Domain

 Link Adaptation in frequency domain : OFDM subcarrier  power + data rate  adjust for
optimal utilization
 Channel dependent scheduling in frequency domain : channel quality varies significaly
with frequency + channel quality only varies slowly with time  enhance system capacity

20
Link adaptation in the frequency domain implies that, based on knowledge about the
instantaneous channel conditions also in the frequency domain – that is, knowledge about the
attenuation as well as the noise/interference level of, in the extreme case, every OFDM subcarrier –
the power and/ or the data rate of each OFDM carrier can be individually adjusted for optimal
utilization.

Similarly, channel-dependent scheduling in the frequency domain implies that, based on

knowledge about the instantaneous channel conditions also in the frequency domain, different
subcarriers are used for transmission to or from different terminals. The scheduling gains from
exploiting variations in the frequency domain are similar to those obtained from time-domain
variations. Obviously, in situations where the channel quality varies significantly with the frequency
while the channel quality only varies slowly with time, channel-dependent scheduling in the
frequency domain can enhance system capacity. An example of such a situation is a wideband
indoor system with low mobility, where the quality only varies slowly with time.

21
 2. Channel-Dependent Scheduling
2.4 Acquiring on Channel-State Information (CSI)

 To select a suitable data rate, in practice a suitable modulation scheme and channel-
coding rate, the transmitter needs information about the radio-link channel conditions
 Such information is also required for the purpose of channel-dependent scheduling.
 In the case of a system based on frequency-division duplex (FDD), only the receiver can
accurately estimate the radio-link channel conditions.

 In the case of a system with time-division duplex (TDD), where uplink and downlink
communication are time multiplexed within the same frequency band, the instantaneous
uplink signal quality attenuation could be estimated from downlink measurements of the
terminal, due to the reciprocity of the multi-path fading in the case of TDD. However, it
should then be noted that this may not provide full knowledge of the downlink channel
conditions. As an example, the interference situations at the terminal and the base station
are different also in the case of TDD. 22
Downlink
 For the downlink, most systems provide a downlink signal of a predetermined structure,
known as the downlink pilot or the downlink reference signal. This reference signal is
transmitted from the base station with constant power and can be used by the terminal to
estimate the instantaneous downlink channel conditions. Information about the
instantaneous downlink conditions can then be reported to the base station.
 Basically, what is relevant for the transmitter is an estimate reflecting the channel
conditions at the time of transmission. Hence, in principle, the terminal could apply a
predictor, trying to predict the future channel conditions and report this predicted value
to the base station. However, as this would require specification of prediction algorithms
and how they would operate when the terminal is moving at different speeds, most
practical systems simply report the measured channel conditions to the base station. This
can be seen as a very simple predictor, basically assuming the conditions in the near
future will be similar to the current conditions. Thus, the more rapid the time-domain
channel variations, the less efficient the link adaptation.
 As there inevitably will be a delay between the point in time when the terminal measured
the channel conditions and the application of the reported value in the transmitter,
channel-dependent scheduling and link adaptation typically operates at its best at low
terminal mobility. If the terminal starts to move at high speed, the measurement reports will
be outdated once arriving at the base station. In such cases, it is often preferable to 23
perform link adaptation on the long-term average channel quality and rely on hybrid ARQ
Uplink

 For the uplink, estimation of the uplink channel conditions is not as straightforward, as there
is typically no reference signal transmitted with constant power from each terminal. Means
to estimate uplink channel conditions for LTE are discussed in Chapter 11.

24
2. Channel-Dependent Scheduling
2.5 Traffic Behavior and Scheduling

It should be noted that there is little difference between different scheduling algorithms at
low system load – that is, when only one or, in some cases, a few users have data waiting for
transmission at the base station at each scheduling instant. The differences between
different scheduling algorithms are primarily visible at high load. However, not only the load,
but also the traffic behavior affects the overall scheduling performance.

As discussed above, channel-dependent scheduling tries to exploit short-term variations in

radio quality. Generally, a certain degree of long-term fairness in service quality is desirable,
which should be accounted for in the scheduler design. However, since system throughput
decreases the more fairness is enforced, a trade-off between fairness and system throughput
is necessary. In this trade-off, it is important to take traffic characteristics into account

25
To illustrate this, consider three different downlink schedulers:
1. Round-robin (RR) scheduler, where channel conditions are not taken into account.
2. Proportional-fair (PF) scheduler, where short-term channel variations are exploited while
maintaining the long-term average user data rate.
3. Max-C/I scheduler, where the user with the best instantaneous channel quality in absolute
terms is scheduled.

26
throughput for users at the cell edge with a low average channel quality. The
reason is the fundamental strategy of the max-C/I scheduler – all resources are
allocated for transmission to the terminal whose channel conditions support the
highest data rate. Only in the rare, not to say unlikely, case of a cell-edge user
having better conditions than a cell-center user, for example due to a deep
fading dip for the cell-center user, will the cell-edge user be scheduled. A
proportional-fair scheduler, on the other hand, will ensure some degree of
fairness by selecting the user supporting the highest data rate relative to its
average data rate. Hence, users tend to be scheduled on their fading peaks,
regardless of the absolute quality. Thus, users on the cell edge will also be
scheduled, thereby resulting in some degree of fairness between users.
For a scenario with bursty packet data, the situation is different. In this case, the
users’ buffers will be finite and in many cases also empty. For example, a web
page has a certain size and, after transmitting the page, there is no more data
to be transmitted to the terminal in question until the users requests a new page
by clicking on a link. In this case, a max-C/I scheduler can still provide a certain
degree of fairness. Once the buffer for the user with the highest C/I has been
emptied, another user with nonempty buffers will have the highest C/I and be
scheduled and so on. This is the reason for the difference between full buffer
and web-browsing traffic illustrated in Figure 6.4. The proportional-fair scheduler 27
has similar performance in both scenarios.
Scheduling strategies : fill buffers, web
browsing

28
 Clearly, the degree of fairness introduced by the traffic properties depends heavily on the
actual traffic; a design made with certain assumptions may be less desirable in an actual
network where the traffic pattern may be different from the assumptions made during the
design. Therefore, relying solely on the traffic properties for fairness is not a good strategy,
but the discussion above emphasizes the need to design the scheduler not only for the full
buffer case.

29
Daftar Isi

1. Link Adaptation : Power and Rate Control.

2. Channel Dependent Scheduling.
3. Advanced Retransmission Scheme.
4. Hybrid ARQ with Soft Combining.

30
3. Advanced Retransmission Schemes

 Variations yang mempengaruhi kualitas sinyal penerima dapat diatasi dengan

menggunakan link adaptation, akan tetapi lain halnya dengan noise dan interferensi.
 Untuk mengatasi noise dan interferensi tersebut dapat digunakan :
1. Error-correction coding,
2. Error-detection coding, dan
3. Hybrid Automatic Repeat Request (ARQ)

31
Error-Detection Code

 In an Automatic Repeat Request/ARQ scheme typically use a Cyclic Redundancy Check

(CRC),
 Cyclic Redundancy Check (CRC), to detect if the received packet is in error or not. If no
error is detected in the received data packet, the received data is declared error-free
and the transmitter is notified by sending a positive acknowledgement (ACK). On the
other hand, if an error is detected, the receiver discards the received data and notifies
the transmitter via a return channel by sending a negative acknowledgement (NAK). In
response to an NAK, the transmitter retransmits the same information.

32
ARQ dan FEC

 ARQ (Automatic Retransmission reQuest)

 Komunikasi Dua Arah
 Tidak ada Multicast

 FEC (Forward Error Control)

 Penambahan Redundansi
 Mengoreksi Error
Karakteristik ARQ

 Apakah receiver menerima semua pesan?

 Jika pesan tidak diterima pada rentang waktu tertentu
 Receiver meminta pengiriman ulang
 Transmitter mengirim pesan yang hilang
 Komunikasi 2 arah antara transmitter dan receiver
 Semakin banyak paket hilang/rusak, semakin banyak pengiriman ulang
Penjelasan ARQ

 Penggunaan ARQ harus dibatasi

 Transmisi memiliki batasan kapasitas
 Mungkin terjadi snowball effect
 ARQ dapat menggangu sistem transmisi karena terlalu banyak melakukan retransmisi
 Pesan baru tidak dapat dikirim karena Batasan kapasitas
 ARQ membutuhkan buffering
 Pesan mungkin tidak terurut dan terdelay
 Mengecek apakah paket hilang/rusak/terdelay
 Jika ada yang rusak, minta pengiriman ulang
 Meningkatkan latency secara keseluruhan
Penjelasan ARQ

 Membutuhkan transmisi dua arah supaya dapat berfungsi

 Tidak support multicast
 Hanya berlaku untuk transmisi point-to-point
 Sering memiliki masalah ketika melewati “Firewall”
 Jika tidak ada pesan rusak/hilang, tidak menambah beban sistem
Karakteristik FEC

 Penambahan informasi redundant

 Membuat checksum dengan metode CRC
 Semakin Panjang redundansi, semakin tinggi kemampuan koreksi error
 Transmitter mengirimkan pesan normal sekaligus pesan FEC
 Mampu mengoreksi kesalahan berturut-turut / berantai
 Meningkatkan latency sistem secara keseluruhan
Karakteristik FEC

 Cara Kerja
 Matriks FEC (terdapat baris dan kolom)
 Kemampuan koreksi error:
Error beruntun
Error secara random tidak beruntun
 FEC latency and penambahan redundansi konstan untuk setiap jumlah baris
dan kolom
Daftar Isi

1. Link Adaptation : Power and Rate Control.

2. Channel Dependent Scheduling.
3. Advanced Retransmission Scheme.
4. Hybrid ARQ with Soft Combining.

39
4. HARQ: Kombinasi ARQ and FEC
(Soft Combining)

 HARQ = ARQ + FEC

 FEC digunakan pertama untuk mengoreksi error
 ARQ digunakan pada kasus FEC gagal mengoreksi error
 Implementasi cerdas – Hybrid ARQ & FEC
 Penambahan redundansi FEC dikurangi ketika ARQ aktif
 Kapasitas untuk FEC berkurang dan digunakan untuk ARQ
 Memaksimalkan kapasitas saluran
 HARQ Chase Combination

Informasi
dan Parity
SAMA
Setiap
Retransmisi
 HARQ Incremental Redundancy

BERBEDA
Pengkodean
dan Parity
untuk setiap
Retransmisi
Contoh HARQ
Contoh HARQ

 10 x 10 blok pesan
 Termasuk 20 redundansi FEC
 10 row checksums
 10 column checksums
 Kemampuan error koreksi 20%
 10 kesalahan beruntun
 10 kesalahan acak – 1 per baris
Contoh HARQ

 Mengurangi redundansi FEC untuk megaktifkan ARQ

 Menjaga penggunaan kapasitas saluran
 Retransmisi (ARQ) menggunakan alokasi FEC
 Kemampuan koreksi ARQ dibatasi kapasitas saluran
 Batasan untuk retransmisi ARQ adalah 10 pesan untuk matriks FEC 10x10 atau 10%
Implementasi

 Batasan kapasitas saluran

 Limitasi kemampuan koreksi error
 Jika kapasitas terbatas atau minimal ada 2x kapasitas
 Mengoreksi sangat banyak kesalahan
 Penambahan redundansi umumnya dibatasi 10-30%
Pro-MPEG Forum dan SMPTE

 Standar untuk ukuran matriks FEC

 20 x 5 dan 10 x 10 matriks paling banyak digunakan
 Cukup untuk private network dengan sedikit error
 Tidak cukup untuk public network (missal Internet)
 Kesalahan beruntun Internet lebih banyak dari 20
Daftar Pustaka :
1. Dahlman, E., Parkvall, S., Skold, J. 2011. LTE/ LTE-Advanced for Mobile Broadband. UK : Elsevier.
2. Dahlman, E., Parkvall, S., Skold, J., Beming, P. 2007. 3G Evolution : HSPA and LTE for Mobile Broadband 2nd
edition. UK : Elsevier.
3. https://www.youtube.com/channel/UCCKhH1p0tj1frvcD70tEyDg
4. http://www.rfwireless-world.com/Terminology/Chase-Combining-HARQ-vs-incremental-redundancy-
HARQ.html
5. http://www.telecomhall.com/what-is-retransmission-arq-and-harq.aspx
6. Moosavi, R., Eriksson, J., Larsson, E. G., Wiberg, N., Frenger, P., Gunnarsson, F. 2010. Comparison of
Strategies for Signaling of Scheduling Assignments in Wireless OFDMA. Linköping University Electronic Press.
7. Suryaman, B., Irawati, I.D.,Mulyana, A. 2010. Perbandingan Performansi Algoritma Penjadwalan Round
Robin, Maximum C/I, dan Pproportional Fair dengan Menggunakan HARQ Pada Sistem 3GPP LTE. Bali :
Konferensi Nasional Sistem dan Informatika 2010.
8. Trivedi, R. D., Patel, M. C. 2014. Comparison of Different Scheduling Algorithm for LTE. International Journal
of Emerging Technology and Advanced Engineering.

50
Terima Kasih