• 제목/요약/키워드: Collision Resolution Algorithm

검색결과 47건 처리시간 0.035초

A Development of 3-D Resolution Algorithm for Aircraft Collision Avoidance

  • Kim, Youngrae;Lee, Sangchul;Lee, Keumjin;Kang, Ja-Young
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제14권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.

HFC-CATV 망에서의 충돌해결알고리즘에 대한 성능분석 (Performance Analysis of an Collision Resolution Algorithm in HFC-CATV Network)

  • 이수연;안정희
    • 한국콘텐츠학회논문지
    • /
    • 제2권3호
    • /
    • pp.113-118
    • /
    • 2002
  • HFC(Hybrid Fiber Coax)기반으로 한 CATV망에서 양방향을 제공하기 위해서는 매체접근제어(Medium Access Control)프로토콜이 필요하다. 특히, 가입자에서 헤드앤드로 데이터를 전송하는 상향채널은 500가입자 이상이 공유하기 때문에 충돌이 발생하게 된다. 본 논문은 HFC-CATV망에 적합한 충돌해결알고리즘인 이진 스택 알고리즘의 안정성(stability)을 연구하기 위해 분석 모델을 제안하고 기존 모델과의 시스템 처리율(throughput)을 비교ㆍ분석하였다

  • PDF

HFC-CATV 망에서 동적 우선순위 충돌해결알고리즘에 관한 연구 (Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network)

  • 이수연;정진욱
    • 정보처리학회논문지C
    • /
    • 제10C권5호
    • /
    • pp.611-616
    • /
    • 2003
  • 최근 HFC(Hybrid Fiber Coax) CATV 망이 초고속망의 하부구조로 자리를 잡아가고 있다. HFC-CATV 망의 상향채널은 가입자에서 헤드엔드로 데이터 전송시 500가입자 이상이 공유하기 때문에 충돌이 발생하게 된다. 특히, 음성, 비디오 그리고 데이터와 같은 다양한 종류의 트래픽 QoS(Qualify of Service)를 만족시키기 위해서 서비스별로 우선순위를 고려한 알고리즘이 요구되어진다. IEEE 802.14에서 제안된 우선순위 기반 3진 트리(Ternary tree)알고리즘은 정적 PNA(Priority New Access) 슬롯 구조를 가진다. 이 방법은 실시간으로 변화하는 트래픽의 요구 지연(request delay)이 높게 유지되며 서로 다른 우선순위 트래픽의 요구 경쟁 확률이 동일하다는 문제점을 가지고 있다. 따라서, 본 논문에서는 동적 PNA(Priority New Access) 슬롯 구조를 제안하여 높은 우선순위 트래픽의 요구지연을 낮게 하고 새로운 스테이션에 대해 우선순위 별로 경쟁 확률을 다르게 하는 알고리즘을 제안한다. 동일한 조건하에 두 알고리즘에 대해 요구지연 값을 비교 분석하였다. 성능 분석 결과 동적 PNA 우선순위 충돌해결알고리즘이 정적 PNA 우선순위 충돌해결알고리즘보다 낮은 요구지연을 가진다는 것을 확인할 수 있었다.

