Search

In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and sends back the CSI to the transmitter over a resolution-limited error-free feedback channel. With this partial CSI, the transmitter is supposed to select the optimum transmission rate, such that it maximizes the overall goodput of the communication system. This problem has been studied for the asymptotic blocklength regime, however, no solution has so far been presented for finite blocklength. Here, we study this problem in two cases: with and without constraint on reliability. We first formulate the optimization problems and analytically solve them. Iterative algorithms that successfully exploit the system parameters for both cases are presented. It is shown that although the achievable maximum goodput decreases with shorter blocklengths and higher reliability requirements, significant improvement can be achieved even with coarsely quantized feedback schemes. [ABSTRACT FROM AUTHOR]

Owing to the factors such as controllable mobility, ready-to-use technology, low cost, easy implementation, and so on, unmanned aerial vehicle (UAV) possesses tremendous potential to be one of the primary candidates for next-generation (6G) wireless networks. This paper presents a UAV-assisted multiuser communication network where a multiple antenna UAV base station (BS) serves multiple single antenna ground users (GUs). UAV-BS uses a laser source-based charging mechanism to fulfill its power requirement and applies simultaneous wireless information and power transfer (SWIPT) in the downlink in order to provide desired power to energy-constrained GUs. Also, a clustering-based hybrid multiple access technique is used that combines both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) signaling to transmit the information to all GUs, simultaneously. Due to the involved analytical complexity corresponding to the multiple antennas and users, we use a hybrid beamforming method for efficient communication. Next, we analyze the performance of the proposed framework in terms of user outage probabilities, their respective throughput, and average power harvested considering non-linear energy harvesting and derive expressions of these performance metrics. Moreover, we formulate an optimization problem where the throughput of one GU is maximized by optimally choosing the power allocation parameter while ensuring the desired target throughput at other GU in each cluster. We also illustrate how crucial is the optimal selection of the target rates to maximize the network performance. Simulation results are provided to validate the accuracy of derived expressions and to highlight the dominance of hybrid beamforming and hybrid NOMA compared to conventional methods on the performance of the considered network. [ABSTRACT FROM AUTHOR]

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing circuit-theoretic multiport models for radio communication systems, we derive the information-theoretic limits of compact antennas. We first describe an equivalent Chu’s antenna circuit under the physical realizability conditions of its reflection coefficient. Such a design allows us to subsequently compute the achievable rate for a given receive antenna size thereby providing a physical bound on the system performance that we compare to the standard size-unconstrained Shannon capacity. We also determine the effective signal-to-noise ratio (SNR) which strongly depends on the antenna size and experiences an apparent finite-size performance degradation where only a fraction of Shannon capacity can be achieved. We further determine the optimal signaling bandwidth which shows that impedance matching is essential in both narrowband and broadband scenarios. We also examine the achievable rate in presence of interference showing that the size constraint is immaterial in interference-limited scenarios. Finally, our numerical results of the derived achievable rate as function of the antenna size and the SNR reveal new insights for the physically consistent design of radio systems. [ABSTRACT FROM AUTHOR]

Molecular communication often involves coexisting links where certain links may have priority over others. In this work, we consider a system in three-dimensional (3-D) space with two coexisting communication links, each between a point transmitter and a spherical fully-absorbing receiver (FAR), where one link (termed primary) has priority over the second link (termed secondary). The system implements the underlay cognitive-communication strategy for the co-existence of both links, which use the same type of molecules for information transfer. The mutual influence of FARs existing in the same communication medium results in competition for capturing the information-carrying molecules. In this work, first, we derive an approximate hitting probability equation for a diffusion-limited molecular communication system with two spherical FARs of different sizes, considering the effect of molecular degradation. The derived equation is then used for the performance analysis of primary and secondary links in a cognitive molecular communication scenario. We show that the simple transmit control strategy at the secondary transmitter can improve the overall system’s performance. We study the influence of molecular degradation and decision threshold on the system performance. We also show that the parameters of the system need to be carefully set to improve the performance. [ABSTRACT FROM AUTHOR]

