Resource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques

Similar documents
Block Diagram of a DCS in 411

An introduction to the theory of SDDP algorithm

Mean-square Stability Control for Networked Systems with Stochastic Time Delay

Title. Author(s)Asheralieva, Alia; Miyanaga, Yoshikazu. CitationMobile information systems, 2016: Issue Date 2016.

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2

Solutions for Assignment 2

in Renewable Energy Powered Cellular Networks

Problem Formulation in Communication Systems

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

1. VELOCITY AND ACCELERATION

Suboptimal MIMO Detector based on Viterbi Algorithm

Adaptive Noise Estimation Based on Non-negative Matrix Factorization

2016 Possible Examination Questions. Robotics CSCE 574

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD

Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks

A Distributed Multiple-Target Identity Management Algorithm in Sensor Networks

A Hop Constrained Min-Sum Arborescence with Outage Costs

Energy Storage Benchmark Problems

Západočeská Univerzita v Plzni, Czech Republic and Groupe ESIEE Paris, France

QoE-based Resource Allocation for Multi-cell NOMA Networks

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Learning Relaying Strategies in Cellular D2D Networks with Token-Based Incentives

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2

Optimal Server Assignment in Multi-Server

Transmitting important bits and sailing high radio waves: a decentralized cross-layer approach to cooperative video transmission

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

Innova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*)

Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Performance Enhancement of Adaptive Orthogonal Modulation in Wireless CDMA Systems

1 Review of Zero-Sum Games

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran

Particle Swarm Optimization

Distributed Fictitious Play for Optimal Behavior of Multi-Agent Systems with Incomplete Information

1 Subdivide the optimization horizon [t 0,t f ] into n s 1 control stages,

Probabilistic Robotics

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems

Lecture 10 - Model Identification

Operating Systems Exercise 3

Wireless Communication Channel Overview

Optima and Equilibria for Traffic Flow on a Network

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS

Planning in POMDPs. Dominik Schoenberger Abstract

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Orientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets

Power Allocation in Multi-user Cellular Networks With Deep Q Learning Approach

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Random Walk with Anti-Correlated Steps

Lecture 2 October ε-approximation of 2-player zero-sum games

Energy Storage and Renewables in New Jersey: Complementary Technologies for Reducing Our Carbon Footprint

Delivering Better Time-of-Day Using Synchronous Ethernet and Yaakov (J) Stein, Alon Geva, Gabriel Zigelboim RAD Data Communications

Performance Analysis of Distributed Raptor Codes in Wireless Relay Networks

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

CHAPTER 12 DIRECT CURRENT CIRCUITS

Introduction to Mobile Robotics

Online Appendix to Solution Methods for Models with Rare Disasters

Machine Learning 4771

Uplink capacity of self-organizing clustered orthogonal CDMA networks in flat fading channels

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.

Online Learning of Power Allocation Policies in Energy Harvesting Communications

Fundamental Problems In Robotics

cs/ee 143 Communication Networks

Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework

Pade and Laguerre Approximations Applied. to the Active Queue Management Model. of Internet Protocol

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Upper confidence bound based decision making strategies and dynamic spectrum access

Submodular Game for Distributed Application Allocation in Shared Sensor Networks

Execution Cost and Fairness Optimization for Multi-Server Mobile-Edge Computing Systems with Energy Harvesting Devices

EE3723 : Digital Communications

INDEX. Transient analysis 1 Initial Conditions 1

The field of mathematics has made tremendous impact on the study of

Sequential Importance Resampling (SIR) Particle Filter

Introduction to Probability and Statistics Slides 4 Chapter 4

On the Design of Universal Schemes for Massive Uncoordinated Multiple Access

Excel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand

IB Physics Kinematics Worksheet

Cognitive Base Stations in LTE/3GPP Femtocells: ACorrelatedEquilibrium Game-Theoretic Approach

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Adaptation and Synchronization over a Network: stabilization without a reference model

Examples of Dynamic Programming Problems

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems

ON QUANTIZATION AND COMMUNICATION TOPOLOGIES IN MULTI-VEHICLE RENDEZVOUS 1. Karl Henrik Johansson Alberto Speranzon,2 Sandro Zampieri

arxiv: v1 [cs.dc] 8 Mar 2012

1904 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 4, MAY 2009

Modeling Economic Time Series with Stochastic Linear Difference Equations

Simulating models with heterogeneous agents

Opportunism, Backpressure, and Stochastic Optimization with the Wireless Broadcast Advantage

Virtual force field based obstacle avoidance and agent based intelligent mobile robot

control properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model

Stability and Bifurcation in a Neural Network Model with Two Delays

5.2. The Natural Logarithm. Solution

Transcription:

Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions & Compuer Sysems (ICCS) School of Elecrical & Compuer Engineering Naional Technical Universiy of Ahens (NTUA) Erik Jonsson School of Engineering School & Compuer Science Universiy of Texas a Dallas 1

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 2

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 3

