The channel estimation (CE) overhead for unstructured multipath-rich channels increases linearly with the number of reflective elements of reconfigurable intelligent surface (RIS). This results in a significant portio...
详细信息
To cope with high bandwidth demands of modern applications, device-to-device (D2D) communications using millimeter-wave (mmWave) signals are being harnessed. The major challenge of mmWave signals is that they require ...
To cope with high bandwidth demands of modern applications, device-to-device (D2D) communications using millimeter-wave (mmWave) signals are being harnessed. The major challenge of mmWave signals is that they require a strict, obstacle-free line-of-sight communication. Static obstacles are easier to avoid; dynamic obstacles pose the main hurdle, their movement not being known. In this work, we propose a way to learn link blockages due to dynamic obstacles, using the link activation history. For this, one might have to explore non-optimal link activations. This ensures that all links are tried a sufficient number of times, ensuring adequate knowledge about link failures, thus creating an exploration-exploitation dilemma. To this end, we propose a systematic way of exploring such non-optimal channel allocations, so that the number of link failures is minimized. Given the hardness of this problem, we devise a greedy solution, and show its effectiveness over existing strategies through simulations.
Millimeter-wave (mmWave) technology is expected to be the backbone of future communication networks. However, for all its benefits, mmWave communication comes with its fair share of challenges. In this context, the ob...
Millimeter-wave (mmWave) technology is expected to be the backbone of future communication networks. However, for all its benefits, mmWave communication comes with its fair share of challenges. In this context, the obstacle free strict line-of-sight (LOS) requirement is one of the primary hurdles that has to be crossed. One way to deal with this problem is to densely deploy small range base stations, called gNBs, to overcome outage due to obstacles. Reflectors have been proposed to augment the transmission environment, and reflect mmWaves bypassing the obstacles. Evidently, they can be used to increase the coverage area that do not have LOS with the available gNBs. We argue that considering the placement of gNBs and reflectors independently may lead to suboptimal solution. In this paper, we consider an urban deployment scenario, and attempt to maximally cover it by jointly placing the gNBs and reflectors. Given the hardness of the joint problem, we first develop a set cover based greedy solution and also provide a linear programming (LP) relaxation based solution. With extensive simulations, we show that with fixed number of available gNBs and reflectors to be placed, both our joint placement solutions can achieve a larger coverage compared to an existing approach.
The millimeter-wave (mmWave) device-to-device (D2D) communication is already being employed to satisfy the high datarate demand of the internet-of-things nodes. Using mmWave signals has its own challenges as it suffer...
The millimeter-wave (mmWave) device-to-device (D2D) communication is already being employed to satisfy the high datarate demand of the internet-of-things nodes. Using mmWave signals has its own challenges as it suffers from high penetration losses. Therefore, presence of dynamic obstacles further complicates the already hard problem of allocation of channel resources to the demanding nodes. In this work, we have proposed a reinforcement learning (RL) based framework to jointly allocate the frequency channels as well as assign the transmit-powers to the demanding D2D pairs in order to maximize the energy-efficiency in presence of dynamic obstacles. We justify our choice of reward function through a formal proof and also ensure the convergence of the algorithm. Through extensive simulations, we show that our proposed RL framework not only converges, but also outperforms an existing approach.
The rapid growth of multimedia applications requiring high bandwidth has paved the way for millimeter-wave (mmWave) device-to-device (D2D) communications. In many modern applications, such as video streaming, same dat...
详细信息
Unmanned Aerial Vehicles (UAVs) are a potential platform for deploying millimeter wave (mmWave) base stations. Their high spatial flexibility makes them an attractive choice for the deployment in disaster management s...
Unmanned Aerial Vehicles (UAVs) are a potential platform for deploying millimeter wave (mmWave) base stations. Their high spatial flexibility makes them an attractive choice for the deployment in disaster management scenarios, and for offloading in crowded areas. Apart from the stringent propagation requirements of mmWaves, one challenge that has to be addressed is the limited power onboard a UAV, which is used to hover and move the device, and of course, to transmit data. In this paper, we deal with the deployment of UAVs with an aim to minimising their displacement in subsequent time. We take into consideration user mobility, and propose LazyUAV, a Set-Cover based geometric approach to minimise UAV displacement, while maintaining maximal coverage. Via extensive simulations, we demonstrate the effectiveness of our approach.
Quantum Approximate Optimization Algorithm (QAOA) is a prospective candidate for providing quantum advantage in finding approximate solutions to optimization problems using near-term quantum devices. In this paper, th...
Quantum Approximate Optimization Algorithm (QAOA) is a prospective candidate for providing quantum advantage in finding approximate solutions to optimization problems using near-term quantum devices. In this paper, the goal is to reduce the number of CNOT gates and the depth of quantum ansatz circuits for QAOA. First, we present a generalized QAOA formulation for any Hamiltonian that involves upto two-body interactions, as a graph. The circuit realization of the depth-p QAOA requires $2mp$ CNOT gates where the graph for the Hamiltonian has n vertices and m edges. Presently, a CNOT gate is one of the primary sources of error. We propose a graph-theoretic algorithm which can eliminate $n-1$ CNOTs from the QAOA ansatz while retaining functional equivalence with the original circuit. This improves upon previously proposed Depth First Search (DFS) method by restricting the increase in depth of the circuit, which was a drawback of the method, by $\simeq 84.8\%$ for Erdős-Renyi graphs. Finally, if the underlying connectivity (hardware coupling map) and the initial qubit placement for a hardware are known, then we present how to extend the greedy heuristic method in order to obtain a functionally equivalent circuit with $\simeq 5\%$; fewer SWAP gates for Erdős-Renyi graphs.
Reconfigurable intelligent surfaces (RISs) is a promising solution for enhancing the performance of multihop wireless communication networks. In this paper, we propose a double-RIS assisted multihop routing scheme for...
详细信息
This paper investigates the problem of transmit waveform design in the context of a chaotic signal-based self-sustainable reconfigurable intelligent surface (RIS)-aided system for simultaneous wireless information and...
详细信息
In recent times, Multi-Access Edge computing (MEC) has emerged as a new paradigm allowing low-latency access to services deployed on edge nodes offering computation, storage and communication facilities. Vendors deplo...
详细信息
暂无评论