Search

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]

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]

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]

We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other corresponding to the edges). This suggests an interpretation of the symmetric Laplacian's Von Neumann entropy as a measure of bipartite entanglement present between the two parts of the state. We then study extreme values for a connected graph's generalized Rényi- p entropy. Specifically, we show that (1) the complete graph achieves maximum entropy, (2) the 2-regular graph: (a) achieves minimum Rényi-2 entropy among all k -regular graphs, (b) is within log ⁡ 4 / 3 of the minimum Rényi-2 entropy and log ⁡ 4 2 / 3 of the minimum Von Neumann entropy among all connected graphs, (c) achieves a Von Neumann entropy less than the star graph. Point (2) contrasts sharply with similar work applied to (normalized) combinatorial Laplacians, where it has been shown that the star graph almost always achieves minimum Von Neumann entropy. In this work we find that the star graph achieves maximum entropy in the limit as the number of vertices grows without bound. [ABSTRACT FROM AUTHOR]

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 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]

Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper bound for the Kolmogorov complexity of graphs and networks. Firstly, the most simple graphs possible, those with O (1) Kolmogorov complexity, were identified. These graphs were then used to develop a method to estimate the complexity of a given graph. The proposed method utilizes the simple structures within a graph to capture its non-randomness. This method is able to capture features that make a network closer to the more non-random end of the spectrum. The resulting algorithm takes a graph as an input and outputs an upper bound to its Kolmogorov complexity. This could be applicable in, for example evaluating the performances of graph compression methods. [ABSTRACT FROM AUTHOR]

In this paper, the problem of efficiently allocating wireless resources to support multiple scalable video sequences over a downlink cognitive radio network is addressed. We consider the coarse grain scalable (CGS) and medium grain scalable (MGS) extension of the H.264 standard as the encoding method and propose to perform a per-subcarrier transmit antenna selection such that spatial diversity is exploited. We formulate the problem of optimally allocating subcarriers and antennas among secondary users as a binary integer program, where optimality is defined in terms of the aggregate visual quality of received video sequences of all cognitive users. The proposed formulation caters to the staircase rate-distortion characteristics of CGS/MGS sequences and avoids allocating more resources than are necessary to attain a given visual quality. However, due to the high computational complexity involved in solving this hard integer program using discrete programming solvers, we reduce the resource allocation problem to a subset-sum problem. Although it remains \cal NP -hard in general, we present two efficient methods to solve this subset-sum problem based on its structure. Simulation results demonstrate that the methods proposed lead to a solution that is close to the optimal. Moreover, we demonstrate that having multiple antennas at the cognitive base station reduces the outage probability of secondary users. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the asymptotic performance of per-tone, bulk, and joint bulk/per-tone transmit antenna selections in orthogonal frequency-division multiplexing systems employing orthogonal space–time block coding (OSTBC). In particular, we show that the diversity and coding gains of all three systems are identical. This is a remarkable result since it demonstrates that systems with M transmit antennas operating in the high signal-to-noise ratio regime can achieve optimal performance while only employing enough radio frequency circuitry to convey OSTBC over L < M antennas on all subcarriers, thus offering significant savings over conventional approaches. [ABSTRACT FROM PUBLISHER]

Using mutually shift-orthogonal spreading codes, block-spread code-division multiple access (BS-CDMA) systems have been shown to achieve multiuser interference (MUI)-free reception when synchronization between the base station and the subscriber stations is achieved. In practice, when carrier frequency offset (CFO) is present, orthogonality among users is destroyed, and MUI occurs. This paper presents three methods of designing the spreading and despreading codes for uplink BS-CDMA systems to reduce MUI due to CFO. We show through rigorous derivation that all three codes can completely eliminate MUI due to CFO. In particular, by fixing the spreading codes at the transmitter, despreading codes that were obtained by minimizing the interference power or their cross correlation with the spreading codes are shown to yield a performance close to a synchronous system. The advantages and disadvantages of the BS-CDMA systems using the three proposed codes are discussed. [ABSTRACT FROM PUBLISHER]

