• 제목/요약/키워드: Allocation loading

검색결과 66건 처리시간 0.023초

Second Order Suboptimal Power Allocation for MIMO-OFDM Based Cognitive Radio Systems

  • Nguyen, Tien Hoa;Nguyen, Thanh Hieu;Nguyen, Van Duc;Ha, Duyen Trung;Gelle, Guilllaume;Choo, Hyunseung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권8호
    • /
    • pp.2647-2662
    • /
    • 2014
  • This paper proposes an efficient and low complexity power-loading algorithm for MIMO-OFDM downlink based cognitive radio system that maximizes the sum rate of single secondary user (SU) under constraints on the tolerable interference thresholds between secondary user and primary user's frequency bands and the total transmission power. Our suboptimal algorithm is based on the $2^{nd}$ order interference tracking and nulling mechanism to allocate transmission power of the subcarriers among SU's scheme. The performance of our proposed suboptimal scheme is compared with the performance of the classical power loading algorithms, e.g., water filling, $1^{st}$ order interference tracking, nulling, and other suboptimal schemes. Numerical results show that our algorithm has low complexity but obtains a higher channel capacity than that of some previous suboptimal algorithms in some scenarios. We dedicate also that for a given interference threshold, the $2^{nd}$ order interference tracking mechanism has dynamic number of nulling position instead fixed number of nulling position.

OFDMA 시스템에서 단말기의 위치정보를 이용한 상향링크 전력제어 및 부채널 할당 (Uplink Power Control and Sub-channel Allocation depending on the location of Mobile Station in OFDMA system)

  • 김대호;김환우
    • 한국정보통신학회논문지
    • /
    • 제10권1호
    • /
    • pp.15-22
    • /
    • 2006
  • OFDMA 시스템에서 단말기는 기지국과 같이 최소 1개부터 최대일 때 부채널 전부를 사용할 수 있지만 단말기의 송신전력은 기지국보다 낮게 설계되기 때문에 부채널 전부를 사용할 수 있는 거리(FLR : full loading range)의 제한이 생기고 FLR 외부에 위치한 단말은 기존의 개방루프 전력제어 방식을 사용할 수 없는 문제가 발생한다. 본 논문에서는 OFDMA 시 스템의 ranging 정보를 이용하여 단말기의 위치를 파악하고 단말기의 위치에 따라서 사용가능한 부채널수를 제한하고 PCG(power concentration gain)를 인가하는 방식을 제안하였다. 시뮬레이션을 통한 실험 결과에서 제안된 방식은 단말기의 위치에 따라서 상향링크 무선자원의 최적 활용을 가능하게 하며 FLR 외부에서 개방루프 전력 제어가 별도의 하드웨어 없이 가능함을 확인하였다.

고장정지율과 경제적 투입순서를 고려한 민자발전소의 회피발전비용 계산 (Avoided Generation Costs of IPPS Considering Forced Outage Rate and Economic Loading Order)

  • 원종률;박종배;김진호
    • 에너지공학
    • /
    • 제11권1호
    • /
    • pp.47-58
    • /
    • 2002
  • 본 논문은 민자발전소의 회피 발전비용을 계산하는 새로운 방법을 제안하였다. 제안된 방법은 기존의 부하감소법과 달리 민자발전소의 고장정지율과 경제적 투입순서를 정확히 고려할 수가 있다. 그러므로 더욱 정확한 회피 발전비용을 계산할 수가 있다. 또한 확률적 시뮬레이션을 수행하여 계산하므로 민자발전소의 비용에 대한 영향도 정확히 고려할 수가 있다. 부가적으로 한 개 이상의 민자발전소가 참여하였을 때에 회피 발전비용을 할당하는 방법도 제안하였다. 다양한 사례연구를 통해 제안한 방법의 결과를 분석하였다.

OFDM 기반 무선 센서 네트워크에서의 Reserve Power를 이용한 효율적인 파워 할당 알고리즘 (An Efficient Power Allocation Algorithm in OFDM-based Wireless Sensor Networks using Reserve Power)

  • 김병호;오승열;김치하
    • 한국통신학회논문지
    • /
    • 제35권12B호
    • /
    • pp.1251-1258
    • /
    • 2010
  • OFDM은 높은 데이터 전송율을 지원할 수 있는 기술로 미래의 광대역 통신에 촉망받는 통신 방식이다. 이 논문은 주파수 선택적 페이팅 채널 환경에서 파워 예산을 각 부채널 상태에 적합하게 할당하는 알고리즘을 제안한다. 하지만 센서 네트워크의 하드웨어 제약상 기존의 파워할당 알고리즘을 적용하면 높은 계산 복잡도 때문에 실제 적용하는데 문제가 있다. 제안된 방식은 실제 환경과 비슷하게 구현되었으며 계산 복잡도를 현저히 줄여 최적의 방식에 비교할 수 있는 동시에 정해진 파워 예산을 만족 시킬 수 있다. 또한, 제안한 방식의 throughput은 최적의 throughput을 보여주는 알고리즘과 비교될 수 있을 정도의 성능을 낸다. 시뮬레이션 결과를 통해 기존 제안된 방식보다 throughput, 계산 복잡도가 뛰어남을 보여준다.

