• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.615-623
• /
• 2008

Wireless LAN (WLAN) has greatly benefited from the introduction of various technologies, such as MAC protocol and scheduling algorithm. The majority of these technologies focus on fairness or service differentiation. However, it is difficult to use these technologies to provide many benefits to WLAN simultaneously because the current WLAN system only focuses on the provision of a single aspect of QoS. Unfortunately, multimedia applications require both service differentiation and fairness. Therefore, this paper combines Distributed Fair Scheduling (DFS) and Enhanced Distributed Coordinate Function (EDCF), to provide both fairness and service differentiation simultaneously. Furthermore, we show numerical analysis using Markov process. The simulation results demonstrate that F-EDCF outperforms the EDCF, in terms of throughput, fairness, and delay viewpoints.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.12-21
• /
• 2012

IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1280-1288
• /
• 2014

In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. First, we learn about ECMA-392-based network and examine the consideration and the problems for assigning channels to the device. And, we propose a fair channel resource allocation to ensure efficiently channel required by device groups in ECMA-392 MAC protocol. This is a method to reallocate the channels fairly with considering the channel assignment parameters to a new device group and existing device groups. The simulation results show that the proposed scheme improves throughputs compared to the existing one.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.14-18
• /
• 2014

A recent major development in computer technology is the advent of wearable computer systems. Wearable computer systems employ a wireless universal serial bus (WUSB), which refers to a combination of USB with the WiMedia wireless technical specifications. In this study, we focus on an integrated system of WUSB over wireless body area networks (WBANs) for wireless wearable computer systems. However, current WBAN MACs do not have well-defined quality of service (QoS) mapping and resource allocation mechanisms to support multimedia streams with the requested QoS parameters. To solve this problem, we propose a novel QoS-aware time slot allocation method. The proposed method provides fair and adaptive QoS provisioning to isochronous streams according to current traffic loads and their requested QoS parameters by executing a QoS satisfaction algorithm at the WUSB/WBAN host. The simulation results show that the proposed method improves the efficiency of time slot utilization while maximizing QoS provisioning.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.660-664
• /
• 2010

This paper proposes a backoff control scheme for guaranteeing fair packet transmissions in TDMA wireless networks. In order to maximize the system performance, the number of packets transmitted in a frame should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability according to the offered loads and then broadcasts to all the mobile stations. Mobile stations attempt to transmit a packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and delay performance than the conventional one regardless of the offered loads.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.496-498
• /
• 2005

본 논문에서는 RFID 시스템에서 식별영역 내에 있는 태그들을 식별하기 위하여 무기억 특성을 갖는 QT 프로토콜을 개선한 QT_rev 프로토콜을 제안한다. QT_rev 프로토콜에서는 질의 문자열이 식별코드의 처음 비트들과 일치하는 태그는 식별코드 중에서 질의 문자열을 제외한 나머지 비트들로만 응답한다. 또한 리더는 태그들의 응답 문자열 중에서 충돌이 발생한 비트 위치를 알 수 있으므로 충돌이 발생한 위치가 태그 식별코드의 마지막 비트이면 리더는 더 이상의 질의가 없이 두 개의 태그를 동시에 식별할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3880-3899
• /
• 2019

Distributive desynchronization algorithms based on pulse-coupled oscillator (PCO) models have been proposed for achieving collision-free wireless transmissions. These algorithms do not depend on a global clock or infrastructure overheads. Moreover, they gradually converge to fair time-division multiple access (TDMA) scheduling by broadcasting a periodic pulse signal (called a 'firing') and adjusting the next firing time based on firings from other nodes. The time required to achieve constant spacing between phase neighbors is estimated in a closed form or via stochastic modeling. However, because these algorithms cannot guarantee the completion of desynchronization in a short and bounded timeframe, they are not practical. Motivated by the limitations of these methods, we propose a practical solution called PD-DESYNC that provides a short and deterministic convergence time using a flag firing to indicate the beginning of a cycle. We demonstrate that the proposed method guarantees the completion of desynchronization within three cycles, regardless of the number of nodes. Through extensive simulations and experiments, we confirm that PD-DESYNC not only outperforms other algorithms in terms of convergence time but also is a practical solution.