• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.501-508
• /
• 2004

In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.3
• /
• pp.131-138
• /
• 2009

This paper considers a coordinated scheduling problem between multi-suppliers and an manufacture. When the supplier has insufficient inventory to meet the manufacture's order, the supplier may use the expedited production and the expedited transportation. In this case, we consider a scheduling problem to minimize the total cost of suppliers and manufacture. We suggest an population management genetic algorithm with local search and crossover (GALPC). By the computational experiments comparing with general genetic algorithm, the objective value of GALPC is reduced by 8% and the calculation time of GALPC is reduced by 70%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.7
• /
• pp.538-545
• /
• 2014

This paper proposes a coordinated multi-point (CoMP) based dynamic transmission scheme in a downlink multi-ship network, where a central ship selects a ship in order to maximize the utility function. The proposed scheduling scheme dynamically decides to the usage of the coordinated multi transmissions and selects a user to be served for every frame, in order to the utility function on the basis of the throughput and fairness. In particular, the proposed utilify function based scheduling scheme aims to increase the quality of service of ships at the edge of cells. Under the proportional fair scheduling, the simulation results show that the proposed utility function-based scheduling improves the throughput of the ships at the cell edge with the little sacrifice of the system capacity.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.11
• /
• pp.1311-1317
• /
• 2010

In this paper, for a uplink space division multiple access system named cooperative spatial multiplexing(CSM), radio resource management(RRM) algorithms are proposed based on sharing uplink channel information among a serving base station(BS) and interfering BSs in a uplink coordinated wireless communication system. A constrained maximum transmit power algorithm is proposed for mobile station(MS) to limit uplink inter-cell interference(ICI). And joint scheduling algorithm among coordinated BSs is proposed to enhance uplink capacity through ICI mitigation by using channel information from interfering BSs. It is shown that the proposed RRM algorithm provides a considerable uplink capacity enhancement by effective ICI mitigation only with moderate complexity.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.5
• /
• pp.319-327
• /
• 1987

This paper presents a dynamic programming sucdessive approximation algorithm for scheduling pumped storage hydro plants and shows how this method can be coordinated with the commitment of the thermal units of the system. The general object of operation of pumped hydrostorage plants is the minimization of the overall production cost and the maximization of generation reserves. The basic procedure used to obtain a combined pumped storage-unit commitment schedule is to execute the pumped storage scheduler and unit commitment scheduler iteratively. A combined DPSA algorithm has been presented to coordinate the scheduling of the pumped storage with the scheduling of the thermal units.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.8
• /
• pp.477-483
• /
• 2004

In competitive electricity markets, maintenance schedule is submitted by generation companies (GENCOs) and transmission companies (TRANSCOs), and coordinated by Independent System Operator (ISO) with the adequacy criterion. This paper presents an alternative coordination procedure by ISO on the maintenance schedule. In this paper, it is focused on modeling a coordination algorithm by ISO for the maintenance schedule based on the Simulated Annealing algorithm. The proposed model employs the minimum information such as generator capacity, forced outage rate and generator maintenance schedules. The objective function of this model represents minimization of adjustment on schedules submitted by GENCOs.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.346-348
• /
• 2016

Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.339-344
• /
• 2011

Base station coordination has received much attention as a means to reduce the inter-cell interference in cellular networks. However, this interference reducing ability comes at the expense of increased feedback, backhaul load and computational complexity. The degree of coordination is therefore limited in practice. In this paper, we explore the trade-off between capacity and feedback load in a cellular network with coordination clusters. Our main interest lies in a scenario with multiple fading users in each cell. The results indicate that a large fraction of the total gain can be achieved by a significant reduction in feedback. We also find an approximate expression for the distribution of the instantaneous signal to interference-plus-noise ratio (SINR) and propose a new effective scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.601-611
• /
• 2012

In this paper, we first study the spatial multiplexing gain for the 3-cell interfering broadcast channels (IFBC) where all base stations and mobile users are equipped with multiple antennas. Then, we present the IA scheme in conjunction with user selection which outperforms the TDMA technique in the IFBC environment. The optimal scheduling method utilizes multiuser diversity to achieve a significant fraction of sum capacity by using an exhaustive search algorithm. To reduce the computational complexity, a suboptimal scheduling method is proposed based on a coordinate ascent approach.