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

Size: px
Start display at page:

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

Transcription

1 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

2 Presenaion Agenda 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

3 Presenaion Agenda 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

4 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

5 Presenaion Agenda 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

6 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

7 Presenaion Agenda 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

8 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

9 Presenaion Agenda 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

10 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

11 Presenaion Agenda 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

12 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

13 Presenaion Agenda 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

14 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

15 Presenaion Agenda 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

16 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

17 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

18 Presenaion Agenda 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

19 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

20 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

21 Presenaion Agenda 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

22 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

23 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

24 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

25 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

26 Presenaion Agenda 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

27 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

28 Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Thank you for your aenion! 28

Block Diagram of a DCS in 411

Block Diagram of a DCS in 411 Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass

More information

An introduction to the theory of SDDP algorithm

An introduction to the theory of SDDP algorithm An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking

More information

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

Mean-square Stability Control for Networked Systems with Stochastic Time Delay JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455

More information

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

Title. Author(s)Asheralieva, Alia; Miyanaga, Yoshikazu. CitationMobile information systems, 2016: Issue Date 2016. Tile Dynamic Resource Allocaion wih Inegraed Reinforc Access o Unlicensed Band Auhor(s)Asheralieva, Alia; Miyanaga, Yoshikazu CiaionMobile informaion sysems, 206: 4565203 Issue Dae 206 Doc URL hp://hdl.handle.ne/25/64588

More information

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

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

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

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2 Soluions o he Exam Digial Communicaions I given on he 11h of June 2007 Quesion 1 (14p) a) (2p) If X and Y are independen Gaussian variables, hen E [ XY ]=0 always. (Answer wih RUE or FALSE) ANSWER: False.

More information

Solutions for Assignment 2

Solutions for Assignment 2 Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be

More information

in Renewable Energy Powered Cellular Networks

in Renewable Energy Powered Cellular Networks IEEE TRANSACTIONS ON COMMUNICATIONS 1 Base Saion Sleeping and Resource Allocaion in Renewable Energy Powered Cellular Neworks Jie Gong, Member, IEEE, John S. Thompson, Member, IEEE, Sheng Zhou, Member,

More information

Problem Formulation in Communication Systems

Problem Formulation in Communication Systems Problem Formulaion in Communicaion Sysems Sooyong Choi School of Elecrical and Elecronic Engineering Yonsei Universiy Inroducion Problem formulaion in communicaion sysems Simple daa ransmission sysem :

More information

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

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix

More information

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK

CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he

More information

1. VELOCITY AND ACCELERATION

1. VELOCITY AND ACCELERATION 1. VELOCITY AND ACCELERATION 1.1 Kinemaics Equaions s = u + 1 a and s = v 1 a s = 1 (u + v) v = u + as 1. Displacemen-Time Graph Gradien = speed 1.3 Velociy-Time Graph Gradien = acceleraion Area under

More information

Suboptimal MIMO Detector based on Viterbi Algorithm

Suboptimal MIMO Detector based on Viterbi Algorithm Proceedings of he 7h WSEAS Inernaional Conference on ulimedia Sysems & Signal Processing, Hangzhou, China, April 5-7, 007 9 Subopimal IO Deecor based on Vierbi Algorihm Jin Lee and Sin-Chong Park Sysem

More information

Adaptive Noise Estimation Based on Non-negative Matrix Factorization

Adaptive Noise Estimation Based on Non-negative Matrix Factorization dvanced cience and Technology Leers Vol.3 (ICC 213), pp.159-163 hp://dx.doi.org/1.14257/asl.213 dapive Noise Esimaion ased on Non-negaive Marix Facorizaion Kwang Myung Jeon and Hong Kook Kim chool of Informaion

More information

2016 Possible Examination Questions. Robotics CSCE 574

2016 Possible Examination Questions. Robotics CSCE 574 206 Possible Examinaion Quesions Roboics CSCE 574 ) Wha are he differences beween Hydraulic drive and Shape Memory Alloy drive? Name one applicaion in which each one of hem is appropriae. 2) Wha are he

More information

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

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM Name: UNIVERSIY OF CALIFORNIA College of Engineering Deparmen of Elecrical Engineering and Compuer Sciences Professor David se EECS 121 FINAL EXAM 21 May 1997, 5:00-8:00 p.m. Please wrie answers on blank

More information

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD

PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.

