Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication

Device-to-device (D2D) communication underlaying cellular networks allows mobile devices such as smartphones and tablets to use the licensed spectrum allocated to cellular services for direct peer-to-peer transmission. D2D communication can use either one-hop transmission (i.e., in D2D direct communication) or multi-hop cluster-based transmission (i.e., in D2D local area networks). The D2D devices can compete or cooperate with each other to reuse the radio resources in D2D networks. Therefore, resource allocation and access for D2D communication can be treated as games. The theories behind these games provide a variety of mathematical tools to effectively model and analyze the individual or group behaviors of D2D users. In addition, game models can provide distributed solutions to the resource allocation problems for D2D communication. The aim of this article is to demonstrate the applications of game-theoretic models to study the radio resource allocation issues in D2D communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201

Joint relay selection and resource allocation for energy-efficient D2D cooperative communications using matching theory

Device-to-device (D2D) cooperative relay can improve network coverage and throughput by assisting users with inferior channel conditions to implement multi-hop transmissions. Due to the limited battery capacity of handheld equipment, energy efficiency is an important issue to be optimized. Considering the two-hop D2D relay communication scenario, this paper focuses on how to maximize the energy efficiency while guaranteeing the quality of service (QoS) requirements of both cellular and D2D links by jointly optimizing relay selection, spectrum allocation and power control. Since the four-dimensional matching involved in the joint optimization problem is NP-hard, a pricing-based two-stage matching algorithm is proposed to reduce dimensionality and provide a tractable solution. In the first stage, the spectrum resources reused by relay-to-receiver links are determined by a two-dimensional matching. Then, a three-dimensional matching is conducted to match users, relays and the spectrum resources reused by transmitter-to-relay links. In the process of preference establishment of the second stage, the optimal transmit power is solved to guarantee that the D2D link has the maximized energy efficiency. Simulation results show that the proposed algorithm not only has a good performance on energy efficiency, but also enhances the average number of served users compared to the case without any relay

Device-to-device based path selection for post disaster communication using hybrid intelligence

Public safety network communication methods are concurrence with emerging networks to provide enhanced strategies and services for catastrophe management. If the cellular network is damaged after a calamity, a new-generation network like the internet of things (IoT) is ready to assure network access. In this paper, we suggested a framework of hybrid intelligence to find and re-connect the isolated nodes to the functional area to save life. We look at a situation in which the devices in the hazard region can constantly monitor the radio environment to self-detect the occurrence of a disaster, switch to the device-to-device (D2D) communication mode, and establish a vital connection. The oscillating spider monkey optimization (OSMO) approach forms clusters of the devices in the disaster area to improve network efficiency. The devices in the secluded area use the cluster heads as relay nodes to the operational site. An oscillating particle swarm optimization (OPSO) with a priority-based path encoding technique is used for path discovery. The suggested approach improves the energy efficiency of the network by selecting a routing path based on the remaining energy of the device, channel quality, and hop count, thus increasing network stability and packet delivery

Advanced Technologies for Device-to-device Communications Underlaying Cellular Networks

