• IEIE Transactions on Smart Processing and Computing
• /
• 제1권1호
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.482-483
• /
• 2008

This paper compares particle swarm optimization techniques for PV allocation planning problem in power systems. PV allocation planning problem is formulated as a mixed-integer nonlinear problem. Five variants of PSO techniques are investigated for the applicability on the PV allocation problem. Namely, PSO with constant inertia weight approach (PSO-CIW), PSO with time varying inertia weight (PSO-TVIW), PSO with random inertia weight (PSO-RIW), PSO with constriction factor (PSO-CF) and PSO with time varying acceleration coefficients (PSO-TVAC).

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• 한국지능시스템학회논문지
• /
• 제21권6호
• /
• pp.792-797
• /
• 2011

본 논문은 배전망에서의 PV (photovoltaic) 발전 시스템의 최적 배치 문제를 이산 입자 군집 최적화 (DPSO, discrete particle swarm optimization)를 이용하여 해를 구할 때 DPSO에 포함되어야 하는 이산화 단계를 위한 하이브리드 이산화 기법의 적용에 대하여 논한다. 이를 위해 PSO 반복단계에서 목적 함수 값과 최적화 속도를 입력 파라미터로 하는 규칙 기반 전문가 시스템을 제안하고 이산 변수를 포함하여 표현되는 PV 시스템 배치 문제의 최적해를 구하는데 적용하였다. 다수준 이산화를 위하여 간단한 라운딩과 sigmoid 함수를 이용한 3단계 및 5단계 이산화 기법을 하이브리드 형태로 적용하였다. 규칙 기반 전문가 시스템을 적용하여 각 PSO 과정에서 적절한 이산화 기법을 선택함으로써 기존의 DPSO보다 좋은 성능의 최적화가 가능하도록 하였다.

• Journal of Power Electronics
• /
• 제15권5호
• /
• pp.1348-1357
• /
• 2015

Under traditional unified power quality conditioner (UPQC) control, a UPQC series converter (SC) is mainly used to handle grid-side power quality problems while its parallel converter (PC) is mainly used to handle load-side power quality problems. The SC and PC are relatively independent. The SC is usually in standby mode and it only runs when the grid voltage abruptly changes. In this paper, novel UPQC coordinated control strategies are proposed which use the SC to share the reactive power compensation function of the PC especially without grid-side power quality problems. However, in some cases, there will be a circulating current between the SC and the PC, which will probably influence the compensation fashion, the compensation capacity, or the normal work of the UPQC. Through an active power circulation analysis, strategies with and without a circulating current are presented which fuses the reactive power allocation strategy of the SC and the PC, the composite control strategy of the SC and the compensation strategy of the DC storage unit. Both of the strategies effectively solve the SC long term idle problem, limit the influence of the circulating current, optimize all of the UPQC units and reduce the production cost. An analysis, along with simulation andexperimental results, is presented to verify the feasibility and effectiveness of the proposed control strategies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4865-4886
• /
• 2017

The user experience of practical indoor power line communication (PLC) applications is greatly affected by the system quality-of-service (QoS) criteria. With a general broadcast-and-multi-access (BMA) relay scheme, in this work we investigate the joint source and relay power optimization of the amplify-and-forward (AF) relay systems used under indoor broad-band PLC environments. To achieve both time diversity and spatial diversity from the relay-involved PLC channel, which is time-varying in nature, the source node has been configured to transmit an identical message twice in the first and second signalling phase, respectively. The QoS constrained power allocation problem is not convex, which makes the global optimal solution is computationally intractable. To solve this problem, an alternating optimization (AO) method has been adopted and decomposes this problem into three convex/quasi-convex sub-problems. Simulation results show the fast convergence and short delay of the proposed algorithm under realistic relay-involved PLC channels. Compared with the two-hop and broadcast-and-forward (BF) relay systems, the proposed general relay system meets the same QoS requirement with less network power assumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.3821-3841
• /
• 2019

Cloud radio access networks (C-RANs) have been regarded in recent times as a promising concept in future 5G technologies where all DSP processors are moved into a central base band unit (BBU) pool in the cloud, and distributed remote radio heads (RRHs) compress and forward received radio signals from mobile users to the BBUs through radio links. In such dynamic environment, automatic decision-making approaches, such as artificial intelligence based deep reinforcement learning (DRL), become imperative in designing new solutions. In this paper, we propose a generic framework of autonomous cell activation and customized physical resource allocation schemes for energy consumption and QoS optimization in wireless networks. We formulate the problem as fractional power control with bandwidth adaptation and full power control and bandwidth allocation models and set up a Q-learning model to satisfy the QoS requirements of users and to achieve low energy consumption with the minimum number of active RRHs under varying traffic demand and network densities. Extensive simulations are conducted to show the effectiveness of our proposed solution compared to existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4835-4855
• /
• 2015

TV white space (TVWS) is showing promise to become the first widespread practical application of cognitive technology. In fact, regulators worldwide are beginning to allow access to the TV band for secondary users, on the provision that they access the geolocation database. Device-to-device (D2D) can improve the spectrum efficiency, but large-scale D2D communications that underlie TVWS may generate undesirable interference to TV receivers and cause severe mutual interference. In this paper, we use an established geolocation database to investigate the power allocation problem, in order to maximize the total sum throughput of D2D links in TVWS while guaranteeing the quality-of-service (QoS) requirement for both D2D links and TV receivers. Firstly, we formulate an optimization problem based on the system model, which is nonconvex and intractable. Secondly, we use an effective approach to convert the original problem into a series of convex problems and we solve these problems using interior point methods that have polynomial computational complexity. Additionally, we propose an iterative algorithm based on the barrier method to locate the optimal solution. Simulation results show that the proposed algorithm has strong performance with high approximation accuracy for both small and large dimensional problems, and it is superior to both the active set algorithm and genetic algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2496-2512
• /
• 2021

The requirements for powerful computing capability, high capacity, low latency and low energy consumption of emerging services, pose severe challenges to the fifth-generation (5G) network. As a promising paradigm, mobile edge networks can provide services in proximity to users by deploying computing components and cache at the edge, which can effectively decrease service delay. However, the coexistence of heterogeneous services and the sharing of limited resources lead to the competition between various services for multiple resources. This paper considers two typical heterogeneous services: computing services and content delivery services, in order to properly configure resources, it is crucial to develop an effective offloading and caching strategies. Considering the high energy consumption of 5G base stations, this paper considers the hybrid energy supply model of traditional power grid and green energy. Therefore, it is necessary to design a reasonable association mechanism which can allocate more service load to base stations rich in green energy to improve the utilization of green energy. This paper formed the joint optimization problem of computing offloading, caching and resource allocation for heterogeneous services with the objective of minimizing the on-grid power consumption under the constraints of limited resources and QoS guarantee. Since the joint optimization problem is a mixed integer nonlinear programming problem that is impossible to solve, this paper uses deep reinforcement learning method to learn the optimal strategy through a lot of training. Extensive simulation experiments show that compared with other schemes, the proposed scheme can allocate resources to heterogeneous service according to the green energy distribution which can effectively reduce the traditional energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.794-815
• /
• 2023

The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.