Efficient clustering scheme for OFDMA-based multicast wireless systems using grouping genetic algorithm

Tan, Chee Keong; Chuah, Teong Chee; Tan, Su Wei; Sim, Moh Lim

doi:10.1049/el.2011.3429

Cited by 24 publications

(10 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From these works it clearly emerges that subgrouping policies in OFDMA-based networks pose additional constraints in terms of computation complexity and this asks for the design of low-complexity algorithms for multicast subgroup formation. Focusing on this aspect, works in [13] and [22] dealt with a near-optimal subgroup formation for maximizing the sum of the data rate experienced by the multicast users, i.e., the Aggregate Data Rate (ADR). In particular, authors in [13] proposed the Subgroup Merging Scheme (SMS) that, in the initialization step, serves the multicast users on unicast connections with a random sub-carriers assignment.…”

Section: Related Workmentioning

confidence: 99%

“…This process is iterated until there is no further ADR improvement or no subgroups to merge. Authors in [22] designed an efficient scheme, namely the Multicast Grouping Genetic Algorithm (MGGA), an evolutionary clustering method where the subgrouping problem is coded as subgroups in chromosomes and as fitness in ADR. The MGGA aims at performing different generations (i.e., iterations) in order to select the population (i.e., subgroup configuration) with the highest fitness (i.e., ADR).…”

Section: Related Workmentioning

confidence: 99%

“…With the aim to overcome this limit, a resource allocation can be adopted for multicast subgroup formation that aims to maximize the Aggregate Data Rate, as also considered in [13] [22]. Hence, the subgrouping resource allocation problem can be expressed as follows:…”

Section: ) Maximum Throughputmentioning

confidence: 99%

“…In order to assess the effectiveness of the subgroup-based RRM policies (both Maximum Throughput and Proportional Fairness), we compare them with the CMS algorithm, which represents the standard solution for multicast traffic delivery in MBMS. To assess the near-optimal behavior of the proposed FAST for subgroup formation, we compare its performance against the ESS used as a benchmark and two low-complexity schemes, i.e., SMS [13] and MGGA [22], mentioned in the related work section.…”

Section: A Simulation Modelmentioning

confidence: 99%

See 3 more Smart Citations

A Low-Complexity Resource Allocation Algorithm for Multicast Service Delivery in OFDMA Networks

Araniti

Condoluci

Molinaro

et al. 2014

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

Abstract-Allocating and managing radio resources to multicast transmissions in Orthogonal Frequency-Division Multiple Access (OFDMA) systems is the challenging research issue addressed by this paper. A subgrouping technique, which divides the subscribers into subgroups according to the experienced channel quality, is considered to overcome the throughput limitations of conventional multicast data delivery schemes. A low complexity algorithm, designed to work with different resource allocation strategies, is also proposed to reduce the computational complexity of the subgroup formation problem. Simulation results, carried out by considering the Long Term Evolution (LTE) system based on OFDMA, testify the effectiveness of the proposed solution, which achieves a near-optimal performance with a limited computational load for the system.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: ) Maximum Throughputmentioning

confidence: 99%

Section: A Simulation Modelmentioning

confidence: 99%

See 2 more Smart Citations

A Low-Complexity Resource Allocation Algorithm for Multicast Service Delivery in OFDMA Networks

Araniti

Condoluci

Molinaro

et al. 2014

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

show abstract

“…Base on the analysis above, in order to overcome the shortcomings of [7,14,15], in this paper, we propose a novel resource allocation scheme for the base layer and enhancement layers, respectively. The objective of base layer data's optimal problem is to maximise total throughput while guaranteeing the requirements of QoS among all groups.…”

Section: Introductionmentioning

confidence: 99%

Dynamic resource allocation with precoding and joint coding scheme for limited feedback‐based wireless multi‐antenna multicast system

Chen

Wang

He³

2013

IET Communications

View full text Add to dashboard Cite

In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, the authors introduce a resource allocation algorithm by exploiting layered coding combined with erasure correction coding for multicast services in the downlink of orthogonal frequency-division multiple access-based multi-antenna system. To reduce the feedback overhead of uplink, the authors design a novel transmission scheme with limited feedback. Then, the joint subcarrier and power allocation problem for the data of base layer and enhancement layers are formulated, which is shown to be non-deterministic polynomial-hard. Hence, in order to reduce the computational complexity, they propose a three-phase suboptimal algorithm. The algorithm is designed to maximise the system throughput, whereas at the same time guarantee the quality of services (QoS) requirements of all multicast groups. It is composed of precoding scheme, proportional fairness subcarrier allocation algorithm and modified water-filling power allocation algorithm with QoS guarantees (MWF-Q). To further decrease the complexity of MWF-Q, a power allocation algorithm with increased fixed power allocation algorithm with QoS guarantees is introduced. Simulation results show that the proposed algorithms based on limited feedback scheme significantly outperform CMS and any other existing algorithm with full feedback. Moreover, the proposed scheme can efficiently reduce 50% of the full feedback overhead.

show abstract

A Novel Grouping Genetic Algorithm for Assigning Resources to Users in WCDMA Networks

Cuadra

Salcedo‐Sanz

Carnicer

et al. 2015

Applications of Evolutionary Computation

View full text Add to dashboard Cite

Efficient clustering scheme for OFDMA-based multicast wireless systems using grouping genetic algorithm

Cited by 24 publications

References 2 publications

A Low-Complexity Resource Allocation Algorithm for Multicast Service Delivery in OFDMA Networks

A Low-Complexity Resource Allocation Algorithm for Multicast Service Delivery in OFDMA Networks

Dynamic resource allocation with precoding and joint coding scheme for limited feedback‐based wireless multi‐antenna multicast system

A Novel Grouping Genetic Algorithm for Assigning Resources to Users in WCDMA Networks

Contact Info

Product

Resources

About