Toward End-to-End, Full-Stack 6G Terahertz Networks

Recent evolutions in semiconductors have brought the terahertz band in the spotlight as an enabler for terabit-per-second communications in 6G networks. Most of the research so far, however, has focused on understanding the physics of terahertz devices, circuitry and propagation, and on studying physical layer solutions. However, integrating this technology in complex mobile networks requires a proper design of the full communication stack, to address link- and system-level challenges related to network setup, management, coordination, energy efficiency, and end-to-end connectivity. This paper provides an overview of the issues that need to be overcome to introduce the terahertz spectrum in mobile networks, from a MAC, network and transport layer perspective, with considerations on the performance of end-to-end data flows on terahertz connections.Comment: Published on IEEE Communications Magazine, THz Communications: A Catalyst for the Wireless Future, 7 pages, 6 figure

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of some integer programs reveals equivalence with graph theory problems making a large body of the literature readily available for solving and characterizing the complexity of these problems. This tutorial presents a framework for utilizing a particular graph theory problem, known as the clique problem, for solving communications and signal processing problems. In particular, the paper aims to illustrate the structural properties of integer programs that can be formulated as clique problems through multiple examples in communications and signal processing. To that end, the first part of the tutorial provides various optimal and heuristic solutions for the maximum clique, maximum weight clique, and $k$-clique problems. The tutorial, further, illustrates the use of the clique formulation through numerous contemporary examples in communications and signal processing, mainly in maximum access for non-orthogonal multiple access networks, throughput maximization using index and instantly decodable network coding, collision-free radio frequency identification networks, and resource allocation in cloud-radio access networks. Finally, the tutorial sheds light on the recent advances of such applications, and provides technical insights on ways of dealing with mixed discrete-continuous optimization problems