Performance Analysis of Unsupervised LTE Device-to-Device (D2D) Communication

Cellular network technology based device-to-device communication attracts increasing attention for use cases such as the control of autonomous vehicles on the ground and in the air. LTE provides device-to-device communication options, however, the configuration options are manifold (leading to 150+ possible combinations) and therefore the ideal combination of parameters is hard to find. Depending on the use case, either throughput, reliability or latency constraints may be the primary concern of the service provider. In this work we analyze the impact of different configuration settings of unsupervised LTE device-to-device (sidelink) communication on the system performance. Using a simulative approach we vary the length of the PSCCH period and the number of PSCCH subframes and determine the impact of different combinations of those parameters on the resulting latency, reliability and the interarrival times of the received packets. Furthermore we examine the system limitations by a scalability analysis. In this context, we propose a modified HARQ process to mitigate scalability constraints. Our results show that the proposed reduced HARQ retransmission probability can increase the system performance regarding latency and interarrival times as well as the packet transmission reliability for higher channel utilization

Distributed Spectrum and Power Allocation for D2D-U Networks: A Scheme based on NN and Federated Learning

In this paper, a Device-to-Device communication on unlicensed bands (D2D-U) enabled network is studied. To improve the spectrum efficiency (SE) on the unlicensed bands and fit its distributed structure while ensuring the fairness among D2D-U links and the harmonious coexistence with WiFi networks, a distributed joint power and spectrum scheme is proposed. In particular, a parameter, named as price, is defined, which is updated at each D2D-U pair by a online trained Neural network (NN) according to the channel state and traffic load. In addition, the parameters used in the NN are updated by two ways, unsupervised self-iteration and federated learning, to guarantee the fairness and harmonious coexistence. Then, a non-convex optimization problem with respect to the spectrum and power is formulated and solved on each D2D-U link to maximize its own data rate. Numerical simulation results are demonstrated to verify the effectiveness of the proposed scheme

Clustering algorithm for D2D communication in next generation cellular networks : thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engineering, Massey University, Auckland, New Zealand

Next generation cellular networks will support many complex services for smartphones, vehicles, and other devices. To accommodate such services, cellular networks need to go beyond the capabilities of their previous generations. Device-to-Device communication (D2D) is a key technology that can help fulfil some of the requirements of future networks. The telecommunication industry expects a significant increase in the density of mobile devices which puts more pressure on centralized schemes and poses risk in terms of outages, poor spectral efficiencies, and low data rates. Recent studies have shown that a large part of the cellular traffic pertains to sharing popular contents. This highlights the need for decentralized and distributive approaches to managing multimedia traffic. Content-sharing via D2D clustered networks has emerged as a popular approach for alleviating the burden on the cellular network. Different studies have established that D2D communication in clusters can improve spectral and energy efficiency, achieve low latency while increasing the capacity of the network. To achieve effective content-sharing among users, appropriate clustering strategies are required. Therefore, the aim is to design and compare clustering approaches for D2D communication targeting content-sharing applications. Currently, most of researched and implemented clustering schemes are centralized or predominantly dependent on Evolved Node B (eNB). This thesis proposes a distributed architecture that supports clustering approaches to incorporate multimedia traffic. A content-sharing network is presented where some D2D User Equipment (DUE) function as content distributors for nearby devices. Two promising techniques are utilized, namely, Content-Centric Networking and Network Virtualization, to propose a distributed architecture, that supports efficient content delivery. We propose to use clustering at the user level for content-distribution. A weighted multi-factor clustering algorithm is proposed for grouping the DUEs sharing a common interest. Various performance parameters such as energy consumption, area spectral efficiency, and throughput have been considered for evaluating the proposed algorithm. The effect of number of clusters on the performance parameters is also discussed. The proposed algorithm has been further modified to allow for a trade-off between fairness and other performance parameters. A comprehensive simulation study is presented that demonstrates that the proposed clustering algorithm is more flexible and outperforms several well-known and state-of-the-art algorithms. The clustering process is subsequently evaluated from an individual user’s perspective for further performance improvement. We believe that some users, sharing common interests, are better off with the eNB rather than being in the clusters. We utilize machine learning algorithms namely, Deep Neural Network, Random Forest, and Support Vector Machine, to identify the users that are better served by the eNB and form clusters for the rest of the users. This proposed user segregation scheme can be used in conjunction with most clustering algorithms including the proposed multi-factor scheme. A comprehensive simulation study demonstrates that with such novel user segregation, the performance of individual users, as well as the whole network, can be significantly improved for throughput, energy consumption, and fairness

Sum Rate Maximization and Consistency in D2D Communication Based on ACO and Game Theory

Cellular network is the most popular network setup among today’s wireless communication systems. The primary resource in a cellular system is the spectrum for communication, and owing to the rising number of cellular users, the spectrum that is currently accessible from different service providers is depleting quickly. The resource or channel allocation is the most hindering task in cellular networks. Many efforts have been taken by many researchers to allocate the resources properly in order to increase the channel utilization and it is found that one effective method for reusing the channels inside a cell is device to device (D2D) communication. D2D communication was first developed in order to achieve the fundamental goals of fast data rates, widespread coverage with little latency, energy efficiency, and low per-information transmission costs. The dynamic behaviour of this network set-up again increases the risk of different types of interferences, which is another issue faced by the researchers. In this paper an effort is taken to understand and solve various aspects of channel allocation and Cellular networks have incorporated interference management in D2D communication especially. The two major issues of allocation of resource and management of interference in D2D communication is addressed here. This paper considers the meta heuristic algorithm namely Ant Colony Optimization (ACO) for resource allocation issue and interference management. The sum rate maximization is achieved through Game theory along with the concept of resource exchange in turn to increase the consistency of D2D communication setup. The results demonstrate that our algorithm can significantly increase the sum rate of D2D pairs when compared to other algorithms suggested by related works