Delay aware optimal resource allocation in MU MIMO-OFDM using enhanced spider monkey optimization

In multiple users MIMO- OFDM system allocates the available resources to the optimal users is a difficult task. Hence the scheduling and resource allocation become the major problem in the wireless network mainly in case of multiple input and multiple output method that has to be made efficient. There is various method introduced to give an optimal solution to the problem yet it has many drawbacks. So we propose this paper to provide an efficient solution for resource allocation in terms of delay and also added some more features such as high throughout, energy efficient and fairness. To make optimal resource allocation we introduce optimization algorithm named spider monkey with an enhancement which provides the efficient solution. In this optimization process includes the scheduling and resource allocation, the SNR values, channel state information (CSI) from the base station. To make more efficient finally we perform enhanced spider - monkey algorithm hence the resource allocation is performed based on QoS requirements. Thus the simulation results in our paper show high efficiency when compared with other schedulers and techniques

Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling

We study the problem of allocating limited feedback resources across multiple users in an orthogonal-frequency-division-multiple-access downlink system with slow frequency-domain scheduling. Many flavors of slow frequency-domain scheduling (e.g., persistent scheduling, semi-persistent scheduling), that adapt user-sub-band assignments on a slower time-scale, are being considered in standards such as 3GPP Long-Term Evolution. In this paper, we develop a feedback allocation algorithm that operates in conjunction with any arbitrary slow frequency-domain scheduler with the goal of improving the throughput of the system. Given a user-sub-band assignment chosen by the scheduler, the feedback allocation algorithm involves solving a weighted sum-rate maximization at each (slow) scheduling instant. We first develop an optimal dynamic-programming-based algorithm to solve the feedback allocation problem with pseudo-polynomial complexity in the number of users and in the total feedback bit budget. We then propose two approximation algorithms with complexity further reduced, for scenarios where the problem exhibits additional structure.Comment: Accepted to IEEE Transactions on Signal Processin

MLTE Algorithm for Multicast Service Delivery in OFDMA Networks

Dispensing and overseeing radio resources to the multi-cast transmissions in OFDMA (orthogonal-frequency division-multiple-access) systems is testing exploration issue tended to by this paper. A sub-grouping technique, which separates the subscribers into subgroups as indicated by the accomplished channel quality, is considered to defeat the throughput confinements of conventional multicast data conveyance schemes. A low complexity algorithm intended to work with diverse resource allocation strategies, is additionally proposed to diminish the computational complexity of the subgroup development issue. Reproduction results, did by considering the long term evolution system taking into account OFDMA, affirm the adequacy of the proposed arrangement, which accomplishes a close ideal execution with a restricted computational load for the system. In this paper we are introducing the MLTE for improve the MBPS speed for fix network coverage at uniform and sparse. DOI: 10.17762/ijritcc2321-8169.150713

Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying

This paper addresses a weighted sum rate (WSR) maximization problem for downlink OFDMA aided by a decode-and-forward (DF) relay under a total power constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is proposed. Specifically, user message bits are transmitted in two time slots. A subcarrier in the first slot can be paired with a subcarrier in the second slot for the DF relay-aided transmission to a user. In particular, the source and the relay can transmit simultaneously to implement beamforming at the subcarrier in the second slot. Each unpaired subcarrier in either the first or second slot is used for the source's direct transmission to a user. A benchmark protocol, same as the proposed one except that the transmit beamforming is not used for the relay-aided transmission, is also considered. For each protocol, a polynomial-complexity algorithm is developed to find at least an approximately optimum resource allocation (RA), by using continuous relaxation, the dual method, and Hungarian algorithm. Instrumental to the algorithm design is an elegant definition of optimization variables, motivated by the idea of regarding the unpaired subcarriers as virtual subcarrier pairs in the direct transmission mode. The effectiveness of the RA algorithm and the impact of relay position and total power on the protocols' performance are illustrated by numerical experiments. The proposed protocol always leads to a maximum WSR equal to or greater than that for the benchmark one, and the performance gain of using the proposed one is significant especially when the relay is in close proximity to the source and the total power is low. Theoretical analysis is presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on Signal Processing. arXiv admin note: text overlap with arXiv:1301.293

Energy Harvesting for Secure OFDMA Systems

Energy harvesting and physical-layer security in wireless networks are of great significance. In this paper, we study the simultaneous wireless information and power transfer (SWIPT) in downlink orthogonal frequency-division multiple access (OFDMA) systems, where each user applies power splitting to coordinate the energy harvesting and information decoding processes while secrecy information requirement is guaranteed. The problem is formulated to maximize the aggregate harvested power at the users while satisfying secrecy rate requirements of all users by subcarrier allocation and the optimal power splitting ratio selection. Due to the NP-hardness of the problem, we propose an efficient iterative algorithm. The numerical results show that the proposed method outperforms conventional methods.Comment: Accepted by WCSP 201

Investigation on Evolving Single-Carrier NOMA into Multi-Carrier NOMA in 5G

© 2013 IEEE. Non-orthogonal multiple access (NOMA) is one promising technology, which provides high system capacity, low latency, and massive connectivity, to address several challenges in the fifth-generation wireless systems. In this paper, we first reveal that the NOMA techniques have evolved from single-carrier NOMA (SC-NOMA) into multi-carrier NOMA (MC-NOMA). Then, we comprehensively investigated on the basic principles, enabling schemes and evaluations of the two most promising MC-NOMA techniques, namely sparse code multiple access (SCMA) and pattern division multiple access (PDMA). Meanwhile, we consider that the research challenges of SCMA and PDMA might be addressed with the stimulation of the advanced and matured progress in SC-NOMA. Finally, yet importantly, we investigate the emerging applications, and point out the future research trends of the MC-NOMA techniques, which could be straightforwardly inspired by the various deployments of SC-NOMA