Related papers: Alternating Maximization Algorithm for Mismatch Ca…
We propose novel resource allocation algorithms that have the objective of finding a good tradeoff between resource reuse and interference avoidance in wireless networks. To this end, we first study properties of functions that relate the…
In this paper, a novel transmissive reconfigurable intelligent surface (RIS) enabled uplink communication system with orthogonal frequency division multiple access (OFDMA) is investigated. Specifically, a non-conventional receiver…
This work proposes a new resource allocation optimization and network management framework for wireless networks using neighborhood-based optimization rather than fully centralized or fully decentralized methods. We propose hierarchical…
This paper presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably…
Small cell enchantment is emerging as the key technique for wireless network evolution. One challenging problem for small cell enhancement is how to achieve high data rate with as-low-as-possible control and computation overheads. As a…
We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…
In slow fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the…
We consider the computation of the entanglement-assisted quantum rate-distortion function, which plays a central role in quantum information theory. We propose an efficient alternating minimization algorithm based on the Lagrangian…
This paper focuses on designing edge-weighted networks, whose robustness is characterized by maximizing algebraic connectivity, or the second smallest eigenvalue of the Laplacian matrix. This problem is motivated by cooperative vehicle…
In heterogeneous dense networks where spectrum is shared, users privacy remains one of the major challenges. On a multi-antenna relay-assisted multi-carrier interference channel, each user shares the frequency and spatial resources with all…
Interference alignment is a signaling technique that provides high multiplexing gain in the interference channel. It can be extended to multi-hop interference channels, where relays aid transmission between sources and destinations. In…
A limited feedback based dynamic resource allocation algorithm is proposed for a relay cooperative network with Orthogonal Frequency Division Multiplexing (OFDM) modulation. A communication model where one source node communicates with one…
We focus on robust, survivable communication networks, where network links and nodes are affected by an uncertainty set. In this sense, any network links might fail. Besides, a signal can only travel a maximum distance before its quality…
The autoencoder concept has fostered the reinterpretation and the design of modern communication systems. It consists of an encoder, a channel, and a decoder block which modify their internal neural structure in an end-to-end learning…
This paper presents a distributed, optimal, communication-aware trajectory planning algorithm for multi-robot systems. Building on prior work, it addresses the multi-robot communication-aware trajectory planning problem using a general…
We consider convex optimization problems with prioritized equality constraints, which may be infeasible. In many applications, such as network optimization and image reconstruction, it is often desirable to compute solutions that satisfy…
This paper deals with the problem of jointly designing the source precoder, the relaying matrices, and the destination equalizer in a multiple-relay amplify-and-forward (AF) cooperative multiple-input multiple-output (MIMO) wireless…
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…
Mobile relaying is emerged as a promising technique to assist wireless communication, driven by the rapid development of unmanned aerial vehicles (UAVs). In this paper, we study secure transmission in a four-node (source, destination,…
Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of…