Search

In this paper, we investigate the performance of an intelligent omni-surface (IOS) assisted downlink non-orthogonal multiple access (NOMA) network with phase quantization errors and channel estimation errors, where the channels related to the IOS are spatially correlated. First, upper bounds on the average achievable rates of the two users are derived. Then, channel hardening is shown to occur in the proposed system, based on which we derive approximations of the average achievable rates of the two users. The analytical results illustrate that the proposed upper bound and approximation on the average achievable rates are asymptotically equivalent in the number of elements. Furthermore, it is proved that the asymptotic equivalence also holds for the average achievable rates with correlated and uncorrelated channels. Additionally, we extend the analysis by evaluating the average achievable rates for IOS assisted orthogonal multiple access (OMA) and IOS assisted multi-user NOMA scenarios. Simulation results corroborate the theoretical analysis and demonstrate that: i) low-precision elements with only two-bit phase adjustment can achieve the performance close to the ideal continuous phase shifting scheme; ii) The average achievable rates with correlated channels and uncorrelated channels are asymptotically equivalent in the number of elements; iii) IOS-assisted NOMA does not always perform better than OMA due to the reconfigurability of IOS in different time slots. [ABSTRACT FROM AUTHOR]

This letter investigates electrophoretic molecular communication (EMC) operating in circular duct channels. EMC utilizes the time-varying electrophoretic force that can controllably induce the movement of charged particles to enhance communication performance. In circular duct channels, where the memory component is high, intersymbol interference (ISI) must be considered. Thus, this letter presents a method to design an electric field under the framework of the calculus of variations, simultaneously reducing the ISI and strengthening the information signal reception. The numerical results show that the proposed electric field can significantly reduce the bit error rate compared to the constant field benchmark. [ABSTRACT FROM AUTHOR]

The relationship between the age of information (AoI) and the mean squared error (MSE) in optimisation problems has been widely investigated for various Gaussian Markov models. Recently, we put the AoI in an information-theoretic context and proposed a mutual information-based value of information (VoI) framework to characterise how valuable the status updates are. In this letter we consider general noisy Gaussian models and investigate the connection between the VoI and MSE. We show that the VoI can be presented by a logarithmic function of the MSE. We also study the rate of change of the two with respect to the signal-to-noise ratio (SNR) and the AoI. The results hold for both discrete-time and continuous-time stationary Gaussian processes. This letter illuminates a useful relationship between information theory and signal processing theory in the presence of the AoI and additive noise, and provides a possible way to infer the information value by estimating the MSE for practical applications. [ABSTRACT FROM AUTHOR]

In this paper, a general framework is formalised to characterise the value of information (VoI) in hidden Markov models. Specifically, the VoI is defined as the mutual information between the current, unobserved status at the source and a sequence of observed measurements at the receiver, which can be interpreted as the reduction in the uncertainty of the current status given that we have noisy past observations of a hidden Markov process. We explore the VoI in the context of the noisy Ornstein-Uhlenbeck process and derive its closed-form expressions. Moreover, we investigate the effect of different sampling policies on VoI, deriving simplified expressions in different noise regimes and analysing statistical properties of the VoI in the worst case. We also study the optimal sampling policy to maximise the average information value under the sampling rate constraint. In simulations, the validity of theoretical results is verified, and the performance of VoI in Markov and hidden Markov models is also analysed. Numerical results further illustrate that the proposed VoI framework can support timely transmission in status update systems, and it can also capture the correlation properties of the underlying random process and the noise in the transmission environment. [ABSTRACT FROM AUTHOR]

We develop a family of tractable models for UAV mobility. Based on a system of coupled stochastic differential equations, the resulting models exhibit realistic trajectories and flexible covariance structures, making them suitable for both small scale and large scale applications. Closed form solutions for steady state and transient position distributions, as well as position covariance, are derived. These results are subsequently used to obtain distance outage probabilities and pathloss. The analytical results allow us to assess the impact of a variety of system parameters related to device control, navigation and position measurement errors. Finally, using measured UAV flight data, we show an excellent goodness of fit between the proposed model and the data. [ABSTRACT FROM AUTHOR]

