• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.119-123
• /
• 2001

The CDMA system with time division duplex mode (CDMA/TDD system) is a highly attractive solution to support the next generation cellular mobile systems providing multimedia services where the traffic unbalance between downlink and uplink exists. In this paper, the capacity of the CDMA/TDD system is analyzed in general multicell environments. For this analysis, the interference for a time slot is analyzed, and a time slot and channel allocation problem is mathematically formulated and solved using simulated annealing technique. Computational experiments provide a promising result.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.1-10
• /
• 2021

In recent decades, the heterogeneous and dynamic behavior of Internet traffic has placed new demands on the adaptive resource allocation of the optical network infrastructure. However, the advent of multifiber elastic optical networks has led to a higher degree of spectrum fragmentation than conventional flexible grid networks due to the dynamic and random establishment and removal of optical connections. In this paper, we propose heuristic routing and dynamic slot allocation algorithms to minimize spectrum fragmentation and reduce the probability of blocking future connection requests by considering the power consumption in elastic multifiber elastic optical networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.814-821
• /
• 2005

When there are many tags using the same frequency around the reader in RFID system, they disturb each other and in the end their response cannot be received by the reader. To solve this disturbance and fast identify the tags, the anti-collision algorithm, which is the core technology in RFID system, is needed. We propose two ALOHA-type Dynamic Framed Slotted ALOHA(DFS-ALOHA) algorithms using Dynamic Slot Allocation(DSA), which dynamically allocates the frame size in accordance with the number of tags and Tag Estimation Method(TEM), which estimates the number of tags around the reader. We also compare the performance of the proposed DFS-ALOHA algorithms with that of the conventional Framed Slotted ALOHA (FS-ALOHA) algorithms and the algorithms proposed by Vogt using OPNET simulation. According to the analysis, the two proposed DFS-ALOHA algorithms(DFS-ALOHA I and DFS-ALOHA II) show better performance than the conventional ALOHA-based algorithms regardless of the number of tags. Although the two proposed DFS-ALOHA algorithms show the similar performance, BFS-ALOHA ll is better because it is easier to be implemented in the system and the complexity is lower.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5835-5854
• /
• 2017

The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• 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.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.295-309
• /
• 2015

Beacon scheduling is considered to be one of the most significant challenges for energy-efficient Low-Rate Wireless Personal Area Network (LR-WPAN) multi-hop networks. The emerging new standard, IEEE802.15.4e, contains a distributed beacon scheduling functionality that utilizes a specific bitmap and multi-superframe structure. However, this new standard does not provide a critical recipe for superframe duration (SD) allocation in beacon scheduling. Therefore, in this paper, we first introduce three different SD allocation approaches, LSB first, MSB first, and random. Via experiments we show that IEEE802.15.4e DSME beacon scheduling performs differently for different SD allocation schemes. Based on our experimental results we propose an adaptive SD allocation (ASDA) algorithm. It utilizes a single indicator, a distributed neighboring slot incrementer (DNSI). The experimental results demonstrate that the ASDA has a superior performance over other methods from the viewpoint of resource efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.684-690
• /
• 2003

In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.