相关论文: A Quinary Coding and Matrix Structure-based Channe…

Downlink scheduling schemes are well-known and widely investigated under the assumption that the channel state is perfectly known to the scheduler. In the multiuser MIMO (broadcast) case, downlink scheduling in the presence of non-perfect…

Full-duplex (FD) wireless is an attractive communication paradigm with high potential for improving network capacity and reducing delay in wireless networks. Despite significant progress on the physical layer development, the challenges…

Compute-forward multiple access (CFMA) is a transmission strategy which allows the receiver in a multiple access channel (MAC) to first decode linear combinations of the transmitted signals and then solve for individual messages. Compared…

This paper studies the resource allocation algorithm design for multiuser coordinated multipoint (CoMP) networks with simultaneous wireless information and power transfer (SWIPT). In particular, remote radio heads (RRHs) are connected to a…

Cognitive radio networks (CRNs) propose a smart solution for spectrum usage inefficiency. Routing protocols for CRNs follow different criteria to choose the best route to the destination and to avoid the interference with primary users.…

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…

Pansharpening aims to enhance remote sensing image (RSI) quality by merging high-resolution panchromatic (PAN) with multispectral (MS) images. However, prior techniques struggled to optimally fuse PAN and MS images for enhanced spatial and…

In order to understand the key merits of multiuser diversity techniques in relay-assisted cellular multihop networks, this paper analyzes the spectral efficiency of opportunistic (i.e., channel-aware) scheduling algorithms over a fading…

In this paper we design network coding schemes for Differential Chaos Shift Keying (DCSK) modulation. In this work, non-coherent chaos-based communication system is used due to its simplicity and robustness to multipath propagation effects,…

Channel aggregation (CA) is one of the newest concept which cognitive radio network is bringing to bear for the smooth role out of fifth/next generation wireless networks. This is the combining of several unused primary user spectrum holes…

Motivated by improved detection and prediction of temporal holes, we propose a two stage algorithm to classify the channel access method used by a primary network. The first stage extends an existing fourth-order cumulant-based modulation…

We study a number of two-user interference networks with multiple-antenna transmitters/receivers, transmitter side information in the form of linear combinations (over finite-field) of the information messages, and two-hop relaying. We…

This work develops a rate-distortion-based approach to stochastic Chase decoding of algebraic codes over binary memoryless symmetric (BMS) channels, replacing the heuristics traditionally used to determine flip probabilities with…

In this research, we proposes a new method for cooperation and underlay mode selection in cognitive radio networks. We characterize the maximum achievable throughput of our proposed method of hybrid spectrum sharing. Hybrid spectrum sharing…

Collision-free Frequency Hopping Sequences (FHS) are crucial for maintaining the throughput of Frequency Hopping Multiple Access (FHMA) communication systems. When multiple FHS deployed in the same geographical area hop into the same…

Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a…

We consider the distributed channel access problem for a system consisting of multiple control subsystems that close their loop over a shared wireless network. We propose a distributed method for providing deterministic channel access…

Channel coding alone is not sufficient to reliably transmit a message of finite length $K$ from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure…

In a densely deployed distributed wireless network, there may be various types of traffic with differentiated Quality of Service (QoS) requirements. However, when the network is heavily loaded, the collision increases significantly, making…

We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by…