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]

A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called network evolution chain, is a stationary and ergodic stochastic process. Therefore, the asymptotic equipartition property can be applied to it. The model's entropy rate and typical sequences are also explored. Extracting particular information from the network and methods to simulate network evolution in the continuous time domain are discussed. Additionally, the Erdős–Rényi network evolution chain is introduced as a subset of our model with the additional property of its stationary distribution matching the Erdős–Rényi random graph model. The stationary distributions of nodes and graphs are calculated for this subset alongside its entropy rate. The simulation results at the end of the article back up the proved theorems and calculated values. [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]

This article highlights challenges associated with securing visible light communication (VLC) systems by using physical layer security (PLS) techniques. Motivated by the achievements in PLS studies for radio frequency (RF) communication, many PLS techniques for VLC systems were also rigorously investigated by tailoring the RF techniques to the VLC environment. However, careful consideration of the inherent differences between RF and VLC systems is still needed. By disregarding these differences, an eavesdropper could be given an opportunity to wiretap the VLC systems, even when PLS techniques are employed to protect them. Crucially, the fact that it is often not possible to know the number and locations of eavesdroppers in real VLC systems may allow eavesdroppers to devise various cooperative eavesdropping methods. By examining a few examples of the possible eavesdropper threats that can occur in VLC systems, this article offers novel insights into the vulnerabilities of state-of-the-art PLS schemes for VLC systems. Although the focus of the paper is mostly on these weaknesses, some potential solutions are also briefly proposed with a view to stimulating discourse in the community. [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]

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]

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]

Recently, the mission-critical push-to-talk (MCPTT) system has emerged as the new broadband technology for public safety networks. In this paper, we propose a route selection method based on the connectivity, delay, and trust in the MCPTT system to offer the best connectivity-delay-trust performance. To begin with, the connection probability between a pair of user equipment (UE) has been analyzed with the interference from other MCPTT groups. Then, the timeliness probability is studied to capture the level of confidence for the delay requirement. Moreover, the trust probability is calculated by a beta reputation system to prevent potential attacks from malicious nodes and ensure secure interactions among the forwarding UE. By combining three probabilistic results, we investigate the optimal path route selection method based on the Dijkstra's algorithm to find the path, which can meet the requirement of the MCPTT system. The simulation results validate our models and theoretical analysis. The results provide a useful insight into designing the MCPTT system for 5G public safety and disaster relief networks. [ABSTRACT FROM AUTHOR]

When utilizing all subcarrier activation patterns in the combinatorial index modulation (IM) scheme, existing techniques either fail to realize the maximum possible throughput enhancement or fail to address the bit-level synchronization issue (or error propagation) due to the variable-length nature of the index-domain codebook. To address these drawbacks, we propose using Huffman coding for IM together with two constellation mappings for the bandpass modulation. The proposed scheme induces no signal overhead and is applicable when the index-domain codebook has the maximum encoding rate. Simulations demonstrate the effectiveness of the proposed scheme in mitigating bit-level synchronization errors. [ABSTRACT FROM AUTHOR]

