MCS selection algorithms for a persistent allocation scheme to accommodate VoIP services in IEEE 802.16e OFDMA system

Cho, Changgi; Jin, Hu; Song, Nah-Oak; Sung, Dan Keun

doi:10.1109/pimrc.2009.5449929

Cited by 10 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MCS allocation is based on the minimization of the number of HARQ retransmissions, neglecting the statistics of additionally RBs assigned in the same TTI. In [9] the authors extend the work of [8] for time correlated channel conditions. In contrast to these works, we concentrate on the performance improvement since the first transmission and consider the joint statistics of the assigned RBs.…”

Section: B Problem Statement and Related Workmentioning

confidence: 95%

See 1 more Smart Citation

Rate selection analysis under semi-persistent scheduling in LTE networks

Parruca

Gross

2013

2013 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

Abstract-Upcoming LTE networks have basically two different modes for scheduling data in the down-link by the base station. Dynamic scheduling brings the advantage of exploiting instantaneous channel state information while it puts on the other hand a significant burden on the system in terms of overhead and computation requirements. Especially for small packets that show up periodically, the overhead is typically too high. Therefore, the base station can serve such packet flows by the semi-persistent scheduling mode. In this mode, a certain resource allocation is fixed to a periodic schedule. While this does not allow any longer to exploit instantaneous channel states, it requires much less overhead. In this paper, we address the problem of selecting a modulation and coding scheme for such semi-persistent scheduling grants. The problem lies here in the stochastic characterization of the resource blocks over the next few seconds while on the other hand estimating based on such a characterization the blok error rate (and hence the average goodput). We provide a novel scheme, which outperforms all previously presented schemes significantly. The underlying model that we provide can also be used for any other long-term decision in an LTE system with semi-persistent scheduling such as interference coordination, handover decision etc.

show abstract

Section: B Problem Statement and Related Workmentioning

confidence: 95%

“…The MCS selection algorithms proposed in [8] assume a Nakagami-m SINR distribution. The MCS allocation is based on the minimization of the number of HARQ retransmissions, neglecting the statistics of additionally RBs assigned in the same TTI.…”

Section: B Problem Statement and Related Workmentioning

confidence: 99%

Rate selection analysis under semi-persistent scheduling in LTE networks

Parruca

Gross

2013

2013 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

show abstract

“…However, since they used throughput measurement under a full queue condition without considering the packet error requirement, their results can not be applicable to the rate selection of realtime services. Cho et al [7] proposed a method to select the optimal MCS level to minimize the resource usage of the PS with an HARQ scheme for given bounds on the maximum number of (re)transmissions and packet error requirement in a single link.…”

Section: Introductionmentioning

confidence: 99%

Optimizing the persistent scheduling in two-hop relay networks

Kim

Jin

Sung

2011

2011 IEEE Wireless Communications and Networking Conference

Self Cite

View full text Add to dashboard Cite

We propose two scheduling protocols which are applicable to two-hop relay networks based on mobile WiMAX system: the first protocol adopts a persistent scheduling (PS) scheme in both hops, called the PS-PS protocol, while the second protocol adopts the PS scheme only in the first hop and the dynamic scheduling (DS) scheme in the second hop, called the PS-DS protocol. We optimize the above two protocols by minimizing their average resource usage (ARU) through appropriate selection of the modulation and coding scheme (MCS) level for given delay and packet error requirements. Taking into account different characteristics in both a source-relay (SR) link and a relaydestination (RD) link, resource usage due to hybrid automatic repeat request (HARQ) retransmissions, and the accompanying signaling overhead, we compare the performance of the proposed optimization methods with that of the conventional method in terms of ARU. The PS-PS protocol outperforms the PS-DS protocol and the conventional method considered in most channel case, while the PS-DS protocol outperforms other schemes in a harsh channel condition.

show abstract

“…The main application of the persistent scheduling is VoIP service with a periodic real-time property. Recently, there have been several studies on the persistent scheduling for VoIP service [8], [9], [10]. The persistent scheduling increases the VoIP user capacity by 15% and reduces the MAP overhead by 19% compared to the user capacity and MAP overhead of the conventional scheduling [8] in IEEE 802.16e system.…”

Section: Introductionmentioning

confidence: 99%

“…In order to improve the VoIP user capacity in IEEE 802.16e system, Shirivastava et al [9] adopted a group scheduling concept to the persistent scheduling. Cho et al [10] also proposed a modulation and coding scheme (MCS) selection algorithm which can minimize the resource for the persistent scheduling and evaluated the VoIP user capacity. The performance of the persistent scheduling in 3GPP2 and 3GPP LTE systems were also evaluated for VoIP service [11], [12].…”

Section: Introductionmentioning

confidence: 99%

On the efficiency of persistent scheduling for non-periodic real-time services in IEEE 802.16e system

Jin

Lee

Sung

2010

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

Self Cite

View full text Add to dashboard Cite

In order to reduce MAP overhead for periodic small-sized services such as voice over IP (VoIP) service, a persistent scheduling scheme has been proposed in IEEE 802.16e/m. Although this persistent scheduling scheme is designed for periodic services, we propose to adopt the persistent scheduling for non-periodic real-time services with small-sized packets by considering the advantage of MAP overhead reduction. Assuming Poisson packet arrivals which show a typical non-periodic property, we mathematically analyze the average delay performance and derive the optimal resource allocation period of the persistent scheduling with a given delay requirement. In this paper, we also compare the average occupied resources per frame between the persistent scheduling and the conventional scheduling both in downlink and uplink. Analysis and numerical results show that for the non-periodic services, the persistent scheduling shows more efficient resource usage than that of the conventional scheduling with a smaller packet size and higher modulation and coding scheme.

show abstract

MCS selection algorithms for a persistent allocation scheme to accommodate VoIP services in IEEE 802.16e OFDMA system

Cited by 10 publications

References 13 publications

Rate selection analysis under semi-persistent scheduling in LTE networks

Rate selection analysis under semi-persistent scheduling in LTE networks

Optimizing the persistent scheduling in two-hop relay networks

On the efficiency of persistent scheduling for non-periodic real-time services in IEEE 802.16e system

Contact Info

Product

Resources

About