• Title/Summary/Keyword: 경쟁 윈도우

Search Result 59, Processing Time 0.03 seconds

An Analysis and Suggestion for Chinese Single Window based on Korean Single Window (한국의 싱글 윈도우 모범 사례를 통해서 본 중국 싱글윈도우의 실태 분석과 제언)

  • Han, Min-Chung;Ahn, Byung-Soo
    • International Commerce and Information Review
    • /
    • v.13 no.2
    • /
    • pp.27-48
    • /
    • 2011
  • Single window has become a critical point of trade facilitation. While Korea has set up the first web based single window 'uTtradeHub', China has also been working on a seamless single window. As strong governmental support, advanced technology, leading agency and legal framework are success factors for single window, China already has solid foundation for this. For the leading agency, this research suggests the CIECC as a leading agency with linkage to E-Port service for seamless trade service for companies. We expect that Chinese single window will materialize in near future by a leading agency with the help of strong governmental support.

  • PDF

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

Analysis of MIMD Backoff Algorithm for IEEE 802.11 DCF (IEEE 802.11 DCF를 위한 MIMD 백오프 알고리즘 분석)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.12 no.3
    • /
    • pp.299-307
    • /
    • 2011
  • The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF. The DCF controls the transmission based on CSMA/CA The BEB backoff algorithm of DCF shows relatively excellent performance in situation that the number of competing station is less, but has a problem that performance of throughput and delay is degraded in situation that the number of competing station is increased. This paper mathematically analyzes an MIMD backoff algorithm considering retry limit that increases the CW to doubled after collision and decreases smoothly the CW to halves after successful transmission in order to reduce the collision probability. To prove efficiency of the MIMD backoff algorithm, lots of simulations are conducted and analyzed.

A Study on New DCF Algorithm in IEEE 802.11 WLAN by Simulation (시뮬레이션에 의한 IEEE 802.11 WLAN에서의 새로운 DCF 알고리즘에 관한 연구)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.61-67
    • /
    • 2008
  • In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

  • PDF

국내 POST PC 산업현황 및 발전방향

  • Korea Electronics Association
    • Journal of Korean Electronics
    • /
    • v.21 no.11
    • /
    • pp.19-23
    • /
    • 2001
  • 향후 디지털 사회는 포스트 PC가 주도할 전망이다. 이에 따라 포스트 PC사업을 둘러싸고 마이크로소프트와 리눅스 업체들 간 협력사 확보 경쟁도 치열하게 전개되고 있으며 연말쯤에는 윈도우와 리눅스 계열의 포스트 PC제품이 속속 등장해 수요경쟁을 벌일 것으로 전망된다. 이에 본회 정보 통신 산업 팀에서는 지난 10월 12일 COEX에서 한국전자전 부대행사로 본회 회원사, 컴퓨터 업체, 정보통신 벤처 업계 등 1000개사가 참석한 가운데 국내 POST PC산업현황과 향후 발전방안을 주제로 기술세미나를 개최하였다. 본고는 세미나 내용 중 전자부품연구원 서경학 본부장이 발표한 내용을 중심으로 요약 정리하였다.

  • PDF

An Adaptive Contention Windows Adjustment Scheme Based on the Access Category for OnBord-Unit in IEEE 802.11p (IEEE 802.11p에서 차량단말기간에 혼잡상황 해결을 위한 동적 충돌 윈도우 향상 기법)

  • Park, Hyun-Moon;Park, Soo-Hyun;Lee, Seung-Joo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.28-39
    • /
    • 2010
  • The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