It has been a challenging task to derive the complementary cumulative distribution function (CCDF) of aggregate interference as closed-form in Poisson point process (PPP). In this paper, we consider wireless communication networks where transmitters are all distributed according to homogeneous PPP and study the CCDF of the interference. Mainly, we derive generalized bounds on the CCDF of aggregate interference from whole homogeneous PPP based on discretization of interference, which considerably enhance tightness compared to the previous bounds. These bounds can be used to the analysis requiring the distribution for aggregate interference, such as deployment and activation of BSs, massive MIMO, and millimeter wave communication networks. As examples of utilizing the derived bounds, we derive tractable coverage probabilities of uplink non-orthogonal multiple access (NOMA) users and downlink users in cellular networks under line-of-sight(LoS)/non-line-of-signt (NLOS) channels, respectively. In NOMA, we derive the closed-form bounds on coverage probability when successive interference cancellation is adopted for NOMA signal demodulation. Using the proposed bounds, we also obtain the bounds on coverage probability of a cellular system with LoS/NLOS channels. The tightness of bounds in this work is shown via numerical comparison. Moreover, we mathematically prove the convergence of bounds to exact CCDF. [ABSTRACT FROM AUTHOR]

Cloud radio access networks (C-RAN) enable a network platform for beyond the fifth generation of communication networks (B5G), which incorporates the advances in cloud computing technologies to modern radio access networks. Recently, rate splitting multiple access (RSMA), relying on multi-antenna rate splitting (RS) at the transmitter and successive interference cancellation (SIC) at the receivers, has been shown to manage the interference in multi-antenna communication networks efficiently. This paper considers applying RSMA in C-RAN. We address the practical challenge of a transmitter that only knows the statistical channel state information (CSI) of the users. To this end, the paper investigates the problem of stochastic coordinated beamforming (SCB) optimization to maximize the ergodic sum-rate (ESR) in the network. Furthermore, we propose a scalable and robust RS scheme where the number of the common streams to be decoded at each user scales linearly with the number of users, and the common stream selection only depends on the statistical CSI. The setup leads to a challenging stochastic and non-convex optimization problem. A sample average approximation (SAA) and weighted minimum mean square error (WMMSE) based algorithm is adopted to tackle the intractable stochastic non-convex optimization and guarantee convergence to a stationary point asymptotically. The numerical simulations demonstrate the efficiency of the proposed RS strategy and show a gain up to 27% in the achievable ESR compared with state-of-the-art schemes, namely treating interference as noise (TIN) and non-orthogonal multiple access (NOMA) schemes. [ABSTRACT FROM AUTHOR]

Channel modeling is a challenging vital step towards the development of diffusion-based molecular communication networks (DMCNs). Analytical approaches for diffusion channel modeling are limited to simple and specific geometries and boundary conditions. Also, simulation- and experiment-driven methods are very time-consuming and computationally complex. In this paper, the channel model for DMCN employing the fundamental concentration Green’s function (CGF) is characterized. A general homogeneous boundary condition framework is considered that includes any linear reaction systems at the boundaries in the environment. To obtain the CGF for a general DMCN including multiple transmitters, receivers, and other objects with arbitrary geometries and boundary conditions, a semi-analytical method (SAM) is proposed. The CGF linear integral equation (CLIE) is analytically derived. By employing the numerical method of moments, the problem of CGF derivation from CLIE is transformed into an inverse matrix problem. Moreover, a sequential SAM is proposed that converts the inversion problem of a large matrix into multiple smaller matrices reducing the computational complexity. Particle-based simulator confirms the results obtained from the proposed SAM. The convergence and run time for the proposed method are examined. Further, the error probability of a simple diffusion-based molecular communication system is analyzed and examined using the proposed method. [ABSTRACT FROM AUTHOR]

