Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey

Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems

Resource and Bandwidth Allocation in Hybrid Wireless Mobile Networks

In the lead up to the implementation of 802.16 and 4G wireless networks, there have been many proposals for addition of multi-hop MANET zones or relay stations in order to cut the cost of building a new backbone infrastructure from the ground up. These types of Hybrid Wireless Networks will certainly be a part of wireless network architecture in the future, and as such, simple problems such as resource allocation must be explored to maximize their potential. This study explores the resource allocation problem in three distinct ways. First, this study highlights two existing backbone architectures: max-coverage and max-resource, and how hybridization will affect bandwidth allocation, with special emphasis on OFDM-TMA wireless networks. Secondly, because of the different goals of these types of networks, the addition of relay stations or MANET zones will affect resource availability differently, and I will show how the addition of relay stations impacts the backbone network. Finally, I will discuss specific allocation algorithms and policies such as top-down, bottom-up, and auction-based allocation, and how each kind of allocation will maximize the revenue of both the backbone network as well as the mobile subscribers while maintaining a minimum Quality of Service (or fairness). Each of these approaches has merit in different hybrid wireless systems, and I will summarize the benefits of each in a study of a network system with a combination of the elements discussed in the previous chapters

A Systematic Review of NOMA Variants for 5G and Beyond

With the fast expansion of the Internet of Things (IoT), there is an exponential need for mobile intelligent terminals .However, the connectivity of large-scale intelligent terminals is constrained by increasingly restricted spectrum resources. To address this issue, non-orthogonal multiple access (NOMA) technology, which can handle more users with less resources, is predicted to enable future wireless networks beyond 5G,., 6G, to give huge terminal access. The fundamental idea behind NOMA is to superimpose signals from numerous users on the same time-frequency resource prior to transmission. At the receiver, serial interference cancellation (SIC) technology is used to reduce interference among users. In this  review paper  we discusses the principles of the strong candidate Non-Orthogonal Multiple Access (NOMA) approach, as well as how it can best match the requirements of the Fifth Generation (5G) requirements in practical applications.  

Game Theoretical Approaches for Wireless Networks

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2017. 2. 김성철.In this dissertation, I introduce three algorithms, which are connectivity reconstruction game (CRG), adaptive sector coloring game (ASCG), and asymmetric transmission game (ATG), by mainly using supermodular game and exact potential game with considerations of various objectives (e.g., energy consumption and interference management) in wireless sensor and cellular networks. My main contributions are threefold: 1) connectivity relaxation (energy saving) in wireless localization2) intercell interference coordination in wireless cellular networks3) interference minimization in wireless ad-hoc relay networks. The corresponding explanations are as follows. 1) In geographically dense and energy limited wireless sensor networks, connectivity based localization with full power transmission can be inefficient in terms of energy consumption. In this work, I propose a distributed power control based connectivity reconstruction game, which takes into considerations of both energy efficiency and the quality of localization. The proposed scheme results in a better performance with an improved 61.9% reduction in energy consumption while maintaining the performance of localization at a level similar to the conventional algorithm with full power transmission. 2) Inter-cell interference coordination (ICIC) is a promising technique to improve the performance of frequency-domain packet scheduling (FDPS) in downlink LTE/LTEA networks. However, it is difficult to maximize the performance of FDPS using static ICIC schemes because of insufficient consideration of signal-to-interference-and-noise ratio (SINR) distribution and user fairness. On the other hand, dynamic ICIC schemes based on channel state information (CSI) also have difficulty presented in the excessive signaling overhead and X2 interface latency. In order to overcome these drawbacks, I introduce a new concept of ICIC problem based on geometric network information (GNI) and propose an ASCG as a decentralized solution of the GNI based ICIC problem. Furthermore, I develop an ASCG with a dominant strategy space noted as ASCGD to secure a stable solution through proving the existence of Nash equilibrium (NE). The proposed scheme provides better performance in terms of system throughput gain of up to about 44.1%, and especially of up to about 221% for the worst 10% users than static ICIC schemes. Moreover, the performance of the CSI based ICIC, which require too much computational load and signaling overhead, is only 13.0% and 5.6% higher than that of ASCG-D regarding the total user throughput and the worst 10% user throughput, respectively. The most interesting outcome is that the signaling overhead of ASCG-D is 1/144 of dynamic ICIC schemes one. 3) In this work, I introduce the new concept of temporal diversity utilization based on asymmetric transmission to minimize network interference in wireless ad-hoc networks with a two-hop half-duplex relaying (HDR) protocol. Asymmetric transmission is an interference-aware backoff technique, in which each communication session (source-relay-destination link) adaptively chooses a certain subset of spectrallyorthogonal data streaming which should be delayed by the duration of one time-slot (i.e., half of one subframe). I design the problem in the HDR scenario by applying the concept of asymmetric transmission, and evaluate the game-theoretical algorithm, called ATG, to derive the suboptimal solution. I show that ATG is an exact potential game, and derive its convergence and optimality properties. Furthermore, I develop an approximated version of ATG (termed A-ATG) in order to reduce signaling and computational complexity. Numerical results verify that two algorithms proposed showsignificant synergistic effects when collaborating with the conventional methods in terms of interference coordination. Ultimately, the energy consumption to satisfy the rate requirement is reduced by up to 17:4% compared to the conventional schemes alone.1 INTRODUCTION 1 1.1 Application of Supermodular Game for Connectivity Relaxation in Wireless Localization 2 1.2 Application of Exact Potential Game for Effective Inter-Cell Interference Coordination in Wireless Cellular Networks 3 1.3 Application of Exact Potential Game for Interference Minimization in Wireless Ad-hoc Relay Networks 7 1.4 Dissertation Outline 11 2 APPLICATION OF SUPERMODULAR GAME: Distributed Power Control based Connectivity Reconstruction Game inWireless Localization 13 2.1 Brief Introduction 13 2.2 System Model 13 2.3 Proposed Power Control Algorithm 14 2.3.1 Reliability Function 14 2.3.2 Game Formulation 15 2.3.3 Convergence Properties of CRG 17 2.4 Simulation Results 20 3 APPLICATION OF EXACT POTENTIAL GAME: Adaptive Sector Coloring Game for Geometric Network Information based Inter-Cell Interference Coordination in Wireless Cellular Networks 24 3.1 Brief Introduction 24 3.2 Network Model 26 3.2.1 System Preliminaries 26 3.2.2 Determination of Time Policy 27 3.2.3 Two-Stage Framework of RB Allocation 27 3.3 PROBLEM FORMULATION: Geometric Network Information based ICIC 28 3.3.1 Outline 28 3.3.2 What Is the GNI 28 3.3.3 Temporal Perspective: Why GNI 29 3.3.4 Spatial Perspective: How do I Design a Suitable Utility Function 29 3.3.5 GNI based ICIC Problem 33 3.4 ADAPTIVE SECTOR COLORING GAME 33 3.4.1 Design of ASCG 33 3.4.2 ASCG with a Dominant Strategy Space 35 3.4.3 Summary of System Operation 40 3.5 PERFORMANCE EVALUATION 41 3.5.1 Simulation Settings and Baselines for Comparison 41 3.5.2 SINR Distribution and Average User Throughput 43 3.5.3 Signaling Overhead for ICIC and FDPS 47 3.5.4 Reduction of Feasible ASCG Strategy Space 49 4 APPLICATION OF EXACT POTENTIAL GAME: Asymmetric Transmission Game for Interference Coordination in Wireless Ad-hoc Relay Networks 51 4.1 Brief Introduction 51 4.2 Problem Formulation 52 4.2.1 System Preliminaries 52 4.2.2 The Concept of Asymmetric Transmission for Interference Coordination: A Simple Example 53 4.2.3 Optimization Problem 54 4.3 Asymmetric Transmission Game 55 4.3.1 Game Formulation 55 4.3.2 Convergence and Optimality Properties of Asymmetric Transmission Game 55 4.3.3 Approximated Version of Asymmetric Transmission Game . . 58 4.4 Simulation Results 61 4.4.1 Parameters Settings 61 4.4.2 Network Interference in One-shot Game 62 4.4.3 Individual Power Consumption in One-shot Game 66 4.4.4 Total Energy Consumption in 1000-shot Games 70 4.4.5 Complexity Analysis for Varying K and M 71 5 CONCLUSION 74 Appendix A Derivation of number of partitions for extracting the dominant feasible strategy set 76 Appendix B Derivation of the cardinal number of the dominant feasible strategy set 78 Appendix C Existence of NE in ASCG-D 79 Appendix D The Required Signaling overhead of ASCG-D 82 Bibliography 83 Abstract (In Korean) 93Docto

