Optimized Frame Packing for OFDMA Systems

Necker, Marc; Köhn, Martin; Reifert, Andreas; Scharf, Joachim; Sommer, Jörg

doi:10.1109/vetecs.2008.348

Cited by 3 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, their scheme has big disadvantages as nearly all parameters should be set manually and there is little optimization. For OFDM systems, BenShimol et al in [21] and Necker et al in [22] provide methods to increase resources utilization also at physical level. But in OFDM systems, each time slot in every subchannel is strictly isolated from each other, even if they are adjacent in the time-frequency plane, which decreases the complexity of the combinatorial optimization problem.…”

Section: Related Workmentioning

confidence: 99%

Efficient resource allocation for wireless virtualization using time-space division

Zhang

Jin

et al. 2012

2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

Network virtualization provides an alternative for wireless testbed to support multiple experiments simultaneously, as its properties of isolation, customization and efficiency are able to improve network resources utilization significantly. However, complex radio environment makes the employment of virtualization in wireless networks become a difficult problem, in which strict isolation across different experiments is hard to maintain. What is more, present radio experimental systems mostly exploit only Time Division Multiplexing, which may cause resources waste when the scale of experiments is relatively small. In this paper, we propose a time-space combined resources allocation scheme by taking advantage of both Time Division Multiplexing and Space Division Multiplexing. In this scheme, we first select a new time slot and some unscheduled experiments. Then we adopt Space Division Multiplexing to fit in as many experiments as possible in a time slot while ensuring required isolation across them. Extensive simulation shows that our scheme improves experimental resources utilization effectively, while each experiment in the same time slot have enough bandwidth among all nodes and the fairness of resources utility is also ensured.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient resource allocation for wireless virtualization using time-space division

Zhang

Jin

et al. 2012

2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

show abstract

“…In this paper we present an efficient and simple algorithm named Orientation-Based Burst Packing (OBBP) algorithm to pack the user's data bursts into the DL-Subframe container. This problem has been investigated in the literature from different viewpoints [3][4][5][6][7][8][9][10][11][12][13][14][15][16]. The authors in [3] presented the Less Flexibility First (LFF) algorithm as an efficient solution.…”

Section: Introductionmentioning

confidence: 99%

OBBP: An Efficient Burst Packing Algorithm for IEEE802.16e Systems

Eshanta

Ismail

Jumari

2011

ISRN Communications and Networking

View full text Add to dashboard Cite

Mobile communications have witnessed a phenomenal increase in the amount of users, services, and applications. Orthogonal Frequency Division Multiple Access (OFDMA) targets to provide broadband connectivity to wide area coverage, in mobile environments, for Next Generation Networks (NGNs), which results in significant design challenges in the MAC (Medium Access Control) layer to provide an efficient resource allocation in a cost-effective manner. This paper proposes a two-dimensional (2D) Burst Packing (BP) algorithm for OFDMA downlink (DL) subframe that can provide the service providers with an efficient, fast, flexible, and high-spectral efficiency method to allocate system resources among the Mobile Stations (MSs). The proposed Orientation-Based Burst Packing (OBBP) algorithm uses the Orientation Factors (OFs) of the bursts as a criteria to achieve the challenging issues in the BP problem. The simulation results show that OBBP algorithm can achieve a high packing efficiency up to 99.2% when the burst size ratio (BSR) is 50%.

show abstract

An efficient burst packing algorithm for OFDMA systems

Eshanta

Ismail

Jumari

2010

2010 2nd International Conference on Computer Technology and Development

View full text Add to dashboard Cite

Orthogonal Frequency Division Multi p le Access (OFDMA) targets to p rovide broadband connectivity to wide area coverage in mobile environments, which results in significant design challenges in the Medium Access Control (MAC) layer to p rovide an efficient resource allocation in a cost-effective manner. This p a p er p ro p oses a two dimensional (2D) Burst Packing (BP) algorithm for OFDMA down Link (DL) subframe that can p rovide the service p roviders with an efficient, fast, flexible and high s p ectral efficiency method to allocate system resources among the Mobile Stations (MSs). The p ro p osed Orientation-Based Burst Packing algorithm uses the Orientation Factors (OF) of the bursts as a criteria to achieve the challenging issues in the BP p roblem. The simulation results show that the p ro p osed algorithm can achieve a high p acking efficiency u p to 99.2 % when the burst size ratio (BSR) is 50 %.

show abstract

Optimized Frame Packing for OFDMA Systems

Cited by 3 publications

References 16 publications

Efficient resource allocation for wireless virtualization using time-space division

Efficient resource allocation for wireless virtualization using time-space division

OBBP: An Efficient Burst Packing Algorithm for IEEE802.16e Systems

An efficient burst packing algorithm for OFDMA systems

Contact Info

Product

Resources

About