We consider an intelligent reflecting surface (IRS)-aided mobile edge computing (MEC) system, where an IRS is deployed to assist computation offloading from two users to an access point connected with an edge cloud. For the IRS-aided data transmission, in contrast to the conventional non-orthogonal multiple-access (NOMA) and time-division multiple-access (TDMA), we propose a new flexible time-sharing NOMA scheme that allows users to flexibly divide their data into two parts transmitted via NOMA and TDMA, respectively, thus encapsulating both conventional NOMA and TDMA as special cases. We formulate an optimization problem to minimize the sum delay of the two users by designing the IRS passive reflection and users' computation-offloading scheduling under the IRS discrete-phase constraint. Although this problem is non-convex, we obtain its optimal solution for both the cases of infinite and finite cloud computing capacities. Furthermore, we show that NOMA and TDMA based transmissions are preferred in different scenarios, depending on the users' cloud-computing time as well as the rate discrepancy between NOMA and TDMA with IRS.
This paper studies the information-theoretic limits of a cognitive radio (CR) network under spectrum sharing with an existing primary radio (PR) network for wireless communications. In particular, the fading cognitive multiple-access channel (C-MAC) is studied, where multiple CR users transmit to the base station (BS) of the CR network under both individual transmit power constraints and a set of interference-power constraints each applied at one of the PR receivers. For the fading PR and CR channels, we consider the long-term (LT) or the short-term (ST) transmit-power constraint over the fading states at each CR transmitter, combined with the LT interference-power constraint at each PR receiver. In each case, we characterize the ergodic sum capacity of the corresponding fading C-MAC, which is defined as the maximum sum-rate of CR users averaged over all the fading sates. Furthermore, we derive in each case the conditions for the optimality of the time-division-multiple-access (TDMA) in the CR network, i.e., when it is optimal to schedule at most one CR user for transmission at each time to achieve the ergodic sum capacity of the fading C-MAC.
In this paper, we investigate a new type of channels named as "dying" channels, which are resulted in wireless networks subject to random fatal impacts, e.g., sensor networks under sudden physical attacks or cognitive radio networks with unpredictable primary user occupancy. Under such circumstances, it is critical to quantify how fast and reliable information can be collected over "dying" links. In this paper, we focus on a simple point-to-point communication setting and model the "dying" channel by the traditional if-block block-fading (BF) model subject to a fatal attack that may happen randomly in any of the K blocks. The resultant channel is non-ergodic and delay-limited in nature, and thus its information-theoretic limit can be measured by adopting the conventional outage capacity concept. An outage event in a "dying" channel could be caused by two mechanisms: fading over finite K blocks; and random attack within K blocks. In this paper, we present the general problem formulation to determine the outage capacity of the "dying" channel, as well as the corresponding optimal transmit power allocation over the K blocks, based upon the known probability distributions of both the fading channel and the attack time. The optimal power allocation turns out to be in general nonuniform with a decreasing profile over transmission blocks. In addition, there exists an optimal number of blocks over which the codeword is spanned. Some other interesting observations are also made pertinent to the optimal transmission over a "dying" channel.
No abstract is provided for this article.
This correspondence studies the downlink transmission in a multi-cell system, where multiple base stations (BSs) each with multiple antennas cooperatively design their respective transmit beamforming vectors to optimize the overall system performance. For simplicity, it is assumed that all mobile stations (MSs) are equipped with a single antenna each, and there is one active MS in each cell at one time. Accordingly, the system of interests can be modeled by a multiple-input single-output (MISO) interference channel (IC), termed as MISO-IC, with interference treated as noise. We propose a new method to characterize different rate-tuples for active MSs on the Pareto boundary of the achievable rate region for the MISO-IC, by exploring the relationship between the MISO-IC and the cognitive radio (CR) MISO channel. We show that each Pareto-boundary rate-tuple of the MISO-IC can be achieved in a decentralized manner when each of the BSs attains its own channel capacity subject to a certain set of interference-power constraints (also known as interference-temperature constraints in the CR system) at the other MS receivers. Furthermore, we show that this result leads to a new decentralized algorithm for implementing the multi-cell cooperative downlink beamforming.
In this letter, we consider an intelligent reflecting surface (IRS)-aided mobile edge computing (MEC) system, where an IRS is deployed to assist computation offloading from two users to an access point connected with an edge cloud. For the IRS-aided data transmission, in contrast to the conventional non-orthogonal multiple-access (NOMA) and time-division multiple-access (TDMA), we propose a new flexible time-sharing NOMA scheme that allows users to flexibly divide their data into two parts transmitted via NOMA and TDMA, respectively, thus encapsulating both conventional NOMA and TDMA as special cases. We formulate an optimization problem to minimize the sum delay of the two users by designing the IRS passive reflection and users' computation-offloading scheduling under the IRS discrete-phase constraint. Although this problem is non-convex, we obtain its optimal solution for both the cases of infinite and finite cloud computing capacities. Furthermore, we show that NOMA and TDMA based transmissions are preferred in different scenarios, depending on the users' cloud-computing time as well as the rate discrepancy between NOMA and TDMA with IRS.
This letter considers spectrum sharing between a primary multiuser multiple-input multiple-output (MIMO) wireless energy transfer (WET) system and a coexisting secondary point-to-point MIMO wireless information transmission (WIT) system, where WET generates interference to WIT and degrades its throughput performance. We show that due to the interference, the WIT system suffers from a loss of the degrees of freedom (DoF) proportional to the number of energy beams sent by the energy transmitter (ET), which, in general, needs to be larger than one in order to optimize the multiuser WET with user fairness consideration. To minimize the DoF loss in WIT, we further propose a new single-beam energy transmission scheme based on the principle of time sharing, where the ET transmits one of the optimal energy beams at each time. This new scheme achieves the same optimal performance for the WET system, and minimizes the impact of its interference to the WIT system.
Intelligent reflecting surface (IRS) has recently emerged as a new solution to enhance wireless communication performance via passive signal reflection. In this letter, we unlock the potential of IRS controller in relaying information and propose a novel IRS-assisted communication system with both IRS passive reflection and active relaying. Specifically, we jointly optimize the time allocations for decode-and-forward (DF) relaying by the IRS controller and the IRS passive beamforming to maximize the achievable rate of the proposed system. We also compare the rate performance of the proposed system with the conventional IRS without relaying, and reveal the conditions for one to outperform the other. Simulation results demonstrate that the proposed new design can significantly improve the coverage/rate performance of IRS-assisted systems.
We consider a three-dimensional (3D) unmanned aerial vehicle (UAV)-terrestrial base station (TBS) coordinated multi-point non-orthogonal multiple access (CoMP-NOMA) scheme where UAV coordinates with TBS to allow joint transmission for the terrestrial users. With the assistance of closed-form power allocation derivations, a joint user scheduling and power allocation (J-USPA) algorithm is proposed to obtain the optimal user scheduling solution, with the consideration of imperfect channel estimation. Moreover, considering the line of sight (LoS) and non-LoS factors in the air-ground channel, the 3D trajectory of UAV is designed to provide a flexible user-centric service. Numerical results verify that the 3D UAV-TBS CoMP-NOMA model and the J-USPA scheme have a superior performance in terms of sum rate of users over the TBS CoMP-NOMA and the UAV assisted NOMA systems without CoMP transmission.
Wireless communication with unmanned aerial vehicles (UAVs) is a promising technology for future communication systems. In this paper, we study energy-efficient UAV communication with a ground terminal via optimizing the UAV's trajectory, a new design paradigm that jointly considers both the communication throughput and the UAV's energy consumption. To this end, we first derive a theoretical model on the propulsion energy consumption of fixed-wing UAVs as a function of the UAV's flying speed, direction and acceleration, based on which the energy efficiency of UAV communication is defined. Then, for the case of unconstrained trajectory optimization, we show that both the rate-maximization and energy-minimization designs lead to vanishing energy efficiency and thus are energy-inefficient in general. Next, we introduce a practical circular UAV trajectory, under which the UAV's flight radius and speed are optimized to maximize the energy efficiency for communication. Furthermore, an efficient design is proposed for maximizing the UAV's energy efficiency with general constraints on its trajectory, including its initial/final locations and velocities, as well as maximum speed and acceleration. Numerical results show that the proposed designs achieve significantly higher energy efficiency for UAV communication as compared with other benchmark schemes.
Electric vehicle (EV) is a promising technological tool for diminishing environmental impact caused by gasoline-consumed transportation. Due to the limited battery capacity, EVs need to be charged frequently in a static charging station and thus waste large amounts of time being out of service. Research previously conducted in this topic have proposed solutions for deployment of charging lanes that can charge in-motion EVs. However, they cannot guarantee that every EV can be operational in their respective entire route. Meanwhile, we observe that EVs have repetitive motions and may cyclically encounter with each other which no prior research having been investigated. In addition, the development on the circuit design of energy transmit antennas can render EVs to be able to bi-directionally, highly efficiently transfer energy between themselves. These two observations enable us to distribute energy among EVs in a collaborative and interactive manner. We consider the cases of both loss-less and lossy energy transfer between EVs. In both cases, we formulate the problem of minimizing the time needed (or energy transferred) to reach a given energy distribution into a series of linear programming problems. When compared with a state-of-the-art algorithm, extensive simulation results show that the proposed algorithms can reduce the balancing time and energy loss by up to 70.60% and 36.59%, respectively.
This paper studies an unmanned aerial vehicle (UAV)-enabled multicasting system, where a UAV is dispatched to disseminate a common file to a set of ground terminals (GTs). We aim to design the UAV trajectory to minimize its mission completion time, while ensuring that each GT successfully recovers the file with a desired high probability. The formulated problem is nonconvex and difficult to be solved in its original form. Therefore, we first derive an effective lower bound for the success file recovery probability of each GT. The problem is then reformulated in a more tractable form, where the UAV trajectory only needs to be designed to ensure the minimum connection time constraint with each GT, during which their distance is below a certain threshold. We show that without loss of optimality, the UAV trajectory consists of connected line segments only, which can be obtained by determining the optimal set of waypoints as well as the UAV speed along the path connecting the waypoints. We propose efficient schemes for the waypoint design based on a novel concept of virtual base station placement and by applying convex optimization. Furthermore, for fixed waypoints, the optimal UAV speed is efficiently obtained by solving a linear programming problem. Numerical results show that the proposed UAV-enabled multicasting with optimized trajectory design achieves significant performance gains over other benchmark schemes.
The coarse coal powder separator of the coal supply system of Hunjiang power plant boiler No.3 was modified improve the separating efficiency and reduce the flow resistance. The modification was summarized as: at the upper part, 36 slices of barriers were added in stead of original radial barriers; at the lower part, two rows of inertial separating plank (8 slices per row) were added.The gas-solid two-phase flow simulation by means of CFD software FLUENT6.0 was performed for original construction and modified one. The flow field, the powder volume fraction distribution and the pressure field were simulated. Numerical simulation was verified by in-situ test data and the results show that the separator construction modification is successful: the separating efficiency increases by more than 20%,the flow resistance reduces by about 500 Pa.Taking the No.3 boiler as an example, if the boiler works 6000h per year, the electricity of 1.8 million kW·h can be saved,that is equivalent to 450 000 RMB.