Inroducory Remarks Visible Ligh Communicaions Personal Area Neworks (VPANs) The communicaion signal is encoded on op of he illuminaion ligh Energy saving green communicaion High Speed Conneciviy Poenial No healh hazards, reduced inerference and low ransmission power a almos no cos Resource Allocaion Disribued Approach No cenrally deermined: he decision lies a he mobile erminals Opimal OAPs Selecion wihin he users, Resource Blocks (RBs) and Uplink Transmission Power allocaion based on Maximum Gain Policy and Uiliy Maximizaion 4

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 5

Paper Conribuion Self Opimizaion The users opimally deermine heir ransmission parameers irrespecive of he seleced ransmission echnique Topology Opimizaion and Opimized User Transmission OAP selecion Uplink Transmission Power Allocaion Power Allocaion in he Uplink of VPANs One of he firs approaches in lieraure, so far only downlink ransmission was examined NOMA Presenaion of NOMA (Non Orhogonal Muliple Access) as a new promising ransmission echnique for resource allocaion in he 5G neworking era Exensive Comparisons NOMA is in deph compared wih OFDMA (Orhogonal Frequency Division Muliple Access) Advanages and Disadvanages - Conclusions 6

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 7

VPANs Topology & Sysem Model Muli-cell VPAN nework consising of T OAPs T U Mobile Users A specrum of oal bandwidh W is devoed o each OAP 1,2,..., T U u1,2,..., U Simple VPAN opology Each user u communicaes wih an OAP via a communicaion link l u, Line of Sigh (LOS) beween he user and he OAP: m1 A m cos 2 Ts g cos, 0 c Hu, 2 d A: phoodeecor area φ: irradiance angle T s (ψ): signal ransmission coefficien of an opical filer ψ: angle of incidence m: order of Lamberian emission g(ψ): gain of an opical concenraor d: disance beween he OAP and he user 0, oherwise 8

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 9

SINR (γ) OFDMA vs. NOMA Orhogonal Frequency Division Muliple Access (OFDMA) The bandwidh of each Opical Access Poin is divided ino subcarriers, organized ino Resource Blocks Each Resource Block is reserved for one user wihin he OAP, and reused among differen OAPs Co-channel inerference caused by reuse of RBs from differen OAPs Non-Orhogonal Muliple Access (NOMA) Users wihin he same OAP simulaneously exploi he whole bandwidh, leading o considerable achievable rae enhancemens Each user decodes only he signals of oher users wih beer channel gain (SIC inerference cancellaion echnique) Inerference from users wih worse channel gain is reaed as noise (r) u, U u1, uu, T R H P ( r) PD u, u, H P ( r) u, u, R PD : phoodiode responsiiviy H u, : line of sie pah gain beween user and he OAP P u, : user s uplink ransmission power ξ: cumulaive noise power u, U uu, T R H P PD u, u, H P u, u, 10

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 11

Opical Access Poin Selecion A mobile user may reside wihin muliple OAPs Maximum Gain Selecion (MGS) Policy: Each user wihin he VPAN selec he OAP ha provides he highes pah Gain H beween him and he OAP Near Opimal Soluion: Each user achieves he bes feasible channel condiions based on he line of sigh channel gain H, Channel gain diversiy Perfec pah gain knowledge necessary H H... H H2,1 H2,2.... H ( u, )............ H H... H 1,1 1,2 1, T U,1 U,2 U, T l * * * u, arg max T H u, Users wihin an OAP vary wih ime, hus he MGS problem for OAP selecion should be solved periodically per ime slo 12

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 13

Uiliy Funcions Uiliy Funcions Reflec users degree of saisfacion as a resul of heir acions A user arges a ransmiing wih low uplink ransmission power: Enhanced baery life Less inerference in he muli-cell VPAN environmen Saisfacion increases wih high ransmission daa rae and lower ransmission power values Uiliy funcions show he rade-off beween he among parameers OFDMA : NOMA : U U u, r u, u, W fu N P W fu P r u, r u, u, N : number of users wihin he OAP W: OAP s bandwidh f u ( ): efficiency funcion - represens he probabiliy of successful packe ransmission 14

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 15

Problem Formulaion and Soluion Approach (1/2) Objecive Each user acing selfishly arges a maximizing his overall perceived saisfacion (uiliy) hrough an opimally deermined ransmission power value via a disribued approach Uplink Power Allocaion Problem Formulaion r P u, P -u, P-u, r r r OFDMA : max U P, NOMA : max U P, u, u, u, u, P P s.. 0 P s.. 0 P P Max r u, Max u, u, u, Ru, u, The firs approach owards uplink ransmission power allocaion in VPANs alongside QoS provisioning Opimizaion Soluion Approach Firs order derivaive of he uiliies: U P r u, r u, u, resp r fu u, r r 0 u, fu u, 0 r U f u, u u,. 0 u, fu u, 0 Pu, u, 16