We show that the von Neumann entropy (from herein referred to as the von Neumann index) of a graph's trace normalized combinatorial Laplacian provides structural information about the level of centralization across a graph. This is done by considering the Theil index, which is an established statistical measure used to determine levels of inequality across a system of 'agents', for example, income levels across a population. Here, we establish a Theil index for graphs, which provides us with a macroscopic measure of graph centralization. Concretely, we show that the von Neumann index can be used to bound the graph's Theil index, and thus we provide a direct characterization of graph centralization via the von Neumann index. Because of the algebraic similarities between the bound and the Theil index, we call the bound the von Neumann Theil index. We elucidate our ideas by providing examples and a discussion of different n = 7 vertex graphs. We also discuss how the von Neumann Theil index provides a more comprehensive measure of centralization when compared to traditional centralization measures, and when compared to the graph's classical Theil index. This is because it more accurately accounts for macro-structural changes that occur from micro-structural changes in the graph (e.g. the removal of a vertex). Finally, we provide future direction, showing that the von Neumann Theil index can be generalized by considering the R´enyi entropy. We then show that this generalization can be used to bound the negative logarithm of the graph's Jain fairness index. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel codebook design scheme for orthogonal frequency-division multiplexing with index modulation (OFDM-IM) to improve system performance. The optimization process can be implemented efficiently by the lexicographic ordering principle. By applying the proposed codebook design, all subcarrier activation patterns with a fixed number of active subcarriers will be explored. Furthermore, as the number of active subcarriers is fixed, the computational complexity for estimation at the receiver is reduced and the zero-active subcarrier dilemma is solved without involving complex higher layer transmission protocols. It is found that the codebook design can potentially provide a tradeoff between diversity and transmission rate. We investigate the diversity mechanism and formulate three diversity-rate optimization problems for the proposed OFDM-IM system. Based on the genetic algorithm, the method of solving these formulated optimization problems is provided and verified to be effective. Then, we analyze the average block error rate and bit error rate of the OFDM-IM systems applying the codebook design. Finally, all analyses are numerically verified by the Monte Carlo simulations. In addition, a series of comparisons are provided, by which the superiority of the codebook design is confirmed. [ABSTRACT FROM AUTHOR]

In this paper, we consider a Poisson clustered out-of-band device-to-device (D2D) network operating in Rayleigh fading channels and propose two optimization schemes based on the joint coverage probability to allocate the transmit power to D2D user equipment (DUE) in both the target cluster and the whole network. The joint coverage probability accounts for the spatial correlation of the interference among the DUE. With a differing amount of location information being available among the DUE in centralized and localized communication solutions, the joint coverage probability is formulated based on the coherent, non-coherent, and single-cluster approximated pairwise coverage probabilities. By maximizing the joint coverage probability formulated in this way, the robustness of the network can be enhanced. Meanwhile, to fulfill the green aspect of future 5G communications, the battery life of the DUE will be prolonged by minimizing the power consumption for a given joint coverage probability requirement. The formulations of the two optimization problems mentioned above are not convex but are transformed to convex by using geometric programming. The simulation results show that, compared with the conventional LTE open-loop and fixed power schemes, the joint coverage probability and power consumption are, respectively, optimized by applying the proposed schemes. [ABSTRACT FROM AUTHOR]

This paper studies finding the secure path according to the secrecy connectivity probability (SCP) in the multihop ad hoc networks in the presence of inhomogeneous eavesdropper clusters. We consider both random and fixed eavesdropper clusters, where the former case assumes that there is no knowledge of the locations of the clusters and the latter case assumes that the locations of the clusters can be estimated accurately. First, we derive the end-to-end SCP to characterize the secrecy performance of a given path in a general multihop wireless network with half-duplex randomize-and-forward relaying. Then, we consider a full-duplex scheme at the legitimate receiver, which receives the useful information while broadcasting a jamming signal to the potential eavesdroppers to further enhance the secrecy connectivity. Then, a novel secure routing algorithm that can provide the maximum SCP for any legitimate transmitter/receiver pair in a distributed manner is proposed. The theoretical analysis is verified by Monte Carlo simulation results. The results show that our secure routing algorithm provides similar results compared to an exhaustive search. For the random eavesdropper cluster case, the optimal route is independent of the knowledge of the cluster, which is the same as the homogeneous eavesdropper case. However, for the case where eavesdropper clusters are fixed and their locations are knowna priori, the optimal path selection depends on the radii and locations of the eavesdropper clusters and the average number of eavesdroppers in each cluster. [ABSTRACT FROM AUTHOR]