The past few years have seen a major change in cellular networks, as explosive growth in data demands requires more and more network capacity and backhaul capability. New wireless technologies have been proposed to tackle these challenges. One of the emerging technologies is device-to-device (D2D) communications. It enables two cellular user equip- ment (UEs) in proximity to communicate with each other directly reusing cellular radio resources. In this case, D2D is able to of oad data traf c from central base stations (BSs) and signi cantly improve the spectrum ef ciency of a cellular network, and thus is one of the key technologies for the next generation cellular systems. Radio resource management (RRM) for D2D communications and how to effectively exploit the potential bene ts of D2D are two paramount challenges to D2D communications underlaying cellular networks. In this thesis, we focus on four problems related to these two challenges. In Chapter 2, we utilise the mixed integer non-linear programming (MINLP) to model and solve the RRM optimisation problems for D2D communications. Firstly we consider the RRM optimisation problem for D2D communications underlaying the single carrier frequency division multiple access (SC-FDMA) system and devise a heuristic sub- optimal solution to it. Then we propose an optimised RRM mechanism for multi-hop D2D communications with network coding (NC). NC has been proven as an ef cient technique to improve the throughput of ad-hoc networks and thus we apply it to multi-hop D2D communications. We devise an optimal solution to the RRM optimisation problem for multi-hop D2D communications with NC. In Chapter 3, we investigate how the location of the D2D transmitter in a cell may affect the RRM mechanism and the performance of D2D communications. We propose two optimised location-based RRM mechanisms for D2D, which maximise the throughput and the energy ef ciency of D2D, respectively. We show that, by considering the location information of the D2D transmitter, the MINLP problem of RRM for D2D communications can be transformed into a convex optimisation problem, which can be ef ciently solved by the method of Lagrangian multipliers. In Chapter 4, we propose a D2D-based P2P le sharing system, which is called Iunius. The Iunius system features: 1) a wireless P2P protocol based on Bittorrent protocol in the application layer; 2) a simple centralised routing mechanism for multi-hop D2D communications; 3) an interference cancellation technique for conventional cellular (CC) uplink communications; and 4) a radio resource management scheme to mitigate the interference between CC and D2D communications that share the cellular uplink radio resources while maximising the throughput of D2D communications. We show that with the properly designed application layer protocol and the optimised RRM for D2D communications, Iunius can signi cantly improve the quality of experience (QoE) of users and of oad local traf c from the base station. In Chapter 5, we combine LTE-unlicensed with D2D communications. We utilise LTE-unlicensed to enable the operation of D2D in unlicensed bands. We show that not only can this improve the throughput of D2D communications, but also allow D2D to work in the cell central area, which normally regarded as a “forbidden area” for D2D in existing works. We achieve these results mainly through numerical optimisation and simulations. We utilise a wide range of numerical optimisation theories in our works. Instead of utilising the general numerical optimisation algorithms to solve the optimisation problems, we modify them to be suitable for the speci c problems, thereby reducing the computational complexity. Finally, we evaluate our proposed algorithms and systems through sophisticated numer- ical simulations. We have developed a complete system-level simulation framework for D2D communications and we open-source it in Github: https://github.com/mathwuyue/py- wireless-sys-sim

Relay assisted device-to-device communication with channel uncertainty

The gains of direct communication between user equipment in a network may not be fully realised due to the separation between the user equipment and due to the fading that the channel between these user equipment experiences. In order to fully realise the gains that direct (device-to-device) communication promises, idle user equipment can be exploited to serve as relays to enforce device-to-device communication. The availability of potential relay user equipment creates a problem: a way to select the relay user equipment. Moreover, unlike infrastructure relays, user equipment are carried around by people and these users are self-interested. Thus the problem of relay selection goes beyond choosing which device to assist in relayed communication but catering for user self-interest. Another problem in wireless communication is the unavailability of perfect channel state information. This reality creates uncertainty in the channel and so in designing selection algorithms, channel uncertainty awareness needs to be a consideration. Therefore the work in this thesis considers the design of relay user equipment selection algorithms that are not only device centric but that are relay user equipment centric. Furthermore, the designed algorithms are channel uncertainty aware. Firstly, a stable matching based relay user equipment selection algorithm is put forward for underlay device-to-device communication. A channel uncertainty aware approach is proposed to cater to imperfect channel state information at the devices. The algorithm is combined with a rate based mode selection algorithm. Next, to cater to the queue state at the relay user equipment, a cross-layer selection algorithm is proposed for a twoway decode and forward relay set up. The algorithm proposed employs deterministic uncertainty constraint in the interference channel, solving the selection algorithm in a heuristic fashion. Then a cluster head selection algorithm is proposed for device-to-device group communication constrained by channel uncertainty in the interference channel. The formulated rate maximization problem is solved for deterministic and probabilistic constraint scenarios, and the problem extended to a multiple-input single-out scenario for which robust beamforming was designed. Finally, relay utility and social distance based selection algorithms are proposed for full duplex decode and forward device-to-device communication set up. A worst-case approach is proposed for a full channel uncertainty scenario. The results from computer simulations indicate that the proposed algorithms offer spectral efficiency, fairness and energy efficiency gains. The results also showed clearly the deterioration in the performance of networks when perfect channel state information is assumed