• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.51-72
• /
• 2015

Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.154-158
• /
• 1997

This paper proposes a new resource allocation system where overall performance can be improved using production smoothing method. In economic point of view, market price is determined by the market mechanism that is subject to the law of demand and supply. Similarly, agents determine whether to allocate tasks to machines by profit and loss or not. In existing resource allocation system, tasks are exclusively allocated to agents with better manufacturing conditions, because they are evaluated by the only currency. But in the proposed resource allocation system, agents are evaluated by not only a currency but also machine specifications. Hereby, the production smoothing is achieved and we expect to improve system performance In this study, we propose a resource allocation system with consideration of Production Smoothing.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1503-1520
• /
• 2013

For multi-line insurance companies, allocating the risk capital to each line is a widely-accepted risk management exercise. In this article we consider several applications of the Euler capital allocation. First, we propose visual tools to present the diversification and the line-wise performance for a given loss portfolio so that the risk managers can understand the interactions among the lines. Secondly, on theoretical side, we prove that the Euler allocation is the directional derivative of the marginal or incremental allocation method, an alternative capital allocation rule in the literature. Lastly, we establish the equivalence between the mean-shortfall optimization and the RORAC optimization when the risk adjusted capital is the expected shortfall, and show how to construct the optimal insurance business mix that maximizes the portfolio RORAC. An actual loss sample of an insurance portfolio is used for numerical illustrations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권3호
• /
• pp.784-793
• /
• 2012

This paper deals with subcarrier allocation strategies for soft hand-over in OFDMA-based cellular systems. Two possible subcarrier allocation methods are considered for soft hand-over. One method is to use an identical subcarrier set between the two cells participating in the hand-over. The other is to use different subcarrier sets between the two cells. As expected, the different subcarrier strategy is better in terms of diversity order and BER than the identical subcarrier strategy. It will be shown that the BER performance difference between the two strategies is more noticeable with contiguous subcarrier allocation. But the different subcarrier strategy consumes twice more frequency resources than the other, and there is a trade-off between the two strategies in terms of BER and frequency resources. By considering the trade-off, we also propose a subcarrier allocation strategy for soft hand-over.

• 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.

• 제어로봇시스템학회논문지
• /
• 제16권5호
• /
• pp.510-516
• /
• 2010

In this paper, a dynamic GTS allocation method of wireless control networks is proposed for the use of factory automation using IEEE 802.15.4 MAC protocol. A superframe of IEEE 802.15.4 is applied to the transmission method of real-time periodic I/O data of wireless control systems within the limited time in factory environment. The method is proposed for efficient transmission of real-time periodic I/O traffic. The simulation results show the average network utilization and available I/O node numbers could be increased by the proposed method.

• 전기학회논문지
• /
• 제66권2호
• /
• pp.292-299
• /
• 2017

In this paper, multiple ESS(Energy Storage System) control strategy for microgrids is presented. Installation of ESS becomes mandatory when microgrids are used to supply high quality power to the loads. The one of main functions of the ESS is to maintain power balance. However ESS has limitation of its capacity and instantaneous injecting power. Power allocation method based on SOC(State Of Charge) of each ESS is proposed. P-Q control is employed as the basic control strategy for the distributed ESSs. By using the proposed method, the coefficients in the conventional P-Q control method are modified. The ESSs with higher SOC inject more active power, while those with lower SOC inject less, leading to more balanced SOC levels among the ESSs. The proposed method is demonstrated by simulation using PSCAD/EMTDC.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2233-2252
• /
• 2018

For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.

• 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.