In this paper, we study the connectivity between two fixed terminal nodes within a geometrically bounded network of relay nodes and fixed infrastructure nodes. We assume that a communication path, between the terminal nodes, can be established by direct connection (1-hop), via a relay node (2-hop) or via the infrastructure network; the choice is based on link viability in a Rayleigh fading environment. We adopt a probabilistic approach to our analysis considering a homogeneous spatial distribution of relay nodes and an inhomogeneous spatial distribution of infrastructure nodes. Our analysis of the relationship between relay and infrastructure densities for a prescribed outage probability shows that reliance on infrastructure connectivity can be appreciably reduced by employing direct and 2-hop connectivity. We further show that, as the relay density increases, optimum connectivity is achieved by employing a non uniform spatial thinning of the infrastructure, which is dependent upon the geometric extent of the network. Our analysis provides an insight into multi-mode connectivity in bounded network domains and has application in many fields including cellular and vehicle-to-infrastructure (V2X), which are often modelled as having finite extent and where reducing the reliance on fixed infrastructure can effectively reduce operating expenditure costs. [ABSTRACT FROM AUTHOR]

In this paper, we propose a full-duplex orthogonal frequency-division multiplexing (OFDM) device-to-device (D2D) system in two-hop networks, where multiple full-duplex decode-and-forward relays assist the transmission from D2D user equipment (DUE) transmitter to DUE receiver. By such a transmission mechanism, the signal transmitted by the DUE transmitter does not need to go through a base station. Meanwhile, due to the adoption of underlay D2D communication protocol, power control mechanisms are thereby necessary to be applied to mitigate the interference to conventional cellular communications. Based on these considerations, we analyze the outage performance of the proposed system, and derive the exact expressions of outage probabilities when bulk and per-subcarrier relay selection criteria are applied. Furthermore, closed-form expressions of outage probabilities are also obtained for special cases when the instantaneous channel state information between BS and cellular user equipments is not accessible, so that a static power control mechanism is applied. Subsequently, we also investigate the outage performance optimization problem by coordinating transmit power among DUE transmitter and relays, and provide a suboptimal solution, which is capable of improving the outage performance. All analyses are substantiated by numerical results provided by Monte Carlo simulations. The analytical and numerical results demonstrated in this paper can provide an insight into the full-duplex relay-assisted OFDM D2D systems, and serve as a guideline for its implementation in next generation networks. [ABSTRACT FROM AUTHOR]

This paper considers secrecy enhancement mechanisms in visible light communication (VLC) systems with spatially distributed passive eavesdroppers (EDs) under the assumption that there are multiple LED transmitters and one legitimate user equipment. Based on certain amplitude constraints, we propose a beamforming scheme to improve secrecy performance. Contrary to the case where null-steering is made possible by using knowledge of the ED locations, the proposed beamforming when only statistical information about ED locations is available directs the transmission along a particular eigenmode related to the intensity of the ED process and the intended channel. Then, a LED selection scheme that is less complicated than beamforming is provided to reduce the secrecy outage probability (SOP). An approximate closed-form for the SOP is derived by using secrecy rate bounds. All the analysis is numerically verified by Monte-Carlo simulations. The analysis shows that the beamformer yields superior performance to LED selection. However, LED selection is still a highly efficient alternative scheme due to the complexity associated with the use of multiple transmitters in the full beamforming approach. These performance trends and exact relations between system parameters can be used to develop a secure VLC system in the presence of randomly distributed EDs. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an adaptive orthogonal frequency-division multiplexing with index modulation (OFDM-IM) for two-hop relay networks. In contrast to the traditional OFDM-IM with a deterministic and fixed mapping scheme, in this proposed adaptive OFDM-IM, the mapping schemes between a bit stream and indices of active subcarriers for the first and second hops are adaptively selected by a certain criterion. As a result, the active subcarriers for the same bit stream in the first and second hops can be varied in order to combat slow frequency-selective fading. In this way, the system reliability can be enhanced. In addition, considering the fact that a relay device is normally a simple node, which may not always be able to perform mapping scheme selection due to limited processing capability, we also propose an alternative adaptive methodology in which the mapping scheme selection is only performed at the source and the relay will simply utilize the selected mapping scheme without changing it. The analyses of average outage probability, network capacity, and symbol error rate are given in closed form for decode-and-forward relaying networks and are substantiated by numerical results generated by Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