In contrast with the traditional cryptography, physical layer security has attracted the attention of many researchers having aim at reinforcing the security of communication systems. As far as vehicular communication is concerned, it is challenging to maintain secure and reliable communication between the connected vehicles due to the density, mobility, and dynamic network topology. This paper considers a vehicle to infrastructure communication in which a legitimately fixed transmitter equipped with a single antenna transmits a confidential message to a legitimate mobile receiver equipped with multiple antennas in the presence of a passive mobile eavesdropper. In such a single input multiple output wireless system, the receiver performs the maximal ratio combining technique assuming constant vehicle speed. We assume that the antennas are closely spaced and depending upon the imperfect channel state information (CSI), we derive the closed-form expressions for the average outage probability, secrecy outage probability, and average secrecy outage rate over the uniform, exponential, and arbitrary correlated Nakagami- ${m}$ channels for dual antenna branches. In order to gain insight we also perform the high SNR asymptotic analysis of the outage probability and secrecy outage probability. Simulations are conducted to validate the accuracy of our derived analytic expressions. The computation error analysis is carried out to provide the suitability of the correlation type at the legitimate receiver side. Our findings suggest that the performance of the case with exponential channel correlation is better than those for the uniform and arbitrary. Numerical results show the joint effect of vehicle mobility and the antenna correlation on secrecy performance. Moreover, we also observed that the imperfect knowledge of the CSI degrades the security of the confidential messages severely under the effect of mobility. [ABSTRACT FROM AUTHOR]

Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of multi-antenna (Gaussian) BC with perfect CSIT is known and achieved by Dirty Paper Coding (DPC), the capacity and the capacity-achieving strategy of multi-antenna BC with imperfect CSIT remain unknown. Conventional approaches therefore rely on applying communication strategies designed for perfect CSIT to the imperfect CSIT setting. In this work, we break this conventional routine and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on the split of messages into common and private parts and linear precoding at the transmitter, and successive interference cancellation at the receivers, can achieve larger rate region than DPC in multi-antenna BC with partial CSIT. Second, we propose a novel scheme, denoted as Dirty Paper Coded Rate-Splitting (DPCRS), that relies on RS to split the user messages into common and private parts, and DPC to encode the private parts. We show that the rate region of DPCRS in Multiple-Input Single-Output (MISO) BC with partial CSIT is enlarged beyond that of conventional DPC and that of linearly precoded RS. Gaining benefits from the capability of RS to partially decode the interference and partially treat interference as noise, DPCRS is less sensitive to CSIT inaccuracies, networks loads and user deployments compared with DPC and other existing transmission strategies. [ABSTRACT FROM AUTHOR]

In this article, we propose a three-dimensional (3D) multi-input multi-output (MIMO) channel model for air-to-ground (A2G) communications in unmanned aerial vehicles (UAV) environments, where the UAV transmitter and ground receiver are in motion in the air and on the ground, respectively. A novel angular estimation algorithm is proposed to estimate the real-time azimuth angle of departure (AAoD), elevation angle of departure (EAoD), azimuth angle of arrival (AAoA), and elevation angle of arrival (EAoA) based on the non-stationary nature of the channel model. In the model, we investigate the time-varying spatial cross-correlation functions (CCFs) and temporal auto-correlation functions (ACFs) with respect to the different moving directions and velocities of the UAV transmitter and ground receiver. Furthermore, we derive and study the Doppler power spectral densities (PSDs) and power delay profiles (PDPs) of the proposed channel model. Numerical results show that characteristics of the proposed channel model are very close to those of practical measurements, which provide a new and practical approach to evaluate the performance of next generation UAV-MIMO communication systems. [ABSTRACT FROM AUTHOR]

We consider a trainable point-to-point communication system, where both transmitter and receiver are implemented as neural networks (NNs), and demonstrate that training on the bit-wise mutual information (BMI) allows seamless integration with practical bit-metric decoding (BMD) receivers, as well as joint optimization of constellation shaping and labeling. Moreover, we present a fully differentiable neural iterative demapping and decoding (IDD) structure which achieves significant gains on additive white Gaussian noise (AWGN) channels using a standard 802.11n low-density parity-check (LDPC) code. The strength of this approach is that it can be applied to arbitrary channels without any modifications. Going one step further, we show that careful code design can lead to further performance improvements. Lastly, we show the viability of the proposed system through implementation on software-defined radios (SDRs) and training of the end-to-end system on the actual wireless channel. Experimental results reveal that the proposed method enables significant gains compared to conventional techniques. [ABSTRACT FROM AUTHOR]

