• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권8호
• /
• pp.1913-1925
• /
• 2012

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• 경영과학
• /
• 제26권1호
• /
• pp.209-223
• /
• 2009

In this paper, an analysis problem of repair levels and spare part allocation for MIME(Multi indenture multi echelon) systems is studied using simulation and meta-heuristics. We suggest a method to determine simultaneously repair levels and spare parts allocation to minimize the life cycle cost of MIME system under availability constraint. A simulated annealing method is used to analyze the repair levels and genetic algorithm is used to obtain the optimal allocation of spare parts. We also develop a simulation system to calculate the life cycle cost and system availability. Some numerical examples are also studied.

• 전자공학회논문지B
• /
• 제30B권4호
• /
• pp.130-137
• /
• 1993

In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.

• Journal of information and communication convergence engineering
• /
• 제17권3호
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.319-333
• /
• 2022

In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

• Journal of Information Processing Systems
• /
• 제20권2호
• /
• pp.226-238
• /
• 2024

Recently, multi-access edge computing (MEC) has emerged as a promising technology to alleviate the computing burden of vehicular terminals and efficiently facilitate vehicular applications. The vehicle can improve the quality of experience of applications by offloading their tasks to MEC servers. However, channel conditions are time-varying due to channel interference among vehicles, and path loss is time-varying due to the mobility of vehicles. The task arrival of vehicles is also stochastic. Therefore, it is difficult to determine an optimal offloading with resource allocation decision in the dynamic MEC system because offloading is affected by wireless data transmission. In this paper, we study computation offloading with resource allocation in the dynamic MEC system. The objective is to minimize power consumption and maximize throughput while meeting the delay constraints of tasks. Therefore, it allocates resources for local execution and transmission power for offloading. We define the problem as a Markov decision process, and propose an offloading method using deep reinforcement learning named deep deterministic policy gradient. Simulation shows that, compared with existing methods, the proposed method outperforms in terms of throughput and satisfaction of delay constraints.

• 대한토목학회논문집
• /
• 제26권1A호
• /
• pp.11-19
• /
• 2006

본 연구에서는 현수교의 선박충돌해석을 위한 설계선박을 결정하기 위하여 선박충돌위험도해석을 수행한다. 선박충돌에 대한 설계선박을 결정하기 위하여 AASHTO 설계기준에서 제시한 3개의 선박충돌 설계방법 중 확률기반 해석방법인 Method II를 사용한다. 선박충돌 위험에 노출된 각각의 교각에 대해 선박충돌위험도 평가를 하여 교각의 충돌설계수평강도를 결정한다. 해석과정은 반복적인 것으로 교량부재의 충돌저항강도를 가정하고 연간파괴빈도를 계산하여 허용기준이 만족하도록 설계 변수를 수정한다. 허용기준은 예상연간파괴빈도에 근거한 가중치를 이용하여 교각에 할당한다. 해석결과에서 안전성과 경제성을 얻기 위해 이 할당방법을 주탑집중 할당방법과 비교한다. 비록 주탑집중 할당방법이 주탑에 비해 과대평가되는 교각의 설계수평강도를 적절히 수정할 경우 보다 경제적인 결과를 가져오지만, 가중치에 의한 할당방법이 설계인자의 특성을 정량적으로 고려하기 때문에 더 합리적인 것으로 보인다. 그리고 선박충돌위험도 평가로부터 얻어지는 충돌설계수평강도에 상응하는 각각의 교각에 대한 설계선박이 결정된다. 같은 교량에 대해서도 충돌설계수평강도가 수로 및 교량의 특성과 선박통행량에 따라 상당히 변화한다. 따라서 허용기준의 할당과 설계선박 선정에 대한 많은 연구가 요구된다.

• 대한전자공학회논문지TC
• /
• 제38권2호
• /
• pp.6-12
• /
• 2001

CBR 소스 트래픽에 대한 ATM 교환기와 광대역 망종단장치의 셀전달지연을 측정하여 국내영역에서의 셀전달지연을 추정하였다. 추정결과 I.356의 할당원칙에 의한 국내영역의 셀전달지연 목표치를 만족하였다. Chernoff 누적방법에 기초한 peak to peak CDV 할당방법을 제안하고 국내영역의 노트들에 적용하였다. 수치해석 결과 전송경로상에 놓인 노드수와 각 노드에서의 CDV가 증가하는 경우에 제안된 할당방법이기존의 균등할당 방법에 비해 정확도가 개선되었다.

• 한국컴퓨터정보학회논문지
• /
• 제27권4호
• /
• pp.1-8
• /
• 2022

이 논문에서는 싱글 프로세스 멀티코어 환경의 매크로 확장에서 Lock이 필요하지 않은 더 효과적인 고유식별자 할당 방식을 제안한다. 이 할당 방식의 핵심 아이디어는 나머지 연산을 이용해 순차적 의존성을 제거하는 것이다. 우리가 고안한 방식이 멀티코어 병렬 환경에서 매크로 확장의 성능 개선에 적합함을 확인하기 위해, 기존에 순차적 방식의 고유식별자 생성으로 구현된 라이브러리를 우리가 고안한 방식으로 변경하여 변경 전의 버전과 후의 버전의 라이브러리로 작성된 같은 프로그램의 성능을 비교하는 벤치마크를 수행하였다.