Utility Maximization for Delay Constrained QoS in Wireless I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1 /23.

Slides:



Advertisements
Similar presentations
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Advertisements

Truthful Spectrum Auction Design for Secondary Networks Yuefei Zhu ∗, Baochun Li ∗ and Zongpeng Li † ∗ Electrical and Computer Engineering, University.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
REAL-TIME COMMUNICATION ANALYSIS FOR NOCS WITH WORMHOLE SWITCHING Presented by Sina Gholamian, 1 09/11/2011.
Scheduling Heterogeneous Real- Time Traffic over Fading Wireless Channels I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1/24.
DBLA: D ISTRIBUTED B LOCK L EARNING A LGORITHM F OR C HANNEL S ELECTION I N C OGNITIVE R ADIO N ETWORKS Chowdhury Sayeed Hyder Department of Computer Science.
Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs for Wireless Michael J. Neely University of Southern California
Admission Control and Scheduling for QoS Guarantees for Variable-Bit-Rate Applications on Wireless Channels I-H. Hou and P.R. Kumar Department of Computer.
1 “Multiplexing Live Video Streams & Voice with Data over a High Capacity Packet Switched Wireless Network” Spyros Psychis, Polychronis Koutsakis and Michael.
Cross-Layer Optimization for Video Streaming in Single- Hop Wireless Networks Cheng-Hsin Hsu Joint Work with Mohamed Hefeeda MMCN ‘09January 19, 2009 Simon.
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
CAC and Scheduling Schemes for Real-time Video Applications in IEEE Networks Ou Yang UR 10/11/2006.
A Layered Hybrid ARQ Scheme for Scalable Video Multicast over Wireless Networks Zhengye Liu, Joint work with Zhenyu Wu.
CS541 Advanced Networking 1 Spectrum Sharing in Cognitive Radio Networks Neil Tang 3/23/2009.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Mixed Criteria Packet Scheduling Chad R. Meiners Eric Torng.
A Strategy for Implementing Smart Market Pricing Scheme on Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY.
Opportunistic Transmission Scheduling With Resource-Sharing Constraints in Wireless Networks From IEEE JOURNAL ON SELECTED AREAS IN COMMUNCATIONS Presented.
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
Resource Allocation for E-healthcare Applications
Fair Real-time Traffic Scheduling over Wireless Local Area Networks Insik Shin Joint work with M. Adamou, S. Khanna, I. Lee, and S. Zhou Dept. of Computer.
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
A Non-Monetary Protocol for P2P Content Distribution in Wireless Broadcast Networks with Network Coding I-Hong Hou, Yao Liu, and Alex Sprintson Dept. of.
Mazumdar Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Non-convex.
Fen Hou and Pin-Han Ho Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario Wireless Communications and Mobile.
Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband wireless Access Systems Bader Al-Manthari, Member, IEEE,
Utility-Optimal Scheduling in Time- Varying Wireless Networks with Delay Constraints I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1/30.
Michael J. Neely, University of Southern California CISS, Princeton University, March 2012 Wireless Peer-to-Peer Scheduling.
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements I-Hong Hou and P.R. Kumar 1.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Department of Information Engineering University of Padova, ITALY A Soft QoS scheduling algorithm for Bluetooth piconets {andrea.zanella, daniele.miorandi,
Admission Control and Scheduling for QoS Guarantees for Variable-Bit-Rate Applications on Wireless Channels I-Hong Hou P.R. Kumar University of Illinois,
Incentive-Oriented Downlink Scheduling for Wireless Networks with Real-Time and Non-Real-Time Flows I-Hong Hou, Jing Zhu, and Rath Vannithamby.
EE 685 presentation Utility-Optimal Random-Access Control By Jang-Won Lee, Mung Chiang and A. Robert Calderbank.
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements I-Hong Hou and P.R. Kumar 1 Presenter: Qixin Wang.
Advanced Communication Network Joint Throughput Optimization for Wireless Mesh Networks R 戴智斌 R 蔡永斌 Xiang-Yang.
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
Simultaneous routing and resource allocation via dual decomposition AUTHOR: Lin Xiao, Student Member, IEEE, Mikael Johansson, Member, IEEE, and Stephen.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Stochastic Optimization for Markov Modulated Networks with Application to Delay Constrained Wireless Scheduling Michael J. Neely University of Southern.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
A Cluster Based On-demand Multi- Channel MAC Protocol for Wireless Multimedia Sensor Network Cheng Li1, Pu Wang1, Hsiao-Hwa Chen2, and Mohsen Guizani3.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling.
Energy Optimal Control for Time Varying Wireless Networks Michael J. Neely University of Southern California
CHANNEL ALLOCATION FOR SMOOTH VIDEO DELIVERY OVER COGNITIVE RADIO NETWORKS Globecom 2010, FL, USA 1 Sanying Li, Tom H. Luan, Xuemin (Sherman) Shen Department.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
A Theory of QoS for Wireless I-Hong Hou Vivek Borkar P.R. Kumar University of Illinois, Urbana-Champaign.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Wireless Packet Scheduling With Soft Deadlines Aditya Dua and Nicholas Bambos Department of Electrical Engineering Stanford University ICC 2007.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Presented by Tae-Seok Kim
Cross layer design is wireless multi-hop network
IEEE Student Paper Contest
Optimization of Wireless Station Time Slot Allocation with Consideration of Throughput and Delay Constraints 指導教授:林永松 博士 研究生:林岦毅.
Broadcasting Delay-Constrained Traffic over Unreliable Wireless Links with Network Coding I-Hong Hou and P.R. Kumar.
Throughput-Optimal Broadcast in Dynamic Wireless Networks
The System Issues of Rate Adaptation
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Presentation transcript:

Utility Maximization for Delay Constrained QoS in Wireless I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1 /23

Problem Overview  Every packet has a hard delay bound  Timely throughput = Throughput of packets delivered within their delay bounds  q n = Timely throughput of client n  U n (q n ) = Utility of client n  Channels are unreliable  Goal: Max ∑U n (q n ) s.t. [q n ] feasible under both channel unreliabilities and delay constraints  Example applications: VoIP, Network control, etc. 2 /23

Client-Server Model  A system with N wireless clients and one AP  AP schedules all transmissions  Time is slotted AP /23

Traffic Model  Group time slots into periods with τ time slots  Clients generate packets at the beginning of each period AP τ 4 /23

Delay Bounds  τ = Deadline  Packets are dropped if not delivered by the deadline  Delay of successful delivered packet is at most τ AP /23 τ arrival deadline

Channel Model  Each transmission takes one time slot  Links are unreliable  Transmission for client n succeeds with probability p n AP p1p1 p2p2 p3p3 6 /23

How the System Works AP SF p1p1 p2p2 p3p3 7 /23 S FF S S S FI I I

Timely Throughput AP SF p1p1 p2p2 p3p3 8 /23 S FF S S S FI I I  Timely throughput (q n ) = Client #Throughput

Problem Formulation  Each client has an utility function, is strictly increasing, strictly concave, and continuously differentiable  AP needs to assign [q n ] to maximize total utility, subject to feasibility constraints 9 /23

Characterization of What is Feasible  The average number of time slots needed for client n to have timely throughput q n is  Let I S = Expected number of idle time slots when the set of clients is S  Clearly, we need  Theorem: the condition is both necessary and sufficient 10 /23 Average # of packets delivered in a period Average # of transmissions needed for a delivery

Optimization Problem  SYSTEM:  Decompose SYSTEM into two subproblems CLIENT n : considers own utility function ACCESS-POINT: considers feasibility constraints 11 /23 Utility functions may be unknown 2 N feasibility constraints

Problem Decomposition CLIENT n : (Ψ n given) Max over ACCESS-POINT: (ρ n given) Max s.t. over 12 /23

A Bidding Game Step 1. Each client n announces ρ n Step 2. Given [ρ n ], AP finds [q n ] to solve ACCESS-POINT Step 3. Client n observes q n, compute Ψ n = ρ n /q n. Client n finds new ρ n to solve CLIENT n Step 4. Go to Step /23

Solving ACCESS-POINT  ACCESS-POINT: (ρ n given) Max s.t. over By KKT condition: 14 /23

Solving ACCESS-POINT  ACCESS-POINT: (ρ n given) By KKT condition: Average # of time slots working for client n per period 15 /23

Solving ACCESS-POINT  ACCESS-POINT: (ρ n given) By KKT condition: The more price paid, the more time slots received 16 /23

Solving ACCESS-POINT  ACCESS-POINT: (ρ n given) By KKT condition: Depends on prices paid by all clients and feasibility constraints (Difficult to solve) 17 /23

Scheduling Policy for ACCESS-POINT  Weighted-Transmission Policy (WT): 1. Let be the total number of time slots allocated for client n 2. Sort clients by 3. Clients with smaller get higher priorities  Theorem: WT solves the ACCESS-POINT problem Require no knowledge on channel reliabilities 18 /23

Simulation: Utility Maximization  Setup: A set of 30 clients Utility function: Parameters:  Setting 1:  Setting 2:  Evaluate the mean and variance of 19 /23

Evaluated Policies  WT policies and bidding game (WT-Bid)  WT policies without bidding game (WT-NoBid)  Randomly assign priorities (Rand)  Clients with larger get higher priorities, break ties randomly (P-Rand) 20 /23

Simulation Results: Mean WT-Bid has highest total utility 21 /23

Simulation Results: Variance WT-Bid has small variance 22 /23

Conclusion  Formulate and solve the problem of utility maximization for delay-constrained wireless networks  Propose a scheduling policy to solve ACCESS-POINT 23 /23 AP 12 p1p1 p2p2 τ arrival deadline CLIENT n SYSTEM ACCESS-POINT ΨnΨn ρnρn

24 Another work on scheduling delay-constrained packets with time- varying channels, different delay bounds, and rate adaptation will be presented in TS60: WIRELESS NETWORK SCHEDULING 3