• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.165-171
• /
• 2005

In this paper, the centralized dynamic load-balancing was processed effectively by using the network based parallel genetic algorithm. Unlike the existing method using genetic algorithm, the performance of central scheduler was improved by distributing the process for the searching of the optimal task assignment to clients. A roulette wheel selection and an elite preservation strategy were used as selection operation to improve the convergence speed of optimal solution. A chromosome was encoded by using sliding window method. And a cyclic crossover was used as crossover operation. By the result of simulation for the performance estimation of central scheduler according to the change of flexibility of load-balancing method, it was verified that the performance is improved in the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.58-66
• /
• 2001

Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, many input queueing switches have centralized scheduler, which centralized scheduler restrict the design of the switch architecture. To overcome this problem, we propose a simple scheduler called PRR(Pipelined Round Robin), which is intrinsically distributed and presents to show the effectiveness of the proposed scheduling.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.65-70
• /
• 2008

현재 응급 의료 시스템에서는 환자의 소재를 파악하기 힘들 뿐만 아니라, 환자의 이송과정에서도 환자를 치료할 수 없는 병원에 이송하는 등의 문제점을 지닌다. 또한 이송을 위한 대기중인 구급차가 없거나, 환자의 병명에 따른 시한을 지키지 못함으로써 환자를 위급한 상태까지 이르게 하는 경우도 존재한다. 본 논문은 이러한 문제를 해결하기 위해 자동화된 중앙 관리 체계를 기반으로 한 u-EMS의 시공간 환경과 행위를 명세 및 분석하기 위한 CARDMI기반의 HAP 스케줄러를 제안한다. 이를 통해 응급 의료 시스템에서 발생할 수 있는 문제점을 u-EMS를 통해 환자를 적시적소에 EMS서비스를 제공할 수 있도록 스케줄링 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.99-109
• /
• 2007

IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1178-1190
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.64-76
• /
• 2009

Recently, the ubiquitous environment and the practical technology associated with it become more popular topic along with the rapid development of wireless technologies. The necessity of the automated system based on the ubiquitous environment has been increasing when the concept of the ubiquitous is integrated into the fields of existing IT. Also, the necessity of formulating a power-saving plan on large buildings and public institutions is gathering strength because of a raise in exchange rates and high oil prices. In this paper, to efficiently manage the power consumption of the electronic machine such as electric lights, electric heaters, and air conditioners in a building, power-saving manage- ment system using RFID/USN technologies is proposed. Proposed system controls the electric machine and monitor it's condition by RFID and collects the real time information about the surrounding and the power consumption of the electric machine by USN. Especially, proposed system analyzes the real time information and supports the intelligent scheduler with the best power-saving. Finally, this paper shows the difference between proposed system and existing system and establishes thereality of our system through experiments in variety environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1606-1612
• /
• 2012

Cognitive radio technology enables us to utilize the extra spectrum which is not used by the primary users by sensing the channel condition. To use such an extra spectrum, spectrum allocation is one of the important issues in the cognitive radio networks. The network is dynamic and the available channels are changeable, and the opportunistic channel allocation is required to use the resource efficiently without interference to the primary networks. In this paper, modified proportional fairness scheduling is proposed for cognitive radio networks to satisfy the both fairness and system throughput, and the modified scheduling was designed to reduce the interference to the primary users.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.831-841
• /
• 2003

In wireless ATM network, Mobile terminals must offer function and QoS such as terminal of wire ATM network. The fast notification of BS (Base Station) scheduler about ATM cells arriving in mobile terminals is a critical item of the ATM-based centrally controlled MAC protocol. But, Collision is arisen at process that several mobile terminals require data transmission by contention method through uplink and because of re-transmission by collision, throughput of decrease and transmission delay increases. In this paper, We propose the MAC protocol that decide optimized request mini-slot's number considering number of request terminal predicted as statistical and its posterior throughput. According to simulation result, could know that proposed protocol shows high performance delay and throughput.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.255-264
• /
• 2011

A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.