• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.3
• /
• pp.272-281
• /
• 2013

Traffic Collision Avoidance System (TCAS) is designed to enhance safety in aircraft operations, by reducing the incidences of mid-air collision between aircraft. The current version of TCAS provides only vertical resolution advisory to the pilots, if an aircraft's collision with another is predicted to be imminent, while efforts to include horizontal resolution advisory have been made, as well. This paper introduces a collision resolution algorithm, which includes both vertical and horizontal avoidance maneuvers of aircraft. Also, the paper compares between the performance of the proposed algorithm and that of algorithms with only vertical or horizontal avoidance maneuver of aircraft.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.33-43
• /
• 2013

This paper proposes a distributed MAC protocol called Carrier Sensing Multiple Access with Collision Resolution (CSMA/CR) considering fully-connected single hop network environments for next-generation wireless LAN with high density of stations. The proposed CSMA/CR is compatible with the conventional MAC protocols by observing the operation of CSMA/CA and is able to detect a collision promptly without RTS/CTS exchange by applying the technique of CSMA/CD to wireless environments. Moreover, once a collision is detected, the dedicated resource is allocated to the next transmission and so the collision that may occur again is resolved. We investigate some implementation issues for the practicality of CSMA/CR and compare it with the typical distributed MAC protocols. The simulation results show that the proposed CSMA/CR has a low overhead as detecting a collision without the RTS/CTS exploitation and achieves always the best throughput regardless of the number of access stations, by using the reservation-based collision resolution technique.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.113-118
• /
• 2002

To provide interactive sonics in HFC(Hybrid Fiber Coax)-CATV network, there must be supported a MAC(Medium Access Control) protocol. It is wet known that collision can be occurred in the HFC upstream channel because it is shared by up to 500 users. Thus it needs the collision resolution algorithm. Consequently, this paper proposes the analysis mood to study stability of binary stack algorithm for adaptive collision resolution algorithm in HFC-CATV. Also, it compares a system throughput between IPP model and D-BMAP model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.5
• /
• pp.225-231
• /
• 2002

This paper proposes a discriminative collision resolution scheme for the wireless Medium Access Control (MAC) protocols to support the Quality of Service (QoS) requirements of real-time applications. Our scheme deals with access requests in different ways depending on their delay requirements. In our scheme, a Collision Resolution Period (CRP) is used to quickly resolve collisions for the delay sensitive traffic in order to support their delay requirements. Performance analysis and simulation results show that our algorithm may successfully meet the delay requirements of real time applications by reducing access delays and collisions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2259-2266
• /
• 2016

Recently dense wireless local area networks (WLANs) emerge as the number of WLAN cells and stations increases. In such dense WLAN environment, this paper proposes a new distributed medium access control (MAC) protocol. The proposed MAC protocol extends the previous CSMA with collision resolution (CSMA/CR) that uses a single collision detection (CD) phase and employs multiple CD phases to resolve more collisions. It checks the collision detection in each CD phase and stops the CD phase if consecutive non-detected CD phases occur more than the threshold. Therefore, the proposed protocol can control the number of CD phases adaptively according to the number of accessing stations and increase the probability of collision resolution while decreasing the packet overhead. The simulation results show that the proposed adaptive CSMA/CR protocol employs a variable number of CD phases according to the number of stations and achieves a greater throughput than the previous CSMA/CR protocol using the fixed number of CD phases.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.275-285
• /
• 2015

To improve the efficiency of carrier sense multiple access (CSMA)-based medium access control (MAC) protocols, CSMA with collision resolution (CSMA/CR) has been proposed. In the CSMA/CR, a transmitting station can detect a collision by employing additional sensing after the start of a data transmission and then resolve the next collision that might occur by broadcasting a jam signal during a collision detection (CD) period. In this paper, we analyze the delay of a CSMA/CR based on a generic p- persistent CSMA model and obtain the minimum achievable delay of the CSMA/CR by finding the optimal length of the CD period according to the number of contending stations. Through this delay analysis, we also investigate the throughput-delay characteristics of the CSMA/CR protocol according to various parameters. Analysis and simulation results show that the CSMA/CR has a considerably lower delay and its throughput-delay characteristic is significantly improved than the conventional CSMA/CA and wireless CSMA/CD protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3152-3165
• /
• 2012

Wireless sensor networks (WSN) often employ asynchronous MAC scheduling, which allows each sensor node to wake up independently without synchronizing with its neighbor nodes. However, this asynchronous scheduling may not deal with collisions due to hidden terminals effectively. Although most of the existing asynchronous protocols exploit a random back-off technique to resolve collisions, the random back-off cannot secure a receiver from potentially repetitive collisions and may lead to a substantial increase in the packet latency. In this paper, we propose a new collision resolution algorithm called Transient Coordinator (TC) for asynchronous WSN MAC protocols. TC resolves a collision on demand by ordering senders' transmissions when a receiver detects a collision. To coordinate the transmission sequence both the receiver and the collided senders perform handshaking to collect the information and to derive a collision-free transmission sequence, which enables each sender to exclusively access the channel. According to the simulation results, our scheme can improve the average per-node throughput by up to 19.4% while it also reduces unnecessary energy consumption due to repetitive collisions by as much as 91.1% compared to the conventional asynchronous MAC protocols. This demonstrates that TC is more efficient in terms of performance, resource utilization, and energy compared to the random back-off scheme in dealing with collisions for asynchronous WSN MAC scheduling.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.116-124
• /
• 2016

This paper proposes a medium access control protocol for collision detection and resolution when a large number of sensor nodes transmits data in vehicle. The proposed protocol selects a random collision detection (CD) slot after data transmission, suspends its transmission and senses the channel to check whether a collision occurs by the detection of both energy level and jam signal. The proposed scheme uses multiple CD phases and in each CD phase, colliding stations are filtered and only surviving stations compete again in the next CD phase; thus, the collision resolution probability significantly increases. Simulation results show that the proposed protocol using the multiple CD phases has significantly better throughput than the conventional protocol. In addition, according to the number of CD phases and the number of CD slots per phase, the throughput aspect of the proposed scheme is investigated and the optimal parameters are derived.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.125-128
• /
• 2003

This paper proposes efficient cloth animation and collision handling methods. There have been various techniques for the generation of cloth behavior. However, the cloth animation is still a challenging subject in real-time environments. This paper presents an efficient animation method based on implicit integration. The proposed method can efficiently animate virtual cloth object with complex geometry. In addition, this paper also introduces an efficient collision handling method. The collision resolution is another important issue in cloth animation since deformable objects has special collision problem called self-collision. In this paper, the self-collision was successfully avoided in real - time environments.