Energy-Spectral-Efficiency Tradeoff in Interference-Limited Wireless Networks

Spectral efficiency (SE) is an important metric in traditional wireless network design. However, as the development of high-data rate services and rapid increase of energy consumption, energy efficiency (EE) has received more and more attention. In this paper, we investigate the EE–SE tradeoff problem in interference-limited wireless networks. Different from previous researches, we try to optimize EE and SE simultaneously. Firstly, the problem is formulated as a multi-objective optimization problem (MOP), with the constraint of transmit power limit. Then, we convert the MOP to a single-objective optimization problem by the weighted linear sum method. We present an algorithm utilizing difference between two convex functions programming (DCP) to handle with SE optimization problem (SD). EE optimization problem can be solved by an algorithm (EFD) consists of fractional programming embedded with DCP. While for EE–SE tradeoff problem, a particle swarm optimization algorithm is proposed (ESTP) to deal with it. Simulation results validate that the proposed algorithm can efficiently balance EE and SE by adjusting the value of weighted coefficient, which could be used to design a flexible energy efficient network in the future.

     

Interference-aware node access scheme in UAV-aided VANET

In vehicular Ad Hoc network (VANET),frequent link handovers and channel interference can lead to increased transmission delay and decreased network throughput.To address the issues,unmanned aerial vehicle (UAV) were introduced to cooperate with vehicles and construct UAV-assisted air-ground integrated VANET.An interference-aware node access scheme was proposed.The node access problem was formulated as a multi-objective optimization problem considering link transmission rate,link handovers and transmit power.Then the optimization problem was decomposed into two convex optimization sub-problems by dual decomposition method,the sub-problem jointly optimizes handovers and link transmission rate while the sub-problem optimizes the transmit power based on link reliability.Finally,simulation results show that the proposed mechanism can effectively improve data delivery ratio,average end-to-end delay and network throughput.     

基于信息年龄优化的多信道无线网络调度方法

信息年龄(AoI)是近年来针对时间敏感类应用所提出的一种描述数据交付及时性的度量标准,它是从网络中目标节点的角度出发,衡量其最新收到的数据包的新鲜程度.在信道资源受限的多信道无线网络场景中,基于信息年龄的链路调度问题需要考虑信道资源和链路冲突的约束.针对上述问题,该文提出一种逐时隙调度链路进行数据传输的调度方法,以最小...     

无线供能移动边缘网络中计算时延最小化资源分配方法研究

针对无线供能移动边缘计算(MEC)网络,该文将计算时延定义为数据卸载与计算所消耗的时间,并提出一种节点计算时延之和最小化的多维资源分配方法。首先,在节点能量因果约束下,通过联合优化专用能量站工作时长、任务分割系数、节点计算频率和发射功率来建立一个计算时延之和最小化的多维资源分配问题。由于存在优化变量耦合与max-max函数,所建问题非凸且无法采用凸优化工具获取最优解。为此,通过引入一系列松弛变量和辅助变量来进行优化问题简化以及优化变量解耦,并在此基础上,通过深入分析简化问题的结构特性,提出一种基于二分法的迭代算法来求解原问题的最优解。最后,计算机仿真验证了所提迭代算法的正确性以及所提资源分配方法在计算时延方面的优越性。     

基于智能反射面的无线抗干扰通信方法

由于无线信道的开放性,当前无线通信系统愈发受到恶意干扰攻击. 为了提高无线通信干扰能力,提出了一种基于智能反射面（intelligent reflecting surface, IRS）的抗干扰通信方法. 针对IRS辅助的通信抗干扰系统,考虑在用户接收信干噪比约束和连续相移约束下,建立非线性、多变量耦合的功率最小化资源分配模型,以实现频谱和能量性能的双向提升. 利用交替优化和半正定松弛求解原变量耦合的非凸优化问题,以得到最优发射波束和IRS相移. 此外,针对模型求解复杂度高的问题,还提出了一种低复杂度算法以得到发射波束的低复杂度闭式解. 同时,进一步提出了一种实用且快速响应的经验算法,以应对时变高动态干扰. 仿真结果表明,与现有未引入IRS方案相比,所提算法在各种情况下收敛迅速,并且功率消耗和干扰容限都有约30 dB的性能提升.     

Computation energy efficiency maximization based resource allocation scheme in wireless powered mobile edge computing network

