We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption.
We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting in arbitrary wireless networks when the channel state information is not available at the transmitters. Upper bounds are obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes. The gap between the upper and lower bounds is only a constant factor for dense random networks and regular networks, and differs by a poly-logarithmic factor for extended random networks. Furthermore, we show that the proposed upper and lower bounds for random networks hold almost surely in the node locations as the number of nodes approaches infinity.
In this era of 5G technology, the ever-increasing demands for high data rates lead researchers to develop hybrid satellite-terrestrial (HST) networks as a substitution to the conventional cellular terrestrial systems. Since an HST network suffers from a masking effect which can be mitigated by adopting the terrestrial relaying strategy, in this work, we focus on wireless multicasting through an HST relaying net-work (HSTRN) in which a satellite sends messages to multiple terrestrial nodes via multiple relays under the wiretapping efforts of multiple eavesdroppers. Our concern is to protect the…
This letter studies an unmanned aerial vehicle (UAV) aided multicasting (MC) system, which is enabled by simultaneous free space optics (FSO) backhaul and power transfer. The UAV applies the power-splitting technique to harvest wireless power and decode backhaul information simultaneously over the FSO link, while at the same time using the harvested power to multicast the backhauled information over the radio frequency (RF) links to multiple ground users (GUs). We derive the UAV's achievable MC rate under the Poisson point process (PPP) based GU distribution. By jointly designing the FSO and R…
Communicate Less, Synthesize the Rest: Latency-aware Intent-based Generative Semantic Multicasting with Diffusion Models
GIC & 6GIC, Institute for Communication Systems (ICS), University of Surrey（5GIC与6GIC，通信系统研究所（ICS），萨里大学）；School of Information and Electronics, Beijing Institute of Technology（信息电子学院，北京理工大学）；Centre for Wireless Communications, University of Oulu（无线通信中心，奥卢大学）
In this letter, we design passive beamforming in an intelligent reflecting surface (IRS) assisted multiple-user wireless network. Two different scenarios are considered, namely, multicasting and multi-user downlink transmission. We optimize the passive beamforming vector of the IRS to maximize the smallest signal-to-noise ratio of the users in both scenarios. Based on the alternating direction method of multipliers algorithm, a low complexity method is designed to iteratively solve the established problem. In each iteration of the proposed method, the solution is in closed form, and thus the c…
Immersive viewing is emerging as the next interface evolution for human-computer interaction. A truly wireless immersive application necessitates immense data delivery with ultra-low latency, raising stringent requirements for next-generation wireless networks. A potential solution for addressing these requirements is through the efficient usage of in-device storage and computation capabilities. This paper proposes a novel location-based coded cache placement and delivery scheme, which leverages the nested code modulation (NCM) to enable multi-rate multicasting transmission. To provide a unifo…
This work studies multigroup multicasting transmission in cloud radio access networks (C-RANs) with simultaneous wireless information and power transfer, where densely packed remote radio heads (RRHs) cooperatively provide information and energy services for information users (IUs) and energy users (EUs), respectively. To maximize the weighted sum rate (WSR) of information services while satisfying the energy harvesting levels at EUs, an optimization of joint beamforming design for the fronthaul and access links is formulated, which is however neither smooth nor convex and is indeed NP-hard. T…
Bit-interleaved coded modulation (BICM) has attracted considerable attention from the research community in the past three decades, because it can achieve desirable error performance with relatively low implementation complexity for a large number of communication and storage systems. By exploiting the iterative demapping and decoding (ID), the BICM is able to approach capacity limits of coded modulation over various channels. In recent years, protograph low-density parity-check (PLDPC) codes and their spatially-coupled (SC) variants have emerged to be a pragmatic forward-error-correction (FEC…
This article investigates the exploitation of semantic communications in multi-user networks. We propose a novel heterogeneous semantic and bit multi-user framework for providing flawless, customized, and intelligent information transmission. We discuss both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) for the proposed heterogeneous framework, with an emphasis on investigating the attractive interplay between semantic communications and NOMA, namely NOMA enabled semantic communications and semantic communications enhanced NOMA. 1) For NOMA enabled semantic communi…
Providing connectivity to a massive number of devices is a key challenge in 5G wireless systems. In particular, it is crucial to develop efficient methods for active device identification and message decoding in a multi-cell network with fading, path loss, and delay uncertainties. This paper presents such a scheme using second-order Reed-Muller (RM) sequences and orthogonal frequency-division multiplexing (OFDM). For given positive integer $m$, a codebook is generated with up to $2^{m(m+3)/2}$ codewords of length $2^m$, where each codeword is a unique RM sequence determined by a matrix-vector …