We analyze the secrecy outage probability in the downlink for wireless networks with spatially (Poisson) distributed eavesdroppers (EDs) under the assumption that the base station employs transmit antenna selection (TAS) to enhance secrecy performance. We compare the cases, where the receiving user equipment (UE) operates in half-duplex (HD) mode and full-duplex (FD) mode. In the latter case, the UE simultaneously receives the intended downlink message and transmits a jamming signal to strengthen secrecy. We investigate two models of (semi)passive eavesdropping: 1) EDs act independently and 2) EDs collude to intercept the transmitted message. For both of these models, we obtain expressions for the secrecy outage probability in the downlink for the HD and FD UE operation. The expressions for the HD systems have very accurate approximate or exact forms in terms of elementary and/or special functions for all path loss exponents. Those related to the FD systems have exact integral forms for general path loss exponents, while exact closed forms are given for specific exponents. A closed-form approximation is also derived for the FD case with colluding EDs. The resulting analysis shows that the reduction in the secrecy outage probability is logarithmic in the number of antennas used for TAS and identifies conditions, under which HD operation should be used instead of FD jamming at the UE. These performance trends and exact relations between system parameters can be used to develop adaptive power allocation and duplex operation methods in practice. Examples of such techniques are alluded to herein. [ABSTRACT FROM PUBLISHER]

We present a novel data programming scheme for flash memory. In each word-line, exactly $k$ out of n$ memory cells are programmed while the rest are kept in the erased state. Information is then conveyed by the index set of the k$ programmed cells, of which there are possible choices (also called activation patterns). In the case of multi-level flash, additional information is conveyed by the threshold-voltage levels of the $k$ programmed cells (similar to traditional programming). We derive the storage efficiency of the new scheme as a function of the fraction of programmed cells and determine the fraction that maximizes it. Then, we analyze the effect of this scheme on cell-to-cell interference and derive the conditions that ensure its reduction compared with the traditional programming. Following this, we analyze the performance of our new scheme using two detection methods: fixed reference detection and dynamic reference detection, and conclude that using dynamic reference detection will result in page error performance improvements that can reach orders of magnitude compared with that attainable by the fixed reference approach. We then discuss how logical pages can be constructed in the index programming similarly to traditional programming. Finally, we discuss the results and tradeoffs between storage efficiency and error resilience proposed by the scheme along with some future directions. [ABSTRACT FROM PUBLISHER]

We study the hybrid classical-quantum version of the channel coding problem for the famous Gel’fand–Pinsker channel. In the classical setting for this channel the conditional distribution of the channel output given the channel input is a function of a random parameter called the channel state. We study this problem when a rate limited version of the channel state is available at the encoder for the classical-quantum Gel’fand–Pinsker channel. We establish the capacity region for this problem in the information-spectrum setting. The capacity region is quantified in terms of spectral-sup classical mutual information rate and spectral-inf quantum mutual information rate. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel relay selection scheme for orthogonal frequency-division multiplexing systems by combining conventional bulk and per-subcarrier selection schemes and analyze its outage performance over equally spatially correlated channels. Specifically, the combined selection scheme selects only two relays at the first attempt and performs per-subcarrier selection over these two relays. We analyze the asymptotic outage performance of the combined selection scheme in the high signal-to-noise ratio (SNR) region and prove a generalized theorem. This theorem states that the combined selection can achieve an optimal outage probability equivalent to the per-subcarrier selection at a high SNR without using the full set of available relays for selection. This unique property is termed the equivalence principle, and it holds for all correlation conditions. To explore this principle, we consider three examples: decode-and-forward, fixed-gain amplify-and-forward (AF), and variable-gain AF relay systems. Furthermore, two extended applications, i.e., antenna selection and branch selection, are also considered to reveal the feasibility and the expandability of the equivalence principle. Our analysis is verified by Monte Carlo simulations. The proposed combined selection and the proved theorem provide a general and feasible solution to the tradeoff between system complexity and outage performance when relay selection is applied. [ABSTRACT FROM AUTHOR]

