• 제목/요약/키워드: Collision Protocols

검색결과 98건 처리시간 0.026초

Throughput Analysis and Optimization of Distributed Collision Detection Protocols in Dense Wireless Local Area Networks

  • Choi, Hyun-Ho;Lee, Howon;Kim, Sanghoon;Lee, In-Ho
    • Journal of Communications and Networks
    • /
    • 제18권3호
    • /
    • pp.502-512
    • /
    • 2016
  • The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

Research on Anti-Reader Collision Protocols for Integrated RFID-WSNs

  • Ko, Doo-Hyun;Kim, Bum-Jin;An, Sun-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권5호
    • /
    • pp.776-796
    • /
    • 2010
  • Integrated RFID-WSNs (wireless sensor networks) have recently been researched to provide object identities, sensing information, mobile service, and network functionalities. In integrated RFID-WSNs, the reader collision is one of the critical problems. Above all, due to the absence of universally applicable anti-collision protocols and the channel capture phenomenon, the medium access control protocols in integrated RFID-WSNs suffer from reader collision and starvation problems. In this paper, we propose an efficient MAC protocol, called EMP, to avoid the above problems in integrated RFID-WSNs. EMP is a CSMA-based MAC protocol which is compatible with sensor networks operating on integrated nodes which consist of an RFID reader and a senor node. EMP resolves not only the reader collision problem, but also the starvation problem using a power control mechanism. To verify the performance of EMP, we compared it with other anti-reader collision MAC protocols using simulations. As a result, the performance of EMP showed improvements in throughput, system efficiency, and energy consumption compared to the single data channel protocols (CSMA/CA, Pulse, and DiCa) in dense deployment environments.

상대적인 RFID 시스템 정보와 커뮤니케이션 공학의 anti-collision 프로토콜에 대한 연구 (Comparative performance study of anti-collision protocols in RFID system Information and Communication Engineering)

  • ;최영일;최동유;한승조
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 춘계종합학술대회 A
    • /
    • pp.253-259
    • /
    • 2008
  • RFID is a generic term for technologies which use RF waves to identify, track, or categorize any object. A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. One of the research areas in RFID system is a tag anti-collision protocol. In this paper, various anti-collision protocols are discussed. The pros and cons of different anti-collision protocols are compared with each other and their performance is analyzed and the better performance anti-collision protocol is suggested.

  • PDF

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.

고속 광 지역망을 위한 수신측 충돌 방지 파장 분할 다중 접근 프로토콜 (Wavelength Division Multiple Access Protocols with Receiver Collision Avoidance for High-Speed Optical Fiber Local Area Networks)

  • 조원홍;이준호;이상배
    • 전자공학회논문지A
    • /
    • 제31A권5호
    • /
    • pp.10-17
    • /
    • 1994
  • Two protocols inclouding the receiver collision avoidance function are proposed for high-speed optical fiber LANs with finite users. The basic idea to avoid receiver collision is the grouping of destination nodes by the number of channels and it is accomplished in the architecture with or without one separate control channel. While the protocol with a control channel requires a tunable optical transmitter, a fixed optical transmitter and two fixed optical receiver, the other protocol requires a tunable optical transmitter and one fixed optical receiver. The performance of two receiver collision avoidance protocols is computed and analyzed under various system parameters. The numerical results show that the receiver collision avoidance protocol has better performance for a small load than the protocol without receiver collision avoidance.

  • PDF

Idle Slots Skipped Mechanism based Tag Identification Algorithm with Enhanced Collision Detection

  • Su, Jian;Xu, Ruoyu;Yu, ShiMing;Wang, BaoWei;Wang, Jiuru
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.2294-2309
    • /
    • 2020
  • In this article, a new Aloha-based tag identification protocol is presented to improve the reading efficiency of the EPC C1 Gen2-based UHF RFID system. Collision detection (CD) plays a vital role in tag identification process which determines the efficiency of anti-collision protocols since most Aloha-based protocols optimize the incoming frame length based on the collisions in current frame. Existing CD methods are ineffective in identifying collision, resulting in a degradation of identification performance. Our proposed algorithm adopts an enhanced CD (ECD) scheme based on the EPC C1 Gen2 standard to optimize identification performance. The ECD method can realize timely and effective CD by detecting the pulse width of the randomly sent by tags. According to the ECD, the reader detects the slot distribution and predicts tag cardinality in every collision slot. The tags involved in each collision slot are identified by independently assigned sub-frames. A large number of numerical results show that the proposed solution is superior to other existing anti-collision protocols in various performance evaluation metrics.