More information

Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks

Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks PROC. IEEE INFOCO, PHOENIX, AZ, APRIL 008 Opporunisic Scheduling wih Reliabiliy Guaranees in Cogniive Radio Neworks Rahul Urgaonkar, ichael J. Neely Universiy of Souhern California, Los Angeles, CA 90089

More information

A Distributed Multiple-Target Identity Management Algorithm in Sensor Networks

A Distributed Multiple-Target Identity Management Algorithm in Sensor Networks A Disribued Muliple-Targe Ideniy Managemen Algorihm in Sensor Neworks Inseok Hwang, Kaushik Roy, Hamsa Balakrishnan, and Claire Tomlin Dep. of Aeronauics and Asronauics, Sanford Universiy, CA 94305 Dep.

More information

A Hop Constrained Min-Sum Arborescence with Outage Costs

A Hop Constrained Min-Sum Arborescence with Outage Costs A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem

More information

Energy Storage Benchmark Problems

Energy Storage Benchmark Problems Energy Sorage Benchmark Problems Daniel F. Salas 1,3, Warren B. Powell 2,3 1 Deparmen of Chemical & Biological Engineering 2 Deparmen of Operaions Research & Financial Engineering 3 Princeon Laboraory

More information

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

Západočeská Univerzita v Plzni, Czech Republic and Groupe ESIEE Paris, France ADAPTIVE SIGNAL PROCESSING USING MAXIMUM ENTROPY ON THE MEAN METHOD AND MONTE CARLO ANALYSIS Pavla Holejšovsá, Ing. *), Z. Peroua, Ing. **), J.-F. Bercher, Prof. Assis. ***) Západočesá Univerzia v Plzni,

More information

QoE-based Resource Allocation for Multi-cell NOMA Networks

QoE-based Resource Allocation for Multi-cell NOMA Networks 1 QoE-based Resource Allocaion for Muli-cell NOMA Neworks Jingjing Cui, Suden Member, IEEE, Yuanwei Liu, Member, IEEE, Zhiguo Ding, Senior Member, IEEE, Pingzhi Fan, Fellow, IEEE and Arumugam Nallanahan,

More information

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

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach 1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model

More information

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

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

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

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

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

Learning Relaying Strategies in Cellular D2D Networks with Token-Based Incentives Learning Relaying Sraegies in Cellular D2D Neworks wih Token-Based Incenives Nicholas Masronarde, Viral Pael Deparmen of Elecrical Engineering Sae Universiy of New York a Buffalo Buffalo, NY USA Jie Xu,

More information

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

Dimitri Solomatine. D.P. Solomatine. Data-driven modelling (part 2). 2 Daa-driven modelling. Par. Daa-driven Arificial di Neural modelling. Newors Par Dimiri Solomaine Arificial neural newors D.P. Solomaine. Daa-driven modelling par. 1 Arificial neural newors ANN: main pes

More information

Optimal Server Assignment in Multi-Server

Optimal Server Assignment in Multi-Server Opimal Server Assignmen in Muli-Server 1 Queueing Sysems wih Random Conneciviies Hassan Halabian, Suden Member, IEEE, Ioannis Lambadaris, Member, IEEE, arxiv:1112.1178v2 [mah.oc] 21 Jun 2013 Yannis Viniois,

More information

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

Transmitting important bits and sailing high radio waves: a decentralized cross-layer approach to cooperative video transmission Transmiing imporan bis and sailing high radio waves: a decenralized cross-layer approach o cooperaive video ransmission 1 Nicholas Masronarde, Francesco Verde, Donaella Darsena, Anna Scaglione, and Mihaela

More information

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

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 Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

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

Innova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*) Soluion 3 x 4x3 x 3 x 0 4x3 x 4x3 x 4x3 x 4x3 x x 3x 3 4x3 x Innova Junior College H Mahemaics JC Preliminary Examinaions Paper Soluions 3x 3 4x 3x 0 4x 3 4x 3 0 (*) 0 0 + + + - 3 3 4 3 3 3 3 Hence x or

More information

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

Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters 4 JOURNAL OF COMMUNICAIONS AND NEWORKS, VOL. 4, NO. 2, APRIL 22 Opimal Packe Scheduling in a Muliple Access Channel wih Energy Harvesing ransmiers Jing Yang and Sennur Ulukus Absrac: In his paper, we invesigae

More information

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems

Beam Management for Millimeter Wave Beamspace MU-MIMO Systems Beam Managemen for Millimeer Wave Beamspace MU-MIMO Sysems Qing Xue and Xuming Fang Key Lab of Informaion Coding & Transmission Souhwes Jiaoong Universiy, Chengdu 6003, China Email: shdlxxq5460@my.swju.edu.cn,

