Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation

2012 ◽  
Vol 22 (3) ◽  
pp. 862-878 ◽  
Author(s):  
Hideaki Iiduka
Keyword(s):  
Iterative Algorithm ◽  
Nonconvex Optimization ◽  
Bandwidth Allocation ◽  
Optimization Problem ◽  
Network Bandwidth

scholarly journals Energy Efficiency Maximization for UAV-Assisted Emergency Communication Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Haibin Niu ◽  
Xinyu Zhao ◽  
Liming Hou ◽  
Dongjun Ma
Keyword(s):  
Energy Efficiency ◽  
Communication Networks ◽  
Nonconvex Optimization ◽  
Bandwidth Allocation ◽  
Optimization Problem ◽  
Energy Savings ◽  
Low Cost ◽  
Optimization Technique ◽  
Base Station ◽  
Effective Capacity

Using unmanned aerial vehicles (UAVs) in emergency communications is a promising technology because of their flexible deployment, low cost, and high mobility. However, due to the limited energy of the onboard battery, the service duration of the UAV is greatly limited. In this paper, we study an emerging energy-efficient UAV emergency network, where a UAV works as an aerial base station to serve a group of users with different statistical quality-of-service (QoS) constraints in the downlink. In particular, the energy efficiency of the UAV is defined as the sum effective capacity of the downlink users divided by the energy consumption of the UAV, which includes the energy consumed by communication and the energy consumed by hovering. Then, we formulate an optimization problem to maximize the energy efficiency of the UAV by jointly optimizing the UAV’s altitude, downlink transmit power, and bandwidth allocation while meeting a statistical delay QoS requirement for each user. The formulated optimization problem is a nonlinear nonconvex optimization problem of fractional programming, which is difficult to solve. In order to deal with the nonconvex optimization problem, the following two steps are used. First, we transform the fractional objective function into a tractable subtractive function. Second, we decompose the original optimization problem into three subproblems, and then, we propose an efficient iterative algorithm to obtain the energy efficiency maximization value by using the Dinkelbach method, the block coordinate descent, and the successive convex optimization technique. Extensive simulation results show that our proposed algorithm has significant energy savings compared with a benchmark scheme.

scholarly journals DiffPerf: Towards Performance Differentiation and Optimization with SDN Implementation

2021 ◽  
Author(s):  
Walid Aljoby
Keyword(s):  
Bandwidth Allocation ◽  
Network Bandwidth ◽  
Significant Step ◽  
Performance Differentiation

Our work, DiffPerf, is a key enabler which represents a significant step forward in network softwarization. It supports an agile and dynamic in-network bandwidth allocation in an ISP-centric settings and is implemented on largest community-led SDN platforms.

scholarly journals Power Allocation for Reducing PAPR of Artificial-Noise-Aided Secure Communication System

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Tao Hong ◽  
Geng-xin Zhang
Keyword(s):  
Power Allocation ◽  
Nonconvex Optimization ◽  
Communication System ◽  
Secure Communication ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Average Power ◽  
Finite Alphabet ◽  
Artificial Noise ◽  
Communication Signals

The research of improving the secrecy capacity (SC) of wireless communication system using artificial noise (AN) is one of the classic models in the field of physical layer security communication. In this paper, we consider the peak-to-average power ratio (PAPR) problem in this AN-aided model. A power allocation algorithm for AN subspaces is proposed to solve the nonconvex optimization problem of PAPR. This algorithm utilizes a series of convex optimization problems to relax the nonconvex optimization problem in a convex way based on fractional programming, difference of convex (DC) functions programming, and nonconvex quadratic equality constraint relaxation. Furthermore, we also derive the SC of the proposed signal under the condition of the AN-aided model with a finite alphabet and the nonlinear high-power amplifiers (HPAs). Simulation results show that the proposed algorithm reduces the PAPR value of transmit signal to improve the efficiency of HPA compared with benchmark AN-aided secure communication signals in the multiple-input single-output (MISO) model.

scholarly journals Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism

2018 ◽  
Vol 176 ◽  
pp. 01020
Author(s):  
Wang Chao ◽  
Zhang Dalong ◽  
Ran Xiaomin
Keyword(s):  
Load Balancing ◽  
Bandwidth Allocation ◽  
Link Quality ◽  
Communication Overhead ◽  
Response Delay ◽  
Allocation Model ◽  
Network Bandwidth ◽  
Delay Increase ◽  
Link Model ◽  
Network Status

Aiming at the problem of link congestion caused by the shortage of network bandwidth resources at the user end, this paper first proposes a regional load balancing idea. Then, for the problem of bandwidth resource allocation in regional load balancing, a bandwidth allocation model is established and a dynamic auction algorithm is proposed. The algorithm calculates the link quality and stability by constructing a link model, and introduces the auction bandwidth to the auctioneer's incentive degree to obtain the auction bidding function. The simulation results show that the algorithm can effectively improve the user's network status, reduce the service response delay, increase the throughput, and at the same time can effectively prevent the auction user's false bidding behavior, so that the auction quote quickly converges to the maximum quote, reduces the number of auctions, and reduces Communication overhead.

Sign in / Sign up

Export Citation Format

Share Document