OFSA: Optimum Frame-Slotted Aloha for RFID Tag Collision Arbitration

  • Lee, Dong-Hwan;Choi, Ji-Hoon;Lee, Won-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권11호
    • /
    • pp.1929-1945
    • /
    • 2011
  • RFID technologies have attracted a lot of attention in recent years because of their cost/time-effectiveness in large-scale logistics, supply chain management (SCM) and other various potential applications. One of the most important issues of the RFID-based systems is how quickly tags can be identified. Tag collision arbitration plays a more critical role in determining the system performance especially for passive tag-based ones where tag collisions are dealt with rather than prevented. We present a novel tag collision arbitration protocol called Optimum Frame-Slotted Aloha (OFSA). The protocol has been designed to achieve time-optimal efficiency in tag identification through an analytic study of tag identification delay and tag number estimation. Results from our analysis and extensive simulations demonstrate that OFSA outperforms other collision arbitration protocols. Also, unlike most prior anti-collision protocols, it does not require any modification to the current standards and architectures facilitating the rollout of RFID systems.

RFID 충돌방지 프로토콜의 성능 개선에 관한 연구 (A Study on Performance Enhancement of RFID Anti-Collision Protocols)

  • 김영범
    • 융합신호처리학회논문지
    • /
    • 제12권4호
    • /
    • pp.281-285
    • /
    • 2011
  • RFID 시스템 구현에 있어서 중요한 고려사항 중의 하나는 인식 범위 내에 있는 태그들을 최소한의 인식 지연시간을 가지고 모두 인식하도록 하기 위한 충돌방지 알고리즘의 설계이다. 또한 이러한 충돌방지 알고리즘의 설계에 있어서 일반적으로 태그 및 리더의 메모리 및 계산력 상의 제약조건이 감안되어야 한다. 본 논문에서는 산업분야 RFID 표준으로 정립된 Gen2 프로토콜에서 제시하는 기본적인 태그인식 충돌방지 알고리즘과 Q 알고리즘, 그리고 FAFQ 알고리즘의 성능과 문제점을 분석하고 태그 밀집 수준에 따른 프레임 길이의 동적 설정을 통하여 태그 식별시간 측면에서 RFID 시스템의 성능 향상을 기대할 수 있는 새로운 RFID 충돌방지 알고리즘을 제시한다. 또한 컴퓨터 시뮬레이션을 통하여 기존 Q 알고리즘과 FAFQ 알고리즘, 그리고 제안된 알고리즘의 성능을 비교하였다.

Delay Analysis of Carrier Sense Multiple Access with Collision Resolution

  • Choi, Hyun-Ho;Lee, In-Ho;Lee, Howon
    • Journal of Communications and Networks
    • /
    • 제17권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.

Reader Collision Avoidance Scheme for Mobile RFID-Sensor Integrated Networks

  • Ko, Doo-Hyun;Kim, Song-Min;Lee, Sang-Bin;An, Sun-Shin
    • 전기전자학회논문지
    • /
    • 제13권2호
    • /
    • pp.108-117
    • /
    • 2009
  • In recent years, one of alternatives for constructing RFID networks that provide mobile services is using wireless sensor networks (WSN) to enhance network capacity, utility and scalability. Due to absence of compatible reader anti-collision control and channel capture phenomenon, the medium access control protocols as used in the RFID networks lead to reader collision and starvation problem. In this paper, we develop a MAC protocol which is called Enhanced Collision Avoidance MAC (ECO) to avoid reader to reader collisions in an integrated RFID network. ECO is a CSMA-based MAC protocol, and operates on integrated nodes which consist of a RFID reader and a mote. Performance evaluation shows superior results to pure-CSMA protocols under dense deployment environments, both in number of failures and in throughput.

  • PDF