In this paper, we propose two novel modulation concepts based on a simple maximum distance separable (MDS) code and show that these concepts can achieve better error performance than index modulation (IM) and related schemes. In the first concept, we use amplitude and phase levels to form a simple MDS code, whereas, in the second one, in-phase and quadrature components of codeword elements are used to construct the MDS code. We depict practical schemes for using the proposed concepts with orthogonal frequency division multiplexing (OFDM). We analyze the performance in terms of the minimum Euclidean distance and bit error rate. We also show that the proposed techniques exhibit desirable properties such as efficient low-complexity detection, very simple bits-to-symbols, and symbols-to-bits mappings, and a better error performance when compared to the OFDM-IM and related schemes. More importantly, contrary to the vast majority of IM studies that focus on showing the superiority of the IM techniques against conventional modulation techniques, we show that modulation concepts based on a well-known MDS code can achieve better error performance than the IM and related schemes while exhibiting a structure as simple as these schemes. [ABSTRACT FROM AUTHOR]

In this paper, we derive closed-form expressions for significant statistical properties of the link signal-to-noise ratio (SNR) and the separation distance in mobile ad hoc networks subject to Ornstein-Uhlenbeck (OU) mobility and Rayleigh fading. In these systems, the SNR is a critical parameter as it directly influences link performance. In the absence of signal fading, the distribution of the link SNR depends exclusively on the squared distance between nodes, which is governed by the mobility model. In our analysis, nodes move randomly according to an Ornstein-Uhlenbeck process, using one tuning parameter to control the temporal dependency in the mobility pattern. We derive a complete statistical description of the squared distance and show that it forms a stationary Markov process. Then, we compute closed-form expressions for the probability density function (pdf), the cumulative distribution function (cdf), the bivariate pdf, and the bivariate cdf of the link SNR. Next, we introduce small-scale fading, modeled by a Rayleigh random variable, and evaluate the pdf of the link SNR for rational path loss exponents. The validity of our theoretical analysis is verified by extensive simulation studies. The results presented in this work can be used to quantify link uncertainty and evaluate stability in mobile ad hoc wireless systems. [ABSTRACT FROM AUTHOR]

This article proposes zero-forcing (ZF) beamforming strategies that can simultaneously deal with active and passive eavesdroppers in visible light communication (VLC) systems. First, we propose a ZF beamforming scheme that steers a transmission beam to the null space of active eavesdroppers’ (AEDs) channel, while simultaneously considering the SNRs for a legitimate user (UE) and passive eavesdroppers (PEDs) residing at unknown locations. To find an eigenmode related to the optimal beamforming vector, we adopt an inverse free preconditioned Krylov subspace projection method. For unfavorable VLC secrecy environments, the proposed ZF beamformer appears to be incapable of effectively coping with the PEDs due to the strict condition that the data transmission must be in the null space of the AEDs’ channel matrix. Hence, an alternative beamforming scheme is proposed by relaxing the constraint on the SNRs of the AEDs. The related optimization problem is formulated to reduce the secrecy outages caused by PEDs, while simultaneously satisfying the target constraints on the SNRs of the UE and the AEDs. To simplify the mathematical complexity of the approach, Lloyd’s algorithm is employed to sample the SNR field, which in turn discretizes the problem, thus making it tractable for practical implementation. The numerical results show that both the exact and relaxed ZF beamforming methods achieve superior performance in the sense of secrecy outage relative to a benchmark ZF scheme. Moreover, the proposed relaxed ZF beamforming method is shown to cope with PEDs better than the exact ZF beamforming approach for unfavorable VLC environments. [ABSTRACT FROM AUTHOR]

In this letter, we propose a novel modulation concept which we call index and composition modulation (ICM). In the proposed concept, we use indices of active/deactive codeword elements and compositions of an integer to encode information. In this regard, we first determine the activated codeword elements, then we exploit energy levels of these elements to identify the compositions. We depict a practical scheme for using ICM with orthogonal frequency division multiplexing (OFDM) and show that OFDM with ICM (OFDM-ICM) can enhance the spectral efficiency (SE) and error performance of OFDM-IM. We design an efficient low-complexity detector for the proposed technique. Moreover, we analyze the error and SE performance of the OFDM-ICM technique and show that it is capable of outperforming existing OFDM benchmarks in terms of error and SE performance. [ABSTRACT FROM AUTHOR]