More information

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

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

Performance Enhancement of Adaptive Orthogonal Modulation in Wireless CDMA Systems

Performance Enhancement of Adaptive Orthogonal Modulation in Wireless CDMA Systems Performance Enhancemen of Adapive Orhogonal Modulaion in Wireless CDMA Sysems 1 Alaa Muqaash, Marwan Krunz, and Tao Shu Deparmen of Elecrical and Compuer Engineering The Universiy of Arizona Tucson, AZ

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

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

Georey E. Hinton. University oftoronto.   Technical Report CRG-TR February 22, Abstract Parameer Esimaion for Linear Dynamical Sysems Zoubin Ghahramani Georey E. Hinon Deparmen of Compuer Science Universiy oftorono 6 King's College Road Torono, Canada M5S A4 Email: zoubin@cs.orono.edu Technical

More information

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

Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy

More information

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

Shiva Akhtarian MSc Student, Department of Computer Engineering and Information Technology, Payame Noor University, Iran Curren Trends in Technology and Science ISSN : 79-055 8hSASTech 04 Symposium on Advances in Science & Technology-Commission-IV Mashhad, Iran A New for Sofware Reliabiliy Evaluaion Based on NHPP wih Imperfec

More information

Particle Swarm Optimization

Particle Swarm Optimization Paricle Swarm Opimizaion Speaker: Jeng-Shyang Pan Deparmen of Elecronic Engineering, Kaohsiung Universiy of Applied Science, Taiwan Email: jspan@cc.kuas.edu.w 7/26/2004 ppso 1 Wha is he Paricle Swarm Opimizaion

More information

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

Distributed Fictitious Play for Optimal Behavior of Multi-Agent Systems with Incomplete Information Disribued Ficiious Play for Opimal Behavior of Muli-Agen Sysems wih Incomplee Informaion Ceyhun Eksin and Alejandro Ribeiro arxiv:602.02066v [cs.g] 5 Feb 206 Absrac A muli-agen sysem operaes in an uncerain

More information

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

1 Subdivide the optimization horizon [t 0,t f ] into n s 1 control stages, Opimal Conrol Formulaion Opimal Conrol Lecures 19-2: Direc Soluion Mehods Benoî Chachua Deparmen of Chemical Engineering Spring 29 We are concerned wih numerical soluion procedures for

More information

Probabilistic Robotics

Probabilistic Robotics Probabilisic Roboics Bayes Filer Implemenaions Gaussian filers Bayes Filer Reminder Predicion bel p u bel d Correcion bel η p z bel Gaussians : ~ π e p N p - Univariae / / : ~ μ μ μ e p Ν p d π Mulivariae

More information

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

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,

More information

Lecture 10 - Model Identification

Lecture 10 - Model Identification Lecure - odel Idenificaion Wha is ssem idenificaion? Direc impulse response idenificaion Linear regression Regularizaion Parameric model ID nonlinear LS Conrol Engineering - Wha is Ssem Idenificaion? Experimen

More information

Operating Systems Exercise 3

Operating Systems Exercise 3 Operaing Sysems SS 00 Universiy of Zurich Operaing Sysems Exercise 3 00-06-4 Dominique Emery, s97-60-056 Thomas Bocek, s99-706-39 Philip Iezzi, s99-74-354 Florian Caflisch, s96-90-55 Table page Table page

More information

Wireless Communication Channel Overview

Wireless Communication Channel Overview EC744 Wireless Communicaion Fall 008 Mohamed Essam Khedr Deparmen of Elecronics and Communicaions Wireless Communicaion Channel Overview Syllabus Tenaively Week 1 Week Week 3 Week 4 Week 5 Week 6 Week

More information

Optima and Equilibria for Traffic Flow on a Network

Optima and Equilibria for Traffic Flow on a Network Opima and Equilibria for Traffic Flow on a Nework Albero Bressan Deparmen of Mahemaics, Penn Sae Universiy bressan@mah.psu.edu Albero Bressan (Penn Sae) Opima and equilibria for raffic flow 1 / 1 A Traffic

More information

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS

MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS 1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,

More information

Planning in POMDPs. Dominik Schoenberger Abstract

Planning in POMDPs. Dominik Schoenberger Abstract Planning in POMDPs Dominik Schoenberger d.schoenberger@sud.u-darmsad.de Absrac This documen briefly explains wha a Parially Observable Markov Decision Process is. Furhermore i inroduces he differen approaches

