• 제목/요약/키워드: Resources allocation

검색결과 790건 처리시간 0.028초

OFDMA 시스템에서 비디오 전송을 위한 효율적인 채널 할당 (An efficient channel allocation for video transmission in OFDMA systems)

  • 이상재;김세헌
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2007년도 추계학술대회 및 정기총회
    • /
    • pp.325-329
    • /
    • 2007
  • The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

  • PDF

An Algorithm for Optimal Allocation of Spare Parts

  • Jee, Man-Won
    • 한국국방경영분석학회지
    • /
    • 제9권1호
    • /
    • pp.29-49
    • /
    • 1983
  • The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

  • PDF

On Power Calculation for First and Second Strong Channel Users in M-user NOMA System

  • Chung, Kyuhyuk
    • International journal of advanced smart convergence
    • /
    • 제9권3호
    • /
    • pp.49-58
    • /
    • 2020
  • Non-orthogonal multiple access (NOMA) has been recognized as a significant technology in the fifth generation (5G) and beyond mobile communication, which encompasses the advanced smart convergence of the artificial intelligence (AI) and the internet of things (IoT). In NOMA, since the channel resources are shared by many users, it is essential to establish the user fairness. Such fairness is achieved by the power allocation among the users, and in turn, the less power is allocated to the stronger channel users. Especially, the first and second strong channel users have to share the extremely small amount of power. In this paper, we consider the power optimization for the two users with the small power. First, the closed-form expression for the power allocation is derived and then the results are validated by the numerical results. Furthermore, with the derived analytical expression, for the various channel environments, the optimal power allocation is investigated and the impact of the channel gain difference on the power allocation is analyzed.

Distributed Channel Allocation Using Kernel Density Estimation in Cognitive Radio Networks

  • Ahmed, M. Ejaz;Kim, Joo Seuk;Mao, Runkun;Song, Ju Bin;Li, Husheng
    • ETRI Journal
    • /
    • 제34권5호
    • /
    • pp.771-774
    • /
    • 2012
  • Typical channel allocation algorithms for secondary users do not include processes to reduce the frequency of switching from one channel to another caused by random interruptions by primary users, which results in high packet drops and delays. In this letter, with the purpose of decreasing the number of switches made between channels, we propose a nonparametric channel allocation algorithm that uses robust kernel density estimation to effectively schedule idle channel resources. Experiment and simulation results demonstrate that the proposed algorithm outperforms both random and parametric channel allocation algorithms in terms of throughput and packet drops.

유전알고리즘과 시뮬레이션을 이용한 유연생산시스템에서의 최적 버퍼 할당에 관한 연구 (The Study for Optimal Boner Allocation in FMS Using Genetic Algorithm and Simulation)

  • 이용균;김경섭
    • 한국시뮬레이션학회논문지
    • /
    • 제10권4호
    • /
    • pp.65-75
    • /
    • 2001
  • This study presents a heuristic algorithm for buffer allocation in FMS(Flexible Manufacturing System). The buffers, which are finite resources in FMS, are responsible for improvement of an overall system utilization. But, until now, the study for buffer allocation in FMS are rarely conducted because of the complexity in FMS. Most studies for buffer allocation had been addressed to the simple production line system. The presented algorithm uses a simulation for the description of system complexity and uses a genetic algorithm for finding better buffer allocation. Lastly, we compare performance of the presented algorithm with that of a simple heuristic, and analyze the experiment results.

  • PDF

동적계획법에 의한 물 배분 (Optimal Water Allocation by Dynamic Programming)

  • 이순탁;이진우
    • 물과 미래
    • /
    • 제18권2호
    • /
    • pp.163-174
    • /
    • 1985
  • 본 연구는 하천유역에 있어서 한정된 일정의 수자원이 몇 단계로 사용될 경우, 효과적인 물사용 및 합리적인 물배분방법에 동적계획(Dynamic Programming) 모델을 적용하여 최적 물배분량을 결정하고자 하는데 그 목적이 있다. 분석에 있어서는 물배분 가능지구를 영천댐을 중심으로 하는 금호강 하류 낙동강 본류 합류점까지의 포항지구($C_1$).영천지구($C_2$).경산지구($C_$).대구지구($C_4$)인 4개 지구로 구분하고, 이들 각 지구별 지역내 주민총생산과 용도별 물사용량자료의 상관관계로부터 이익함수를 결정하여, 지구별 물배분과 용도별 물배분으로 구분하여 DP 모델을 적용시켰으며, 그결과 지구별 물배분에서 C1 지구의 용수를 제한없이 배분할 시 240units($1unit=10^3㎥/일$)까지는 영천댐의 가용수자원량만으로 공급이 가능하나 그 이상이 될 경우에는 대체수자원을 개발해야 됨을 알 수 있었고, 용도별로 배분할 때의 이익이 지구별로 배분할 때의 이익보다 많이 나타남과 동시에 가용수자원량의 217units까지는 $C_1$지구의 용수를 제한시키는 편이이익이 크다는 점을 알 수 있었다. 지구별로 물배분할 시 영천댐만의 가용수자원량으로는 $C_1$지구에 240units, 지하지구에 80units로 배분되었고 영천댐 상류 도일댐을 고려할 경우 $C_1$지구에 360units, 하류지역에 80units로 배분되었으며 용도별로 물배분할 시 영천댐만의 가용수자원량으로는 C1지구의 공업.생활용수는 103units, 33units로 배분되고, 하류지구에 184units로 배분되었으며 도일댐을 고려할 경우 C1지구의 공업.생활용수는 103units, 33units로 배분되고, 하류지구에 304units로 배분되었다. 따라서 용도별로 물배분하므로서 금호강 하루지역에 더욱 많은 물을 배분할 수 있음을 알았다.

  • PDF