In this paper, a novel modulation scheme called set partition modulation (SPM) is proposed. In this scheme, set partitioning and ordered subsets in the set partitions are used to form codewords. We define different SPM variants and depict a practical model for using SPM with orthogonal frequency division multiplexing (OFDM). For the OFDM-SPM schemes, different constellations are used to distinguish between different subsets in a set partition. To achieve good distance properties as well as better error performance for the OFDM-SPM codewords, we define a codebook selection problem and formulate such a problem as a clique problem in graph theory. In this regard, we propose a fast and efficient codebook selection algorithm. We analyze error and achievable rate performance of the proposed schemes and provide asymptotic results for the performance. It is shown that the proposed SPM variants are general schemes, which encompass multi-mode OFDM with index modulation (MM-OFDM-IM) and dual-mode OFDM with index modulation (DM-OFDM-IM) as special cases. It is also shown that OFDM-SPM schemes are capable of exhibiting better error performance and improved achievable rate than conventional OFDM, OFDM-IM, DM-OFDM-IM, and MM-OFDM-IM. [ABSTRACT FROM AUTHOR]

Multi-hop route optimization in large-scale inhomogeneous networks is typically NP-hard, for most problem formulations, requiring the application of heuristics which, despite their relatively low processing complexity, find sub-optimal solutions. Where optimal solutions can be determined by Lagrangian based constrained optimization techniques for example, the processing complexity typically scales like $O(N^{3})$ , $N$ being the number of relays employed. Here, we propose an alternative approach to route optimization by considering the limit of infinite relay node density to develop a continuum model, which yields an optimized equivalent continuous relay path. The model is carefully constructed to maintain a constant connection density even though the node density scales without bound. This leads to a formulation for minimizing the end-to-end outage probability that can be solved using methods from the calculus of variations. With the continuum model, we show that the processing complexity scales linearly with the number of points that sample the continuous path, which can be lower than the number of relay nodes in a large scale network. We demonstrate the effectiveness of this new approach and its potential by considering a network subjected to point sources of interference. [ABSTRACT FROM AUTHOR]

The problem of designing bit-to-pattern mappings and power allocation schemes for orthogonal frequency-division multiplexing (OFDM) systems that employ subcarrier index modulation (IM) is considered. We assume that the binary source conveys a stream of independent, uniformly distributed bits to the pattern mapper, which introduces a constraint on the pattern transmission probability distribution that can be quantified using a binary tree formalism. Under this constraint, we undertake the task of maximizing the achievable rate subject to the availability of channel knowledge at the transmitter. The optimization variables are the pattern probability distribution (i.e., the bit-to-pattern mapping) and the transmit powers allocated to active subcarriers. To solve the problem, we first consider the relaxed problem where pattern probabilities are allowed to take any values in the interval [0, 1] subject to a sum probability constraint. We develop (approximately) optimal solutions to the relaxed problem by using new bounds and asymptotic results, and then use a novel heuristic algorithm to project the relaxed solution onto a point in the feasible set of the constrained problem. Numerical analysis shows that this approach is capable of achieving the maximum mutual information for the relaxed problem in low- and high-SNR regimes and offers noticeable benefits in terms of achievable rate relative to a conventional OFDM-IM benchmark. [ABSTRACT FROM AUTHOR]

This paper considers physical layer security enhancement mechanisms that utilize simultaneous beamforming and jamming in visible light communication systems with a randomly located eavesdropper under the assumption that there are multiple light-emitting diode (LED) transmitters and one intended user. When an eavesdropper with an augmented front-end receiver is present, the jamming is very useful for preventing the eavesdropper from wiretapping the information since it is not possible to extract only the information component from the received signal if the jamming signal is random. Thus, in this paper, an optimization problem is formulated with a focus on the signal-to-interference-plus-noise ratio for the legitimate link, and it is solved by a heuristic method called the concave–convex procedure. Then, a ternary scheme is proposed, which is less complicated than the full (joint) scheme, and it is optimized by adopting a formulation based on an assignment problem, the solution of which is effectively obtained by the so-called tabu search procedure. In addition, the problem of maximizing the average secrecy rate is investigated by utilizing a continuous LED model, which significantly relaxes the complication that rises from calculating the expectation with respect to the location of the eavesdropper. Our analysis and simulation results show that the proposed simultaneous beamforming and jamming strategies (both joint and ternary) are good proxies for maximizing the average secrecy rate by utilizing the statistical information on the eavesdropper’s random location. [ABSTRACT FROM AUTHOR]