More information

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

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.

More information

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

Orientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets Connecions beween nework coding and sochasic nework heory Bruce Hajek Orienaion On Thursday, Ralf Koeer discussed nework coding: coding wihin he nework Absrac: Randomly generaed coded informaion blocks

More information

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

Power Allocation in Multi-user Cellular Networks With Deep Q Learning Approach Power Allocaion in Muli-user Cellular Neworks Wih Deep Q Learning Approach Fan Meng, Peng Chen and Lenan Wu arxiv:1812.02979v1 [cs.it] 7 Dec 2018 Absrac The model-driven power allocaion (PA) algorihms

More information

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

Article from. Predictive Analytics and Futurism. July 2016 Issue 13 Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning

More information

Random Walk with Anti-Correlated Steps

Random Walk with Anti-Correlated Steps Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and

More information

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

Lecture 2 October ε-approximation of 2-player zero-sum games Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion

More information

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

Energy Storage and Renewables in New Jersey: Complementary Technologies for Reducing Our Carbon Footprint Energy Sorage and Renewables in New Jersey: Complemenary Technologies for Reducing Our Carbon Fooprin ACEE E-filliaes workshop November 14, 2014 Warren B. Powell Daniel Seingar Harvey Cheng Greg Davies

More information

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

Delivering Better Time-of-Day Using Synchronous Ethernet and Yaakov (J) Stein, Alon Geva, Gabriel Zigelboim RAD Data Communications Delivering Beer Time-of-Day Using Synchronous Eherne and 1588 Yaakov (J) Sein, Alon Geva, Gabriel Zigelboim RAD Daa Communicaions The problem I wan discuss he use of 1588 (or NTP for ha maer) for ime of

More information

Performance Analysis of Distributed Raptor Codes in Wireless Relay Networks

Performance Analysis of Distributed Raptor Codes in Wireless Relay Networks 2014 Elevenh Annual IEEE Inernaional Conference on Sensing, Communicaion, and Neworking SECON Performance Analysis of Disribued Rapor Codes in Wireless Relay Neworks Jing Yue, Zihuai in, Branka Vuceic,

More information

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems 1 Sable Scheduling Policies for Maximizing Throughpu in Generalized Consrained Queueing Sysems Prasanna Chaporar, Suden Member, IEEE, Saswai Sarar, Member, IEEE Absrac We consider a class of queueing newors

More information

CHAPTER 12 DIRECT CURRENT CIRCUITS

CHAPTER 12 DIRECT CURRENT CIRCUITS CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As

More information

Introduction to Mobile Robotics

Introduction to Mobile Robotics Inroducion o Mobile Roboics Bayes Filer Kalman Filer Wolfram Burgard Cyrill Sachniss Giorgio Grisei Maren Bennewiz Chrisian Plagemann Bayes Filer Reminder Predicion bel p u bel d Correcion bel η p z bel

More information

Online Appendix to Solution Methods for Models with Rare Disasters

Online Appendix to Solution Methods for Models with Rare Disasters Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,

More information

Machine Learning 4771

Machine Learning 4771 ony Jebara, Columbia Universiy achine Learning 4771 Insrucor: ony Jebara ony Jebara, Columbia Universiy opic 20 Hs wih Evidence H Collec H Evaluae H Disribue H Decode H Parameer Learning via JA & E ony

More information

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

Uplink capacity of self-organizing clustered orthogonal CDMA networks in flat fading channels Auhor manuscrip, published in "ITW-29, Ialy 29)" Uplink capaciy of self-organizing clusered orhogonal CDMA neworks in fla fading channels Romain Couille ST-Ericsson, Supelec 55 Roue des Lucioles 656 Sophia

More information

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

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1. Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of

More information

Online Learning of Power Allocation Policies in Energy Harvesting Communications

Online Learning of Power Allocation Policies in Energy Harvesting Communications Online Learning of Power Allocaion Policies in Energy Harvesing Communicaions Pranav Sakulkar and Bhaskar Krishnamachari Ming Hsieh Deparmen of Elecrical Engineering Vierbi School of Engineering Universiy

More information

Fundamental Problems In Robotics