Adaptive CSMA/CA Protocol Using Flag in Aeronautical VHF Communication (플래그를 이용한 항공 VHF 통신환경에서의 적응형 CSMA/CA 프로토콜)

  • Kim, Yong Joong;Park, Yong Tae;Park, Hyo Dal
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.2
    • /
    • pp.199-205
    • /
    • 2003
  • In this paper, CSMA/CA protocol is modified for aeronautical VHF communication through collision alleviation and the change of retransmission slot selection method in flag used transmission. When collision occurred in the contention period of CSMA/CA process, it is generally waiting for retransmission delay and it has the double size of CW(Contention Window). To solve this problem, this paper modifies the change procedure of original contention window size and reduces the state transition in collision among the whole of it. Also, in this paper we reduces the second collision probability through the station has to enter Backoff mode with increased contention window in the first collision. In the result of simulation, it is verified that it has good property in throughput and delay, So the proposed protocol is suitable for aeronautical VHF communication.

  • PDF

Load-based Dynamic Backoff Algorithm in Contention-based Wireless Shared Medium (단일 경쟁 매체에서의 새로운 로드 기반 동적 매체 접속 제어 백오프 알고리즘)

  • Seo Chang-Keun;Wang Weidong;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.406-415
    • /
    • 2005
  • The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

Reservation based Collision Reduction Scheme in Wireless LANs (무선 랜에서 채널 예약을 통한 충돌 감소 방법)

  • Hyun, Jong-Uk;Kim, Sunmyeng
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.390-392
    • /
    • 2015
  • IEEE 802.11 DCF(Distributed Coordination Function) 프로토콜은 이진 지수 백오프 방식을 사용한다. 단말은 데이터 전송 전에 충돌을 피하기 위해 일정한 시간동안 채널 휴지(Idle)를 기다린다. 데이터 전송이 성공하면 경쟁 윈도우 값을 두 배로 증가시키고 실패하면 최소 값으로 초기화 한다. 이를 통해 DCF는 충돌을 회피하지만 단말의 수가 증가함에 따라 충돌율은 증가하고 전체 네트워크 성능은 저하된다. 본 논문에서는 이 문제를 해결하기 위해 예약 방식을 통한 데이터 전송 방법을 제안한다. 제안된 방법에서 채널 시간을 예약 구간과 경쟁 구간으로 나눈다. 기본적으로 경쟁 구간에서 단말들은 DCF와 마찬가지로 경쟁 방식을 통해 데이터를 전송할 때 예약 구간에 대한 채널 예약을 AP에게 요청한다. 또한 예약 구간에서 데이터를 전송한 단말은 다음 예약 구간에서의 예약을 요청한다. AP는 채널 예약을 수행한다. 채널 예약에 성공한 단말은 예약 구간에서 비경쟁 방법으로 데이터 패킷을 전송한다. 따라서 DCF의 충돌율을 낮추고 전체적인 네트워크 성능을 향상시킨다.

An Adaptive Contention-window Adjustment Technique Based on Individual Class Traffic for IEEE 802.11e Performance (802.11e의 성능 향상을 위한 개별적 클래스 트래픽에 기반한 동적 충돌 윈도우 크기 조절 기법)

  • Um, Jin-Yeong;Oh, Kyung-Sik;Ahn, Jong-Suk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.191-195
    • /
    • 2008
  • This paper proposes a technique for improving IEEE 802.11e EDCA's performance by dynamically adjusting each class's contention window size based on each class's traffic amount. For providing differentiated service differently from 802.11, 802.11e EDCA maintains four classes each of which specifies different static minimum and maximum contention window sizes. Since the initial window sites significantly affect the 802.11e performance, several window adjustment schemes have been proposed. One of the schemes known as CWminAS (CWmin Adaptation Scheme) dynamically and synchronously determines the four windows' site based on the periodically measured collision rate. This method, however, can lower the send probability of high priority classes since it can't differentiate their collisions from those of low priority classes, leading to the channel underutilization. For solving this problem, we propose ACATICT(Adaptive Contention-window Adjustment Technique based on Individual Class Traffic) algorithm which adapts each class window size based on each individual collision rate rather than one average collision rate. Our simulation experiments show that ACATICT achieves better utilization by around 10% at maximum.