Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory

Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization

A Survey of Anticipatory Mobile Networking: Context-Based Classification, Prediction Methodologies, and Optimization Techniques

A growing trend for information technology is to not just react to changes, but anticipate them as much as possible. This paradigm made modern solutions, such as recommendation systems, a ubiquitous presence in today's digital transactions. Anticipatory networking extends the idea to communication technologies by studying patterns and periodicity in human behavior and network dynamics to optimize network performance. This survey collects and analyzes recent papers leveraging context information to forecast the evolution of network conditions and, in turn, to improve network performance. In particular, we identify the main prediction and optimization tools adopted in this body of work and link them with objectives and constraints of the typical applications and scenarios. Finally, we consider open challenges and research directions to make anticipatory networking part of next generation networks

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

From its introduction to its quindecennial, network coding has built a strong reputation for enhancing packet recovery and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the system by proposing elaborate schemes able to reach the network capacity. With the shift toward distributed computing on mobile devices, performance and complexity become both critical factors that affect the efficiency of a coding strategy. Instantly decodable network coding presents itself as a new paradigm in network coding that trades off these two aspects. This paper review instantly decodable network coding schemes by identifying, categorizing, and evaluating various algorithms proposed in the literature. The first part of the manuscript investigates the conventional centralized systems, in which all decisions are carried out by a central unit, e.g., a base-station. In particular, two successful approaches known as the strict and generalized instantly decodable network are compared in terms of reliability, performance, complexity, and packet selection methodology. The second part considers the use of instantly decodable codes in a device-to-device communication network, in which devices speed up the recovery of the missing packets by exchanging network coded packets. Although the performance improvements are directly proportional to the computational complexity increases, numerous successful schemes from both the performance and complexity viewpoints are identified

Resource Allocation in 4G and 5G Networks: A Review

The advent of 4G and 5G broadband wireless networks brings several challenges with respect to resource allocation in the networks. In an interconnected network of wireless devices, users, and devices, all compete for scarce resources which further emphasizes the fair and efficient allocation of those resources for the proper functioning of the networks. The purpose of this study is to discover the different factors that are involved in resource allocation in 4G and 5G networks. The methodology used was an empirical study using qualitative techniques by performing literature reviews on the state of art in 4G and 5G networks, analyze their respective architectures and resource allocation mechanisms, discover parameters, criteria and provide recommendations. It was observed that resource allocation is primarily done with radio resource in 4G and 5G networks, owing to their wireless nature, and resource allocation is measured in terms of delay, fairness, packet loss ratio, spectral efficiency, and throughput. Minimal consideration is given to other resources along the end-to-end 4G and 5G network architectures. This paper defines more types of resources, such as electrical energy, processor cycles and memory space, along end-to-end architectures, whose allocation processes need to be emphasized owing to the inclusion of software defined networking and network function virtualization in 5G network architectures. Thus, more criteria, such as electrical energy usage, processor cycle, and memory to evaluate resource allocation have been proposed.  Finally, ten recommendations have been made to enhance resource allocation along the whole 5G network architecture

An adaptive social-aware device-to-device communication mechanism for wireless networks

Device-to-Device (D2D) communication is an essential element in 5G networks, which enables users to communicate either directly without network assistance or with minimum signaling through a base station. For an effective D2D communication, related problems in mode and peer selection need to be addressed. In mode selection, the problem is how to guarantee selection always chooses the best available mode. In peer selection, the problem is how to select optimum peers among surrounding peers in terms of connection conditions and social relationships between peers. The main objectives of this research are to identify mode selection between devices and establishing a connection with the best D2D pair connection without privacy leakage. Multi-Attribute Decision Making and Social Choice theories are applied to achieve the objectives. Mode selection scheme is based on Received Signal Strength (RSS), delay and bandwidth attributes to choose and switch among the available modes intelligently based on the highest ranking. Then, the peering selection scheme is proposed using RSS, delay, bandwidth and power attribute to find an optimum peer with concerning social relationship, by evaluating trust level between peers and excluding the untrusted peers from ranking which will increase the optimum quality of D2D connection. The proposed schemes are validated and tested using MATLAB. Two main scenarios, namely crowded network and user speed were considered to evaluate the proposed mechanism with three existing approaches where the selection is based on a single attribute. The obtained results showed that the proposed mechanism outperforms other approaches in terms of delay, signal to noise ratio, delivery ratio and throughput with better performance up to 70%. The proposed mechanism provides a smooth switching between different modes and employs an automatic peering selection with trusted peers only. It can be applied in different types of network that serves the massive number of users with different movement speed of the user

Efficient Algorithms for Cache-Throughput Analysis in Cellular-D2D 5G Networks

