Online Relay Switching in the Presence of Dynamic Obstacles in Millimeter Wave D2D Communication.

Date of Submission

December 2020

Date of Award

Winter 12-12-2021

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Ghosh, Sasthi Charan (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

With the ever-increasing number of diverse user-equipments (UEs) and their requirement of high data rate several modifications have been done on previous wireless technologies leading to the evolution of 5G device to device (D2D) communication. The use of millimeter wave (mmWave) channels is gaining popularity for short-range D2D communication due to its high available bandwidth. But due to the excessive penetration loss suffered by mmWave, it is necessary to facilitate D2D communication along the line of sight (LOS) path. In the D2D communication, UEs also acts as relays to forward the data packet transmitted by the source to receiver. In the presence of dynamic Obstacles as well as due to the motion of UEs, blockage of LOS is highly probable which makes relay selection quite challenging. We are proposing the unique strategies based on the geometric approach to nd the priority of the relays for a given D2D pair. In case of blockage of LOS by dynamic or static obstacles, the respective D2D pair might switch to the other high priority relay. We are modeling the entire problem as a game-theoretic auction framework with the goal of increasing the overall throughput of the system as well as prevention of starvation of any D2D pair. We perform centralized relay selection using the global information but found that this might not be sufficient to reduce packet loss adequately. Motivated by this, we develop an online relay switching (ORS) algorithm, where we perform pre-emptive distributed switching using the local information of the UEs to reduce any further packet loss due to the blockages. Through simulation we show that in the presence of large number of dynamic obstacles, ORS not only gives a significant improvement in the average throughput and packet loss but also the lower starvation of D2D pairs than the traditional approaches which does not take into account the pre-emptive switching of the relays in case of blockage.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.