Related papers: Scheduling Quantum Annealing for Active User Detec…
We propose an architecture for scheduling network operations enabling the end-to-end generation of entanglement according to user demand. The main challenge solved by this architecture is to allow for the integration of a network schedule…
This paper proposes a new communication protocol for a cooperative non-orthogonal multiple access (NOMA) system. In this system, based on users' channel conditions, each two NOMA users are paired to reduce system complexity. In this…
The key idea of power-domain non-orthogonal multiple access (NOMA) is to exploit the superposition coding (SC) combined with successive interference cancellation (SIC) technique (called SC-SIC) while reducing the receivers' complexity as…
Complex networks have now become integral parts of modern information infrastructures. This paper proposes a user-centric method for detecting anomalies in heterogeneous information networks, in which nodes and/or edges might be from…
Ultra-dense networks (UDNs) represent a transformative access architecture for upcoming sixth generation (6G) systems, poised to meet the surging demand for high data rates. Achieving precise synchronization across diverse base stations…
Broader applications of the Internet of Things (IoT) are expected in the forthcoming 6G system, although massive IoT is already a key scenario in 5G, predominantly relying on physical layer solutions inherited from 4G LTE and primarily…
Inspired by group testing algorithms and the coded computation paradigm, we propose and analyze a novel multiple access scheme for detecting active users in large-scale networks. The scheme consists of a simple randomized detection…
Ambient backscatter communication (BackCom) is faced with the challenge that a single BackCom device can occupy multiple orthogonal resource blocks unintentionally. As a result, in order to avoid co-channel interference, a conventional…
This paper investigates the performance of cooperative non-orthogonal multiple access (C-NOMA) in a cellular downlink system. The system model consists of a base station (BS) serving multiple users, where users with good channel quality can…
Agile networks with fast adaptation and reconfiguration capabilities are required for on-demand provisioning of various network services. We propose a new methodical framework for short-time network optimization based on quantum computing…
Network Utility Maximization (NUM) is a mathematical framework that has endowed researchers with powerful methods for designing and analyzing classical communication protocols. NUM has also enabled the development of distributed algorithms…
A feature of the Internet of Things (IoT) is that some users in the system need to be served quickly for small packet transmission. To address this requirement, a new multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA)…
This paper proposes a graph neural network (GNN) enabled power allocation scheme for non-orthogonal multiple access (NOMA) networks. In particular, a downlink scenario with one base station serving multiple users over several subchannels is…
Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this…
We present a comparison study of state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. The problem is to acquire high value images while obeying the attitude…
Quantum annealing is an emerging metaheuristic used for solving combinatorial optimisation problems. However, hardware based physical quantum annealers are primarily limited to a single vendor. As an alternative, we can discretise the…
Simulated annealing (SA) method has had significant recent success in designing distributed control algorithms for wireless networks. These SA based techniques formed the basis of new CSMA algorithms and gave rise to the development of…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
Quantum annealing is a computational approach designed to leverage quantum fluctuations for solving large-scale classical optimization problems. Although incorporating standard transverse field (TF) terms in the annealing process can help…
Most existing studies on joint activity detection and channel estimation for grant-free massive random access (RA) systems assume perfect synchronization among all active users, which is hard to achieve in practice. Therefore, this paper…