Fundamental Problems In Robotics Fundamenal Problems In Roboics Wha does he world looks like? (mapping sense from various posiions inegrae measuremens o produce map assumes perfec knowledge of posiion Where am I in he world? (localizaion

More information

cs/ee 143 Communication Networks

cs/ee 143 Communication Networks cs/ee 143 Communicaion Neworks Chaper 3 Eherne Tex: Walrand & Parakh, 2010 Seven Low CMS, EE, Calech Warning These noes are no self-conained, probably no undersandable, unless you also were in he lecure

More information

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

Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework Join Channel Selecion and Power Conrol in Infrasrucureless Wireless Neworks: A Muli-Player Muli-Armed Bandi Framework Seareh Maghsudi and Sławomir Sańczak, Senior Member, IEEE arxiv:47.5447v [cs.gt] 2

More information

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

Pade and Laguerre Approximations Applied. to the Active Queue Management Model. of Internet Protocol Applied Mahemaical Sciences, Vol. 7, 013, no. 16, 663-673 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/10.1988/ams.013.39499 Pade and Laguerre Approximaions Applied o he Acive Queue Managemen Model of Inerne

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

Upper confidence bound based decision making strategies and dynamic spectrum access

Upper confidence bound based decision making strategies and dynamic spectrum access Upper confidence bound based decision making sraegies and dynamic specrum access Wassim Jouini wassim.jouini@supelec.fr Damien Erns Universiy of Liège derns@ulg.ac.be Chrisophe Moy chrisophe.moy@supelec.fr

More information

Submodular Game for Distributed Application Allocation in Shared Sensor Networks

Submodular Game for Distributed Application Allocation in Shared Sensor Networks Submodular Game for Disribued Applicaion Allocaion in Shared Sensor Neworks Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu Deparmen of Compuer Science & Engineering Washingon Universiy in S. Louis {wu, yx,

More information

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

Execution Cost and Fairness Optimization for Multi-Server Mobile-Edge Computing Systems with Energy Harvesting Devices In. J. xxxxxxxxx xxxxxxxxxxxxxms, Vol. X, No. Y, xxxx 1 Execuion Cos and Fairness Opimizaion for Muli-Server Mobile-Edge Compuing Sysems wih Energy Harvesing Devices Hailiang Zhao, Wei Du, Wei Liu, Tao

More information

EE3723 : Digital Communications

EE3723 : Digital Communications EE373 : Digial Communicaions Week 6-7: Deecion Error Probabiliy Signal Space Orhogonal Signal Space MAJU-Digial Comm.-Week-6-7 Deecion Mached filer reduces he received signal o a single variable zt, afer

More information

INDEX. Transient analysis 1 Initial Conditions 1

INDEX. Transient analysis 1 Initial Conditions 1 INDEX Secion Page Transien analysis 1 Iniial Condiions 1 Please inform me of your opinion of he relaive emphasis of he review maerial by simply making commens on his page and sending i o me a: Frank Mera

More information

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

The field of mathematics has made tremendous impact on the study of A Populaion Firing Rae Model of Reverberaory Aciviy in Neuronal Neworks Zofia Koscielniak Carnegie Mellon Universiy Menor: Dr. G. Bard Ermenrou Universiy of Pisburgh Inroducion: The field of mahemaics

More information

Sequential Importance Resampling (SIR) Particle Filter

Sequential Importance Resampling (SIR) Particle Filter Paricle Filers++ Pieer Abbeel UC Berkeley EECS Many slides adaped from Thrun, Burgard and Fox, Probabilisic Roboics 1. Algorihm paricle_filer( S -1, u, z ): 2. Sequenial Imporance Resampling (SIR) Paricle

More information

Introduction to Probability and Statistics Slides 4 Chapter 4

Introduction to Probability and Statistics Slides 4 Chapter 4 Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random

More information

On the Design of Universal Schemes for Massive Uncoordinated Multiple Access

On the Design of Universal Schemes for Massive Uncoordinated Multiple Access On he Design of Universal Schemes for Massive Uncoordinaed Muliple Access Ausin Taghavi, Avinash Vem, Jean-Francois Chamberland, Krishna R. Narayanan Deparmen of Elecrical and Compuer Engineering Texas

More information

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

Excel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand Excel-Based Soluion Mehod For The Opimal Policy Of The Hadley And Whiin s Exac Model Wih Arma Demand Kal Nami School of Business and Economics Winson Salem Sae Universiy Winson Salem, NC 27110 Phone: (336)750-2338

More information

IB Physics Kinematics Worksheet

IB Physics Kinematics Worksheet IB Physics Kinemaics Workshee Wrie full soluions and noes for muliple choice answers. Do no use a calculaor for muliple choice answers. 1. Which of he following is a correc definiion of average acceleraion?

More information

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

Cognitive Base Stations in LTE/3GPP Femtocells: ACorrelatedEquilibrium Game-Theoretic Approach IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 12, DECEMBER 2011 3485 Cogniive Base Saions in LTE/3GPP Femocells: ACorrelaedEquilibrium Game-Theoreic Approach Jane Wei Huang, Suden Member, IEEE, andviramkrishnamurhy,fellow,

More information

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

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

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

Adaptation and Synchronization over a Network: stabilization without a reference model Adapaion and Synchronizaion over a Nework: sabilizaion wihou a reference model Travis E. Gibson (gibson@mi.edu) Harvard Medical School Deparmen of Pahology, Brigham and Women s Hospial 55 h Conference

More information

Examples of Dynamic Programming Problems

Examples of Dynamic Programming Problems M.I.T. 5.450-Fall 00 Sloan School of Managemen Professor Leonid Kogan Examples of Dynamic Programming Problems Problem A given quaniy X of a single resource is o be allocaed opimally among N producion

More information

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

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor

More information

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

ON QUANTIZATION AND COMMUNICATION TOPOLOGIES IN MULTI-VEHICLE RENDEZVOUS 1. Karl Henrik Johansson Alberto Speranzon,2 Sandro Zampieri ON QUANTIZATION AND COMMUNICATION TOPOLOGIES IN MULTI-VEHICLE RENDEZVOUS 1 Karl Henrik Johansson Albero Speranzon, Sandro Zampieri Deparmen of Signals, Sensors and Sysems Royal Insiue of Technology Osquldas

More information

arxiv: v1 [cs.dc] 8 Mar 2012

arxiv: v1 [cs.dc] 8 Mar 2012 Consensus on Moving Neighborhood Model of Peerson Graph arxiv:.9v [cs.dc] 8 Mar Hannah Arend and Jorgensen Jos Absrac In his paper, we sudy he consensus problem of muliple agens on a kind of famous graph,

More information

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

1904 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 4, MAY 2009 1904 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 4, MAY 2009 Learning o Compee for Resources in Wireless Sochasic Games Fangwen Fu, Suden Member, IEEE, and Mihaela van der Schaar, Senior Member,

More information

Modeling Economic Time Series with Stochastic Linear Difference Equations

Modeling Economic Time Series with Stochastic Linear Difference Equations A. Thiemer, SLDG.mcd, 6..6 FH-Kiel Universiy of Applied Sciences Prof. Dr. Andreas Thiemer e-mail: andreas.hiemer@fh-kiel.de Modeling Economic Time Series wih Sochasic Linear Difference Equaions Summary:

More information

Simulating models with heterogeneous agents

Simulating models with heterogeneous agents Simulaing models wih heerogeneous agens Wouer J. Den Haan London School of Economics c by Wouer J. Den Haan Individual agen Subjec o employmen shocks (ε i, {0, 1}) Incomplee markes only way o save is hrough

More information

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

Opportunism, Backpressure, and Stochastic Optimization with the Wireless Broadcast Advantage ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, PACIFIC GROVE, CA, OCTOBER 2008 1 Opporunism, Backpressure, and Sochasic Opimizaion wih he Wireless Broadcas Advanage Michael J. Neely, Rahul Urgaonkar

More information

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

Virtual force field based obstacle avoidance and agent based intelligent mobile robot Virual force field based obsacle avoidance and agen based inelligen mobile robo Saurabh Sarkar *a, Sco Reynolds b, Ernes Hall a a Dep of Mechinical Engineering, Universiy of Cincinnai b Dep. of Compuer

More information

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

control properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed 535 SOFT-DECSON THRESHOLD DECODNG OF CONVOLUTONAL CODES R.M.F. Goodman*, B.Sc., Ph.D. W.H. Ng*, M.S.E.E. Sunnnary Exising majoriy-decision hreshold decoders have so far been limied o his paper a new mehod

More information

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

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model Lecure Noes 3: Quaniaive Analysis in DSGE Models: New Keynesian Model Zhiwei Xu, Email: xuzhiwei@sju.edu.cn The moneary policy plays lile role in he basic moneary model wihou price sickiness. We now urn

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

5.2. The Natural Logarithm. Solution

5.2. The Natural Logarithm. Solution 5.2 The Naural Logarihm The number e is an irraional number, similar in naure o π. Is non-erminaing, non-repeaing value is e 2.718 281 828 59. Like π, e also occurs frequenly in naural phenomena. In fac,

More information