• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.109-115
• /
• 2014

This paper presents a concurrent channel time allocation scheme used in the reservation period for concurrent transmissions in 60-GHz wireless personal area networks (WPANs). To this end, the proposed resource allocation scheme includes an efficient method for creating a concurrent transmission group by using a table that indicates whether individual streams experience interference from other streams or not. The coordinator device calculates the number of streams that can be concurrently transmitted with each stream and groups them together on the basis of the calculation result. Then, the coordinator device allocates resources to each group such that the streams belonging to the same group can transmit data concurrently. Therefore, when the piconet coordinator (PNC) allocates the channel time to the individual groups, it should allow for maximizing the overall capacity. The performance evaluation result demonstrates that the proposed scheme outperforms the random grouping scheme in terms of the overall capacity when the beamwidth is $30^{\circ}C$ and the radiation efficiency is 0.9.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.213-215
• /
• 1999

This paper presents a transmission cost allocation through application of a new reliability index in transmission pricing in competitive electric industry. The proposed method allocates a fair use of transmission system charge given separately to individual generator by capacity usage, based on the contribution of individual generator considering N-1 contingency in reliability margin of transmission capacity, and offers more alternatives of pricing in using transmission capacity and transmission margin.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.77-83
• /
• 2015

This paper suggests heuristic algorithm to obtain optimal solution of minimum number of delay aircraft in airport arrivals/departures problem. This problem can be solved only mathematical optimization method. The proposed algorithm selects the minimum delays capacity in various airport capacities for number of arrivals/departures aircraft in $i^{th}$ time interval (15 minutes). In details, we apply median selection method and left-right selection method. This algorithm can be get the optimal solution of minimum number of delay aircraft for sixes actual experimental data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3529-3550
• /
• 2016

In heterogeneous networks (HetNets), energy saving is vital for a sustainable network development. Many techniques, such as spectrum allocation, network planning, etc., are used to improve the network energy efficiency (EE). In this paper, micro BSs utilizing cell range expansion (CRE) and spectrum allocation are considered in multi-channel heterogeneous networks to improve EE. Hotspot region is assumed to be covered by micro BSs which can ensure that the hotspot capacity is greater than the average demand of hotspot users. The expressions of network energy efficiency are derived under shared, orthogonal and hybrid subchannel allocation schemes, respectively. Particle swarm optimization (PSO) algorithm is used to solve the optimal ratio of subchannel allocation in orthogonal and hybrid schemes. Based on the results of the optimal analysis, we propose three service control strategies on the basis of large-scale user behaviors, i.e., adjust micro cell rang expansion (AmCRE), adjust micro BSs density (AmBD) and adjust micro BSs transmit power (AmBTP). Both theoretical and simulation results show that using shared subchannel allocation scheme in AmBD strategies can obtain maximal EE with a very small area ratio. Using orthogonal subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is larger. Using hybrid subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is large enough. No matter which service control strategy is used, orthogonal spectrum scheme can obtain the maximal hotspot user rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.247-260
• /
• 2007

This paper solves the problem of finding a suitable sub-channel and power joint allocation method for multiple users in 802.16e OFDMA/TDD cellular systems. The joint allocation is thatfirstly the sub-channel is allocated to the users and then suitable power is allocated. We propose a FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm which is a dynamic channel allocation algorithm considering all users' channel state information conditionally to maximize fairness and throughput. The improved CHC algorithm, which is dynamic power allocation algorithm, is also proposed in this paper The Improved CHC algorithm collects the extra of the downlink transmit power and then re-allocates it to other users. Simulation results show that the proposed improved CHC algorithm additionally increases the fairness and sector throughput.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.45-50
• /
• 1984

This paper is concerned with the facility location-allocation problem (FLAP) with multiple objectives. A branch-and-bound procedure is presented to solve the mixed zero-one integer goal programming problem which is to determine facility locations from given candidate locations and to allocate facility capacity to given customer markets simultaneously. A numercial example is given to illustrate this procedure.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1334-1337
• /
• 1993

In this study, we newly formulated the link capcity allocation problem and the link capacity allocation and routing problem in an voice/data integrated network by the fuzzy set concept. We developed efficient algorithms for the above fuzzified problems and successfully showed that the fuzzy set theory is the powerful tool for the design problems in communication networks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.3
• /
• pp.49-60
• /
• 2003

In this paper, we study the joint design of sampling inspections and service capacities for multi-products. Products of different defect rates which are either deterministic or random variables are supplied in batches after sampling inspection and rework. When supplied, all defective products that have not been inspected in batches are uncovered through total inspection and returned to service. We identify the optimal inspection policies and service capacities for multi-products reflecting the relationships between inspection rework costs and service provision costs. We also develope a marginal allocation algorithm for the optimal allocation of the limited total service capacity to products as well as inspection quantities.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.61-72
• /
• 2004

In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Particularly, we extend Kim(2003) by introducing the fixed cost of providing services. We show that, due to the fixed cost considered, the cost function of a product is no longer linear or convex in terms of the level of service provision, and the total inspection is prefered to the small level of service capacity which results in high burden of the fixed cost. And we develop a simple framework to deal with this joint design problem for a product. Also we consider the problem of allocating the given number of the total service capacities among products. A dynamic programming algorithm is developed to determine the optimal allocation which minimizes the overall total cost of the system and the optimal allocation can be obtained with the considerably smaller computations than the total number of possible allocations. The results can be used to support planning decisions and to aid the joint design of inspections and service capacities for products.