• Information and Communications Magazine
• /
• v.15 no.2
• /
• pp.61-82
• /
• 1998

무선 ATM의 MAC 프로토콜은 독립적으로 분산되어 있는 이동 단말기들을 대상으로 ATM이 추구하는 진정한 의미의 통계적 다중화 기능을 무선 매체를 통해 확장하는 역할을 한다. 이와 같은 매체 접근 제어 프로토콜을 통해서만 멀티미디어 서비스 특성에 따라 동적으로 변하는 대역 요구 사항과 지연 시간 및 셀 손실 등의 서비스 품질을 동시에 만족시킬 수 있으며, 이동 단말기들이 채널을 공평하면서도 효율적으로 사용할 수 있는 접속 환경을 제공할 수 있다. 따라서, 이와 관련한 유럽의 ACTS 프로젝트 및 제외국에서의 기술 개발 사례와 ATM Forum WATM-WG에서의 표준화 동향을 분석하여 향후 무선 ATM 구현에 필요한 요소 기술로서의 매체 접근 제어 방식의 설계 및 구현 방안에 대해서 고찰함으로써 향후 연구 방향을 제시하고자 한다.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.213-222
• /
• 2017

The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

• 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.25 no.1A
• /
• pp.74-80
• /
• 2000

In this paper, we proposed the MAC protocol and analyzed the performance for CATV/LAN network which was based upon HFC(hybrid optic coaxial) increased abruptly as alternative method of high speed network. Upstream channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that position and unidirectional property. To solve this fairness problem, we propose the CSMA-CD/U/P protocol that transm it as $P_i$ probability although data packets is immediately transmitted when it was occurred. As the analytic result and simulation, we obtained $P_i$ value and its average delay time. Also, we get its variance value and queue length distribution. The mean delay time and queue length increase as the load and number of stations increase in the CATV/LAN network.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.12-17
• /
• 1999

WATM(Wireless ATM)에서의 매체접근제어(Medium Access Control)는 QoS를 보장하기 위해 다양한 방식들이 제안되어 왔다. 현재까지 제안되어 온 매체접근제어 방식들은 시분할 다중화 방식 (TDMA)과 예약경쟁방식을 주로 사용하고 있다. 이때 활용되는 기능에는 QoS를 보장하기 위해 통계적 다중화, 스케쥴링 또는 예약 방식 등이 있는데 경쟁 방식은 아직까지 slotted-ALOHA를 그대로 사용하고 있다. Slotted-ALOHA방식의 단점을 개선하기 위하여 통계적 방식으로 경쟁을 제어하거나 물리적 방식으로 경쟁을 분리시켜 그 효율을 향상 시켜왔으나 우선 순위가 같은 이동국들이 많을 경우에는 해결할 방법이 없었다. 이러한 문제점들은 기지국 중심의 경쟁방식이라는 점이 그 문제를 해결하는데 있어서의 걸림돌이다. 본 논문에서는 이미 슬롯을 할당받은 동료 이동국에게 예약요청을 피기백킹(piggybacking)함으로써 신속하게 슬롯을 할당을 받을 수 있는 분산 경쟁방식을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1142-1150
• /
• 2009

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.213-220
• /
• 2008

In a distributed processing environment composed of many independent systems connected by networks, it is very important and difficult to make time synchronization between the systems. Especially in the USN environment the time synchronization is still more difficult than in general distributed processing environment because energy is limited and communication function is feeble. Even though of these difficulties, the USN environment requires higher precision of time synchronization. We of the typical applications requesting very strict time synchronization in USN is TDMA MAC. This paper proposes and evaluates a new time synchronization protocol HTSP(Hierarchical Time Synchronization Protocol) which is an advanced version of the FTSP(Flooding Time Synchronization Protocol) published recently. The time synchronization precision of the HTSP is equal to that of the FTSP, but the energy consumption of the HTSP is lower than that of the FTSP owing to the reduced number of broadcast messages. The simulation results show that the energy consumption of the HTSP is only 74% of that of the FTSP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.81-89
• /
• 2000

In this paper, we analyzed the performance for CATV/LAN added priority problem. Upstrea nm channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that positionand unidirectional property. To solve that fairness problem and priority, we propose the CSMA-CD/U/P-P protocolthat transmit as P1 probability if data packets happen. We assumed 2-Class priority(high, low). As the analyticresult and simulation, we obtained P1, value and its average delay time under priority problem assumed twoscenarios. Also, we get its variance value and queue length. Especially, the mean delay time increases nearer thanposition from H/E

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.4
• /
• pp.67-76
• /
• 2002

Kerberos is designed to provide strong authentication between client and application servers which are working in distributed network environment by using symmetric-key cryptography, and supposed to trust other systems of the realm. In this paper, we design an efficient and strong authentication mechanism by introducing the public/private-key to Kerberos. In the mechanism to make a system more secure, the value of the session key is changed everytime using MAC(message authentication code) algorithm with the long-term key for user-authentication and a random number exchanged through the public key. Also, we employ a mutual authentication method, which is used on challenge-response mechanism based on digital signatures, to improve trust between realms, and present a way of reducing the number of keys by simplifying authentication steps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1117-1119
• /
• 2015

In this letter, we propose a mathematical model of variable-length payloads transmitted in EDCA and transmitted using MU-MIMO. Assuming fixed-length or the use of mean value of payload length leads to discordant results while calculating the total payload length of variable-length frames transmitted within a fixed duration. Using the proposed model results in accurate results (less than 3% relative errors) for total payload length under variable-length traffic.