We introduce a tractable approach for studying the feasibility of multiple-antenna cellular networks, where low-energy devices decode information data and harvest power simultaneously. Tools from stochastic geometry are used to quantify the information rate versus harvested power tradeoff. This letter unveils that large-scale antenna arrays and ultra-dense deployments of base stations are both necessary to harvest, with high reliability, an amount of power of the order of a milliwatt. [ABSTRACT FROM PUBLISHER]

We derive closed-form outage probability expressions for fixed-gain (FG) and variable-gain (VG) two-way amplify-and-forward (AF) relay networks subject to a nonlinear transmission at the relay. We then derive an explicit expression for the relay gain that optimizes the network's performance. Finally, we show that, if the source nodes have no access to the distortion characteristics of the relay's amplifier, which inhibits self-interference removal, the network's performance will change negligibly. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel framework that can be used to study the capacity and power scaling properties of linear multiple-input multiple-output d\times d antenna amplify-and-forward relay networks. In particular, we model these networks as random dynamical systems and calculate their d Lyapunov exponents. Our analysis can be applied to systems with any per-hop channel fading distribution; although in this contribution, we focus on Rayleigh fading. Our main results are twofold: 1) the total transmit power at the n th node will follow a deterministic trajectory through the network governed by the network’s maximum Lyapunov exponent and 2) the capacity of the i th eigenchannel at the n th node will follow a deterministic trajectory through the network governed by the network’s i th Lyapunov exponent. Before concluding, we concentrate on some applications of our results. In particular, we show how the Lyapunov exponents are intimately related to the rate at which the eigenchannel capacities diverge from each other, and how this relates to the amplification strategy and the number of antennas at each relay. We also use them to determine the extra cost in power associated with each extra multiplexed data stream. [ABSTRACT FROM AUTHOR]

We develop an approximation for the outage probability of a parallel channel where the subchannel statistics satisfy mild conditions. The main result is in the form of a functional of the density function that describes the statistics of the subchannel powers. The error of the approximation is quantified to be O(\gamma^-n(q+1)-2), where $\gamma$ is the end-to-end SNR of a given subchannel, $n$ is the number of subchannels, and $q$ represents the inherent subchannel diversity. We illustrate the versatility and accuracy of the approximation by studying different statistical subchannel models, which reflect practical wireless communication systems, including line-of-sight links (Rician fading), transmissions affected by interference, and relay systems subject to amplifier distortion. [ABSTRACT FROM PUBLISHER]

Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks but has largely focused on convex deployment regions. We consider here a scenario of practical importance to wireless communications, in which one or more nodes are located outside the convex space where the remaining nodes reside. We call these “external nodes” and assume that they play some essential role in the macro network functionality e.g. a gateway to a dense self-contained mesh network cloud. Conventional approaches with the underlying assumption of only line-of-sight (LOS) or direct connections between nodes fail to provide the correct analysis for such a network setup. To this end we present a novel analytical framework that accommodates for the non-convexity of the domain and explicitly considers the effects of non-LOS nodes through reflections from the domain boundaries. We obtain analytical expressions in 2D and 3D which are confirmed numerically for Rician channel fading statistics and discuss possible extensions and applications. [ABSTRACT FROM PUBLISHER]

A theorem that describes the high signal-to-noise ratio outage behavior of fixed-gain amplify-and-forward relay systems is given. Qualitatively, the theorem states that the outage probability decays according to a power law, where the power is dictated by the poles of the moments of the underlying per-hop fading distributions. The power-law decay is dampened by a logarithmic factor when the leading pole (furthest to the right in the plane) is of order two or more. The theorem is easy to apply, and several examples are presented to this effect. [ABSTRACT FROM PUBLISHER]