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

Socially aware integrated centralized infrastructure and opportunistic networking: a powerful content dissemination catalyst

The classic centralized infrastructure (CI) exhibits low efficiency in disseminating the content of common interest across its requesters. In order to overcome the limitations of CI-based content dissemination, smart mobile devices are capable of activating direct opportunistic communications among mobile users, which returns in integrated cellular and opportunistic networks. During the content dissemination process, the social characteristics of multiple users, including their common interest in the content, their mobility patterns, their social ties, and their altruistic forwarding behaviors, should be carefully considered in order to design an efficient content dissemination scheme. We demonstrate that the integrated network-based content dissemination scheme outperforms its CI-based counterpart in terms of both content delivery ratio and its various energy and delay metrics. Furthermore, the opportunistic network is capable of offloading a large fraction of tele-traffic from the overloaded CI-based network

Recent Advances in Cellular D2D Communications

Device-to-device (D2D) communications have attracted a great deal of attention from researchers in recent years. It is a promising technique for offloading local traffic from cellular base stations by allowing local devices, in physical proximity, to communicate directly with each other. Furthermore, through relaying, D2D is also a promising approach to enhancing service coverage at cell edges or in black spots. However, there are many challenges to realizing the full benefits of D2D. For one, minimizing the interference between legacy cellular and D2D users operating in underlay mode is still an active research issue. With the 5th generation (5G) communication systems expected to be the main data carrier for the Internet-of-Things (IoT) paradigm, the potential role of D2D and its scalability to support massive IoT devices and their machine-centric (as opposed to human-centric) communications need to be investigated. New challenges have also arisen from new enabling technologies for D2D communications, such as non-orthogonal multiple access (NOMA) and blockchain technologies, which call for new solutions to be proposed. This edited book presents a collection of ten chapters, including one review and nine original research works on addressing many of the aforementioned challenges and beyond

Framework for Content Distribution over Wireless LANs

Wireless LAN (also called as Wi-Fi) is dominantly considered as the most pervasive technology for Intent access. Due to the low-cost of chipsets and support for high data rates, Wi-Fi has become a universal solution for ever-increasing application space which includes, video streaming, content delivery, emergency communication, vehicular communication and Internet-of-Things (IoT). Wireless LAN technology is defined by the IEEE 802.11 standard. The 802.11 standard has been amended several times over the last two decades, to incorporate the requirement of future applications. The 802.11 based Wi-Fi networks are infrastructure networks in which devices communicate through an access point. However, in 2010, Wi-Fi Alliance has released a specification to standardize direct communication in Wi-Fi networks. The technology is called Wi-Fi Direct. Wi-Fi Direct after 9 years of its release is still used for very basic services (connectivity, file transfer etc.), despite the potential to support a wide range of applications. The reason behind the limited inception of Wi-Fi Direct is some inherent shortcomings that limit its performance in dense networks. These include the issues related to topology design, such as non-optimal group formation, Group Owner selection problem, clustering in dense networks and coping with device mobility in dynamic networks. Furthermore, Wi-Fi networks also face challenges to meet the growing number of Wi Fi users. The next generation of Wi-Fi networks is characterized as ultra-dense networks where the topology changes frequently which directly affects the network performance. The dynamic nature of such networks challenges the operators to design and make optimum planifications. In this dissertation, we propose solutions to the aforementioned problems. We contributed to the existing Wi-Fi Direct technology by enhancing the group formation process. The proposed group formation scheme is backwards-compatible and incorporates role selection based on the device's capabilities to improve network performance. Optimum clustering scheme using mixed integer programming is proposed to design efficient topologies in fixed dense networks, which improves network throughput and reduces packet loss ratio. A novel architecture using Unmanned Aeriel Vehicles (UAVs) in Wi-Fi Direct networks is proposed for dynamic networks. In ultra-dense, highly dynamic topologies, we propose cognitive networks using machine-learning algorithms to predict the network changes ahead of time and self-configuring the network

Queue stability analysis in network coded wireless multicast.

In this dissertation queue stability in wireless multicast networks with packet erasure channels is studied. Our focus is on optimizing packet scheduling so as to maximize throughput. Specifically, new queuing strategies consisting of several sub-queues are introduced, where all newly arrived packets are first stored in the main sub-queue on a first-come-first-served basis. Using the receiver feedback, the transmitter combines packets from different sub-queues for transmission. Our objective is to maximize the input rate under the queue stability constraints. Two packet scheduling and encoding algorithms have been developed. First, the optimization problem is formulated as a linear programming (LP) problem, according to which a network coding based optimal packet scheduling scheme is obtained. Second, the Lyapunov optimization model is adopted and decision variables are defined to derive a network coding based packet scheduling algorithm, which has significantly less complexity and smaller queue backlog compared with the LP solution. Further, an extension of the proposed algorithm is derived to meet the requirements of time-critical data transmission, where each packet expires after a predefined deadline and then dropped from the system. To minimize the average transmission power, we further derive a scheduling policy that simultaneously minimizes both power and queue size, where the transmitter may choose to be idle to save energy consumption. Moreover, a redundancy in the schedules is inadvertently revealed by the algorithm. By detecting and removing the redundancy we further reduce the system complexity. Finally, the simulation results verify the effectiveness of our proposed algorithms over existing works