• 한국국방경영분석학회지
• /
• 제26권2호
• /
• pp.143-158
• /
• 2000

This paper deals with the problem of redundancy allocation for the mixed reliability system in an optimal way. Two kinds of the reliability system are considered for optimal allocation of parallel redundancy. The problem is approached as the optimization problems using th standard method of dynamic programming(DP). The algorithm for solving the optimal redundancy allocation is proposed and then the DP algorithm is applied to two numerical examples such as maximization of reliability subject to an allowable cost-constraint and minimization of the total cost subject to the specified minimum reliability-constraint. A consequence of this study is that the developed computer program package can be applied to the optimal redundancy allocation for the mixed reliability system.

• 한국군사과학기술학회지
• /
• 제17권2호
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2022년도 춘계학술발표대회
• /
• pp.45-47
• /
• 2022

Mobile edge computing (MEC), which enables mobile terminals to offload computational tasks to a server located at the user's edge, is considered an effective way to reduce the heavy computational burden and achieve efficient computational offloading. In this paper, we study a multi-user MEC system in which multiple user devices (UEs) can offload computation to the MEC server via a wireless channel. To solve the resource allocation and task offloading problem, we take the total cost of latency and energy consumption of all UEs as our optimization objective. To minimize the total cost of the considered MEC system, we propose an DRL-based method to solve the resource allocation problem in wireless MEC. Specifically, we propose a Asynchronous Advantage Actor-Critic (A3C)-based scheme. Asynchronous Advantage Actor-Critic (A3C) is applied to this framework and compared with DQN, and Double Q-Learning simulation results show that this scheme significantly reduces the total cost compared to other resource allocation schemes

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권1호
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.43-56
• /
• 2009

In korean peninsular, aircraft defense with SAM (Surface-to-Air Missile) is very important because of short range of combat space in depth. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Set covering model which can handle both factors simultaneously and Multi-heuristic algorithm for solving allocation problem of the batteries and missile assignment problem in each battery. Genetic algorithm is used to decide optimal location of the batteries. To determine the number of SAM, a heuristic algorithm is applied for solving missile assignment problem. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of air defense operations.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.155-160
• /
• 2011

In distributed source localization where sensors transmit measurements to a fusion node, we address the sensor selection problem where the goal is to find the best set of sensors that maximizes localization accuracy when quantization of sensor measurements is taken into account. Since sensor selection depends heavily upon rate assigned to each sensor, joint optimization of rate allocation and sensor selection is required to achieve the best solution. We show that this task could be accomplished by solving the problem of allocating rates to each sensor so as to minimize the error in estimating the position of a source. Then we solve this rate allocation problem by using the generalized BFOS algorithm. Our experiments demonstrate that the best set of sensors obtained from the proposed sensor selection algorithm leads to significant improvements in localization performance with respect to the set of sensors determined from a sensor selection process based on unquantized measurements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4387-4404
• /
• 2015

The energy-efficient design of sensing-based spectrum sharing of a multi-input and multi-output (MIMO) cognitive radio (CR) system with imperfect multiple antenna spectrum sensing is investigated in this study. Optimal resource allocation strategies, including sensing time and power allocation schemes, are studied to maximize the energy efficiency (EE) of the secondary base station under the transmit power and interference power constraints. EE problem is formulated as a nonlinear stochastic fractional programming of a nonconvex optimal problem. The EE problem is transformed into its equivalent nonlinear parametric programming and solved by one-dimension search algorithm. To reduce searching complexity, the search range was founded by demonstration. Furthermore, simulation results confirms that an optimal sensing time exists to maximize EE, and shows that EE is affected by the spectrum detection factors and corresponding constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.565-581
• /
• 2019

This paper investigates the wireless powered two way relay network (WPTWRN), where two single-antenna users and one single-antenna relay firstly harvest energy from signals emitted by a multi-antenna power beacon (PB) and then two users exchange information with the help of the relay by using their harvested energies. In order to improve the energy transfer efficiency, energy beamforming at the PB is deployed. For such a network, to explore the performance limit of the presented WPTWRN, an optimization problem is formulated to obtain the achievable rate region bounds by jointly optimizing the time allocation and energy beamforming design. As the optimization problem is non-convex, it is first transformed to be a convex problem by using variable substitutions and semidefinite relaxation (SDR) and then solve it efficiently. It is proved that the proposed method achieves the global optimum. Simulation results show that the achievable rate region of the presented WPTWRN architecture outperforms that of wireless powered one way relay network architecture. Results also show that the relay location has significant impact on achievable rate region of the WPTWRN.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.252-256
• /
• 2012

We consider resource allocation in femto-cell networks to maximize the throughput while minimizing interference to macro-users nearby. This can be achieved by allocating spectrum resource in a cognitive radio way. The proposed resource allocation is performed in two steps; spectrum sensing and resource scheduling. The femto base station detects idle frequency assignments (FAs) free from the occupation by macro-users and then allocates sub-channels in an idle FA to femto-users, effectively managing the interference problem. Finally, the effectiveness of the proposed scheme is verified by computer simulations.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.863-865
• /
• 1988

This paper presents a optimal Var allocation algorithm for minimizing transmission line losses and improving voltage profile in a given system. In this paper, nodal input data is considered as Gaussian distribution with their mean value and their variance. A Stocastic Linear programming technique based on chance constrained method is applied, to solve the var allocation problem with probabilistic constraint. The test result in 6-Bus Model system showes that the voltage distribution of load buses is improved and the power loss is more reduced than before var allocation.