For wireless powered mobile edge computing (MEC) network,a system computation energy efficiency (CEE) maximization scheme by considering the limited computation capacity at the MEC server side was proposed.Specifically,a CEE maximization optimization problem was formulated by jointly optimizing the computing frequencies and execution time of the MEC server and the edge user(EU),the transmit power and offloading time of each EU,the energy harvesting time and the transmit power of the power beacon.Since the formulated optimization problem was a non-convex fractional optimization problem and hard to solve,the formulated problem was firstly transformed into a non-convex subtraction problem by means of the generalized fractional programming theory and then transform the subtraction problem into an equivalent convex problem by introducing a series of auxiliary variables.On this basis,an iterative algorithm to obtain the optimal solutions was proposed.Simulation results verify the fast convergence of the proposed algorithm and show that the proposed resource allocation scheme can achieve a higher CEE by comparing with other schemes.     

Full-duplex overlay cognitive wireless powered communication network using RF energy harvesting

In this paper, a novel full-duplex overlay cognitive wireless powered communication network (FD-OCWPCN) is proposed where a full-duplex (FD) hybrid-access point (H-AP) supports the full access of all battery-free secondary users (SUs). The H-AP broadcasts wireless power to empower the nearby SUs in the downlink (DL) phase while decoding the information transmitted uplink (UL) phase by the SUs, simultaneously. To overcome the self-interference (SI) phenomenon in FD-OCWPCN, the problem of maximizing the system sum-throughput with optimal UL-DL transmission/reception time and H-AP’s transmit power allocation is considered. This problem is non-convex under perfect/imperfect SI cancelation (SIC), so we employ the active interference temperature control and the gradient projection techniques to effectively reduce it into a convex problem. Closed-form expressions for the perfect/imperfect SIC cases are also derived. To assess the performance of the FD-OCWPCN, a comparison with a half-duplex OCWPCN (HD-OCWPCN) is provided. The achievable average sum-throughput for different FD/HD-OCWPCN is compared in the context of the average and peak transmit power at the H-AP, the number of SUs, path loss exponent and fairness metric. The simulation results depict the superiority of the FD-OCWPCN over the HD-OCWPCN for the perfect SIC and the effective imperfect SIC.

     

Joint Optimization of Transmit Power-Time and Bit Energy Efficiency in CDMA Wireless Sensor Networks

In this paper, we address the problem of minimizing energy consumption in a CDMA-based wireless sensor network (WSN). A comprehensive energy consumption model is proposed, which accounts for both the transmit and circuit energies. Energy consumption is minimized by jointly optimizing the transmit power and transmission time for each active node in the network. The problem is formulated as a non-convex optimization. Numerical as well as closed-form approximate solutions are provided. For the numerical solution, we show that the formulation can be transformed into a convex geometric programming (GP), for which fast algorithms, such as interior point method, can be applied. For the closed-form solution, we prove that the joint power/time optimization can be decoupled into two sequential sub-problems: optimization of transmit power with transmission time serving as a parameter, and then optimization of the transmission time. We show that the first sub-problem is a linear program while the second one can be well approximated as a convex programming problem. Taking advantage of these analytical results, we further derive the per-bit energy efficiency. Our results are verified through numerical examples and simulations     

Shortest path planning of a data mule in wireless sensor networks

Data mules are extensively used for data collection in wireless sensor networks (WSNs), which significantly reduces energy consumption at sensor nodes but increases the data delivery latency. In this paper, we focus on minimizing the length of the traveling path to reduce the data delivery latency. We first model the shortest path planning of a data mule as an optimization problem, and propose an optimal model and corresponding solving algorithm. The optimal model solution has high time complexity, mainly due to the parallel optimization of node visit arrangements and data access point (DAP) settings during the solution process, which is to obtain the shortest path result. In order to improve the computational efficiency, we next give the approximate model and its solving algorithm, which is mainly to decompose the path planning problem into the Traveling Salesman Problem (TSP) and nonlinear optimization problem, and optimize the two parts separately. The proposed approach is capable of expressing the influence of the communication range of each sensor node, which is suitable for more general application scenarios than the existing methods. Theoretical analysis and simulation results show that the solution has good performances in terms of path length and computational efforts.

     

MeMLO: Mobility-Enabled Multi-level Optimization Sensor Network

The paper presents a technique called as Mobility-Enabled Multi Level Optimization (MeMLO) that addressing the existing problem of clustering in wireless sensor net-work (WSN). The technique enables selection of aggregator node based on multiple optimization attribute which gives better decision capability to the clustering mechanism by choosing the best aggregator node. The outcome of the study shows MeMLO is highly capable of minimizing the halt time of mobile node that significantly lowers the transmit power of aggregator node. The simulation outcome shows negligible computational complexity, faster response time, and highly energy efficient for large scale WSN for longer simulation rounds as compared to conventional LEACH algorithm.

     

雾网络中基于统计分布的内容缓存与交付方案

