SlideShare una empresa de Scribd logo
1 de 34
Descargar para leer sin conexión
London, 11th June 2015
Sleep Period Optimization Model For
Layered Video Service Delivery Over
eMBMS Networks
IEEE ICC 2015 - SAC, Energy Efficient Wireless Systems
Lorenzo Carlà, Francesco Chiti, Romano Fantacci, A. Tassi
a.tassi@{lancaster.ac.uk, bristol.ac.uk}
Starting Point and Goals
๏ Delivery of multimedia broadcast/multicast services over 

4G/5G networks is a challenging task. Especially for the point
of view of the user battery efficiency.
๏ During the reception of high data rate video streams, the user
radio interface is in an active state for a not be negligible time.
That has an impact on the battery, we minimize the active time.
๏ There are many studies dealing with DRX optimization but they
mainly refer to Point-to-Point services.
Goals
๏ Advanced eMBMS Scenario - Scalable video service (such as
H.264/SVC) multicasting.
๏ Resource optimisation - Minimizing the transmission time of
a video stream and, hence, the battery footprint.
2
Index
1. System Parameters and Performance Analysis
2. Proposed Resource Allocation Modeling and
Heuristic Solution
3. Analytical Results
4. Concluding Remarks
3
1. System Parameters and Performance Analysis
System Model
๏ One-hop wireless communication system composed of a Single
Frequency Network (SFN) and a multicast group of U users
5
๏ Layered service consists of a basic layer and multiple
enhancement layers.
๏ All the BSs forming the SFN multicast the same layered video
service, in a synchronous fashion.
๏ Reliability ensured via the RLNC principle.
BS
BS
BS
BS
M1/M2
(MCE / MBMS-GW)
SFN
4
1
2
3
UE3
UEUUE2
UE1
UE4
LTE-A Core Network
6
๏ Encoding performed over each service layer independently
from the others.
๏ The source node will linearly combine the data packets
composing the -th layer and will generate a stream of
coded packets , where
๏ is a layered source message of source
packets, classified into service layers
x = {x1, . . . , xK}
RLNC Principle
yj =
klX
i=1
gj,i xi Coef%icients+of+the+linear+
combination+are+selected+a+
certain+%inite+%ield
K1 K2 K3
x1 x2 xK. . .. . .
K
L
KL
`
{yj}j
7
RLNC and LTE-A
Data$stream
associated$with$$ $
⊗⊗ ⊗
⊕
TB
MACPHY
Data$stream
associated$with$$ $
MAC$PDU
associated
with
x1 x2 xK. . .
gj,1 gj,2 gj,K2
. . . xK2
y1 yj. . . . . .
Source$Message
. . .
yj
v1 v2
v2
Service+layers+
arrive+at+the+MAC+
layer
Coded+elements+
are+generated Depending+on+the+
MCS+a+certain+no.+of+
cod.+el.+are+mapped+
onto+a+PDU+
๏ Coded elements of different layers cannot be mixed within a PDU
๏ One PDU per PHY layer Transport Block. TBs of the same layer are
transmitted with the same power.
N`(P`, t`) '
$
ru(P`)
t` tTTI
L`
%
Performance Model
8
๏ User collects coded elements associated with layerN`u `
N`(P`, t`) '
$
ru(P`)
t` tTTI
L`
%
Performance Model
8
๏ User collects coded elements associated with layerN`u `
Tx+pow.
N`(P`, t`) '
$
ru(P`)
t` tTTI
L`
%
Performance Model
8
๏ User collects coded elements associated with layerN`u `
Tx+pow. No.+of+PDU+tx
N`(P`, t`) '
$
ru(P`)
t` tTTI
L`
%
Performance Model
8
๏ User collects coded elements associated with layerN`u `
Tx+pow. No.+of+PDU+tx
Cod.+el.+bit+length
TTI+durationUser+reception+rate
N`(P`, t`) '
$
ru(P`)
t` tTTI
L`
%
Performance Model
8
๏ User collects coded elements associated with layerN`u `
u `๏ A user recovers the layer if it collects linearly
independent coded elements associated with that layer, which
occurs with probability
✴ A. Tassi et al., “Resource-Allocation Frameworks for Network-
Coded Layered Multimedia Multicast Services”, IEEE J. Sel.
Areas Commun., vol. 33, no. 2, Feb. 2015
gu(P`, t`) =
K` 1Y
j=0

1
1
qN`(P`,t`) j
K`
Tx+pow. No.+of+PDU+tx
Cod.+el.+bit+length
TTI+durationUser+reception+rate
2. Proposed Resource Allocation Modelling and
Heuristic Solution
Problem Formulation
10
๏ The battery efficiency is obtained by accommodating the
transmission power and the number of PDU transmissions
per service layer.
(MSP) min max
`2{1,...,L}
t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U ` 2 {1, . . . , L} (2)
K`  t`  dGoP ` 2 {1, . . . , L} (3)
LX
`=1
P`  ˆP (4)
P` 2 R+
, t` 2 N ` 2 {1, . . . , L} (5)
During+each+subframe+the+total+
transmission+power+is+limited+
Each+service+level+shall+be+achieved+
by+a+predetermined+fraction+of+users+
within+a+certain+time.+
Max.+Sleep+Period
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
11
(MSP) min max
`2{1,...,L}
t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U ` 2 {1, . . . , L} (2)
K`  t`  dGoP ` 2 {1, . . . , L} (3)
LX
`=1
P`  ˆP (4)
P` 2 R+
, t` 2 N ` 2 {1, . . . , L} (5)
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
11
(MSP) min max
`2{1,...,L}
t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U ` 2 {1, . . . , L} (2)
K`  t`  dGoP ` 2 {1, . . . , L} (3)
LX
`=1
P`  ˆP (4)
P` 2 R+
, t` 2 N ` 2 {1, . . . , L} (5)
(USP)
Unconst.+Sleep+Period
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
12
(USP-`) min t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U (2)
K`  t`  dGoP (3)
๏ Proposition - If the solution of (USP-l) exists, it belongs to
๏ However, the USP solution may not be feasible for MSP.
L`
.
=
n
(P`, t`) 2 R+
⇥ N K`  t`  dGoP ^
PU
u=1
⇣
gu(P`, t`)
⌘
ˆ)= ˆ✓`U
o
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
12
(USP-`) min t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U (2)
K`  t`  dGoP (3)
๏ Proposition - If the solution of (USP-l) exists, it belongs to
๏ However, the USP solution may not be feasible for MSP.
L`
.
=
n
(P`, t`) 2 R+
⇥ N K`  t`  dGoP ^
PU
u=1
⇣
gu(P`, t`)
⌘
ˆ)= ˆ✓`U
o
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
12
(USP-`) min t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U (2)
K`  t`  dGoP (3)
๏ Proposition - If the solution of (USP-l) exists, it belongs to
๏ However, the USP solution may not be feasible for MSP.
L`
.
=
n
(P`, t`) 2 R+
⇥ N K`  t`  dGoP ^
PU
u=1
⇣
gu(P`, t`)
⌘
ˆ)= ˆ✓`U
o
t`
P`
Problem Heuristic
๏ The MSP is an hard integer optimisation problem because of
the coupling constraints among variables. We proposed the
following heuristic strategy.
12
(USP-`) min t` (1)
subject to
UX
u=1
⇣
gu(P`, t`) ˆ
⌘
ˆ✓`U (2)
K`  t`  dGoP (3)
๏ Proposition - If the solution of (USP-l) exists, it belongs to
๏ However, the USP solution may not be feasible for MSP.
L`
.
=
n
(P`, t`) 2 R+
⇥ N K`  t`  dGoP ^
PU
u=1
⇣
gu(P`, t`)
⌘
ˆ)= ˆ✓`U
o
t`
P`
Heuristic Procedure
13
t`
P`
dGoP
๏ H-MSP makes feasible the optimum solution of USP.
Frontier+of USP-1
USP-2
Frontier+of USP-3
Frontier+of
Heuristic Procedure
13
t`
P`
dGoP
๏ H-MSP makes feasible the optimum solution of USP.
Optimum+values+of+++++++++++++++++,+++++++++++++++++and+
K1 K2 K3
USP-1 USP-2 USP-3
Frontier+of USP-1
USP-2
Frontier+of USP-3
Frontier+of
Heuristic Procedure
13
t`
P`
dGoP
๏ H-MSP makes feasible the optimum solution of USP.
(i) Start+from+the+UTP+solution+
(ii) Alter+the+component+with+the+greatest+value+of++
(iii) Repeat+the+proc.+until+the+power+budget+is+met.
t`
Optimum+values+of+++++++++++++++++,+++++++++++++++++and+
K1 K2 K3
USP-1 USP-2 USP-3
Frontier+of USP-1
USP-2
Frontier+of USP-3
Frontier+of
3. Numerical Results
Numerical Results
15
๏ We compared the proposed strategies with a classic Uniform
Power Allocation (UPA) strategy
๏ System performance was evaluated in terms of
Relies+on+the+considered+
LTELA+stack
(UPA) min
`2{1,...,L}
t`
subject to K`  t`  dGoP ` 2 {1, . . . , L}
P` = ˆP/L ` 2 {1, . . . , L}
✏=
dGoP max
`=1,...,L
(t`)
dGoP
Normalized+sleep+period
Numerical Results
16
SFN cell sector
Interfering cell sector
SFN base station
Interfering base station
Center of the Cell I
Center of the Cell II
Scenario+with+a+high+
heterogeneity.+80+UEs+
equally+spaced
We+considered+

3Llayer+and+4Llayer+
streams
Numerical Results
17
20 25 30 35 40 45 50 55 60 65 70 75 80
0
0.2
0.4
0.6
0.8
Power [W]
ε
MSP
H-MSP
UPA
6 RBP
9 RBP
12 RBP
3Llayer+stream
MSP+and+HLMSP+are+close

(PDUs+of+6+RBPs)
1+RBP+=+180+KHz
Numerical Results
17
20 25 30 35 40 45 50 55 60 65 70 75 80
0
0.2
0.4
0.6
0.8
Power [W]
ε
MSP
H-MSP
UPA
6 RBP
9 RBP
12 RBP
3Llayer+stream
MSP+and+HLMSP+are+close

(PDUs+of+6+RBPs)
1+RBP+=+180+KHz
Numerical Results
17
20 25 30 35 40 45 50 55 60 65 70 75 80
0
0.2
0.4
0.6
0.8
Power [W]
ε
MSP
H-MSP
UPA
6 RBP
9 RBP
12 RBP
3Llayer+stream
MSP+and+HLMSP+are+close

(PDUs+of+6+RBPs)
UPA+cannot+always+%ind+a+solution

(PDUs+of+6+RBPs)
1+RBP+=+180+KHz
Numerical Results
18
20 25 30 35 40 45 50 55 60 65 70 75 80
0
0.2
0.4
0.6
0.8
Power [W]
ε
MSP
H-MSP
UPA
6 RBP
9 RBP
12 RBP
MSP+and+HLMSP+are+close

(PDUs+of+6+RBPs)
UPA+cannot+always+%ind+a+solution

(PDUs+of+6+RBPs)
1+RBP+=+180+KHz
4Llayer+stream
4. Concluding Remarks
Concluding Remarks
20
๏ We propose an optimal and heuristic radio resource
allocation strategy, namely MSP and H-MSP strategies,
which maximize the user sleep period and improve the
reliability of communications by means of an optimized
RLNC approach
๏ Not only the the user energy consumption is reduced but
also the developed strategies can meet the desired QoS
levels
๏ Results show that the developed H-MSP strategy provide a
good quality feasible solution to the MSP model in a finite
number of steps
๏ The proposed strategy is characterized by sleep periods that
are up to 40% greater than those provided by the considered
UPA approach.
Thank you for
your attention
For more information

http://goo.gl/Z4Y9YF
A. Tassi, I. Chatzigeorgiou, and D. Vukobratović, “Resource Allocation
Frameworks for Network-coded Layered Multimedia Multicast
Services”, IEEE J. Sel. Areas Commun., vol. 33, no. 2, Feb. 2015
London, 11th June 2015
Sleep Period Optimization Model For
Layered Video Service Delivery Over
eMBMS Networks
IEEE ICC 2015 - SAC, Energy Efficient Wireless Systems
Lorenzo Carlà, Francesco Chiti, Romano Fantacci, A. Tassi
a.tassi@{lancaster.ac.uk, bristol.ac.uk}

Más contenido relacionado

La actualidad más candente

CUDA and Caffe for deep learning
CUDA and Caffe for deep learningCUDA and Caffe for deep learning
CUDA and Caffe for deep learningAmgad Muhammad
 
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...T. E. BOGALE
 
Oxford 05-oct-2012
Oxford 05-oct-2012Oxford 05-oct-2012
Oxford 05-oct-2012Ted Dunning
 
Technical Tricks of Vowpal Wabbit
Technical Tricks of Vowpal WabbitTechnical Tricks of Vowpal Wabbit
Technical Tricks of Vowpal Wabbitjakehofman
 
Cmu Lecture on Hadoop Performance
Cmu Lecture on Hadoop PerformanceCmu Lecture on Hadoop Performance
Cmu Lecture on Hadoop PerformanceTed Dunning
 
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"YeChan(Paul) Kim
 
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)Naoto Ohsaka
 
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016MLconf
 
Dynamic Influence Analysis in Evolving Networks (VLDB'16)
Dynamic Influence Analysis in Evolving Networks (VLDB'16)Dynamic Influence Analysis in Evolving Networks (VLDB'16)
Dynamic Influence Analysis in Evolving Networks (VLDB'16)Naoto Ohsaka
 
Processing Reachability Queries with Realistic Constraints on Massive Network...
Processing Reachability Queries with Realistic Constraints on Massive Network...Processing Reachability Queries with Realistic Constraints on Massive Network...
Processing Reachability Queries with Realistic Constraints on Massive Network...BigMine
 
Large scale logistic regression and linear support vector machines using spark
Large scale logistic regression and linear support vector machines using sparkLarge scale logistic regression and linear support vector machines using spark
Large scale logistic regression and linear support vector machines using sparkMila, Université de Montréal
 
An Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing ProblemAn Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing ProblemCSCJournals
 
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...MLconf
 
[241]large scale search with polysemous codes
[241]large scale search with polysemous codes[241]large scale search with polysemous codes
[241]large scale search with polysemous codesNAVER D2
 
強化学習の分散アーキテクチャ変遷
強化学習の分散アーキテクチャ変遷強化学習の分散アーキテクチャ変遷
強化学習の分散アーキテクチャ変遷Eiji Sekiya
 
Zero-Forcing Precoding and Generalized Inverses
Zero-Forcing Precoding and Generalized InversesZero-Forcing Precoding and Generalized Inverses
Zero-Forcing Precoding and Generalized InversesDaniel Tai
 
Deep Convolutional GANs - meaning of latent space
Deep Convolutional GANs - meaning of latent spaceDeep Convolutional GANs - meaning of latent space
Deep Convolutional GANs - meaning of latent spaceHansol Kang
 
DIY Deep Learning with Caffe Workshop
DIY Deep Learning with Caffe WorkshopDIY Deep Learning with Caffe Workshop
DIY Deep Learning with Caffe Workshopodsc
 
Exploring Optimization in Vowpal Wabbit
Exploring Optimization in Vowpal WabbitExploring Optimization in Vowpal Wabbit
Exploring Optimization in Vowpal WabbitShiladitya Sen
 

La actualidad más candente (20)

CUDA and Caffe for deep learning
CUDA and Caffe for deep learningCUDA and Caffe for deep learning
CUDA and Caffe for deep learning
 
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...
Pilot Contamination Mitigation for Wideband Massive MIMO: Number of Cells Vs ...
 
Oxford 05-oct-2012
Oxford 05-oct-2012Oxford 05-oct-2012
Oxford 05-oct-2012
 
Technical Tricks of Vowpal Wabbit
Technical Tricks of Vowpal WabbitTechnical Tricks of Vowpal Wabbit
Technical Tricks of Vowpal Wabbit
 
Cmu Lecture on Hadoop Performance
Cmu Lecture on Hadoop PerformanceCmu Lecture on Hadoop Performance
Cmu Lecture on Hadoop Performance
 
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"
pycon2018 "RL Adventure : DQN 부터 Rainbow DQN까지"
 
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)
Maximizing Time-decaying Influence in Social Networks (ECML-PKDD'16)
 
Analysis_molf
Analysis_molfAnalysis_molf
Analysis_molf
 
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016
Alex Smola, Director of Machine Learning, AWS/Amazon, at MLconf SF 2016
 
Dynamic Influence Analysis in Evolving Networks (VLDB'16)
Dynamic Influence Analysis in Evolving Networks (VLDB'16)Dynamic Influence Analysis in Evolving Networks (VLDB'16)
Dynamic Influence Analysis in Evolving Networks (VLDB'16)
 
Processing Reachability Queries with Realistic Constraints on Massive Network...
Processing Reachability Queries with Realistic Constraints on Massive Network...Processing Reachability Queries with Realistic Constraints on Massive Network...
Processing Reachability Queries with Realistic Constraints on Massive Network...
 
Large scale logistic regression and linear support vector machines using spark
Large scale logistic regression and linear support vector machines using sparkLarge scale logistic regression and linear support vector machines using spark
Large scale logistic regression and linear support vector machines using spark
 
An Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing ProblemAn Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing Problem
 
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...
Anima Anadkumar, Principal Scientist, Amazon Web Services, Endowed Professor,...
 
[241]large scale search with polysemous codes
[241]large scale search with polysemous codes[241]large scale search with polysemous codes
[241]large scale search with polysemous codes
 
強化学習の分散アーキテクチャ変遷
強化学習の分散アーキテクチャ変遷強化学習の分散アーキテクチャ変遷
強化学習の分散アーキテクチャ変遷
 
Zero-Forcing Precoding and Generalized Inverses
Zero-Forcing Precoding and Generalized InversesZero-Forcing Precoding and Generalized Inverses
Zero-Forcing Precoding and Generalized Inverses
 
Deep Convolutional GANs - meaning of latent space
Deep Convolutional GANs - meaning of latent spaceDeep Convolutional GANs - meaning of latent space
Deep Convolutional GANs - meaning of latent space
 
DIY Deep Learning with Caffe Workshop
DIY Deep Learning with Caffe WorkshopDIY Deep Learning with Caffe Workshop
DIY Deep Learning with Caffe Workshop
 
Exploring Optimization in Vowpal Wabbit
Exploring Optimization in Vowpal WabbitExploring Optimization in Vowpal Wabbit
Exploring Optimization in Vowpal Wabbit
 

Destacado

Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)
Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)
Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)Andrea Tassi
 
Silicon Cluster Optimization Using Extended Compact Genetic Algorithm
Silicon Cluster Optimization Using Extended Compact Genetic AlgorithmSilicon Cluster Optimization Using Extended Compact Genetic Algorithm
Silicon Cluster Optimization Using Extended Compact Genetic Algorithmkknsastry
 
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of Models
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of ModelsReal-Coded Extended Compact Genetic Algorithm based on Mixtures of Models
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of ModelsPier Luca Lanzi
 
On Extended Compact Genetic Algorithm
On Extended Compact Genetic AlgorithmOn Extended Compact Genetic Algorithm
On Extended Compact Genetic Algorithmkknsastry
 
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...Andrea Tassi
 
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)Andrea Tassi
 
Optimized Network-coded Scalable Video Multicasting over eMBMS Networks
Optimized Network-coded Scalable Video Multicasting over eMBMS NetworksOptimized Network-coded Scalable Video Multicasting over eMBMS Networks
Optimized Network-coded Scalable Video Multicasting over eMBMS NetworksAndrea Tassi
 
Research techniques
Research techniquesResearch techniques
Research techniquesMia Buckley
 
On Optimization of Network-coded Scalable Multimedia Service Multicasting
On Optimization of Network-coded Scalable Multimedia Service MulticastingOn Optimization of Network-coded Scalable Multimedia Service Multicasting
On Optimization of Network-coded Scalable Multimedia Service MulticastingAndrea Tassi
 
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)Andrea Tassi
 
Sparse Random Network Coding for Reliable Multicast Services
Sparse Random Network Coding for Reliable Multicast ServicesSparse Random Network Coding for Reliable Multicast Services
Sparse Random Network Coding for Reliable Multicast ServicesAndrea Tassi
 
R2D2 Project (EP/L006251/1) - Research Objectives & Outcomes
R2D2 Project (EP/L006251/1) - Research Objectives & OutcomesR2D2 Project (EP/L006251/1) - Research Objectives & Outcomes
R2D2 Project (EP/L006251/1) - Research Objectives & OutcomesAndrea Tassi
 
Talk on Resource Allocation Strategies for Layered Multimedia Multicast Services
Talk on Resource Allocation Strategies for Layered Multimedia Multicast ServicesTalk on Resource Allocation Strategies for Layered Multimedia Multicast Services
Talk on Resource Allocation Strategies for Layered Multimedia Multicast ServicesAndrea Tassi
 
A short introduction to Network coding
A short introduction to Network codingA short introduction to Network coding
A short introduction to Network codingArash Pourdamghani
 
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...Andrea Tassi
 
Simple regenerating codes: Network Coding for Cloud Storage
Simple regenerating codes: Network Coding for Cloud StorageSimple regenerating codes: Network Coding for Cloud Storage
Simple regenerating codes: Network Coding for Cloud StorageKevin Tong
 

Destacado (20)

Lecture
LectureLecture
Lecture
 
Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)
Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)
Parte 1 - Linux ed i sistemi embedded per le reti (di Andrea Tassi)
 
PRINCE2 Practitioner
PRINCE2 PractitionerPRINCE2 Practitioner
PRINCE2 Practitioner
 
RLNC
RLNCRLNC
RLNC
 
Silicon Cluster Optimization Using Extended Compact Genetic Algorithm
Silicon Cluster Optimization Using Extended Compact Genetic AlgorithmSilicon Cluster Optimization Using Extended Compact Genetic Algorithm
Silicon Cluster Optimization Using Extended Compact Genetic Algorithm
 
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of Models
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of ModelsReal-Coded Extended Compact Genetic Algorithm based on Mixtures of Models
Real-Coded Extended Compact Genetic Algorithm based on Mixtures of Models
 
On Extended Compact Genetic Algorithm
On Extended Compact Genetic AlgorithmOn Extended Compact Genetic Algorithm
On Extended Compact Genetic Algorithm
 
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...
Presentation of 'A Novel Convex Power Adaptation Strategy for Multicast Commu...
 
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)
Parte 2 - Linux ed i sistemi embedded per le reti (di Massimiliano Toce)
 
Optimized Network-coded Scalable Video Multicasting over eMBMS Networks
Optimized Network-coded Scalable Video Multicasting over eMBMS NetworksOptimized Network-coded Scalable Video Multicasting over eMBMS Networks
Optimized Network-coded Scalable Video Multicasting over eMBMS Networks
 
Research techniques
Research techniquesResearch techniques
Research techniques
 
On Optimization of Network-coded Scalable Multimedia Service Multicasting
On Optimization of Network-coded Scalable Multimedia Service MulticastingOn Optimization of Network-coded Scalable Multimedia Service Multicasting
On Optimization of Network-coded Scalable Multimedia Service Multicasting
 
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)
Parte 3 - Linux ed i sistemi embedded per le reti (di Riccardo Coppola)
 
Sparse Random Network Coding for Reliable Multicast Services
Sparse Random Network Coding for Reliable Multicast ServicesSparse Random Network Coding for Reliable Multicast Services
Sparse Random Network Coding for Reliable Multicast Services
 
R2D2 Project (EP/L006251/1) - Research Objectives & Outcomes
R2D2 Project (EP/L006251/1) - Research Objectives & OutcomesR2D2 Project (EP/L006251/1) - Research Objectives & Outcomes
R2D2 Project (EP/L006251/1) - Research Objectives & Outcomes
 
Talk on Resource Allocation Strategies for Layered Multimedia Multicast Services
Talk on Resource Allocation Strategies for Layered Multimedia Multicast ServicesTalk on Resource Allocation Strategies for Layered Multimedia Multicast Services
Talk on Resource Allocation Strategies for Layered Multimedia Multicast Services
 
A short introduction to Network coding
A short introduction to Network codingA short introduction to Network coding
A short introduction to Network coding
 
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...
Presentation of 'Reliable Rate-Optimized Video Multicasting Services over LTE...
 
Introduction to Network Coding
Introduction to Network CodingIntroduction to Network Coding
Introduction to Network Coding
 
Simple regenerating codes: Network Coding for Cloud Storage
Simple regenerating codes: Network Coding for Cloud StorageSimple regenerating codes: Network Coding for Cloud Storage
Simple regenerating codes: Network Coding for Cloud Storage
 

Similar a Sleep Period Optimization Model For Layered Video Service Delivery Over eMBMS Networks

Analysis of multipath channel delay estimation using subspace fitting
Analysis of multipath channel delay estimation using subspace fittingAnalysis of multipath channel delay estimation using subspace fitting
Analysis of multipath channel delay estimation using subspace fittingTarik Kazaz
 
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...Marisa Paryasto
 
Distributed solution of stochastic optimal control problem on GPUs
Distributed solution of stochastic optimal control problem on GPUsDistributed solution of stochastic optimal control problem on GPUs
Distributed solution of stochastic optimal control problem on GPUsPantelis Sopasakis
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsAjay Bidyarthy
 
Introduction to data structures and complexity.pptx
Introduction to data structures and complexity.pptxIntroduction to data structures and complexity.pptx
Introduction to data structures and complexity.pptxPJS KUMAR
 
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMLITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMIJNSA Journal
 
Response Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty QuantificationResponse Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty QuantificationAlexander Litvinenko
 
Introduction to Algorithms
Introduction to AlgorithmsIntroduction to Algorithms
Introduction to AlgorithmsVenkatesh Iyer
 
SPU Optimizations - Part 2
SPU Optimizations - Part 2SPU Optimizations - Part 2
SPU Optimizations - Part 2Naughty Dog
 
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...Pedro Craggett
 
Stack squeues lists
Stack squeues listsStack squeues lists
Stack squeues listsJames Wong
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues listsHarry Potter
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues listsYoung Alista
 
Stacksqueueslists
StacksqueueslistsStacksqueueslists
StacksqueueslistsFraboni Ec
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues listsTony Nguyen
 
SIAM_QMC_Fourier_Pricing_Pres.pdf
SIAM_QMC_Fourier_Pricing_Pres.pdfSIAM_QMC_Fourier_Pricing_Pres.pdf
SIAM_QMC_Fourier_Pricing_Pres.pdfMichaelSamet4
 

Similar a Sleep Period Optimization Model For Layered Video Service Delivery Over eMBMS Networks (20)

Analysis of multipath channel delay estimation using subspace fitting
Analysis of multipath channel delay estimation using subspace fittingAnalysis of multipath channel delay estimation using subspace fitting
Analysis of multipath channel delay estimation using subspace fitting
 
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptogr...
 
Distributed solution of stochastic optimal control problem on GPUs
Distributed solution of stochastic optimal control problem on GPUsDistributed solution of stochastic optimal control problem on GPUs
Distributed solution of stochastic optimal control problem on GPUs
 
Icmtea
IcmteaIcmtea
Icmtea
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation Algorithms
 
presentation_2.pdf
presentation_2.pdfpresentation_2.pdf
presentation_2.pdf
 
Introduction to data structures and complexity.pptx
Introduction to data structures and complexity.pptxIntroduction to data structures and complexity.pptx
Introduction to data structures and complexity.pptx
 
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMLITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM
 
Response Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty QuantificationResponse Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty Quantification
 
Introduction to Algorithms
Introduction to AlgorithmsIntroduction to Algorithms
Introduction to Algorithms
 
SPU Optimizations - Part 2
SPU Optimizations - Part 2SPU Optimizations - Part 2
SPU Optimizations - Part 2
 
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...
An Integrated Parallel GNFS Algorithm For Integer Factorization Based On Linb...
 
Stack squeues lists
Stack squeues listsStack squeues lists
Stack squeues lists
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues lists
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues lists
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues lists
 
Stacksqueueslists
StacksqueueslistsStacksqueueslists
Stacksqueueslists
 
Stacks queues lists
Stacks queues listsStacks queues lists
Stacks queues lists
 
SIAM_QMC_Fourier_Pricing_Pres.pdf
SIAM_QMC_Fourier_Pricing_Pres.pdfSIAM_QMC_Fourier_Pricing_Pres.pdf
SIAM_QMC_Fourier_Pricing_Pres.pdf
 
Cdc18 dg lee
Cdc18 dg leeCdc18 dg lee
Cdc18 dg lee
 

Último

Introduction to ICANN and Fellowship program by Shreedeep Rayamajhi.pdf
Introduction to ICANN and Fellowship program  by Shreedeep Rayamajhi.pdfIntroduction to ICANN and Fellowship program  by Shreedeep Rayamajhi.pdf
Introduction to ICANN and Fellowship program by Shreedeep Rayamajhi.pdfShreedeep Rayamajhi
 
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdf
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdfLESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdf
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdfmchristianalwyn
 
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...Benefits of doing Internet peering and running an Internet Exchange (IX) pres...
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...APNIC
 
Bio Medical Waste Management Guideliness 2023 ppt.pptx
Bio Medical Waste Management Guideliness 2023 ppt.pptxBio Medical Waste Management Guideliness 2023 ppt.pptx
Bio Medical Waste Management Guideliness 2023 ppt.pptxnaveenithkrishnan
 
Presentation2.pptx - JoyPress Wordpress
Presentation2.pptx -  JoyPress WordpressPresentation2.pptx -  JoyPress Wordpress
Presentation2.pptx - JoyPress Wordpressssuser166378
 
Check out the Free Landing Page Hosting in 2024
Check out the Free Landing Page Hosting in 2024Check out the Free Landing Page Hosting in 2024
Check out the Free Landing Page Hosting in 2024Shubham Pant
 
Zero-day Vulnerabilities
Zero-day VulnerabilitiesZero-day Vulnerabilities
Zero-day Vulnerabilitiesalihassaah1994
 
Computer 10 Lesson 8: Building a Website
Computer 10 Lesson 8: Building a WebsiteComputer 10 Lesson 8: Building a Website
Computer 10 Lesson 8: Building a WebsiteMavein
 
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced Horizons
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced HorizonsVision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced Horizons
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced HorizonsRoxana Stingu
 
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDS
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDSTYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDS
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDSedrianrheine
 
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024Jan Löffler
 
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASS
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASSLESSON 10/ GROUP 10/ ST. THOMAS AQUINASS
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASSlesteraporado16
 

Último (12)

Introduction to ICANN and Fellowship program by Shreedeep Rayamajhi.pdf
Introduction to ICANN and Fellowship program  by Shreedeep Rayamajhi.pdfIntroduction to ICANN and Fellowship program  by Shreedeep Rayamajhi.pdf
Introduction to ICANN and Fellowship program by Shreedeep Rayamajhi.pdf
 
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdf
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdfLESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdf
LESSON 5 GROUP 10 ST. THOMAS AQUINAS.pdf
 
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...Benefits of doing Internet peering and running an Internet Exchange (IX) pres...
Benefits of doing Internet peering and running an Internet Exchange (IX) pres...
 
Bio Medical Waste Management Guideliness 2023 ppt.pptx
Bio Medical Waste Management Guideliness 2023 ppt.pptxBio Medical Waste Management Guideliness 2023 ppt.pptx
Bio Medical Waste Management Guideliness 2023 ppt.pptx
 
Presentation2.pptx - JoyPress Wordpress
Presentation2.pptx -  JoyPress WordpressPresentation2.pptx -  JoyPress Wordpress
Presentation2.pptx - JoyPress Wordpress
 
Check out the Free Landing Page Hosting in 2024
Check out the Free Landing Page Hosting in 2024Check out the Free Landing Page Hosting in 2024
Check out the Free Landing Page Hosting in 2024
 
Zero-day Vulnerabilities
Zero-day VulnerabilitiesZero-day Vulnerabilities
Zero-day Vulnerabilities
 
Computer 10 Lesson 8: Building a Website
Computer 10 Lesson 8: Building a WebsiteComputer 10 Lesson 8: Building a Website
Computer 10 Lesson 8: Building a Website
 
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced Horizons
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced HorizonsVision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced Horizons
Vision Forward: Tracing Image Search SEO From Its Roots To AI-Enhanced Horizons
 
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDS
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDSTYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDS
TYPES AND DEFINITION OF ONLINE CRIMES AND HAZARDS
 
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024
WordPress by the numbers - Jan Loeffler, CTO WebPros, CloudFest 2024
 
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASS
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASSLESSON 10/ GROUP 10/ ST. THOMAS AQUINASS
LESSON 10/ GROUP 10/ ST. THOMAS AQUINASS
 

Sleep Period Optimization Model For Layered Video Service Delivery Over eMBMS Networks

  • 1. London, 11th June 2015 Sleep Period Optimization Model For Layered Video Service Delivery Over eMBMS Networks IEEE ICC 2015 - SAC, Energy Efficient Wireless Systems Lorenzo Carlà, Francesco Chiti, Romano Fantacci, A. Tassi a.tassi@{lancaster.ac.uk, bristol.ac.uk}
  • 2. Starting Point and Goals ๏ Delivery of multimedia broadcast/multicast services over 
 4G/5G networks is a challenging task. Especially for the point of view of the user battery efficiency. ๏ During the reception of high data rate video streams, the user radio interface is in an active state for a not be negligible time. That has an impact on the battery, we minimize the active time. ๏ There are many studies dealing with DRX optimization but they mainly refer to Point-to-Point services. Goals ๏ Advanced eMBMS Scenario - Scalable video service (such as H.264/SVC) multicasting. ๏ Resource optimisation - Minimizing the transmission time of a video stream and, hence, the battery footprint. 2
  • 3. Index 1. System Parameters and Performance Analysis 2. Proposed Resource Allocation Modeling and Heuristic Solution 3. Analytical Results 4. Concluding Remarks 3
  • 4. 1. System Parameters and Performance Analysis
  • 5. System Model ๏ One-hop wireless communication system composed of a Single Frequency Network (SFN) and a multicast group of U users 5 ๏ Layered service consists of a basic layer and multiple enhancement layers. ๏ All the BSs forming the SFN multicast the same layered video service, in a synchronous fashion. ๏ Reliability ensured via the RLNC principle. BS BS BS BS M1/M2 (MCE / MBMS-GW) SFN 4 1 2 3 UE3 UEUUE2 UE1 UE4 LTE-A Core Network
  • 6. 6 ๏ Encoding performed over each service layer independently from the others. ๏ The source node will linearly combine the data packets composing the -th layer and will generate a stream of coded packets , where ๏ is a layered source message of source packets, classified into service layers x = {x1, . . . , xK} RLNC Principle yj = klX i=1 gj,i xi Coef%icients+of+the+linear+ combination+are+selected+a+ certain+%inite+%ield K1 K2 K3 x1 x2 xK. . .. . . K L KL ` {yj}j
  • 7. 7 RLNC and LTE-A Data$stream associated$with$$ $ ⊗⊗ ⊗ ⊕ TB MACPHY Data$stream associated$with$$ $ MAC$PDU associated with x1 x2 xK. . . gj,1 gj,2 gj,K2 . . . xK2 y1 yj. . . . . . Source$Message . . . yj v1 v2 v2 Service+layers+ arrive+at+the+MAC+ layer Coded+elements+ are+generated Depending+on+the+ MCS+a+certain+no.+of+ cod.+el.+are+mapped+ onto+a+PDU+ ๏ Coded elements of different layers cannot be mixed within a PDU ๏ One PDU per PHY layer Transport Block. TBs of the same layer are transmitted with the same power.
  • 8. N`(P`, t`) ' $ ru(P`) t` tTTI L` % Performance Model 8 ๏ User collects coded elements associated with layerN`u `
  • 9. N`(P`, t`) ' $ ru(P`) t` tTTI L` % Performance Model 8 ๏ User collects coded elements associated with layerN`u ` Tx+pow.
  • 10. N`(P`, t`) ' $ ru(P`) t` tTTI L` % Performance Model 8 ๏ User collects coded elements associated with layerN`u ` Tx+pow. No.+of+PDU+tx
  • 11. N`(P`, t`) ' $ ru(P`) t` tTTI L` % Performance Model 8 ๏ User collects coded elements associated with layerN`u ` Tx+pow. No.+of+PDU+tx Cod.+el.+bit+length TTI+durationUser+reception+rate
  • 12. N`(P`, t`) ' $ ru(P`) t` tTTI L` % Performance Model 8 ๏ User collects coded elements associated with layerN`u ` u `๏ A user recovers the layer if it collects linearly independent coded elements associated with that layer, which occurs with probability ✴ A. Tassi et al., “Resource-Allocation Frameworks for Network- Coded Layered Multimedia Multicast Services”, IEEE J. Sel. Areas Commun., vol. 33, no. 2, Feb. 2015 gu(P`, t`) = K` 1Y j=0  1 1 qN`(P`,t`) j K` Tx+pow. No.+of+PDU+tx Cod.+el.+bit+length TTI+durationUser+reception+rate
  • 13. 2. Proposed Resource Allocation Modelling and Heuristic Solution
  • 14. Problem Formulation 10 ๏ The battery efficiency is obtained by accommodating the transmission power and the number of PDU transmissions per service layer. (MSP) min max `2{1,...,L} t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U ` 2 {1, . . . , L} (2) K`  t`  dGoP ` 2 {1, . . . , L} (3) LX `=1 P`  ˆP (4) P` 2 R+ , t` 2 N ` 2 {1, . . . , L} (5) During+each+subframe+the+total+ transmission+power+is+limited+ Each+service+level+shall+be+achieved+ by+a+predetermined+fraction+of+users+ within+a+certain+time.+ Max.+Sleep+Period
  • 15. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 11 (MSP) min max `2{1,...,L} t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U ` 2 {1, . . . , L} (2) K`  t`  dGoP ` 2 {1, . . . , L} (3) LX `=1 P`  ˆP (4) P` 2 R+ , t` 2 N ` 2 {1, . . . , L} (5)
  • 16. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 11 (MSP) min max `2{1,...,L} t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U ` 2 {1, . . . , L} (2) K`  t`  dGoP ` 2 {1, . . . , L} (3) LX `=1 P`  ˆP (4) P` 2 R+ , t` 2 N ` 2 {1, . . . , L} (5) (USP) Unconst.+Sleep+Period
  • 17. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 12 (USP-`) min t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U (2) K`  t`  dGoP (3) ๏ Proposition - If the solution of (USP-l) exists, it belongs to ๏ However, the USP solution may not be feasible for MSP. L` . = n (P`, t`) 2 R+ ⇥ N K`  t`  dGoP ^ PU u=1 ⇣ gu(P`, t`) ⌘ ˆ)= ˆ✓`U o
  • 18. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 12 (USP-`) min t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U (2) K`  t`  dGoP (3) ๏ Proposition - If the solution of (USP-l) exists, it belongs to ๏ However, the USP solution may not be feasible for MSP. L` . = n (P`, t`) 2 R+ ⇥ N K`  t`  dGoP ^ PU u=1 ⇣ gu(P`, t`) ⌘ ˆ)= ˆ✓`U o
  • 19. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 12 (USP-`) min t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U (2) K`  t`  dGoP (3) ๏ Proposition - If the solution of (USP-l) exists, it belongs to ๏ However, the USP solution may not be feasible for MSP. L` . = n (P`, t`) 2 R+ ⇥ N K`  t`  dGoP ^ PU u=1 ⇣ gu(P`, t`) ⌘ ˆ)= ˆ✓`U o t` P`
  • 20. Problem Heuristic ๏ The MSP is an hard integer optimisation problem because of the coupling constraints among variables. We proposed the following heuristic strategy. 12 (USP-`) min t` (1) subject to UX u=1 ⇣ gu(P`, t`) ˆ ⌘ ˆ✓`U (2) K`  t`  dGoP (3) ๏ Proposition - If the solution of (USP-l) exists, it belongs to ๏ However, the USP solution may not be feasible for MSP. L` . = n (P`, t`) 2 R+ ⇥ N K`  t`  dGoP ^ PU u=1 ⇣ gu(P`, t`) ⌘ ˆ)= ˆ✓`U o t` P`
  • 21. Heuristic Procedure 13 t` P` dGoP ๏ H-MSP makes feasible the optimum solution of USP. Frontier+of USP-1 USP-2 Frontier+of USP-3 Frontier+of
  • 22. Heuristic Procedure 13 t` P` dGoP ๏ H-MSP makes feasible the optimum solution of USP. Optimum+values+of+++++++++++++++++,+++++++++++++++++and+ K1 K2 K3 USP-1 USP-2 USP-3 Frontier+of USP-1 USP-2 Frontier+of USP-3 Frontier+of
  • 23. Heuristic Procedure 13 t` P` dGoP ๏ H-MSP makes feasible the optimum solution of USP. (i) Start+from+the+UTP+solution+ (ii) Alter+the+component+with+the+greatest+value+of++ (iii) Repeat+the+proc.+until+the+power+budget+is+met. t` Optimum+values+of+++++++++++++++++,+++++++++++++++++and+ K1 K2 K3 USP-1 USP-2 USP-3 Frontier+of USP-1 USP-2 Frontier+of USP-3 Frontier+of
  • 25. Numerical Results 15 ๏ We compared the proposed strategies with a classic Uniform Power Allocation (UPA) strategy ๏ System performance was evaluated in terms of Relies+on+the+considered+ LTELA+stack (UPA) min `2{1,...,L} t` subject to K`  t`  dGoP ` 2 {1, . . . , L} P` = ˆP/L ` 2 {1, . . . , L} ✏= dGoP max `=1,...,L (t`) dGoP Normalized+sleep+period
  • 26. Numerical Results 16 SFN cell sector Interfering cell sector SFN base station Interfering base station Center of the Cell I Center of the Cell II Scenario+with+a+high+ heterogeneity.+80+UEs+ equally+spaced We+considered+
 3Llayer+and+4Llayer+ streams
  • 27. Numerical Results 17 20 25 30 35 40 45 50 55 60 65 70 75 80 0 0.2 0.4 0.6 0.8 Power [W] ε MSP H-MSP UPA 6 RBP 9 RBP 12 RBP 3Llayer+stream MSP+and+HLMSP+are+close
 (PDUs+of+6+RBPs) 1+RBP+=+180+KHz
  • 28. Numerical Results 17 20 25 30 35 40 45 50 55 60 65 70 75 80 0 0.2 0.4 0.6 0.8 Power [W] ε MSP H-MSP UPA 6 RBP 9 RBP 12 RBP 3Llayer+stream MSP+and+HLMSP+are+close
 (PDUs+of+6+RBPs) 1+RBP+=+180+KHz
  • 29. Numerical Results 17 20 25 30 35 40 45 50 55 60 65 70 75 80 0 0.2 0.4 0.6 0.8 Power [W] ε MSP H-MSP UPA 6 RBP 9 RBP 12 RBP 3Llayer+stream MSP+and+HLMSP+are+close
 (PDUs+of+6+RBPs) UPA+cannot+always+%ind+a+solution
 (PDUs+of+6+RBPs) 1+RBP+=+180+KHz
  • 30. Numerical Results 18 20 25 30 35 40 45 50 55 60 65 70 75 80 0 0.2 0.4 0.6 0.8 Power [W] ε MSP H-MSP UPA 6 RBP 9 RBP 12 RBP MSP+and+HLMSP+are+close
 (PDUs+of+6+RBPs) UPA+cannot+always+%ind+a+solution
 (PDUs+of+6+RBPs) 1+RBP+=+180+KHz 4Llayer+stream
  • 32. Concluding Remarks 20 ๏ We propose an optimal and heuristic radio resource allocation strategy, namely MSP and H-MSP strategies, which maximize the user sleep period and improve the reliability of communications by means of an optimized RLNC approach ๏ Not only the the user energy consumption is reduced but also the developed strategies can meet the desired QoS levels ๏ Results show that the developed H-MSP strategy provide a good quality feasible solution to the MSP model in a finite number of steps ๏ The proposed strategy is characterized by sleep periods that are up to 40% greater than those provided by the considered UPA approach.
  • 33. Thank you for your attention For more information
 http://goo.gl/Z4Y9YF A. Tassi, I. Chatzigeorgiou, and D. Vukobratović, “Resource Allocation Frameworks for Network-coded Layered Multimedia Multicast Services”, IEEE J. Sel. Areas Commun., vol. 33, no. 2, Feb. 2015
  • 34. London, 11th June 2015 Sleep Period Optimization Model For Layered Video Service Delivery Over eMBMS Networks IEEE ICC 2015 - SAC, Energy Efficient Wireless Systems Lorenzo Carlà, Francesco Chiti, Romano Fantacci, A. Tassi a.tassi@{lancaster.ac.uk, bristol.ac.uk}