1 / 16

Channel Feedback Reduction Schemes for Opportunistic Scheduling in Multicast OFDMA Systems

Channel Feedback Reduction Schemes for Opportunistic Scheduling in Multicast OFDMA Systems. Soomin Ko , Yung-Jun Yoo , and Byeong Gi Lee Seoul National University, Korea. Introduction. Multicast transmission Disseminating data to a group of recivers Opportunistic scheduling

lona
Télécharger la présentation

Channel Feedback Reduction Schemes for Opportunistic Scheduling in Multicast OFDMA Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Channel Feedback Reduction Schemes for Opportunistic Scheduling in Multicast OFDMA Systems SoominKo, Yung-Jun Yoo, and ByeongGi Lee Seoul National University, Korea

  2. Introduction • Multicast transmission • Disseminating data to a group of recivers • Opportunistic scheduling • Require channel feedback • OFDMA • Feedback load increase • Channel feedback reduction

  3. Introduction • Characteristics of Multicast transmission • User with the poorest channel condition dictates the transmission rate • Main concept • Reduce the feedback of the users with good average channel condition • Can reduce the total feedback load of a group substantially at a marginal loss of throughput

  4. System model • Downlink multicast OFDMA system • Group : set of users subscribing to the same content • G groups, Kg users in each group, • Mi.i.d. channels, L MCS levels • q(g,k),m : MCS level of channel m for user (g,k) • q(g,k),mfeed: MCS level of channel m that is fed back by user (g,k) using a feedback reduction scheme

  5. System model • Group scheduling • Based on the feedback, q(g,k),mfeed, BS selects which group to transmit to, g* • Transmission rate is determined by the poorest user in the selected group, qg*,mfeed = minkq(g*,k),mfeed • CS (Cumulative mass function-based Scheduling) algorithm • Scheduling metric : based on the CMF (Cumulative Mass Function) of qg,mfeed • Fg,mfeed(l)=1-k(1-F(g,k),mfeed(l)), Fgfeed(l)

  6. System model • CS algorithm (1) • User (g,k) reports q(g,k),mfeed • BS makes qg,mfeed = minkq(g,k),mfeed • BS generates a uniform random variable in the interval [Fgfeed(qg,mfeed-1),Fgfeed(qg,mfeed)) • Scheduling metric for group g

  7. System model • CS algorithm (2) • BS allocates channel m to the group whose scheduling metric is the largest, g* • BS transmits a data to group g* through channel m at the rate r(qg*,mfeed) • Average throughput of group g • Tgfeed=MKg/Glr(l)(Fgfeed(l)G-Fgfeed(l-1)G)

  8. Proposed Scheme • Divides the users in each group into two sets • Based on the average channel condition • PCU (Poor Channel Users) • Bottom Kg,PCU-th users • GCU (Good Channel Users) • Other users • Adopts different feedback policy • PCU • Feed back fine-grained condition of the channel • GCU • Feed back coarse-grained condition of the channel

  9. Proposed Scheme • PCU policy • Feed back the real MCS levels of all the channels • GCU policies • FGB (Feedback reduction by Good users with Bit-map) • Users in GCU adopt Bit-map based feedback • FGAB (Feedback reduction by Good users with Advanced Bit-map) • Users in GCU adopt Advanced Bit-map based feedback

  10. Proposed Scheme • Feedback frame structure

  11. FGB scheme • BS broadcasts the threshold g • Users in GCU make the bit-map • Bit for channel m: 1 if q(g,k),m  g , 0 otherwise • MCS level of channel m fed back by user (g,k)

  12. FGB scheme • Determining threshold g • Calculate TgFGB for various values of g • TgFGB=MKg/Glr(l)(FgFGB(l)G-FgFGB(l-1)G) • Calculate FgFGB(l) • FgFGB(l)=1-k(1-F(g,k)FGB(l)) • Calculate F(g,k)FGB(l) • For a user in PCU: • For a user in GCU: • Choose g with the largest TgFGB

  13. FGAB scheme • BS broadcasts the threshold g • Users in GCU make the bit-map • Bit for channel m: 1 if q(g,k),m  g , 0 otherwise • Additionally sends MCS level of the lowest channel among its M channels • MCS level of channel m fed back by user (g,k)

  14. Numerical results • Simulation environment • M=50 channels • Average SNR of user (g,k) : Uniform random variable in [0,20] dB • Kg=5, vary Kg,PCU from 4 to 0 • Feedback load per group

  15. Numerical results • Normalized average total throughput for varied feedback load

  16. Conclusions • Two feedback reduction schemes, FGB and FGAB • Noting the characteristics of multicast system • Reduce the total feedback load by sacrificing the feedback of the users with good average channel • Significant reduction in total feedback load with marginal loss of throughput

More Related