作为5G中的一种重要模型，雾无线接入网络(Fog Radio Access Network, F-RAN)通过设备到设备通信和无线中继等技术获得了显著的性能增益，而边缘设备中合适的缓存则可以让内容缓存用户(Caching Users, CUs)向内容请求用户(Requesting Users, RUs)直接发送缓存内容，有效减小前传链路的负担和下载延迟。考虑一个F-RAN模型下用户发出请求并获得交付的场景，将每个CU的内容请求队列建模为独立的M/D/1模型，分析导出CUs缓存命中率和平均下载延迟关于内容缓存与交付方案的表达式，证明CUs缓存命中率与内容统计分布之间的联系有助于实现前者的近似最优解。针对在一段时间内的期望视角下建立的优化问题，提出了基于统计分布的算法并注意了执行时的交付控制。仿真结果表明，相较于现有缓存策略，优化内容整体统计分布的方案能够最大化CUs缓存命中率，同时减小平均下载延迟。     

无线供能反向散射通信中能耗最小化资源分配方法

针对无线供能反向散射通信网络,提出了一种满足传感设备通信需求及能量因果的专用能量站能耗最小化资源分配方法。在考虑非线性能量收集模型及不完美串行干扰消除基础上,通过联合优化专用能量站发射功率、传感设备反向散射通信时间、反向散射系数及其能量收集时间,构建了一个专用能量站能耗最小化的非凸多维资源分配问题。首先,构建辅助变量对反向散射系数与时间进行解耦,再利用目标函数是关于专用能量站发射功率的单调递减函数这一特性来设计一种基于二分法的迭代算法来获取原问题的最优解。仿真验证了所提算法的快速收敛性,同时,与同类算法相比,所提方法可为专用能量站节约更多的能量。     

A distributed utility‐based scheduling for peer‐to‐peer video streaming over wireless networks

Interactive multimedia applications such as peer‐to‐peer (P2P) video services over the Internet have gained increasing popularity during the past few years. However, the adopted Internet‐based P2P overlay network architecture hides the underlying network topology, assuming that channel quality is always in perfect condition. Because of the time‐varying nature of wireless channels, this hardly meets the user‐perceived video quality requirement when used in wireless environments. Considering the tightly coupled relationship between P2P overlay networks and the underlying networks, we propose a distributed utility‐based scheduling algorithm on the basis of a quality‐driven cross‐layer design framework to jointly optimize the parameters of different network layers to achieve highly improved video quality for P2P video streaming services in wireless networks. In this paper, the quality‐driven P2P scheduling algorithm is formulated into a distributed utility‐based distortion‐delay optimization problem, where the expected video distortion is minimized under the constraint of a given packet playback deadline to select the optimal combination of system parameters residing in different network layers. Specifically, encoding behaviors, network congestion, Automatic Repeat Request/Query (ARQ), and modulation and coding are jointly considered. Then, we provide the algorithmic solution to the formulated problem. The distributed optimization running on each peer node adopted in the proposed scheduling algorithm greatly reduces the computational intensity. Extensive experimental results also demonstrate 4–14 dB quality enhancement in terms of peak signal‐to‐noise ratio by using the proposed scheduling algorithm. Copyright © 2015 John Wiley & Sons, Ltd.     

Robust Joint Design of Transmit Beamforming and Receive Filter for TB-MIMO STAP Radar

In this paper, we consider the joint design of transmit beamforming and receive filter for transmit beamspace (TB) multiple-input multiple-output (MIMO) radar red space-time adaptive processing (STAP) under the target information uncertainty. The associated robust joint design problem is formulated by maximizing the signal-to-interference-plus-noise ratio (SINR) to guarantee the target detection performance. An iterative optimization procedure is developed to resolve the NP-hard joint design problem. The optimized transmit beamforming weight vector and receive filter exhibit superior performance in terms of output SINR. Several simulation examples are presented to demonstrate the effectiveness of the proposed algorithm.

     

On the interference management in wireless multi-user networks

A study on interference management schemes in wireless multi-user networks is presented. We analyze the interference management problem in cellular networks and show that interference management is an optimization problem, for which we propose a general formulation. Using this general formulations we show that different interference management approaches are either exact or approximated solutions to this optimization problem. For each radio resource management technique, we provide a general overview and discuss its relation vis-a-vie other interference management techniques. As a case study, we then apply the proposed general formulation on the interference management in OFDM wireless networks and show that it results in a joint transmit scheduling and dynamic sub-carrier and power allocation scheme. A polynomial-time heuristic algorithm is also proposed to solve the formulated optimization problem. The distinguishing feature of the proposed scheme is that it gives in one shot, the transmission scheduling, the sub-carriers assigned to each user, and the power allocated to each sub-carrier, based on a fair and efficient framework while satisfying the delay requirements of real-time users.     

