Search

This paper investigates the relay-assisted wireless information and power transfer enabled hybrid visible light communication (VLC)-radio frequency (RF) network, where a light emitting diode (LED) access point (AP) serves multiple information users (IUs) and multiple energy harvesting users (EHUs). IUs are allowed to receive information from the LED AP through time-division-multiple-access (TDMA) manner by either the single-hop VLC-ONLY mode or the relay-assisted dual-hop VLC-RF mode, while EHUs harvest energy via the VLC links. An optimization problem is formulated to maximize the achievable information rate of IUs by jointly optimizing the access mode selection, the direct current (DC) offset at the LED AP, the peak amplitude of the alternating current (AC) component at the LED AP, the electrical power allocated to the LED AP and the power allocation at relay, subject to the energy harvesting (EH) requirement constraints of EHUs. To tackle the non-convex problem with binary variables, we first decompose it into two subproblems in terms of the two access modes. Then, the subproblems are equivalently transformed and solved by the proposed successive convex approximation (SCA)-based algorithms. Simulation results show that significant performance gain can be achieved by optimizing the DC offset. It is also observed that the area where the VLC-ONLY mode is superior to the VLC-RF mode is enlarged with the decrease of the minimal EH requirement. Besides, the achievable information rate of IUs by the VLC-RF mode first increases and then decreases with the increment of the distance between the relay and the LED AP. [ABSTRACT FROM AUTHOR]

This paper investigates the wireless-powered hierarchical fog-cloud computing networks, where multiple energy-constrained users harvest energy from a hybrid access point (HAP) firstly and then use their harvested energy to offload their computation tasks to fog/cloud servers via the HAP or compute their tasks locally. To pursue multi-user fairness, an optimization problem is formulated to maximize the minimal energy balance among all users by jointly optimizing time assignments, computation central processing unit (CPU) frequencies, and the computing mode selection. Since the problem is mixed-integer combinatorial non-convex, which is intractable, a generalized Benders decomposition (GBD)-based method is proposed, which guarantees the globally optimal solution. To release the high computational complexity of the proposed GBD-based method, a penalized successive convex approximation (P-SCA)-based algorithm is designed as an alternative to obtain a suboptimal solution with low computational complexity. Numerical results show that among different optimizable factors in the system, computing mode selection is the dominant one on affecting the system performance. Moreover, for each user, local computing is a better choice, if it is with relatively poor channel gain and small local computing delay. Otherwise, fog/cloud computing may be a better choice. Additionally, for the users with relatively high channel gains, if their local computing delays are less than those selecting fog computing, cloud computing should be a better choice. [ABSTRACT FROM AUTHOR]

In high-speed railway communication systems, the distributed antenna systems are usually employed to mitigate frequent handover and enhance the signal-to-noise ratio to receivers. In this case, jointly optimizing downlink power allocation with antenna selection (PAWAS) can enhance system energy efficiency, while the channel state and traffic density are taken into account. Besides, two typical kinds of terrains with sparse and rich scatterings and three traffic patterns including delay-sensitive, -insensitive, and hybrid traffics are investigated in this paper. We show that severe small-scale fading decreases the ergodic capacity, which is quantitatively analyzed, and proved to be proportional to the number of selected transmit antennas. In addition, in case of delay-sensitive traffic, we show that the PAWAS can be viewed as generalized channel-inversion associated with transmit antenna selection. In case of delay-insensitive traffic, we show that when multiple antennas are selected, the power allocation can be viewed as channel-inversion, whereas when single antenna is selected, it is traditional waterfilling. In case of hybrid traffic, we prove that the optimal PAWAS method can be given by separately solving the PAWAS of its delay-sensitive and -insensitive parts. Simulation results validate our theoretical results and demonstrate that proposed PAWAS can minimize the average transmit power in cases of arbitrary traffic density and channel states. [ABSTRACT FROM AUTHOR]

