• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.130-139
• /
• 2014

Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.9
• /
• pp.1317-1324
• /
• 2017

These days, a penetration of distributed generation(DG) has increased in power system. Due to increased penetration of DG, a whole system is forced to install the maximum hosting capacity of DG. Therefore analysis between the maximum hosting capacity of DG at the target bus and the whole system is important. If we know the maximum hosting capacity, it will be able to satisfy the demand of system planner and customer. In this paper, we use a genetic algorithm to calculate the hosting capacity with optimization program using Design Analysis Kit for Optimization and Terascale Applications(DAKOTA). To consider a real system, we establish constraints and use IEEE 34 node test system. In addition, through the correlation coefficient between the target bus and the other buses, when capacity of DG at the target bus increases, we analyze which capacity of DG at the other buses will be decreased.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.108-111
• /
• 1983

This paper presents a new method for the optimum capacity assignment in store-and-forward communication networks under a total fixed-capacity constraints. Any two link capacities needed in this method can have the desirable quantites and then other capacities can be obtained from the fixed two link capacities. When the minimum and the maximum capacities that are the quantites of the conventional method are fixed, the total average time delay from the new method is almost the same as that from the conventional method. And when the minimum capacity is fixed, the new method gives smaller average time delay.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.6
• /
• pp.340-346
• /
• 2003

This paper presents a game theory application for an analysis of uniform price auction in a simplified competitive electricity market and analyzes the properties of Nash equilibrium for various conditions. We have assumed that each generation firm submits his bid to a market in the form of a sealed bid and the market is operated as a uniform price auction. Two firms are supposed to be the players of the market, and we consider the maximum generation quantity constraint of one firm only. The system demand is assumed to have a linear relationship with market clearing prices and the bidding curve of each firm, representing the price at which he has a willingness to sell his generation quantity, is also assumed to have a linear function. In this paper, we analyze the effects of maximum generation quantity constraints on the Nash equilibrium of the uniform price auction. A simple numerical example with two generation firms is demonstrated to show the basic idea of the proposed methodology.

• IE interfaces
• /
• v.14 no.4
• /
• pp.334-340
• /
• 2001

The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.20-36
• /
• 2001

The purpose of this paper is estimating environmental carving capacity of Seoul Metropolitan Area for a sustainable city management using system dynamics model. A sustainable development requires a society to define sustainability constraints or environmental limits, environmental carving capacity. Environmental carving capacity can be defined as the level of human activity which a region can sustain at an acceptable quality of life level. This concept of environmental carving capacity has several important application to sustainable city planning and management. If the limitation of a human activity can be supported by a scientific data on carving capacity, the resulting decision and actions could more easily win public support for a sustainable development. However, one of the key issues is how to operationalize the carving capacity. In this paper, the environmental carving capacity was operationalized as a maximum number of industry structure, population, and housing that can sustain certain level of environmental quality of Seoul Metropolitan Area. The model developed in this paper consisted off sectors: population, housing, industry, land, and environmental sector. The model limits its main focus on the NO$_2$level of ambient air of Seoul. Carving capacity Seoul Metropolitan Area was estimated by figuring out the maximum number of population, industry structure, housing at an equilibrium point that sustain a desirable NO$_2$level. Based on the model estimation, several policy implications for a sustainable city management was discussed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.11
• /
• pp.1936-1941
• /
• 2010

This purpose of this paper is to propose a methodology for optimal generating operation in power system to minimize the cost of generation subject to not only system constraints but also regional $CO_2$ emission constraints. To solve this ELD problem calculated range limit on minimum and maximum power outputs by regional Equal Generator how each regional capacity is connected into one and expressed Equal Fuel Cost Function considering regional $CO_2$ emission constraints. Accordingly, being modified regional load, new power outputs considering regional $CO_2$ emission constraints were calculated by ELD. The proposed model for evaluating availability is tested on IEEE RTS(Reliability Test System)-24 in detail.