A novel block-spread code-division multiple access (BS-CDMA) framework is presented whereby user-specific, channel-independent precoding is employed along with special spreading codes to ensure multi-user interference free reception with maximum user load. This framework is presented in a general form, from which other BS-CDMA techniques can be derived. Finally, it is shown that specific precoder and spreading code designs facilitate low-complexity frequency-domain equalization at the receiver. [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 analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the "pair connection function") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Classical random geometric graph and exponential graph models can be recovered in certain limits. We derive a simple bound for the entropy of a spatial network ensemble and calculate the conditional entropy of an ensemble given the node location distribution for hard and soft (probabilistic) pair connection functions. Under this formalism, we derive the connection function that yields maximum entropy under general constraints. Finally, we apply our analytical framework to study two practical examples: ad hoc wireless networks and the US flight network. Through the study of these examples, we illustrate that both exhibit properties that are indicative of nearly maximally entropic ensembles. [ABSTRACT FROM AUTHOR]

In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyzing the formation of paths within such networks. Moreover, the presence of the links between the nodes is a random process induced by nature in many real-world networks. In this paper, we study random temporal networks at a microscopic level and formulate the probability of accessibility from a node i to a node j after a certain number of discrete time units T. While solving the original problem is computationally intractable, we provide an upper and two lower bounds on this probability for a very general case with arbitrary time-varying probabilities of the links' existence. Moreover, for a special case where the links have identical probabilities across the network at each time slot, we obtain the exact probability of accessibility between any two nodes. Finally, we discuss scenarios where the information regarding the presence and absence of links is initially available in the form of time duration (of presence or absence intervals) continuous probability distributions rather than discrete probabilities over time slots. We provide a method for transforming such distributions to discrete probabilities, which enables us to apply the given bounds in this paper to a broader range of problem settings. [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]

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]

In this paper, we propose an antenna selection method in a wireless cognitive radio (CR) system, which we term difference selection, whereby a single transmit antenna is selected at the secondary transmitter out of M possible antennas such that the weighted difference between the channel gains of the data link and the interference link is maximized. We analyze the mutual information and the outage probability of the secondary transmission in a CR system with difference antenna selection, and propose a method of optimizing these performance metrics subject to practical constraints on the peak secondary transmit power and the average interference power as seen by the primary receiver. The optimization is performed over two parameters: the peak secondary transmit power and the difference selection weight δ∈[0,1]. Furthermore, we show that the diversity gain of a CR system employing difference selection is an impulsive function of δ, in that a value of δ=1 yields the full diversity order of M and any other value of δ gives no diversity benefit. Finally, we demonstrate through extensive simulations that, in many cases of interest, difference selection using the optimal values of these two parameters is superior to the so-called ratio selection method disclosed in the literature. [ABSTRACT FROM PUBLISHER]

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]

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]

We consider a cognitive radio system with one secondary user (SU) accessing multiple channels via periodic sensing and spectrum handoff. We propose an optimal spectrum sensing and access mechanism such that the average energy cost of the SU, which includes the energy consumed by spectrum sensing, channel switching, and data transmission, is minimized, whereas multiple constraints on the reliability of sensing, the throughput, and the delay of the secondary transmission are satisfied. Optimality is achieved by jointly considering two fundamental tradeoffs involved in energy minimization, i.e., the sensing/transmission tradeoff and the wait/switch tradeoff. An efficient convex optimization procedure is developed to solve for the optimal values of the sensing slot duration and the channel switching probability. The advantages of the proposed spectrum sensing and access mechanism are shown through simulations. [ABSTRACT FROM PUBLISHER]

Next-generation ultra-wideband systems will be required to operate in a robust manner over short distances while achieving data rates on the order of gigabits per second. Sophisticated multi-antenna techniques can be employed to meet these objectives; in particular, multi-antenna precoding (or beamforming) methods are promising solutions. However, due to the strict power regulations placed on UWB transmissions, conventional precoding techniques are not always suitable for use in UWB networks. In this article we present new theoretical results and practical approaches to performing precoding in OFDM-based multi-antenna UWB systems. [ABSTRACT FROM AUTHOR]

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts. [ABSTRACT FROM AUTHOR]