Interference has been a key challenge to wireless networks. As a fundamental transmission unit, the Gaussian interference channel (GIC) provides much insight on understanding the optimal transmission policy and the transmission limit over wireless networks. This paper investigates the multiple-layer power allocation of GIC that maximizes the system sum-rate. First, we derive the optimal signal-layer power allocation and the corresponding sum-rate in closed form for all cases of weak interference GIC based on the rate splitting scheme. Theoretical result indicates that: 1) In low power and asymmetric power regimes, the rate splitting scheme degrades to the pure public or private message transmission at transmitters and simple successive decoding process is efficient enough at receivers and 2) the signal-layer sum-rate is not concave for weak interference GIC and a frequency division scheme brings strict positive sum-rate gain for some power constraints. Second, we specify the relationship between the optimal bandwidth-power allocation of the frequency division scheme and the concave envelope of signal-layer sum-rate in the subband-layer. Finally, considering general GIC with time-varying flat fading, we present an optimal channel-state-layer power allocation associated with rate splitting and frequency division. Numerical results demonstrate that the comprehensive power allocation over the signal-layer, the frequency subbands, and the channel states can largely increase the sum-rate of weak interference GIC in most scenarios. [ABSTRACT FROM PUBLISHER]

This paper considers a wireless powered communication network (WPCN) with group cooperation, where two communication groups cooperate with each other via wireless power transfer and time sharing to fulfill their expected information delivering and achieve “win-win” collaboration. To explore the system performance limits, we formulate optimization problems to maximize the weighted sum-rate (WSR) and minimize the total consumed power. The time assignment, beamforming vector and power allocation are jointly optimized under available power and quality of service requirement constraints of both the groups. For the WSR-maximization, both fixed and flexible power scenarios are investigated. As all problems are non-convex and have no known solution methods, we solve them by using proper variable substitutions and the semi-definite relaxation. We theoretically prove that our proposed solution method guarantees the global optimum for each problem. Numerical results are presented to show the system performance behaviors, which provide some useful insights for future WPCN design. It shows that in such a group cooperation-aware WPCN, optimal time assignment has the greatest effect on the system performance than other factors. [ABSTRACT FROM PUBLISHER]

Decode and forward (DF) and compress and forward (CF) are two efficient cooperation strategies for relay networks. The combination of the DF and CF strategies is promising to improve the achievable rate of cooperative communication systems. To thoroughly aggregate the advantage of the DF and CF strategies, we put forward a joint power allocation and strategy selection (PASS) scheme for the half-duplex relay channel. The PASS scheme is shown to achieve a higher rate compared with a regular hybrid DF/CF scheme. The rate gain obtained in the static relay channel results from actively adjusting and optimizing the relay power, followed by selecting the better strategy between DF and CF. In particular, when the relay receives and transmits in sequential time slots, we characterize the positive rate improvement area of the PASS scheme analytically and give a near-optimal setting for approaching the best rate performance. The PASS scheme is extended to fading relay channels. We show that the rate increment obtained from the PASS scheme is further magnified by employing an advanced relay power allocation technique over channel states. The corresponding optimal power allocation is established based on the concavity of the rate achieved by the PASS scheme in static relay channel. Numerical results are presented to validate the analysis. [ABSTRACT FROM PUBLISHER]

In 5G heterogeneous networking, it is promising to integrate different wireless networks to provide higher data rate. This paper models the integrated system as a receiver frequency division relay channel (RFDRC) and studies how to improve the transmission rate by combining decode-forward (DF), compress-forward (CF), and amplify-forward (AF) schemes. First, we establish clear criterions on how to select a relay scheme among DF, CF, and AF schemes and prove that the CF outperforms AF for all possible configurations. Based on the scheme selection criterions, we propose a hybrid DF–CF scheme which takes advantage of both DF and CF schemes in RFDRC. A near-optimal resource allocation is presented for the DF–CF-based system, leading to a new achievable rate for RFDRC. For ease of implementation, we further put forward a hybrid DF–AF scheme and reconsider the joint bandwidth and power allocation. Two suboptimal resource allocation solutions are established. In particular, when source frequency band and relay frequency band have equivalent bandwidth, we show that the proposed hybrid DF–AF scheme can achieve the concave envelope of the maximum between DF rate and AF rate. Numerical results show that the proposed schemes bring significant gains for RFDRC. [ABSTRACT FROM AUTHOR]

