This paper investigates an orthogonal frequency division multiplexing (OFDM)-based wireless powered communication system, where one user harvests energy from an energy access point (EAP) to power its information transmission to a data access point (DAP). The channels from the EAP to the user, i.e., the wireless energy transfer (WET) link, and from the user to the DAP, i.e., the wireless information transfer (WIT) link, vary over both time slots and sub-channels (SCs) in general. To avoid interference at DAP, WET and WIT are scheduled over orthogonal SCs at any slot. Our objective is to maximize the achievable rate at the DAP by jointly optimizing the SC allocation over time and the power allocation over time and SCs for both WET and WIT links. Assuming availability of full channel state information (CSI), the structural results for the optimal SC/power allocation are obtained and an offline algorithm is proposed to solve the problem. Furthermore, we propose a low-complexity online algorithm when causal CSI is available.
Mobile-edge computation offloading (MECO) is an emerging technology for enhancing mobiles' computation capabilities and prolonging their battery lifetime by offloading intensive computation from mobiles to nearby servers, such as base stations. In this paper, we study the energy-efficient resource-management policy for the asynchronous MECO system, where the mobiles have heterogeneous input-data arrival time instants and computation deadlines. First, we consider the general case with arbitrary arrival-deadline orders. Based on the monomial energy-consumption model for data transmission, an optimization problem is formulated to minimize the total mobile-energy consumption under the time-sharing and computation-deadline constraints. The optimal resource-management policy for data partitioning (for offloading and local computing) and time division (for transmissions) is obtained in (semi-)closed-form expression by using the block coordinate decent method. To gain further insight, we study the optimal resource-management design for two special cases. First, consider the case of identical arrival-deadline orders, i.e., a mobile with input data arriving earlier also needs to complete computation earlier. The optimization problem is reduced to two sequential problems corresponding to the optimal scheduling order and joint data-partitioning and time-division given the optimal order. It is found that the optimal time-division policy tends to equalize the defined effective computing power among offloading mobiles via time sharing. Furthermore, this solution approach is extended to the case of reverse arrival-deadline orders. The corresponding time-division policy is derived by a proposed transformation-and-scheduling approach that first determines the total offloading duration and data size for each mobile in the transformation phase and then specifies the offloading intervals for each mobile in the scheduling phase.
In this paper, we pursue a unified study on smart grid and coordinated multi-point (CoMP) enabled wireless communication by investigating a new joint communication and energy cooperation approach. We consider a practical CoMP system with clustered multiple-antenna base stations (BSs) cooperatively communicating with multiple single-antenna mobile terminals (MTs), where each BS is equipped with local renewable energy generators to supply power and also a smart meter to enable two-way energy flow with the grid. We propose a new energy cooperation paradigm, where a group of BSs dynamically share their renewable energy for more efficient operation via locally injecting/drawing power to/from an aggregator with a zero effective sum-energy exchanged. Under this new energy cooperation model, we consider the downlink transmission in one CoMP cluster with cooperative zero-forcing (ZF) based precoding at the BSs. We maximize the weighted sum-rate for all MTs by jointly optimizing the transmit power allocations at cooperative BSs and their exchanged energy amounts subject to a new type of power constraints featuring energy cooperation among BSs with practical loss ratios. Our new setup with BSs' energy cooperation generalizes the conventional CoMP transmit optimization under BSs' sum-power or individual-power constraints. Finally, we validate our results by simulations under various practical setups, and show that the proposed joint communication and energy cooperation scheme substantially improves the downlink throughput of CoMP systems powered by smart grid and renewable energy, as compared to other suboptimal designs without communication and/or energy cooperation.
To meet the dramatic growth in wireless data traffic driven by the popularity of new mobile devices and mobile applications, the fifth generation (5G) of cellular technology has recently attracted a lot of research interest from both academia and industry (see, e.g., [1]). As compared with its fourth generation (4G) counterpart, 5G is expected to achieve a roughly 1000 times data rate increase via dense base station (BS) deployments and advanced physical layer communication techniques [1]. However, the large number of BSs will lead to large energy consumption and high electricity bills for cellular operators, which amounts to a large portion of their operational expenditure. For example, China Mobile owned around 920000 BSs in 2011 and the total energy cost per year was almost 3 billion US dollars, given that the annual cost for each BS is about 3000 US dollars [2]. Therefore, in the 5G era, it is becoming necessary for these cellular operators to reduce their energy costs by employing new cost-saving solutions in the design of cellular BSs, which are our main focus in this chapter.
Cognitive beamforming (CB) is a multi-antenna technique for efficient spectrum sharing between primary users (PUs) and secondary users (SUs) in a cognitive radio network. Specifically, a multi-antenna SU transmitter applies CB to suppress the interference to the PU receivers as well as enhance the corresponding SU-link performance. In this paper, for a multiple-input-single-output (MISO) SU channel coexisting with a single-input-single-output (SISO) PU channel, we propose a new and practical paradigm for designing CB based on the finite-rate cooperative feedback from the PU receiver to the SU transmitter. Specifically, the PU receiver communicates to the SU transmitter the quantized SU-to-PU channel direction information (CDI) for computing the SU transmit beamformer, and the interference power control (IPC) signal that regulates the SU transmission power according to the tolerable interference margin at the PU receiver. Two CB algorithms based on cooperative feedback are proposed: one restricts the SU transmit beamformer to be orthogonal to the quantized SU-to-PU channel direction and the other relaxes such a constraint. In addition, cooperative feedforward of the SU CDI from the SU transmitter to the PU receiver is exploited to allow more efficient cooperative feedback. The outage probabilities of the SU link for different CB and cooperative feedback/feedforward algorithms are analyzed, from which the optimal bit-allocation tradeoff between the CDI and IPC feedback is characterized.
In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiuser communication system, where an IRS is deployed to provide virtual line-of-sight (LoS) links between an access point (AP) and multiple users. We consider the practical codebook-based IRS passive beamforming and study efficient design for IRS reflect beam training, which is challenging due to the large number of IRS reflecting elements. In contrast to the conventional single-beam training, we propose a new multi-beam training method by dividing the IRS reflecting elements into multiple sub-arrays and designing their simultaneous multi-beam steering over time. By simply comparing the received signal power over time, each user can detect its optimal IRS beam direction with a high probability, even without searching over all possible beam directions as the single-beam training. Simulation results show that our proposed multi-beam training significantly reduces the training time of conventional single-beam training and yet achieves comparable IRS passive beamforming performance for data transmission.
In this paper, we study a new intelligent refracting surface (IRS)-assisted high-mobility communication with the IRS deployed in a high-speed moving vehicle to assist its passenger's communication with a static base station (BS) on the roadside. The vehicle's high Doppler frequency results in a fast fading channel between the BS and the passenger/user, which renders channel estimation for the IRS with a large number of refracting elements a more challenging task as compared to the conventional case with low-mobility users only. In order to mitigate the Doppler effect and reap the full IRS passive beamforming gain with low training overhead, we propose a new and efficient transmission protocol to execute channel estimation and IRS refraction design for data transmission. Specifically, by exploiting the quasi-static channel between the IRS and user both moving at the same high speed, we first estimate the cascaded BS-IRS-user channel with the Doppler effect compensated. Then, we estimate the instantaneous BS-user fast fading channel (without IRS refraction) and tune the IRS refraction over time accordingly to align the cascaded channel with the BS-user direct channel, thus maximizing the IRS's passive beamforming gain as well as converting their combined channel from fast to slow fading. Simulation results show the effectiveness of the proposed channel estimation scheme and passive beamforming design as compared to various benchmark schemes.
IP multicast faces a serious state scalability problem when there are large numbers of groups in the network. Aggregated Multicast has been proposed as a novel solution to solve this problem, in which multiple groups shared one aggregated tree, so as to reduce the multicast forwarding states. In this paper, we propose a Ant Colony Optimization Algorithm for Aggregated Multicast on Clustering to solve the problem that the time complexity of traditional aggregated multicast algorithm increases exponentially. Simulation results show that our algorithm performs well in program execution time and aggregation degree.
No abstract is provided for this article.
Intelligent reflecting surface (IRS) has emerged as a promising technique to extend the wireless signal coverage of access point (AP) and improve the communication performance cost-effectively. In order to reduce the path-loss of the cascaded user-IRS-AP channels, the IRS-integrated AP architecture has been proposed to deploy the IRSs and the antenna array of the AP within the same antenna radome. To reduce the pilot overhead for estimating all IRS-involved channels, in this paper, we propose a novel codebook-based IRS reflection design for the IRS-integrated AP to enhance the coverage performance in a given area. In particular, the codebook consisting of a small number of codewords is designed offline by employing an efficient sector division strategy based on the azimuth angle. To ensure the performance of each sector, we optimize its corresponding codeword for IRS reflection pattern to maximize the sector-min-average-effective-channel-power (SMAECP) by applying the alternating optimization (AO) and semidefinite relaxation (SDR) methods. With the designed codebook, the AP performs the IRS reflection training by sequentially applying all codewords and selects the one achieving the best communication performance for data transmission. Numerical results show that our proposed codebook design can enhance the average channel power of the whole coverage area, as compared to the system without IRS. Moreover, our proposed codebook-based IRS reflection design is shown to achieve significant performance gain over other benchmark schemes in both single-user and multi-user transmissions.
In this letter, we investigate whether the use of artificial noise (AN) is helpful to enhance the secrecy rate of an intelligent reflecting surface (IRS) assisted wireless communication system. Specifically, an IRS is deployed nearby a single-antenna receiver to assist in the transmission from a multi-antenna transmitter, in the presence of multiple single-antenna eavesdroppers. Aiming to maximize the achievable secrecy rate, a design problem for jointly optimizing transmit beamforming with AN or jamming and IRS reflect beamforming is formulated, which is however difficult to solve due to its non-convexity and coupled variables. We thus propose an efficient algorithm based on alternating optimization to solve the problem sub-optimally. Simulation results show that incorporating AN in transmit beamforming is beneficial under the new setup with IRS reflect beamforming. In particular, it is unveiled that the IRS-aided design without AN even performs worse than the AN-aided design without IRS as the number of eavesdroppers near the IRS increases.
Improving energy efficiency is key to network providers maintaining profit levels and an acceptable carbon footprint in the face of rapidly increasing data traffic in cellular networks in the coming years. The energy-saving concept studied in this paper is the adaptation of a base station's (BS's) transmit power levels and coverage area according to channel conditions and traffic load. Cell coverage is usually pre-designed based on the estimated peak traffic load. However, traffic load in cellular networks exhibits significant fluctuations in both space and time. We design short- and long-term power control (STPC and LTPC respectively) policies for the OFDMA-based downlink of a single-cell system, where bandwidth is dynamically and equally shared among a random number of mobile users (MUs). STPC is a function of all MUs' channel gains that maintains the required user-level quality of service (QoS), while LTPC is a function of traffic density that minimizes the long-term energy consumption at the BS under a minimum throughput constraint. We first develop a power scaling law that relates the (short-term) average transmit power at BS with the given cell range and MU density. Based on this result, we derive the optimal (long-term) transmit adaptation policy by considering a joint range adaptation and LTPC problem. Finally, we compare our proposed adaptation scheme with suboptimal schemes of lower complexity to demonstrate the potential energy saving in broadcast channels.
In this paper, power-efficient transmission schemes are studied for MIMO-OFDM block-fading channels under the assumption that the channel is perfectly known at the receiver but unknown at the transmitter. Based on the well-known V- BLAST architecture that employs the horizontal encoding and the interference-nulling based successive decoding, this paper presents a closed-loop V-BLAST extension for MIMO-OFDM whereby the transmit rate and power as well as the assigned transmit antenna for each data stream at different OFDM tones are jointly optimized at the receiver and then fed back to the transmitter. Simulation results have confirmed that the closed- loop V-BLAST architecture is able to approach closely the MIMO-OFDM channel capacity attained through the eigenmode transmission that requires the complete channel feedback from the receiver to the transmitter.
No abstract is provided for this article.
In this study, we investigate event-triggered distributed fusion estimation for asynchronous Markov jump systems subject to correlated noises and fading measurements. The measurement noises are interrelated, and they are simultaneously coupled with the system noise. The sensor samples measurements uniformly, and the sampling rates of the sensors are different. First, the asynchronous system is synchronized at state update points; then, the local filter is obtained. Furthermore, a variance-based event-triggered strategy is introduced between the local estimator and the fusion center to decrease the energy consumption of network communication. Then, a distributed fusion estimation algorithm is proposed using a matrix-weighted fusion criterion. Finally, the effectiveness of the algorithm is verified using computer simulations.
Voltage and reactive power control is an important task to ensure the economic and safe operation of the distribution network. Coordinating multiple adjustment methods can improve the operation efficiency of the distribution network. In this paper, voltage and reactive power control devices are considered, such as on load tap changer (OLTC), voltage regulators (VR), capacitor bank (CB) and distributed generation (DG). And the optimization is proposed to solve the meaningless action in existing Volt control. Firstly, the voltage and reactive power optimization model of distribution network is established based on the branch power flow equation, which is relaxed to the mixed integer second-order cone programming (MISOCP). At the same time, considering the action cost of the devices, a rolling optimization mode based on model predictive control (MPC) is proposed. Finally, the effectiveness of the proposed strategy is verified based on the improved IEEE-33 bus test system.
In multiple-input single-output (MISO) wireless power transfer (WPT) via magnetic resonant coupling (MRC), multiple transmitters are deployed to enhance the efficiency of power transfer to the electric load at a single receiver by jointly optimizing their source currents/voltages to constructively combine the induced magnetic fields at the receiver, known as magnetic beamforming. In practice, since the transmitters (power chargers) are usually at fixed locations and the receiver (e.g. mobile phone) is desired to be freely located in a target region for wireless charging, its received power can fluctuate significantly over locations even with adaptive magnetic beamforming applied. To achieve uniform coverage, the transmitters need to be optimally placed in the region, which motivates this paper. First, we derive the optimal magnetic beamforming solution in closed-form for a distributed MISO WPT system with given locations of the transmitters and receiver to maximize the deliverable power to the receiver load subject to a given sum-power constraint at all transmitters. With the optimal magnetic beamforming solution, we then jointly optimize the locations of all transmitters to maximize the minimum power deliverable to the receiver when it is being moved over a given one-dimensional (1D) region, i.e., a line of finite length. Although the formulated node placement problem is non-convex, we propose an iterative algorithm for solving it efficiently. Extensive simulation results are provided which show the significant performance gains by the proposed design with optimized transmitter locations and magnetic beamforming as compared to other benchmark schemes with non-adaptive or heuristic currents allocation and transmitters placement. Last, we extend the node placement problem to the more general case of two-dimensional (2D) region, and draw the key insights.
Dispatching unmanned aerial vehicles (UAVs) to harvest sensing-data from distributed sensors is expected to significantly improve the data collection efficiency in conventional wireless sensor networks (WSNs). In this paper, we consider a UAV-enabled WSN, where a flying UAV is employed to collect data from multiple sensor nodes (SNs). Our objective is to maximize the minimum average data collection rate from all SNs subject to a prescribed reliability constraint for each SN by jointly optimizing the UAV communication scheduling and three-dimensional (3D) trajectory. Different from the existing works that assume the simplified line-of-sight (LoS) UAV-ground channels, we consider the more practically accurate angle-dependent Rician fading channels between the UAV and SNs with the Rician factors determined by the corresponding UAV-SN elevation angles. However, the formulated optimization problem is intractable due to the lack of a closed-form expression for a key parameter termed effective fading power that characterizes the achievable rate given the reliability requirement in terms of outage probability. To tackle this difficulty, we first approximate the parameter by a logistic (“S” shape) function with respect to the 3D UAV trajectory by using the data regression method. Then, the original problem is reformulated to an approximate form, which, however, is still challenging to solve due to its non-convexity. As such, we further propose an efficient algorithm to derive its suboptimal solution by using the block coordinate descent technique, which iteratively optimizes the communication scheduling, the UAV's horizontal trajectory, and its vertical trajectory. The latter two subproblems are shown to be non-convex, while locally optimal solutions are obtained for them by using the successive convex approximation technique. Finally, extensive numerical results are provided to evaluate the performance of the proposed algorithm and draw new insights on the 3D UAV trajectory under the Rician fading as compared to conventional LoS channel models.
