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

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

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

A QEE-Oriented Fair Power Allocation for Two-tier Heterogeneous Networks

  • Ji, Shiyu;Tang, Liangrui;He, Yanhua;Li, Shuxian;Du, Shimo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권5호
    • /
    • pp.1912-1931
    • /
    • 2018
  • In future wireless network, user experience and energy efficiency will play more and more important roles in the communication systems compared to their roles at present. Quality of experience (QoE) and Energy Efficiency (EE) become the widely used metrics. In this paper, we study a combinatorial problem of QoE and EE and investigate a fair power allocation in heterogeneous networks. We first design a new metric, QoE-aware EE (QEE) to reflect the relationship of QoE and energy. Then, the concept of Utopia QEE is introduced, which is defined as the achievable maximum QEE in ideal conditions, for each user. Finally, we transform the power allocation process to an optimization of ratio of QEE and Utopia QEE and use invasive weed optimization (IWO) algorithm to solve the optimization problem. Numerical simulation results indicate that the proposed algorithm can get converged and efficiently improve the system energy efficiency and the QoE for each user.

A Joint Resource Allocation Scheme for Relay Enhanced Multi-cell Orthogonal Frequency Division Multiple Networks

  • Fu, Yaru;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.288-307
    • /
    • 2013
  • This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

Bidirectional Link Resource Allocation Strategy in GFDM-based Multiuser SWIPT Systems

  • Xu, Xiaorong;Sun, Minghang;Zhu, Wei-Ping;Feng, Wei;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권1호
    • /
    • pp.319-333
    • /
    • 2022
  • In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

다중사용자 OFDM 광대역 무선인터넷 시스템의 자원할당 방법 (Resouce Allocation for Multiuser OFDM Systems)

  • 정용주;백천현;김후곤
    • 한국경영과학회지
    • /
    • 제32권3호
    • /
    • pp.33-46
    • /
    • 2007
  • This study deals with the adaptive multiuser OFDM (Orthogonal Frequency Division Multiplexing) system which adjusts the resource allocation according to the environmental changes in such as wireless and quality of service required by users. The resource allocation includes subcarrier assignment to users, modulation method and power used for subcarriers. We first develop a general optimization model which maximizes data throughput while satisfying data rates required by users and total power constraints. Based on the property that this problem has the 0 duality gap, we apply the subgradient dual optimization method which obtains the solution of the dual problem by iteration of simple calculations. Extensive experiments with realistic data have shown that the subgradient dual method is applicable to the real world system, and can be used as a dynamic resource allocation mechanism.

Joint Opportunistic Spectrum Access and Optimal Power Allocation Strategies for Full Duplex Single Secondary User MIMO Cognitive Radio Network

  • Yue, Wenjing;Ren, Yapeng;Yang, Zhen;Chen, Zhi;Meng, Qingmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.3887-3907
    • /
    • 2015
  • This paper introduces a full duplex single secondary user multiple-input multiple-output (FD-SSU-MIMO) cognitive radio network, where secondary user (SU) opportunistically accesses the authorized spectrum unoccupied by primary user (PU) and transmits data based on FD-MIMO mode. Then we study the network achievable average sum-rate maximization problem under sum transmit power budget constraint at SU communication nodes. In order to solve the trade-off problem between SU's sensing time and data transmission time based on opportunistic spectrum access (OSA) and the power allocation problem based on FD-MIMO transmit mode, we propose a simple trisection algorithm to obtain the optimal sensing time and apply an alternating optimization (AO) algorithm to tackle the FD-MIMO based network achievable sum-rate maximization problem. Simulation results show that our proposed sensing time optimization and AO-based optimal power allocation strategies obtain a higher achievable average sum-rate than sequential convex approximations for matrix-variable programming (SCAMP)-based power allocation for the FD transmission mode, as well as equal power allocation for the half duplex (HD) transmission mode.

Joint Subcarrier and Bit Allocation for Secondary User with Primary Users' Cooperation

  • Xu, Xiaorong;Yao, Yu-Dong;Hu, Sanqing;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권12호
    • /
    • pp.3037-3054
    • /
    • 2013
  • Interference between primary user (PU) and secondary user (SU) transceivers should be mitigated in order to implement underlay spectrum sharing in cognitive radio networks (CRN). Considering this scenario, an improved joint subcarrier and bit allocation scheme for cognitive user with primary users' cooperation (PU Coop) in CRN is proposed. In this scheme, the optimization problem is formulated to minimize the average interference power level at the PU receiver via PU Coop, which guarantees a higher primary signal to interference plus noise ratio (SINR) while maintaining the secondary user total rate constraint. The joint optimal scheme is separated into subcarrier allocation and bit assignment in each subcarrier via arith-metric geo-metric (AM-GM) inequality with asymptotical optimization solution. Moreover, the joint subcarrier and bit optimization scheme, which is evaluated by the available SU subcarriers and the allocated bits, is analyzed in the proposed PU Coop model. The performance of cognitive spectral efficiency and the average interference power level are investigated. Numerical analysis indicates that the SU's spectral efficiency increases significantly compared with the PU non-cooperation scenario. Moreover, the interference power level decreases dramatically for the proposed scheme compared with the traditional Hughes-Hartogs bit allocation scheme.

Resource Allocation based on Quantized Feedback for TDMA Wireless Mesh Networks

  • Xu, Lei;Tang, Zhen-Min;Li, Ya-Ping;Yang, Yu-Wang;Lan, Shao-Hua;Lv, Tong-Ming
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권3호
    • /
    • pp.160-167
    • /
    • 2013
  • Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

  • PDF

Transmit Antenna Selection for Quadrature Spatial Modulation Systems with Power Allocation

  • Kim, Sangchoon
    • International journal of advanced smart convergence
    • /
    • 제9권1호
    • /
    • pp.98-108
    • /
    • 2020
  • We consider transmit antenna selection combined with power allocation for quadrature spatial modulation (QSM) systems to improve the error rate performance. The Euclidean distance-based joint optimization criterion is presented for transmit antenna selection and power allocation in QSM. It requires an exhaustive search and thus high computational complexity. Thus its reduced-complexity algorithm is proposed with a strategy of decoupling, which is employed to successively find transmit antennas and power allocation factors. First, transmit antennas are selected without considering power allocation. After selecting transmit antennas, power allocation factors are determined. Simulation results demonstrate considerable performance gains with lower complexity for transmit antenna selected QSM systems with power allocation, which can be achieved with limited rate feedback.

Joint optimization of beamforming and power allocation for DAJ-based untrusted relay networks

  • Yao, Rugui;Lu, Yanan;Mekkawy, Tamer;Xu, Fei;Zuo, Xiaoya
    • ETRI Journal
    • /
    • 제40권6호
    • /
    • pp.714-725
    • /
    • 2018
  • Destination-assisted jamming (DAJ) is usually used to protect confidential information against untrusted relays and eavesdroppers in wireless networks. In this paper, a DAJ-based untrusted relay network with multiple antennas installed is presented. To increase the secrecy, a joint optimization of beamforming and power allocation at the source and destination is studied. A matched-filter precoder is introduced to maximize the cooperative jamming signal by directing cooperative jamming signals toward untrusted relays. Then, based on generalized singular-value decomposition (GSVD), a novel transmitted precoder for confidential signals is devised to align the signal into the subspace corresponding to the confidential transmission channel. To decouple the precoder design and optimal power allocation, an iterative algorithm is proposed to jointly optimize the above parameters. Numerical results validate the effectiveness of the proposed scheme. Compared with other schemes, the proposed scheme shows significant improvement in terms of security performance.