• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.832-842
• /
• 2006

Wireless Personal Area Networks(WAPANs) are designed for short-range ad hoc connectivity among portable devices. They have gained much attention in the industry recently. One of them, High-rate WPAN, is designed to support multimedia traffic that requires high data rates. But, High-rate WPAN standards don't specify the time slot assignment scheduling method of CAT(Channel Time Allocation). So, there has been many studies regarding time slot assignment scheduling of CAT. However, present studies involve demerits about not applying various types of errors in air interlace or having a starvation of a specific DEV(data device). In this paper, we propose algorithms about supplying the intermediate channel assignment in order to avoid these demerits. This method will help other methods that use time slot assignment scheduling of CTA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.181-188
• /
• 2012

In this paper, the time slot assignment algorithm, which is based on various transmission interval in TDMA DAMA communication system, has been proposed. The performance of the proposed algorithm and the random assignment algorithm is compared through computer simulations. The simulation results show that the new algorithm can enhance the efficiency of time slot usage much more than the random assignment algorithm. Especially, the lower the congestion of the network is, the higher the efficiency of time slot usage for short transmission interval is.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.354-358
• /
• 2005

High-rate WPAN doesn't define the time slot assignment scheduling method of CAT So, there has been many studies regarding time slot assignment scheduling of CAT. However, present studies involve demerits about not applying various types of errors in air interface or having a starvation of a specific DEV. In this paper, we propose algorithms about supplying the intermediate channel assignment in order to avoid these demerits.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.171-176
• /
• 2003

광 파장 경로 네트워크에서 시간슬롯을 도입한 RWTA(Routing, Wavelength and Time-slot Assignment)에서는 시간슬롯의 할당이 제공하는 연결의 대역폭을 결정한다. 본 논문에서는RWTA 방식에서 요구되는 트래픽에 따라 시간슬롯을 제공하고 자원을 효율적으로 사용 할 수 있는 GBTA(Guaranteed-bandwidth Time-slot allocation) 알고리즘을 제안한다. GBTA는 보장된 시간슬롯을 할당함으로서 세션이 블록킹 되지 않고 연결될 확률을 높여 세션의 연결성을 보장하여 QoS의 요구사항을 만족시킨다.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.52-60
• /
• 2008

A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.426-432
• /
• 2000

A novel mixed-integer linear programming model for the short-term scheduling of a sequential multipurpose batch plant is addressed. First, a time slot domain to each unit is introduced. By assigning each time slot to a product, we obtain the production sequence that minimizes makespan. For multiple-unit assignment problem where a few parallel units with the same function exist, production paths are defined for the distinction of the same stage with a different unit. As a second issue, the model adapted for sequence dependent changeover is presented. For a time slot of a unit, if a product is assigned to the time slot and a different product is assigned to the adjacent time slot, the changeover time considering this situation is included. The performance of the proposed models are illustrated through two examples.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.53-63
• /
• 2022

In the paper, we propose a TSCH-based scheduling scheme for IEEE 802.15.4e, which is able to perform the scheduling of its own network by avoiding collision from interference network cluster (INC). Firstly, we model a bipartite graph structure for presenting the slot-frame (channel-slot assignment) of TSCH. Then, based on the bipartite graph edge weight, we utilize the Hungarian assignment algorithm to implement a scheduling scheme. We have employed two features (maximization and minimization) of the Hungarian-based assignment algorithm, which can perform the assignment in terms of minimizing the throughput of INC and maximizing the throughput of own network. Further, in this work, we called the scheme "dual-stage Hungarian-based assignment algorithm". Furthermore, we also propose deep learning (DL) based deep neural network (DNN)scheme, where the data were generated by the dual-stage Hungarian-based assignment algorithm. The performance of the DNN scheme is evaluated by simulations. The simulation results prove that the proposed DNN scheme providessimilar performance to the dual-stage Hungarian-based assignment algorithm while providing a low execution time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.131-134
• /
• 2000

Only MAC protocol can satisfy the service quality of the request of bandwidth, delay time, and cell loss at the same time and it is because MAC protocol provides mobile terminal an environment to use channel evenly and effectively This Paper has been adapted Mobile ATM Standardization of ETSI in maximum and used not only for practicing in-band signal to a priority order but also to the next reserved slot assignment of the dynamic frame. Also, by accepting VBR traffic more adaptively, the effectiveness of transmission channel has been maximized as well, and these are compared with the old way of it and analyzed to confirm the effectiveness.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.819-822
• /
• 2010

Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.