• 제목/요약/키워드: Power Allocation Optimization

검색결과 173건 처리시간 0.058초

Energy-Efficiency Power Allocation for Cognitive Radio MIMO-OFDM Systems

  • Zuo, Jiakuo;Dao, Van Phuong;Bao, Yongqiang;Fang, Shiliang;Zhao, Li;Zou, Cairong
    • ETRI Journal
    • /
    • 제36권4호
    • /
    • pp.686-689
    • /
    • 2014
  • This paper studies energy-efficiency (EE) power allocation for cognitive radio MIMO-OFDM systems. Our aim is to minimize energy efficiency, measured by "Joule per bit" metric, while maintaining the minimal rate requirement of a secondary user under a total power constraint and mutual interference power constraints. However, since the formulated EE problem in this paper is non-convex, it is difficult to solve directly in general. To make it solvable, firstly we transform the original problem into an equivalent convex optimization problem via fractional programming. Then, the equivalent convex optimization problem is solved by a sequential quadratic programming algorithm. Finally, a new iterative energy-efficiency power allocation algorithm is presented. Numerical results show that the proposed method can obtain better EE performance than the maximizing capacity algorithm.

Cross-Layer Resource Allocation in Multi-interface Multi-channel Wireless Multi-hop Networks

  • Feng, Wei;Feng, Suili;Zhang, Yongzhong;Xia, Xiaowei
    • ETRI Journal
    • /
    • 제36권6호
    • /
    • pp.960-967
    • /
    • 2014
  • In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

Sensitivity Analysis on the Priority Order of the Radiological Worker Allocation Model using Goal Programming

  • Jung, Hai-Yong;Lee, Kun-Jai
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 1998년도 춘계학술발표회논문집(2)
    • /
    • pp.577-582
    • /
    • 1998
  • In nuclear power plant, it has been the important object to reduce the occupational radiation exposure (ORE). Recently, the optimization concept of management science has been studied to reduce the ORE in nuclear power plant. In optimization of the worker allocation, the collective dose, working time, individual dose, an total number of worker must be considered and their priority orders must be thought because the main constraint is necessary for determining the constraints variable of the radiological worker allocation problem. The ultimate object of this study s to look into the change of the optimal allocation of the radiological worker as priority order changes. In this study, the priority order is the characteristic of goal programming that is a kind of multi-objective linear programming. From a result of study using goal programming, the total number of worker and collective dose of worker have changed as the priority order has changed and the collective dose limit have played an important role in reducing the ORE.

  • PDF

Throughput maximization for underlay CR multicarrier NOMA network with cooperative communication

  • Manimekalai, Thirunavukkarasu;Joan, Sparjan Romera;Laxmikandan, Thangavelu
    • ETRI Journal
    • /
    • 제42권6호
    • /
    • pp.846-858
    • /
    • 2020
  • The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

A Joint Allocation Algorithm of Computing and Communication Resources Based on Reinforcement Learning in MEC System

  • Liu, Qinghua;Li, Qingping
    • Journal of Information Processing Systems
    • /
    • 제17권4호
    • /
    • pp.721-736
    • /
    • 2021
  • For the mobile edge computing (MEC) system supporting dense network, a joint allocation algorithm of computing and communication resources based on reinforcement learning is proposed. The energy consumption of task execution is defined as the maximum energy consumption of each user's task execution in the system. Considering the constraints of task unloading, power allocation, transmission rate and calculation resource allocation, the problem of joint task unloading and resource allocation is modeled as a problem of maximum task execution energy consumption minimization. As a mixed integer nonlinear programming problem, it is difficult to be directly solve by traditional optimization methods. This paper uses reinforcement learning algorithm to solve this problem. Then, the Markov decision-making process and the theoretical basis of reinforcement learning are introduced to provide a theoretical basis for the algorithm simulation experiment. Based on the algorithm of reinforcement learning and joint allocation of communication resources, the joint optimization of data task unloading and power control strategy is carried out for each terminal device, and the local computing model and task unloading model are built. The simulation results show that the total task computation cost of the proposed algorithm is 5%-10% less than that of the two comparison algorithms under the same task input. At the same time, the total task computation cost of the proposed algorithm is more than 5% less than that of the two new comparison algorithms.

