Reducing Feedback Load of Opportunistic Multicast Scheduling over Wireless Systems

Huang, Shiang-Ming; Hwang, Jenq‐Neng; Chen, Yaw-Chung

doi:10.1109/lcomm.2010.12.101406

Cited by 11 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2, only variable-sized MBS_MAP is located in the MBS zone, so we substract resources for MBS_MAP according to total number of video layered scheduled in this OFDMA frame before video layer allocation. We consider CQI interval to be 1 OFDMA frame in CQICH, while it has been shown that properly reduced frequency on OLM costs little to the performance [15].…”

Section: Simulation Resultsmentioning

confidence: 99%

OLM: Opportunistic Layered Multicasting for Scalable IPTV over Mobile WiMAX

Huang

et al. 2012

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

We propose Opportunistic Layered Multicasting (OLM), a joint user scheduling and resource allocation algorithm that provides enhanced quality and efficiency for layered video multicast over Mobile WiMAX. This work is a lead off and complete synergy of layered video multicasting with opportunistic concept. The target application is characterized by groups of users acquiring popular video programs over a fading channel. To accommodate various bandwidth requirements and device capability, video streams are coded into base and enhancement layers using scalable video coding technology. Correspondingly, the optimization problems, which select the best subset of users to receive a specific video layer and assign the most appropriate modulation and coding scheme for this video layer, are specifically formulated for both video layer types. We also design fast and effective algorithms to bridge the gap between theoretical throughput capacity and implementation concerns. Thus, the basic video quality can be efficiently guaranteed to all subscribers while creating most utility out of limited resources on enhancement information. To overcome the inevitable packet loss in a multicast session, an FEC rate adaptation scheme to approach theoretical performance is also presented. Favorable performance of the proposed algorithms is demonstrated by simulations utilizing realistic Mobile WiMAX parameters.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

OLM: Opportunistic Layered Multicasting for Scalable IPTV over Mobile WiMAX

Huang

et al. 2012

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The impact of limited feedback is examined in [15] and [17]. In [15], the MCS decision is made based on the average SNR.…”

Section: Related Workmentioning

confidence: 99%

“…This assumption is too conservative since a realistic channel is also characterized by the path loss, Rayleigh fading and shadowing. Huang et al [17] determine the transmission rate for the opportunistic multicast scheduling in [13] based on the recent channel conditions instead of the average SNR. Recent channels, however, do not always accurately reflect the instantaneous channel and it highly depends on the feedback interval, which is not explicitly defined.…”

Section: Related Workmentioning

confidence: 99%

Opportunistic Finite Horizon Multicasting of Erasure-Coded Data

Sim

Widmer

Rengarajan³

2016

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

We propose an algorithm for opportunistic multicasting in wireless networks. Whereas prior multicast rate adaptation schemes primarily optimize long-term throughput, we investigate the finite horizon problem where a fixed number of packets has to be transmitted to a set of wireless receivers in the shortest amount of time -a common problem, e.g., for software updates or video multicast. In the finite horizon problem, the optimum rate critically depends on the recent reception history of the receivers and requires a fine balance between maximizing overall throughput and equalizing individual receiver throughput. We formulate a dynamic programming algorithm that optimally solves this problem. We then develop two low complexity heuristics that perform close to the optimal solution and are suitable for practical online scheduling. We further analyze the performance of our algorithms by means of simulation. They substantially outperform existing solutions based on throughput maximization or favoring the user with the worst channel, and we obtain a 30% performance improvement over the former and a 120% improvement over the latter in scenarios with Rayleigh fading. We further analyze the performance of the schemes under imperfect state information and observe an even higher improvement over the benchmark schemes.

show abstract

“…C.W.Huang, et al [4], proposed a resource allocation algorithm that provides enhanced QoS and efficiency for layered video Multicast. S.-M. Huang, et al, [3] proposes a weakly consistent Opportunistic Multicast Scheduling (OMS) scheme for feedback reduction. Chakchai So-In, et al, [2] introduces a technique called Swapping Min-Max (SWIM) for UGS scheduling that not only meets the delay constraint with optimal throughput, but also minimizes the delay jitter and burst overhead.…”

Section: Literature Surveymentioning

confidence: 99%