In this paper, we propose a two-tiered segment-based Device-to-Device (S-D2D) caching approach to decrease the start up and playback delay experienced by Video-on-Demand (VoD) users in a cellular network. In the S-D2D caching approach cache space of each mobile device is divided into two cache-blocks. The first cache-block reserve for caching and delivering the beginning portion of the most popular video les and the second cache-block caches the latter portion of the requested video les ‘fully or partially’ depending on the users’ video watching behaviour and popularity of videos. In this approach before caching, video is divided and grouped in a sequence of fixed-sized fragments called segments. To control the admission to both cache-blocks and improve the system throughput, we further propose and evaluate three cache admission control algorithms. We also propose a video segment access protocol to elaborate on how to cache and share the video segments in a segmentation based D2D caching architecture. We formulate an optimisation problem and the optimal cache probability and beginning-segment size that maximise the cache-throughput probability of beginning-segments. To solve the non-convex cache-throughout maximisation problem, we derive an iterative algorithm, where the optimal solution is derived in each step. We used extensive simulations to evaluate the performance of our proposed S-D2D caching system

Efficient algorithms for cache-throughput analysis in cellular-D2D 5G networks

In this paper, we propose a two-Tiered segment-based Device-To-Device (S-D2D) caching approach to decrease the startup and playback delay experienced by Video-on-Demand (VoD) users in a cellular network. In the S-D2D caching approach cache space of each mobile device is divided into two cache-blocks. The first cache-block reserve for caching and delivering the beginning portion of the most popular video files and the second cacheblock caches the latter portion of the requested video files fully or partially depending on the users video watching behaviour and popularity of videos. In this approach before caching, video is divided and grouped in a sequence of fixed-sized fragments called segments. To control the admission to both cacheblocks and improve the system throughput, we further propose and evaluate three cache admission control algorithms. We also propose a video segment access protocol to elaborate on how to cache and share the video segments in a segmentation based D2D caching architecture.We formulate an optimisation problem and find the optimal cache probability and beginning-segment size that maximise the cache-Throughput probability of beginning-segments. To solve the non-convex cache-Throughout maximisation problem, we derive an iterative algorithm, where the optimal solution is derived in each step.We used extensive simulations to evaluate the performance of our proposed S-D2D caching system

Low-latency Networking: Where Latency Lurks and How to Tame It

While the current generation of mobile and fixed communication networks has been standardized for mobile broadband services, the next generation is driven by the vision of the Internet of Things and mission critical communication services requiring latency in the order of milliseconds or sub-milliseconds. However, these new stringent requirements have a large technical impact on the design of all layers of the communication protocol stack. The cross layer interactions are complex due to the multiple design principles and technologies that contribute to the layers' design and fundamental performance limitations. We will be able to develop low-latency networks only if we address the problem of these complex interactions from the new point of view of sub-milliseconds latency. In this article, we propose a holistic analysis and classification of the main design principles and enabling technologies that will make it possible to deploy low-latency wireless communication networks. We argue that these design principles and enabling technologies must be carefully orchestrated to meet the stringent requirements and to manage the inherent trade-offs between low latency and traditional performance metrics. We also review currently ongoing standardization activities in prominent standards associations, and discuss open problems for future research

Performance enhancement of wireless communication systems through QoS optimisation

Providing quality of service (QoS) in a communication network is essential but challenging, especially when the complexities of wireless and mobile networks are added. The issues of how to achieve the intended performances, such as reliability and efficiency, at the minimal resource cost for wireless communications and networking have not been fully addressed. In this dissertation, we have investigated different data transmission schemes in different wireless communication systems such as wireless sensor network, device-to-device communications and vehicular networks. We have focused on cooperative communications through relaying and proposed a method to maximise the QoS performance by finding optimum transmission schemes. Furthermore, the performance trade-offs that we have identified show that both cooperative and non-cooperative transmission schemes could have advantages as well as disadvantages in offering QoS. In the analytical approach, we have derived the closed-form expressions of the outage probability, throughput and energy efficiency for different transmission schemes in wireless and mobile networks, in addition to applying other QoS metrics such as packet delivery ratio, packet loss rate and average end-to-end delay. We have shown that multi-hop relaying through cooperative communications can outperform non-cooperative transmission schemes in many cases. Furthermore, we have also analysed the optimum required transmission power for different transmission ranges to obtain the maximum energy efficiency or maximum achievable data rate with the minimum outage probability and bit error rate in cellular network. The proposed analytical and modelling approaches are used in wireless sensor networks, device-to-device communications and vehicular networks. The results generated have suggested an adaptive transmission strategy where the system can decide when and how each of transmission schemes should be adopted to achieve the best performance in varied conditions. In addition, the system can also choose proper transmitting power levels under the changing transmission distance to increase and maintain the network reliability and system efficiency accordingly. Consequently, these functions will lead to the optimized QoS in a given network