Problem Formulaion and Soluion Approach (2/2) Unique Soluion Unique Soluion due o sigmoidal form of f(γ) and one-o-one SINR funcion for boh OFDMA and NOMA ransmission echniques OFDMA : U r* ( r) u, Hu, Pu, u1 uu Max r* Pu, Pu, min T, RPDHu, Ru NOMA : U * u, Hu, Pu, uu * Max Pu, min T, Pu, RPDHu, P * P Opimal Uplink Transmission Power Vecors P, P,..., P,..., P ( )* ( )* ( )* ( )* ( )* 1, 2, u, U, P, P,..., P,..., P * * * * 1, 2, u, U, 17

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 18

OAP Selecion Par NOAPRA Algorihm (1/2) NOAPRA Non-Cooperaive OAP Selecion and Resource Allocaion Algorihm: Decenralized, ieraive, disribued, and low complexiy - divided in wo pars Based on Maximum Gain Selecion Policy, he Marix H(u,) is creaed, given perfec knowledge of pah gain informaion. Se k=1 and U (0) ={1,2,,U} Sep A 1 Each user u* connecs o he OAP, via creaing a communicaion link based on he highes pah gain H u, * * * * * l u, arg max u U, T H u, Delee user u* from he overall se of users: U (k+1) = U (k) -{u * } (k 1) U If hen sop. Oherwise go o Sep 2 Sep A2 Sep A3 Sep A4 19

Resource Allocaion Par Uplink Transmission Power Allocaion RB s Allocaion (OFDMA) NOAPRA Algorihm (2/2) Each OAP is aware of he number of users residing wihin i (i.e., U) Sep B1 If R=U: one Resource Block r R is allocaed per user uu Sep B2 Each user wihin an OAP iniially ransmis wih a randomly seleced feasible uplink ransmission power and se k=0: (OFDMA) 0 P *(r)(0) u, P Max u, R u, (NOMA) 0 P P *(0) Max u, u, The conroller collecs he informaion and each OAP announces he overall inerference o he users. Each one user compues his sensed inerference Given he overall inerference, each user updaes his uplink ransmission power. Se k=k+1 10 *(r)( k1) *(r)( k) *( k1) *( k) If Pu, Pu, (resp. Pu, Pu, ), e.g., hen Sop Oherwise go o sep 2. 5 Sep C1 Sep C2 Sep C3 Sep C4 20

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 21

Simulaion Scenario Numerical Resuls Case 1: Uniform Disribuion (7 users per OAP) VPAN nework wih 8 OAPs wihin a room of size 10m x 6m x 3m OFDMA: 7 Resource Blocks are available P max =1W W OAP =20 MHz N oal = 56 users Case 2: Non-Uniform Users Disribuion 22

Users Average Uplink Transmission Power per OAP Case 1: Uniform Disribuion Case 2: Non-Uniform Disribuion In OFDMA, uplink ransmission power considerably increases in non uniform user disribuion since users share he same resource blocks wihin differen OAPs, causing much higher inerference In NOMA, increase in uplink ransmission power for non uniform disribuion is smooher due o he inerference cancellaion echnique 23

Sysem s Toal Uplink Transmission Power and Rae for Increasing Number of Users In OFDMA, due o he fixed number of reusable RBs, he sysem canno suppor more han 56 users, hus any addiional users are rejeced. Transmission power and rae remain consan In NOMA, he sysem can accommodae and serve a much larger number of users providing superior daa rae poenial 24

Users Average Uplink Transmission Rae Case 1: Uniform Disribuion Case 2: Non-Uniform Disribuion In NOMA, uplink ransmission rae is considerably higher han OFDMA since he users can exploi he whole bandwidh, regardless of he user disribuion wihin he nework 25

Presenaion Agenda 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Inroducory Remarks Paper Conribuion VPANs Topology and Sysem Model OFDMA vs. NOMA Opical Access Poin Selecion Uiliy Funcions Problem Formulaion and Soluion Approach NOAPRA Algorihm Numerical Resuls Takeaways 26

Takeaways Opimal Opical Access Poin selecion alongside Transmission Power Allocaion in he Uplink of VPANs under various ransmission echniques Visible Ligh Communicaions a promising wireless echnology: Ulrahigh ransmission speeds Decreased users ransmission power No hrea o human healh NOMA All users can simulaneously exploi he whole bandwidh Considerable inerference miigaion NOMA vs. OFDMA NOMA can provide users wih beer service qualiy han OFDMA due o he inerference miigaion (SIC) echnique, regardless of he user disribuion wih he nework Due o he absence of Resource Blocks per user, NOMA can sufficienly accommodae more users han OFDMA 27

Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Thank you for your aenion! e-mail: pvamvaka@cenral.nua.gr 28