相关论文: A Quasi-random Algorithm for Anonymous Rendezvous …

In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they…

It is well known that physical-layer key generation methods enable wireless devices to harvest symmetric keys by accessing the randomness offered by the wireless channels. Although two-user key generation is well understood, group…

In the symmetric rendezvous problem two players follow the same (randomized) strategy to visit one of $n$ locations in each time step $t=0,1,2,\dots$. Their goal is to minimize the expected time until they visit the same location and thus…

This paper is interested in maximizing the total throughput of cloud radio access networks (CRANs) in which multiple radio remote heads (RRHs) are connected to a central computing unit known as the cloud. The transmit frame of each RRH…

We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…

In this paper, we consider a scenario of covert communication aided by multiple friendly interference nodes. The objective is to conceal the legitimate communication link under the surveillance of a warden. The main content is as follows:…

We address the problem of resource allocation (RA) for spectrum underlay in a cognitive radio (CR) communication system with multiple secondary operators sharing resource with an incumbent primary operator. The multiple secondary operator…

With the explosive growth of mobile data, the demand of high-speed railway (HSR) passengers for broadband wireless access services urgently needs the support of ultra-highspeed scenario broadband wireless communication. Millimeterwave…

Multimodal click-through rate (CTR) prediction is a key technique in industrial recommender systems. It leverages heterogeneous modalities such as text, images, and behavioral logs to capture high-order feature interactions between users…

Grant-free random access (RA) techniques are suitable for machine-type communication (MTC) networks but they need to be adaptive to the MTC traffic, which is different from the human-type communication. Conventional RA protocols such as…

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

For overlay cognitive radio networks (CRNs), transform domain communication system (TDCS) has been proposed to support multiuser communications through spectrum bin nulling and frequency domain spreading. In TDCS-based CRNs, each user is…

The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user…

Quantum network enables a variety of quantum information processing tasks, where multi-user quantum communication is one of the important objectives. Quantum cryptographic conferencing serves as an essential solution to establish secure…

This paper considers a spectrum sharing based cognitive radio (CR) communication system, which consists of a secondary user (SU) having multiple transmit antennas and a single receive antenna and a primary user (PU) having a single receive…

In the problem called single resource constraint scheduling, we are given $m$ identical machines and a set of jobs, each needing one machine to be processed as well as a share of a limited renewable resource $R$. A schedule of these jobs is…

Approximate nearest neighbor (ANN) search in high-dimensional spaces is a foundational component of many modern retrieval and recommendation systems. Currently, almost all algorithms follow an $\epsilon$-Recall-Bounded principle when…

Rapidly-exploring Random Tree (RRT) algorithms have been applied successfully to challenging robot motion planning and under-actuated nonlinear control problems. However a fundamental limitation of the RRT approach is the slow convergence…

Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless…

In this correspondence, the comprehensive problem of joint power, rate, and subcarrier allocation have been investigated for enhancing the spectral efficiency of multi-user orthogonal frequency-division multiple access (OFDMA) cognitive…