Search

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]

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]

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]

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]

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]