• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.3-4
• /
• 2008

We propose an efficient uplink bandwidth request-allocation algorithm for variable-rate real-time service in IEEE 802.11 broadband wireless access networks. By introducing a notion of target delay under the framework of dual feedback, the proposed algorithm can assure the desired level of QoS while minimizing wastage of bandwidth allocation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.2
• /
• pp.63-77
• /
• 2015

The territorial air that our sovereignty is being applied to is divided into several zones and areas. In order to use and manage them effectively, these zones and areas have laws, regulations and rules. The number of airspaces (MOA : Military Operation Area) and Ranges that are used in the military are limited and many airbases are being used for training. Currently the central department manages some, and the rest are independent airbases. Therefore, efficient allocation is not performed and the result occurs where airspaces and ranges are allocated unnecessarily. This is increasing the workload of staff leading to unnecessary re-work. To slove problem, this study proposed models for allocating airspaces and ranges using goal programming with multi-objective functions of minimizing the deviations of the target values.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3004-3015
• /
• 2014

This letter proposes an efficient joint resource allocation scheme for OFDM-based cooperative cognitive radio networks (CRNs) under various practical limitations. Compared with those traditional approaches, which guarantee the transmission rates of cognitive users, the proposed scheme ensures that cognitive users are maintained in proportion to the predefined target rates. Numerical simulation shows that the proposed scheme can achieve a reasonable tradeoff between performance and computational complexity.

• Journal of Information Processing Systems
• /
• v.20 no.1
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.28-44
• /
• 1987

This thesis presents a model to assign targets and to determine gun ammunitions required for naval surface warfare. Delivery errors of weapon systems and vulnerability of moving targets are analyzed, then probability to kill moving battle sihps is computed. A weapon-target allocation model is proposed by using the Out of Kilter technique. A model to determine ammunitions required for killing moving targets is also designed. The models are evaluated by simulation and sensitivity analysis.

• Journal of the Society of Naval Architects of Korea
• /
• v.57 no.1
• /
• pp.45-51
• /
• 2020

In this study, we developed an allocation optimization system for supply chain management in the shipbuilding and offshore construction industry. Supply chain operation is a way of operating manufacturing company responsible for the procurement of outfitting parts. The method about how to allocate the manufacturing volume to each partner company includes important decisions. According to the allocation method, the stability of the material supplied to the final installation process is guaranteed. We improved the allocation method that was previously decided by the person in charge. Based on the optimization engine, a system is developed that can automatically allocate the production volume. For optimization model configuration, factors affecting the volume allocation were analyzed and modeled as constraint factors. A target function is defined to minimize the difference in the load variance of each partner company. In order to use the same type of volume allocation engine for various outfitting products, the amount of work done by the partner company was standardized. We developed an engine that can allocate the same production load of each production partner. Using this engine, the operating system was developed and applied to the actual offshore project. It has been confirmed that the work load variance of suppliers can be maintained uniformly using the optimization engine rather than manual method. By this system, we stabilize the manufacturing process of partner suppliers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1057-1073
• /
• 2015

In this paper, we consider cooperative D2D communications in cellular networks. More precisely, a cellular user leases part of its spectrum to facilitate the D2D communication with a goal of improving the energy efficiency of a D2D pair. However the D2D pair is untrusted to the cellular user, such resource sharing may result in the information of this cellular user unsecured. In order to motivate the cellular user's generosity, this D2D pair needs to help the cellular user maintain a target secrecy rate. To address this issue, we formulate a joint spectrum and power allocation problem to maximize the energy efficiency of the D2D communication while guaranteeing the physical layer security of the cellular user. Then, a theorem is proved to indicate the best resource allocation strategy, and accordingly, an algorithm is proposed to find the best solution to this resource allocation problem. Numerical results are finally presented to verify the validity and effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.855-859
• /
• 2009

In this paper, we introduce the estimation method by Risk or SIL(Safety Integrity Level) for the criterion of safety assurance and summarize each application method and target. IEC 62278(EN 50126) which is international standard for the specification and verification of the railway system RAMS indicate a criterion of safety assurance. Especially, it recommend the safety verification by continuous verification as the order of requirement establishment, design, manufacture, installation, operation, and maintenance for the equipment not easy to quantify the operation environment. In this paper, we study the SIL requirement allocation method relating to internal new system development and existing system improvement by analysing SIL recommendations which were used to understand SIL for a train control equipment in 1990s in IRSE and theoretically their allocation background. This paper help the safety management of Korea train control system to develope the quantitative management procedure as international level by analyzing the SIL requirement allocation by operation agency and the right SIL verification procedure by manufacture and indicating the example to assure safety because it is necessary for improvement and localization for the Korea train control system having highly dependence on aboard technology.

• Journal of the military operations research society of Korea
• /
• v.29 no.2
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.