A New Approach for Resource Allocation in Project Scheduling with Variable-Duration Activities

  • Kim, Soo-Young;Leachman, Robert C.
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.139-149
    • /
    • 1994
  • In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

  • PDF

A new approach for resource allocation in project scheduling with variable-duration activities

  • 김수영;제진권;이상우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.410-420
    • /
    • 1994
  • In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

An Adaptive Fast Expansion, Loading Statistics with Dynamic Swapping Algorithm to Support Real Time Services over CATV Networks

  • Lo Chih-Chen, g;Lai Hung-Chang;Chen, Wen-Shyen E.
    • Journal of Communications and Networks
    • /
    • 제8권4호
    • /
    • pp.432-441
    • /
    • 2006
  • As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

INTERACTIVE MACHINE LIADUNG AND TOOL ASSIGNMENT APPROAH IN FLEXIBLE MANUFACTURING SYSTEMS

  • Kato, Kiyoshi;Oba, Fuminori;Hashimoto, Fumio
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.1576-1579
    • /
    • 1991
  • This paper discusses on the machine loading and tool allocation (MLTA) problem. Mathematical formulation of the problem is given first. Then a heuristic approach based on Group Technology (GT) is presented to deal with the MLTA problem effectively. By using this approach, part-tool group generation and their assignment to adequate machines can easily be obtained in consideration of the work load on each machine, the number of tool-set replacement, and the total number of cutting tools required through the interactive setting of the desired machine utilization rate.

  • PDF

Congestion Management in Deregulated Power System by Optimal Choice and Allocation of FACTS Controllers Using Multi-Objective Genetic Algorithm

  • Reddy, S. Surender;Kumari, M. Sailaja;Sydulu, M.
    • Journal of Electrical Engineering and Technology
    • /
    • 제4권4호
    • /
    • pp.467-475
    • /
    • 2009
  • Congestion management is one of the technical challenges in power system deregulation. This paper presents single objective and multi-objective optimization approaches for optimal choice, location and size of Static Var Compensators (SVC) and Thyristor Controlled Series Capacitors (TCSC) in deregulated power system to improve branch loading (minimize congestion), improve voltage stability and reduce line losses. Though FACTS controllers offer many advantages, their installation cost is very high. Hence Independent System Operator (ISO) has to locate them optimally to satisfy a desired objective. This paper presents optimal location of FACTS controllers considering branch loading (BL), voltage stability (VS) and loss minimization (LM) as objectives at once using GA. It is observed that the locations that are most favorable with respect to one objective are not suitable locations with respect to other two objectives. Later these competing objectives are optimized simultaneously considering two and three objectives at a time using multi-objective Strength Pareto Evolutionary Algorithms (SPEA). The developed algorithms are tested on IEEE 30 bus system. Various cases like i) uniform line loading ii) line outage iii) bilateral and multilateral transactions between source and sink nodes have been considered to create congestion in the system. The developed algorithms show effective locations for all the cases considered for both single and multiobjective optimization studies.

MIMO Techniques for Green Radio Guaranteeing QoS

  • Nicolaou, Marios;Han, Congzheng;Beh, Kian Chung;Armour, Simon;Doufexi, Angela
    • Journal of Communications and Networks
    • /
    • 제12권2호
    • /
    • pp.130-139
    • /
    • 2010
  • Environmental issues and the need to reduce energy consumption for lowering operating costs have pushed power efficiency to become one of the major issues of current research in the field of wireless networks. This paper addresses a number of multiple input multiple output (MIMO) precoding and scheduling techniques across the PHY and MAC layers that can operate under a reduced link budget and collectively improve the transmit power efficiency of a base station, while maintaining the same levels of service. Different MIMO transmission and precoding schemes proposed for LTE, achieving varying degrees of multiuser diversity in both the time, frequency as well as the space domain, are examined. Several fairness-aware resource allocation algorithms are applied to the considered MIMO schemes and a detailed analysis of the tradeoffs between power efficiency and quality of service is presented. This paper explicitly examines the performance of a system serving real-time, VoIP traffic under different traffic loading conditions and transmit power levels. It is demonstrated that by use of efficient scheduling and resource allocation techniques significant savings in terms of consumed energy can be achieved, without compromising QoS.