Joint Relay Selection and Resource Allocation for Delay-Sensitive Traffic in Multi-Hop Relay Networks

  • Sha, Yan;Hu, Jufeng;Hao, Shuang;Wang, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3008-3028
    • /
    • 2022
  • In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

Optimal User Density and Power Allocation for Device-to-Device Communication Underlaying Cellular Networks

  • Yang, Yang;Liu, Ziyang;Min, Boao;Peng, Tao;Wang, Wenbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권2호
    • /
    • pp.483-503
    • /
    • 2015
  • This paper analyzes the optimal user density and power allocation for Device-to-Device (D2D) communication underlaying cellular networks on multiple bands with the target of maximizing the D2D transmission capacity. The entire network is modeled by Poisson point process (PPP) which based on stochastic geometry. Then in order to ensure the outage probabilities of both cellular and D2D communication, a sum capacity optimization problem for D2D system on multiple bands is proposed. Using convex optimization, the optimal D2D density is obtained in closed-form when the D2D transmission power is determined. Next the optimal D2D transmission power is obtained in closed-form when the D2D density is fixed. Based on the former two conclusions, an iterative algorithm for the optimal D2D density and power allocation on multiple bands is proposed. Finally, the simulation results not only demonstrate the D2D performance, density and power on each band are constrained by cellular communication as well as the interference of the entire system, but also verifies the superiority of the proposed algorithm over sorting-based and removal algorithms.

A Relay Selection and Power Allocation Scheme for Cooperative Wireless Sensor Networks

  • Qian, Mujun;Liu, Chen;Fu, Youhua;Zhu, Weiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1390-1405
    • /
    • 2014
  • This paper investigates optimal relay selection and power allocation under an aggregate power constraint for cooperative wireless sensor networks assisted by amplify-and-forward relay nodes. By considering both transmission power and circuit power consumptions, the received signal-to-noise ratio (SNR) at the destination node is calculated, based on which, a relay selection and power allocation scheme is developed. The core idea is to adaptively adjust the selected relays and their transmission power to maximize the received SNR according to the channel state information. The proposed scheme is derived by recasting the optimization problem into a three-layered problem-determining the number of relays to be activated, selecting the active relays, and performing power allocation among the selected relays. Monte Carlo simulation results demonstrate that the proposed scheme provides a higher received SNR and a lower bit error rate as compared to the average power allocation scheme.

Energy-Aware Hybrid Cooperative Relaying with Asymmetric Traffic

  • Chen, Jian;Lv, Lu;Geng, Wenjin;Kuo, Yonghong
    • ETRI Journal
    • /
    • 제37권4호
    • /
    • pp.717-726
    • /
    • 2015
  • In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.

Optimal Thrust Allocation for Dynamic Positioning of Deep-sea Working Vessel

  • Zhao, Luman;Roh, Myung-Il;Hong, Jeong-Woo
    • Journal of Advanced Research in Ocean Engineering
    • /
    • 제1권2호
    • /
    • pp.94-105
    • /
    • 2015
  • In this study, a thruster allocation method of a deep-sea working vessel was proposed with the aims of producing the demanded generalized forces and moment for dynamic positioning while at the same time minimizing total power. For this, an optimization problem for thrust allocation was mathematically formulated with design variables, objective function, and constraints. The genetic algorithms (GA) was used to solve the formulated problem. The proposed method was applied to an example of finding optimal thrust allocation of the deep-sea working vessel having 5 thrusters. The result showed that the method could be used to determine better strategy for thruster allocation of the vessel as compared to existing study.