• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2007년도 추계 국제학술대회
• /
• pp.146-146
• /
• 2007

• 대한전기학회논문지:전력기술부문A
• /
• 제48권9호
• /
• pp.1088-1095
• /
• 1999

This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.

• 지능정보연구
• /
• 제13권3호
• /
• pp.63-82
• /
• 2007

본 논문에서는 유연제조시스템(FMS)에서 다단계스케줄링 문제를 효율적으로 해결하기 위한 적응형 혼합유전 알고리즘(ahGA) 접근법을 제안한다. 제안된 ahGA는 FMS의 해를 개선시키기 위하여 이웃탐색기법을 사용하며, 유전탐색과정에서의 수행도를 향상시키기 위해 유전알고리즘(GA)의 파라메터들을 조정하기 위한 적응형 구조를 사용한다. 수치실험에서는 제안된 ahGA와 기존의 알고리즘들 간의 수행도를 비교하기 위하여 두가지형태의 다단계스케줄링문제를 제시한다. 실험결과는 제안된 ahGA가 기존의 알고리즘들 보나 더 뛰어난 수행도를 보여주고 있다.

• 대한전자공학회논문지TC
• /
• 제45권11호
• /
• pp.9-14
• /
• 2008

본 논문에서는 직교 주파수 분할 다중 접속 방식 (OFDMA, Orthogonal Frequency Division Multiple Access)에서 다중 사용자 다이버시티 이득을 증가시키기 위하여 사용자간 충돌 (collisions)을 피하도록 하는 스케줄링 기법을 제안한다. 제안하는 스케줄링 기법은 각 사용자간 채널 상태의 차이를 조사하여 최소 충돌 조건 (minimum collision criterion)을 만족시키도록 동작한다. 또한 제안된 스케줄링을 사용했을 때 OFDMA 시스템의 전송률을 분석하였는데, 이 분석을 통해 OFDMA 시스템의 전송률이 선택된 사용자들 간의 충돌 횟수에 따라 달라진다는 것을 확인할 수 있다. 모의실험을 통해 제안하는 스케줄링 기법이 사용자 간 충돌의 감소를 통하여 시스템의 전송률을 증대시킬 수 있음을 보인다. 또한 기존의 스케줄링 기법과의 비교를 통해, 제안된 스케를링 기법이 전송률 측면에서 더 우월하다는 것을 확인한다.

• 한국정밀공학회지
• /
• 제20권4호
• /
• pp.214-222
• /
• 2003

Studies on the optimization of machining process can be divided into two different approaches: off-line feedrate scheduling and adaptive control. Each approach possesses its respective strong and weak points compared to each other. That is, each system can be complementary to the other. In this regard, a combined system, which is a feedrate control system fur cutting force optimization, was proposed in this paper to make the best of each approach. Experimental results show that the proposed system could overcome the weak points of the off-line feedrate scheduling system and the adaptive control system. In addition, from the figure, it can be confirmed that the off-line feedrate scheduling technique can improve the machining quality and can fulfill its function in the machine tool which has a adaptive controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5805-5825
• /
• 2019

Smartphones are important platforms because of their sophisticated computation, communication, and sensing capabilities, which enable a variety of applications in the Internet of Things (IoT) systems. Moreover, advancements in hardware have enabled sensors on smartphones such as environmental and chemical sensors that make sensor data collection readily accessible for a wide range of applications. However, dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users that vary throughout the day, which greatly affects the efficacy of sensor data collection. Therefore, it is necessary to consider phone users mobility patterns to design data collection schedules that can reduce the loss of sensor data. In this paper, we propose a mobility-based weighted adaptive opportunistic scheduling framework that can adaptively adjust to the dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users and provide prioritized scheduling based on various application scenarios, such as velocity, region of interest, and sensor type. The performance of the proposed framework is compared with other scheduling frameworks in various heterogeneous smartphone user mobility scenarios. Simulation results show that the proposed scheduling improves the transmission rate by 8 percent and can also improve the collection of higher-priority sensor data compared with other scheduling approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5800-5818
• /
• 2018

Interference may occur when several co-located wireless body area networks (WBANs) share the same channel simultaneously, which is compressed by resource scheduling generally. In this paper, a QoS-aware Adaptive Coloring (QAC) scheduling algorithm is proposed, which contains two components: interference sets determination and time slots assignment. The highlight of QAC is to determine the interference graph based on the relay scheme and adapted to the network QoS by multi-coloring approach. However, the frequent resource assignment brings in extra energy consumption and packet loss. Thus we come up with a launch condition for the QAC scheduling algorithm, that is if the interference duration is longer than a threshold predetermined, time slots rescheduling is activated. Furthermore, based on the relative distance and moving speed between WBANs, a prediction model for interference duration is proposed. The simulation results show that compared with the state-of-the-art approaches, the QAC scheduling algorithm has better performance in terms of network capacity, average delay and resource utility.

• 한국통신학회논문지
• /
• 제30권9A호
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• ETRI Journal
• /
• 제26권5호
• /
• pp.391-396
• /
• 2004

In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.