• ETRI Journal
• /
• v.40 no.6
• /
• pp.726-735
• /
• 2018

Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.443-450
• /
• 2013

We consider user pairing and resource allocation for the uplink of cellular systems employing virtual multiple input multiple output (MIMO). As a multiple access scheme, discrete Fourier transform spread orthogonal frequency division multiple access (DFTS-OFDMA) is adopted for more flexible resource allocation than single carrier (SC)-OFDMA adopted in the Long Term Evolution (LTE) system. We formulate the optimization problems of user pairing and resource allocation to maximize the throughput of the DFTS-OFDMA system under different constraints. The DFTS-OFDMA allowing non-contiguous subcarrier allocation and redundant user assignment provides a better throughput than the SC-FDMA at lower complexity in finding the optimal solution but at the cost of the increased control information indicating the allocated resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.624-632
• /
• 2005

We consider an adaptive bit-loading technique for bit interleaved coded modulation-orthogonal frequency division multiplexing(BICM-OFDM) systems. By adjusting transmission parameter of each subcarrier adaptively depending on the subchannel state, the performance of OFDM system can be improved dramatically. In this paper, the number of bits for each subcarrier is allocated to minimize bit error rate keeping the constant throughput for the adaptive transmission technique of BICM-OFDM system which can be applied to real time transmission. Also, We use the discrete Lagrange multiplier method to get the optimum solution under the integer bit allocation constraint. Simulation results show that computational amount of the proposed bit allocation technique is not high and BICM-OfDM system using the proposed technique can get the SNR gain by 2$\~$3 dB over nonadaptive one.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.59-64
• /
• 1979

The application of optimization techniques to the planning of industrial, economic, administrative and military activities with random technological coefficients has been extensively studied in the literature. Stochastic (linear) programs with simple recourse essentially model the allocation of scarce resources under uncertainty with linear penalties associated with shortages or surplus. This work on a problem with a discrete random resource vector, "The allocation of aircraft under uncertain demand" given in (1), is easily and efficiently handled by the application of the recently developed Wets' algorithm (8) for solving stochastic programs with simple recourse, which approves that such class of stochastic problems can be solved with the same efficiency as solving linear programs of the same size. It is known that the algorithm is also applicable to stochastic programs with continuous random demands for their approximate solutions.

• Journal of the Korea Society for Simulation
• /
• v.32 no.4
• /
• pp.41-58
• /
• 2023

As naval warfare changes to composite warfare that includes simultaneous engagements against surface, underwater, and air enemies, performance and tactical analysis are required to respond to naval warfare. In particular, for practical analysis of composite warfare, it is necessary to study engagement simulations that can appropriately utilize the limited performance resources of the detection system. This paper proposes a DEVS (Discrete Event Systems Specifications)-based simulation model for composite warfare analysis. The proposed model contains generalized models of combat platforms and armed objects to simulate various complex warfare situations. In addition, we propose a detection performance allocation algorithm that can be applied to a detection system model, considering the characteristics of composite warfare in which missions must be performed using limited detection resources. We experimented with the effectiveness of composite warfare according to the strength of the detection system's resource allocation, the enemy force's size, and the friendly force's departure location. The simulation results showed the effect of the resource allocation function on engagement time and success. Our model will be used as an engineering basis for analyzing the tactics of warships in various complex warfare situations in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.227-227
• /
• 2015

The Wairarapa Valley occupies a predominantly rural area in the lower North Island of New Zealand. It supports a mix of intensive farming (dairy), dry stock farming (sheep and beef cattle) and horticulture (including wine grapes). The valley floor is traversed by the Ruamahanga River, the largest river in the Wellington region with a total catchment area of 3,430 km2. Environmental, cultural and recreational values associated with this Ruamahanga River are very high. The alluvial gravel and sand aquifers of the Wairarapa Valley, support productive groundwater aquifers at depths of up to 100 metres below ground while the Ruamahanga River and its tributaries present a further source of water for users. Water is allocated to users via resource consents by Greater Wellington Regional Council (GWRC). With intensifying land use, demand from the surface and groundwater resources of the Wairarapa Valley has increased substantially in recent times and careful management is needed to ensure values are maintained. This paper describes the approach being taken to manage water resources in the Wairarapa Valley and redefine appropriate limits of sustainable water use. There are three key parts: Quantifying the groundwater resource. A FEFLOW numerical groundwater flow model was developed by GWRC. This modelling phase provided a much improved understanding of aquifer recharge and abstraction processes. It also began to reveal the extent of hydraulic connection between aquifer and river systems and the importance of moving towards an integrated (conjunctive) approach to allocating water. Development of a conjunctive management framework. The FEFLOW model was used to quantify the stream flow depletion impacts of a range of groundwater abstraction scenarios. From this, three abstraction categories (A, B and C) that describe diminishing degrees of hydraulic connection between ground and surface water resources were mapped in 3 dimensions across the Valley. Interim allocation limits have been defined for each of 17 discrete management units within the valley based on both local scale aquifer recharge and stream flow depletion criteria but also cumulative impacts at the valley-wide scale. These allocation limits are to be further refined into agreed final limits through a community-led decision making process. Community involvement in the limit setting process. Historically in New Zealand, limits for sustainable resource use have been established primarily on the basis of 'hard science' and the decision making process has been driven by regional councils. Community involvement in limit setting processes has been through consultation rather than active participation. Recent legislation in the form of a National Policy Statement on Freshwater Management (2011) is reforming this approach. In particular, collaborative consensus-based decision making with active engagement from stakeholders is now expected. With this in mind, a committee of Wairarapa local people with a wide range of backgrounds was established in 2014. The role of this committee is to make final recommendations about resource use limits (including allocation of water) that reflect the aspirations of the communities they represent. To assist the committee in taking a holistic view it is intended that the existing numerical groundwater flow models will be coupled with with surface flow, contaminant transport, biological and economic models. This will provide the basis for assessing the likely outcomes of a range of future land use and resource limit scenarios.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.215-223
• /
• 2012

This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The general observations on the similarities and differences among the three algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource constrained project scheduling problems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.101-106
• /
• 2011

In this paper, our goal is to design the controller which operates a manufacturing system, discrete event system, guaranteeing user specification. In specially, based on supervisory control theory W. M. Wonham, our work consists in performing the controller using Petri nets possible parallelism. In addition, we consider the problem of allocation for resources sharing of the issues to consider when designing using Petri net. The controller can be generated by synthesis of user specification model and plant model after giving the management for the resource sharing. This created controller can control the deadlock and starvation which can occur in the case with resource sharing. Previous studies proposed the Constrained Synchronous Reachability graph to synthesis of the two Petri nets models. Therefore, we provide the controlled system which forbids a deadlock and starvation using the result of previous studies.