This paper investigates the energy efficiency (EE) in multiple relay-aided OFDM systems, where decode-and-forward (DF) relay beamforming is employed to help the information transmission. In order to explore the system performance behavior with user fairness for such a system, an optimization problem is formulated to maximize the EE by jointly considering multiple factors, i.e., the transmission mode selection (DF relay beamforming or direct-link transmission), the helping relay set selection, the subcarrier assignment and the power allocation at the source and relays on subcarriers, under nonlinear proportional rate fairness constraints, where both transmit power consumption and linearly rate-dependent circuit power consumption are taken into account. To solve the nonconvex optimization problem, we propose a low-complexity scheme to approximate it. Simulation results demonstrate its effectiveness. The effects of the circuit power consumption on system performance is also studied and it is observed that with either the constant or the linearly rate-dependent circuit power consumption, system EE grows with the increment of system average channel-to-noise ratio (CNR), but the growth rates show different behaviors. For the constant circuit power consumption, system EE increasing rate is an increasing function of the average CNR, while for the linearly rate-dependent one, system EE increasing rate is a decreasing function of the average CNR. This observation is very important, which indicates that by deducing the circuit dynamic power consumption per unit data rate, system EE can be greatly enhanced. Besides, we also discuss the effects of the number of users and subcarriers on the system EE performance. [ABSTRACT FROM AUTHOR]

The outage performance of a dual-hop mobile ad hoc network (MANET), which employs amplify-and-forward (AF) relaying in a Rayleigh fading environment in the presence of a Poisson field of interferers at the destination, is investigated. All mobile users are assumed to follow the Poisson arrival model along the highway and can only communicate with each other via a stationary base station or a mobile relay station. Under this MANET model, a single-integral expression for the exact outage probability and a tight lower bound are both derived. The impacts of transmitting power, path-loss exponent, and spatial density of interferers on the performance of dual-hop systems are found. It is revealed that the outage probability of each hop, as a function of distance, transmitting power, etc., has a different impact on the end-to-end outage probability. The outage probability floor is derived when the transmission power at the source/relay becomes large. The optimal power allocation for the dual-hop link is obtained. The behavior of the outage probability during the communication process between the moving nodes is investigated. The analytical results are validated with Monte Carlo simulation. [ABSTRACT FROM AUTHOR]

We consider providing broadband wireless services for passengers in a high-speed train and local users (low-mobility users) in the same OFDMA system. For the train, a two-hop architecture, under which, passengers communicate with base stations (BSs) via a mobile relay (MR) is employed. Then all passengers in the train can be treated as one large user represented by the MR. Since the channel conditions of the MR and local users are different in both large scale-fading and small-scale fading, we allocate the system resources over two time-scales for them. We formulate the resource allocation problem in the downlink OFDMA system as a capacity optimization problem for the MR subject to the sum capacity constraint of local users. We discuss the problem in two cases where perfect intercarrier interference (ICI) cancellation and no ICI cancellation are applied at the MR. The corresponding capacities and optimal power and subcarrier allocation (OPSA) policies are presented for each case. The capacities obtained in these two cases bound the achievable transmission rate of the MR and provide meaningful guidance for the application of ICI cancellation. Finally, the implementation issues of resource allocation policies are discussed to simplify application in practical scenarios. [ABSTRACT FROM PUBLISHER]

Widespread deployment of high-speed railways in recent years has created huge demand for high-mobility broadband wireless communications. To provide broadband wireless access for passengers on the train, a well-acknowledged approach is to apply a two-hop architecture, under which passengers communicate with base stations (BSs) via an access point (AP) installed in the train. We consider the uplink transmission from the AP to the BSs on the ground along the railway. The key problem we discuss is how to match user-data arrival process and time-varying channel service process with a delay constraint at the AP. We first assume the constant-rate data arrival and the wireless channel affected only by large-scale fading in high-speed railway scenarios. We present the optimal power-allocation policy given the delay constraint. Based on the policy, we show that there exists a power–delay tradeoff in our system model, with the delay within a limited range. Besides, we find that the average transmit power and the train velocity have a tradeoff, which is similar to the power–delay tradeoff. Besides, given average transmit power constraint, the delay constraint is inversely proportional to the train velocity. Finally, when small-scale fading is considered, we modify the optimal power-allocation policy and provide a convenient approach to counteract Nakagami- $m$ fading in high signal-to-noise ratio (SNR) regimes. The modified power-allocation policy can be well adapted to different fading statistics in different terrestrial environments experienced by the high-speed train. [ABSTRACT FROM PUBLISHER]