네트워크형 가상현실 시스템에서의 자원할당 (Resource Allocation for Networked Virtual Reality Systems)

  • 오세웅
    • 한국멀티미디어학회논문지
    • /
    • 제4권2호
    • /
    • pp.130-135
    • /
    • 2001
  • 네트워크를 이용한 가상현실시스템이 3차원 그래픽 뿐만 아니라 오디오, 비디오를 취급하면, 가상 공간의 품질은 현재 사용 가능한 네트워크 대역폭이나 엔드 시스템의 자원에 커다란 영향을 받는다. 또한 자원 예약형의 네트워크를 사용하더라도 네트워크형 가상현실 시스템에서는 사용자의 공간 네비게이션에 따라 요구되는 자원이 변화하므로 결국 가상공간의 품질이 떨어지는 결과를 초래한다 본 논문에서는 네트워크형 가상현실 시스템에서의 자원 할당 방법을 제안하여 네비게이션에 따른 가상공간의 품질 저하를 최소화하며 이를 실험을 통해 그 효율성을 입증한다.

  • PDF

How Do Bacteria Maximize Their Cellular Assets?

  • Kim, Juhyun
    • 한국미생물·생명공학회지
    • /
    • 제49권4호
    • /
    • pp.478-484
    • /
    • 2021
  • Cellular resources including transcriptional and translational machineries in bacteria are limited, yet microorganisms depend upon them to maximize cellular fitness. Bacteria have evolved strategies for using resources economically. Regulatory networks for the gene expression system enable the cell to synthesize proteins only when necessary. At the same time, regulatory interactions enable the cell to limit losses when the system cannot make a cellular profit due to fake substrates. Also, the architecture of the gene expression flow can be advantageous for clustering functionally related products, thus resulting in effective interactions among molecules. In addition, cellular systems modulate the investment of proteomes, depending upon nutrient qualities, and fast-growing cells spend more resources on the synthesis of ribosomes, whereas nonribosomal proteins are synthesized in nutrient-limited conditions. A deeper understanding of cellular mechanisms underlying the optimal allocation of cellular resources can be used for biotechnological purposes, such as designing complex genetic circuits and constructing microbial cell factories.

On Power Allocation Schemes for Bi-directional Communication in a Spectrum Sharing-based Cognitive Radio System

  • Kim, Hyungjong;Wang, Hanho;Hong, Daesik
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제3권5호
    • /
    • pp.285-297
    • /
    • 2014
  • This paper presents the results of an investigation into bi-directional communication in spectrum sharing-based cognitive radio (Bi-CR) systems. A Bi-CR system can increase the spectral efficiency significantly by sharing the spectrum and through the bi-directional use of spatial resources for two-way communication. On the other hand, the primary user experiences more interference from the secondary users in a Bi-CR system. Satisfying the interference constraint by simply reducing the transmission power results in performance degradation for secondary users. In addition, secondary users also experience self-interference from echo channels due to full duplexing. These imperfections may weaken the potential benefits of the Bi-CR system. Therefore, a new way to overcome these defects in the Bi-CR system is needed. To address this need, this paper proposes some novel power allocation schemes for the Bi-CR system. This contribution is based on two major analytic environments, i.e., noise-limited and interference-limited environments, for providing useful analysis. This paper first proposes an optimal power allocation (OPA) scheme in a noise-limited environment and then analyzes the achievable sum rates. This OPA scheme has an effect in the noise-limited environment. In addition, a power allocation scheme for the Bi-CR system in an interference-limited environment was also investigated. The numerical results showed that the proposed schemes can achieve the full duplexing gain available from the bi-directional use of spatial resources.

Spectrum allocation strategy for heterogeneous wireless service based on bidding game

  • Cao, Jing;Wu, Junsheng;Yang, Wenchao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1336-1356
    • /
    • 2017
  • The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.