• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.733-734
• /
• 2009

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.428-430
• /
• 1997

An LQG/LTR based gain scheduling control scheme for the two link inverted pendulum is presented. It is shown by simulation that the gain scheduling scheme based on the robust linear control theory still preserves the robust property of the linear control scheme and can be applied to control a class of nonlinear systems.

• Journal of Communications and Networks
• /
• v.11 no.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.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.863-870
• /
• 2004

UMTS(Universal Mobile Telecommunication System) is recently recognized as a standard for 3rd generation of wireless networks and DSCH(Down-link Shared Chanel) is considered as a very effective multiplexing method in UMTS. So, it is inevitable to develope an effective packet scheduling algorithms for DSCH in UMTS. This paper describes an improved packet scheduling algorithm for DSCH of UMTS. The algorithm takes consideration in channel state for each mobile terminal to maximize link utilization, delay threshold for class 3 traffic and throughput for class 4 to get long term fairness. To verify the algorithm, we programmed a simulator using PARSEC simulation tool and got some simulation results by it. The simulation results show that the algorithm has reasonable characteristics in both of link utilization and fair-ness by trade-off.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3201-3223
• /
• 2020

Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = e^ax - 1 and y = 0.5x² using MATLAB 2017a software for the computation of average and worst ratios of the two levels.

• ETRI Journal
• /
• v.30 no.5
• /
• pp.663-673
• /
• 2008

The multi-scenario topology of multi-channel hybrid ubiquitous sensor networks (USNs) is studied and a novel link auto-diversity cross-layer cooperative scheduling scheme is proposed in this paper. The proposed scheme integrates the attributes of the new performance evaluation link auto-diversity air-time metric and the topology space in the given multi-scenario. The proposed scheme is compared with other schemes, and its superiority is demonstrated through simulations. The simulation results show that relative energy consumption, link reception probability, and end-to-end blocking probability are improved. The addressing ratio of success with unchanged parameters and external information can be increased. The network can tolerate more hops to support reliable transportation when the proposed scheme is implemented. Moreover, the scheme can make the network stable. Therefore, the proposed scheme can enhance the average rate performance of the hybrid USN and stabilize the outage probability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.300-302
• /
• 2012

In this paper, we investigate the performance of multi-channel cognitive radio networks (CRNs) by taking into consideration the problem of channel assignment and link scheduling. We assume that secondary nodes are equipped with multiple radios and can switch among multiple channels. How to allocate channels to links and how much power used on each channel to avoid mutual interference among secondary links are the key problem for such CRNs. We formulate the problem of channel assignment and link scheduling as a combinatorial optimization problem. Then, we propose a the optimal solution and show that it converges to maximum optimum in some iterations by using numerical results.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.10
• /
• pp.1194-1199
• /
• 2010

In this paper, for a relay-based cellular network, a interference avoidance beamforming technique is proposed to enhance direct link capacity while minimizing loss in the capacity of concurrent relaying link. A direct link is transmitted by beamforming at the transmitter, and the relaying link with the least interference to the direct link is scheduled to transmit data by a collision avoidance scheduling algorithm. Simulation results show that the proposed IA beamforming provides a considerable direct link capacity enhancement while minimizing relaying link capacity loss by effectively mitigating inference between concurrent direct and relaying links only with limited feedback.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.