A Developed Collision Resolution Algorithm in MAC Protocol for IEEE 802.11b Wireless LANs (ICEIC'04)

  • Chung Kyung Taek;Pan Ce;Park Hyun;Kim Byun Gon;Chon Byoung Sil
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 학술대회지
    • /
    • pp.681-685
    • /
    • 2004
  • Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

  • PDF

A Reactive Cross Collision Exclusionary Backoff Algorithm in IEEE 802.11 Network

  • Pudasaini, Subodh;Chang, Yu-Sun;Shin, Seok-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권6호
    • /
    • pp.1098-1115
    • /
    • 2010
  • An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

IEEE 802.16 광대역 무선 액세스 시스템을 위한 DCCG 알고리즘 (DCCG Algorithm for the IEEE 802.16 BWA System)

  • 김선희;이정규
    • 대한전자공학회논문지TC
    • /
    • 제40권11호
    • /
    • pp.10-16
    • /
    • 2003
  • 본 논문은 IEEE 802.16 광대역 무선 액세스 망을 위한 새로운 충돌 감소 방안으로 DCCG 알고리즘을 제안하였다. 이 알고리즘은 채널 경쟁 후 충돌이 발생한 슬롯 수와 가입자의 충돌 횟수에 따라서 상향링크의 자원요청 슬롯 구간을 결정한다. 그 결과 제안한 DCCG 알고리즘은 기존 Binary Back-off 알고리즘보다 처리율이 증가하였고 지연시간이 감소하였다.

Transient Coordinator: a Collision Resolution Algorithm for Asynchronous MAC Protocols in Wireless Sensor Networks

  • Lee, Sang Hoon;Park, Byung Joon;Choi, Lynn
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권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.

자율형 무인운반차를 위한 충돌회피동작의 생성(I) (Collision Avoidance Method for Autonomous Vehicle)

  • 임재국;이동형
    • 산업경영시스템학회지
    • /
    • 제22권50호
    • /
    • pp.33-44
    • /
    • 1999
  • This paper describes the Autonomous Vehicles (AV) which are operated for their own tasks. There are chances of conflict resolution such as sharing the same path which can lead to the risk of a collision. This research represents some ways of negotiating the conflict resolution by generating cooperative actions. Negotiation while traveling the path is accomplished by using priority and by announcing the start time of the task. When there is a risk of collision, the AV tries to dissolve the situation of conflict resolution by concurrently adjusting mutual speed and by performing the algorithm of passing. If the speed of the AV cannot be adjusted, it measures the distance between the counterpart of the AV and an obstacle along the path. Then it judges either to proceed by passing the counterpart of the AV or to turn back after observing the current circumstances. The performance of the algorithm described above was proven by a simulator.

  • PDF

IEEE 802.11b 무선 LAN의 MAC 프로토콜을 위한 개선된 충돌 해결 알고리즘 (A Developed Collision Resolution Algorithm in MAC Protocol for IEEE 802.11b Wireless LANs)

  • 판체;박현;김변곤;정경택;전병실
    • 대한전자공학회논문지TC
    • /
    • 제41권6호
    • /
    • pp.33-39
    • /
    • 2004
  • 무선 LAN은 이동중인 사람들이 무선으로 LAN에 연결을 가능하게 해주는 기술이다. 무선 LAN은 고속의 연결과 케이블이나 전화선, 그리고 데스크탑에 종속되지 않고 편리하게 인터넷에 접속할 수 있다. 802.11은 IEEE에서 규정한 무선 LAN의 표준안이다. 이 표준안은 무선에서 LAN에 접속할 수 있도록, 매체접근제어(MAC)와 물리(PHY) 계층을 정의하고 있다. MAC 프로토콜은 PHY 계층에 의존적이며, 공중망을 통해서 사용자 데이터의 전송을 제어한다. 그리고 규모가 큰 네트워크 백본에서 코어 프레이밍 동작과 상호작용을 제공한다. 무선 LAN에서 송은 MAC 프로토콜은 제한된 스펙트럼 리소스를 효율적으로 공유할 수 있고, 동작의 간결성과, 높은 처리율 기능을 제공해야 한다. 높은 데이터 처리율을 갖는 효과적인 MAC 프로토콜을 설계하는 것이 본 논문의 주요 내용이다. 본 논문에서는 무선 LAN에서의 MAC 프로토콜에 적용시키기 위한 Developed Collision Resolution(DCR) 알고리즘을 제안한다. 이 알고리즘은 충돌 해결 속도를 증가시키기 위한 새로운 해법을 제공한다.

A Probabilistic Algorithm for Multi-aircraft Collision Detection and Resolution in 3-D

  • Kim, Kwang-Yeon;Park, Jung-Woo;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제9권2호
    • /
    • pp.1-8
    • /
    • 2008
  • This paper presents a real-time algorithm for collision detection, collision avoidance and guidance. Three-dimensional point-mass aircraft models are used. For collision detection, conflict probability is calculated by using the Monte-Carlo Simulation. Time at the closest point of approach(CPA) and distance at CPA are needed to determine the collision probability, being compared to certain threshold values. For collision avoidance, one of possible maneuver options is chosen to minimize the collision probability. For guidance to a designated way-point, proportional navigation guidance law is used. Two scenarios on encounter situation are studied to demonstrate the performance of proposed algorithm.