The design of communication systems capable of processing and exchanging information through molecules and chemical processes is a rapidly growing interdisciplinary field, which holds the promise to revolutionize how we realize computing and communication devices. While molecular communication (MC) theory has had major developments in recent years, more practical aspects in designing components capable of MC functionalities remain less explored. This paper designs chemical reactions-based microfluidic devices to realize binary concentration shift keying (BCSK) modulation and demodulation functionalities. Considering existing MC literature on information transmission via molecular pulse modulation, we propose a microfluidic MC transmitter design, which is capable of generating continuously predefined pulse-shaped molecular concentrations upon rectangular triggering signals to achieve the modulation function. We further design a microfluidic MC receiver capable of demodulating a received signal to a rectangular output signal using a thresholding reaction and an amplifying reaction. Our chemical reactions-based microfluidic molecular communication system is reproducible and its parameters can be optimized. More importantly, it overcomes the slow-speed, unreliability, and non-scalability of biological processes in cells. To reveal design insights, we also derive the theoretical signal responses for our designed microfluidic transmitter and receiver, which further facilitate the transmitter design optimization. Our theoretical results are validated via simulations performed through the COMSOL Multiphysics finite element solver. We demonstrate the predefined nature of the generated pulse and the demodulated rectangular signal together with their dependence on design parameters. [ABSTRACT FROM AUTHOR]

Covert communication conceals the existence of the transmission from a watchful adversary. We consider the fundamental limits for covert communications via packet insertion over packet channels whose packet timings are governed by a renewal process of rate $\lambda $. Authorized transmitter Jack sends packets to authorized receiver Steve, and covert transmitter Alice wishes to transmit packets to covert receiver Bob without being detected by watchful adversaries Willie 1 and Willie 2. Willies cannot authenticate the source of the packets or collaborate. Hence, each Willie looks for statistical anomalies in the packet stream from Jack to Steve to attempt detection of unauthorized packet insertion. First, we consider a special case where the packet timings are governed by a Poisson process and we show that Alice can covertly insert $\mathcal {O}(\sqrt {\lambda T})$ packets for Bob in a time interval of length $T$ ; conversely, if Alice inserts $\omega (\sqrt {\lambda T})$ packets, she will be detected by Willie 1 or Willie 2 with high probability. Then, we extend our results to general renewal channels and show that in a stream of $N$ packets transmitted by Jack, Alice can covertly insert $\mathcal {O}(\sqrt {N})$ packets; if she inserts $\omega (\sqrt {N})$ packets, she will be detected by Willie 1 or Willie 2, with high probability. [ABSTRACT FROM AUTHOR]

A hybrid communication network with a common analog source signal and independent digital data streams at the transmitters of a multiple access network is considered. The receiver has to estimate the analog signal samples with a given fidelity, and decode the digital streams with a low error probability. The main goal of this paper is to characterize the optimal tradeoff between the mean-squared error distortion in source estimation and the data rates available to each user. To this end, we consider a Gaussian multiple access channel (GMAC) setup with additive state, where the state is nothing but a scaled version of the source process itself. The state process is assumed to be non-causally available to all the transmitting nodes. The problem now becomes that of the joint state estimation and message communication in a GMAC with state. We provide a complete characterization of the optimal distortion-rate tradeoff for an $N$ —sender GMAC. Our results show that, similar to the single-user results, it is optimal to amplify the state using uncoded transmissions, whereas the digital streams are superposed using appropriate Gaussian codebooks in conjunction with dirty paper coding (DPC). Since the variance of the additive state is controlled by a scaling factor in our model, we also recover the results for communicating a common source and independent messages over a GMAC without state as a special case. [ABSTRACT FROM AUTHOR]

In this paper, a simple memory limited transmitter for molecular communication is proposed, in which information is encoded in the emission rate of the molecules. Taking advantage of memory, the proposed transmitter reduces the ISI problem by properly adjusting its emission rate, which can be interpreted as water-filling on the expected interference. The error probability of the proposed scheme is derived and the result is compared with the error probability of the optimal transmitter obtained by dynamic programming methods. Furthermore, for the special case of channel with one symbol memory, a tight lower bound on error probability is derived. Numerical results show that the performance of introduced transmitter is near optimal. Simplicity is the key feature of the presented communication system: the transmitter follows a simple rule, the receiver is a simple threshold decoder, and only one type of molecule is used to convey the information. [ABSTRACT FROM AUTHOR]