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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.15-22
• /
• 2006

In OFDMA system, even if the number of allocated sub-channel in mobile station varies from one to the whole sub-channel as in base station, while because of mobile station's transmit power is lower than that of base station, therefore full loading range(FLR) constraint occurs where whole sub-channel can be used and the conventional open-loop power control scheme can not be used beyond FLR. We propose a new scheme that limits the maximum sub-channel allocation number and uses power concentration gain(PCG) depending on location of mobile station, which is based on ranging in OFDMA system. Simulation results show that the proposed scheme provides solutions for optimum utilization of radio resource depending on the location of mobile station and enables open-loop power control beyond FLR without extra hardware complexity.

• Journal of Energy Engineering
• /
• v.11 no.1
• /
• pp.47-58
• /
• 2002

This paper presents a new method for the evaluation of avoided generation costs. Unlike conventional load decrement method, it exactly considers forced outage rate and economic loading order of IPPs (Independent Power Producers). Therefore we can provide exact generation avoided costs of IPPs by the developed method. Because probabilistic simulation is conducted in this method, effects on the costs of IPPs are exactly considered. Also we suggest an allocation method of avoided generation costs by participation factor. In the case studies we have shown avoided generation costs considering loading order and forced out-age rate by using this method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1251-1258
• /
• 2010

Orthogonal Frequency Division Multiplexing (OFDM) has been investigated as promising technology for future broadband communication. In this paper, we propose a power allocation algorithm for a frequency selective fading channel. However, many investigated algorithms that perform high computation overhead are not appropriate for sensor network systems due to hardware limitations. The proposed algorithm significantly reduces computational overhead and satisfies the power budget. Throughput of the algorithm is comparable to the optimum solution. Simulation results support the claim stated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• 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.

• Journal of Communications and Networks
• /
• v.8 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• 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.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.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.

• Journal of Communications and Networks
• /
• v.12 no.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.