D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version

Long Term Evolution-Advanced and Future Machine-to-Machine Communication

Long Term Evolution (LTE) has adopted Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) as the downlink and uplink transmission schemes respectively. Quality of Service (QoS) provisioning is one of the primary objectives of wireless network operators. In LTE-Advanced (LTE-A), several additional new features such as Carrier Aggregation (CA) and Relay Nodes (RNs) have been introduced by the 3rd Generation Partnership Project (3GPP). These features have been designed to deal with the ever increasing demands for higher data rates and spectral efficiency. The RN is a low power and low cost device designed for extending the coverage and enhancing spectral efficiency, especially at the cell edge. Wireless networks are facing a new challenge emerging on the horizon, the expected surge of the Machine-to-Machine (M2M) traffic in cellular and mobile networks. The costs and sizes of the M2M devices with integrated sensors, network interfaces and enhanced power capabilities have decreased significantly in recent years. Therefore, it is anticipated that M2M devices might outnumber conventional mobile devices in the near future. 3GPP standards like LTE-A have primarily been developed for broadband data services with mobility support. However, M2M applications are mostly based on narrowband traffic. These standards may not achieve overall spectrum and cost efficiency if they are utilized for serving the M2M applications. The main goal of this thesis is to take the advantage of the low cost, low power and small size of RNs for integrating M2M traffic into LTE-A networks. A new RN design is presented for aggregating and multiplexing M2M traffic at the RN before transmission over the air interface (Un interface) to the base station called eNodeB. The data packets of the M2M devices are sent to the RN over the Uu interface. Packets from different devices are aggregated at the Packet Data Convergence Protocol (PDCP) layer of the Donor eNodeB (DeNB) into a single large IP packet instead of several small IP packets. Therefore, the amount of overhead data can be significantly reduced. The proposed concept has been developed in the LTE-A network simulator to illustrate the benefits and advantages of the M2M traffic aggregation and multiplexing at the RN. The potential gains of RNs such as coverage enhancement, multiplexing gain, end-to-end delay performance etc. are illustrated with help of simulation results. The results indicate that the proposed concept improves the performance of the LTE-A network with M2M traffic. The adverse impact of M2M traffic on regular LTE-A traffic such as voice and file transfer is minimized. Furthermore, the cell edge throughput and QoS performance are enhanced. Moreover, the results are validated with the help of an analytical model