This paper investigates the simultaneous wireless information and energy transfer for the non-regenerative multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two practical receiver architectures, we present two protocols, time switching-based relaying (TSR) and power splitting-based relaying (PSR). To explore the system performance limits, we formulate two optimization problems to maximize the end-to-end achievable information rate with the full channel state information (CSI) assumption. Since both problems are non-convex and have no known solution method, we firstly derive some explicit results by theoretical analysis and then design effective algorithms for them. Numerical results show that the performances of both protocols are greatly affected by the relay position. Specifically, PSR and TSR show very different behaviors to the variation of relay position. The achievable information rate of PSR monotonically decreases when the relay moves from the source towards the destination, but for TSR, the performance is relatively worse when the relay is placed in the middle of the source and the destination. This is the first time such a phenomenon has been observed. In addition, it is also shown that PSR always outperforms TSR in such a MIMO-OFDM relaying system. Moreover, the effects of the number of antennas and the number of subcarriers are also discussed. [ABSTRACT FROM AUTHOR]

Applying network coding (NC) in the downlink of two-way relay networks can significantly increase the throughput. However, the fading nature of wireless channels usually causes great asymmetry between two downlink channels, which can degrade the performance of NC. Therefore, it is very necessary to perform an opportunistic scheme that selects between broadcast and unicast at the relay node based on channel side information. This paper focuses on the fundamental limit of the sum rate in the downlink. To solve the maximization problem of the sum rate in the downlink, we first introduce an auxiliary variable, known as marginal capacity income of transmit power, and then derive the corresponding power allocation in closed-form expression and present an opportunistic switching selection strategy between broadcast/unicast. Numerical results also show that our proposed scheme achieves a larger downlink sum throughput compared with other existing known schemes. [ABSTRACT FROM PUBLISHER]

A relay channel (RC), consisting of a source, a relay, and a destination, is a basic transmission unit of cooperative communication networks. The capacity of an RC is not known in general. In this paper, an SNR decomposition (SD) strategy is presented to implement time sharing, which provides a new tractable and achievable rate for a full-duplex Gaussian RC. More specifically, we first expand the SNR of a relay destination channel (SNR-RD) into two terms under the relay power constraint and divide the system into two subbands. Then, we assign the obtained SNR-RD for each subband and employ decode-forward (DF) or compress-forward (CF) according to the assigned SNR-RD. It is shown that the achievable rate of the SD strategy is competitive with that of superposing CF on DF. As the superposition structure requires a sophisticated codeword design, the SD strategy provides another practical combination structure of DF and CF strategies. Approximations for the SNR-RD and bandwidth allocation for subbands are also given. Based on the obtained results, two application scenarios, i.e., mobile relay and quasi-static fading RCs, are also considered. Finally, various numerical results are shown to support our developed theoretical results. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate a three-node two-way relaying network over fading channels. The stability of this system is first discussed. Three protocols are then investigated in this work in terms of throughput, including the opportunistic digital network coding (ODNC) scheduling protocol, the physical network coding (PNC) protocol, and the cooperation protocol of DNC with direct link (CDNC-DL). For the first two protocols, we assume that the direct link is not available. For the third protocol, the direct link is available and can support data rates. The problems of maximizing the long-term totally fair optimal throughput with the three protocols, with respect to the stability constraints, are formulated and solved by allocating power resources with respect to channel fluctuations. To complement this work, optimal time resource allocation for each phase of the three protocols as well as the associated end-to-end throughput are investigated. In the end, it is shown in simulation that ODNC performs better than the conventional DNC and that CDNC-DL outperforms the other two proposed protocols as long as the direct link is in relatively good condition. [ABSTRACT FROM PUBLISHER]

High-speed railways (HSRs) have been widely deployed all over the world in recent years. Different from traditional cellular communications, the high mobility of HSR communication makes it essential to implement power allocation (PA) along time. In the HSR case, the transmission rate greatly depends on the distance between the base station (BS) and the train. As a result, the train receives a time-varying data rate service when passing by a BS. It is clear that the most efficient PA will spend all the power when the train is nearest the BS, which will cause great unfairness along time. On the other hand, channel inversion allocation achieves the best fairness in terms of constant rate transmission. However, its power efficiency is much lower. Therefore, power efficiency and fairness along time are two incompatible objects. For the HSR cellular system considered in this paper, a tradeoff between the two is achieved by proposing a temporal proportional-fair PA scheme. In addition, a near-optimal closed-form solution and one algorithm finding \epsilon-optimal allocation are presented. [ABSTRACT FROM PUBLISHER]