IRS辅助的安全通信系统波束成形嵌套优化算法

智能反射面（Intelligent Reflecting Surface,IRS）是一种通过重新配置无线传播环境,提高无线通信网络安全性的绿色通信新技术。该文针对IRS辅助的多输入单输出安全通信系统,考虑在合法用户保密率约束下,联合优化基站处的发射波束成形和IRS处无源移相器的反射波束成形,使基站的发射功率最小。为了求解多变量耦合的非凸优化问题,我们提出了拉格朗日函数和粒子群嵌套优化算法,使用粒子群算法搜索IRS的反射波束成形,拉格朗日函数求解对应的发射波束成形,获得非凸优化问题的次优解。论文仿真比较了不同算法下基站所需的发射功率,结果表明所提算法基站所需发射功率更低。     

Online Power Control and Optimization for Energy Harvesting Communication System Based on State of Charge

In this paper, the online power control problem for energy harvesting wireless communication system with a finite storage capacity battery is addressed, where the channel state and energy harvesting rate are both unknown. A low complexity algorithm based online convex optimization is proposed to guarantee energy availability of energy harvesting node and maximize average long-term throughput. The proposed algorithm restricts maximum transmission power with the information of state of charge, and allocates transmission power based on historical information. In addition, energy availability constraint is given by rigorous theoretical analysis to guarantee the optimization of average long-term throughput. Simulations have been conducted to demonstrate the effectiveness of the algorithm without considering probability distribution of energy arrival or channel coefficients. The proposed algorithm outperforms counterparts in different energy harvested rates.

     

非对称协作通信中的时变功率分配算法

针对反射、散射影响下的非对称无线协作通信网络,提出了一种时变功率分配(Time Variant Power Allocation, TVPA)算法。根据无线协作网络中,各节点之间信道条件实时变化且不对称的特点,在信号传输过程中对信源节点和中继节点的发送信号功率进行优化分配。借助信道编码定理,将系统错误概率最小的非凸优化问题转化为最大化系统容量的凸优化问题来解。与固定功率分配(Fixed Power Allocation, FXPA)算法和平均功率分配(Average Power Allocation, AVPA)算法相比,该算法能充分利用无线信道的时变特性,重新分配功率以降低系统错误概率。在多种网络模型中的仿真结果表明,准静态瑞利衰落信道下,相比于FXPA算法,TVPA算法可获得多达5.5dB的比特错误概率性能增益。随着网络质量的进一步改善,该性能优势也逐步增大。      

Smart Edge Caching-Aided Partial Opportunistic Interference Alignment in HetNets

The development of the next-generation wireless networks are regarded as the essentials to embrace of Internet of Things (IoT) and edge computing in heterogeneous networks (HetNets). Due to the the spectrum scarcity problem and the large number of connectivity demand of IoT users, intelligent interference management for IoT is worthy of thorough investigation and should be well discussed with consideration on edge computing in heterogeneous networks (HetNets). Two crucial challenges in the context are: 1) placing edge cache based on dynamic request of IoT users, and 2) cache-enabled interference management with time-varying wireless channels. In this paper, we proposed smart edge caching-aided partial opportunistic interference alignment(POIA) with deep reinforcement learning for IoT downlink system in HetNets. Towards this end, the proposed scheme can update the base station (BS) cache dynamically, and then select the optimal cache-enabled POIA user group considering the time-varying user’s requests and time-varying wireless channels. To solve this problem efficiently, the reinforcement learning is exploited that can take advantage of a deep Q-learing to replace the system action. Extensive evaluations demonstrate that the proposed method is effectiveness according to sum rate and energy efficiency of IoT downlink transmission for HetNets.

     

移动无线传感网的生存时间优化算法研究

当sink节点位置固定不变时,分布在sink 节点周围的传感节点很容易成为枢纽节点,因转发较多的数据而过早失效。为解决上述问题,提出移动无线传感网的生存时间优化算法（LOAMWSN）。LOAMWSN算法考虑sink节点的移动,采用减聚类算法确定sink节点移动的锚点,采用最近邻插值法寻找能遍历所有锚点的最短路径近似解,采用分布式非同步Bellman-Ford算法构建sink节点k跳通信范围内的最短路径树。最终,传感节点沿着最短路径树将数据发送给sink节点。仿真结果表明：在节点均匀分布和非均匀分布的无线传感网中,LOAMWSN算法都可以延长网络生存时间、平衡节点能耗,将平均节点能耗保持在较低水平。在一定的条件下,比Ratio_w、TPGF算法更优。