• 제목/요약/키워드: packet collision

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

A Frame Collision Reduction Method for Safety Message Broadcasting in IEEE1609.4/IEEE802.11p based VANETs

  • Wang, Lei;Jing, Weiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1031-1046
    • /
    • 2018
  • Vehicular ad hoc network (VANET) is a dedicated network to connect vehicles without any centralized administration or infrastructure. The wireless access in vehicular environments (WAVE) protocol leveraging IEEE 1609/802.11p is widely implemented for VANETs. However, in congested traffic situation, the performance of the WAVE system degrades significantly due to serious collision, especially for safety related broadcast services on the control channel (CCH) interval due to the inherent drawback of its collision avoidance mechanisms called carrier sense multiple access with collision avoidance (CSMA/CA). In this paper, we propose a method that can decrease the number of frame collisions in CCH with a few modifications to the IEEE 802.11p protocol. In the paper, vehicles still employ CSMA/CA to compete for the channel access opportunity. However, by taking advantage of periodicity of synchronization interval, a two-state switching scheme introducing two new inter frame space (IFS) is proposed to reduce the number of competing vehicles substantially and as a result, the collision probability is significantly decreased. The simulation results demonstrate the superiority of the proposed method in packet collision rate.

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.

IEEE 802.15.6 기반 CSMA/CA 성능 향상에 관한 연구 (A Study on the CSMA/CA Performance Improvement based IEEE 802.15.6)

  • 이정재;김인환
    • 한국전자통신학회논문지
    • /
    • 제10권11호
    • /
    • pp.1225-1230
    • /
    • 2015
  • WBAN을 위한 MAC 프로토콜은 의료용 센서 노드의 가변적인 데이터를 효율적으로 처리하기 위해서 응급상황에서 발생하는 트래픽을 가장 높은 우선순위로 처리하는 CSMA/CA(: Carrier Sense Multiple Access with Collision Avoidance) 알고리즘을 수행하게 된다. 노드가 전송하는 응급 메시지는 충돌이 발생하게 되고 응급 메시지 재전송으로 인한 전송 지연이 발생할 수 있으며 재전송으로 인한 에너지 낭비를 가져올 수 있다. 본 논문에서는 이러한 문제점들을 개선하기 위해서 우선순위 큐잉을 적용한 CSMA/CA 알고리즘의 경우 MAC 명령어 프레임과 데이터 프레임의 우선순위를 정하여 서로 다른 백오프 파라미터를 적용하고 충돌로 인한 프레임 손실을 최소화하는 알고리즘을 제안하였다. 성능평가 결과 제안한 MAC 프로토콜을 사용했을 때가 IEEE 802.15.6을 사용했을때 보다 충돌 확률이 감소하여 패킷 전송 처리율이 증가하고 패킷 손실량이 감소함을 보였다.

IEEE 802.11a 무선 LAN에서 CSMA/CA MAC DCF 프로토콜의 성능 향상 (Performance Enhancement of CSMA/CA MAC DCF Protocol for IEEE 802.11a Wireless LANs)

  • 문일영;노재성;조성준
    • 한국항행학회논문지
    • /
    • 제8권1호
    • /
    • pp.65-72
    • /
    • 2004
  • IEEE 802.11a 무선 LAN에서 사용하는 임의 접근 방식은 CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance)에 기반한 DCF(Distributed Coordination Function)방식이다. 그러나, IEEE 802.11는 지수적 백오프 방식을 사용하기 때문에, 충돌이 일어났을 경우 경쟁 윈도우의 크기가 2배로 커진다. 따라서, 패킷 전송 지연 시간이 증가하게 되어, 효율성이 떨어진다. 본 논문에서는 제안된 수정된 백오프 알고리즘 방식을 사용하여 IEEE 802.11 MAC DCF 프로토콜의 TCP 패킷 전송 시간을 분석하였다. 결과로부터, OFDM/QPSK 변조 방식의 패킷 전송에 있어 패킷 전송 시간을 줄이기 위해서 TCP 패킷 크기가 증가해야 한다는 것을 알 수 있었고, 실험 결과로부터 TCP 계층 안 TCP 패킷 크기와 전체 메시지 전송 시간 상관관계에서 TCP 계층의 적당한 패킷 크기를 구할 수가 있었다.

  • PDF

집중형 DS/SSMA 무선 패킷통신망을 위한 RA-T 대역확산 전송방식의 성능 (Performance of RA-T spread-spectrum transmission scheme for centralized DS/SSMA packet radio networks)

  • 노준철;김동인
    • 전자공학회논문지A
    • /
    • 제33A권6호
    • /
    • pp.11-22
    • /
    • 1996
  • We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.

  • PDF

An MAC Protocol based on Code Status Sensing and Acquisition Indication in CDMA Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • 제5권3호
    • /
    • pp.181-184
    • /
    • 2007
  • In this paper, a CSSMA/AI MAC protocol in packet CDMA network is presented. The main features of this protocol are the code status sensing and reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

음성/데이터 통합형 PRMA 프로토콜의 성능 개선 기법 (A Method for the Performance Ehancement of PRMA Protocol for Mobile Voice/Data Integration)

  • 송재섭;김연수
    • 한국통신학회논문지
    • /
    • 제25권3B호
    • /
    • pp.423-430
    • /
    • 2000
  • Future microcellular systems will require distributed network control. A packet-switched network is suitable for this requirement. The packet reservation multiple access(PRMA) is a Reservation-ALOHA like protocol for wireless terminals to transmit packet speech to a base station. It allows spatially distributed users in cellular systems to transmit packeted voice and data to a common base station using a shared channel. In the existing PRMA, the problem is that the voice packets may collide with the data packets due to simultaneous channel access. the problem may be a major performance degradation factor to a voice and data mixed system. We propose a new PRMA method that integrates voice and data traffic efficiently by resolving the collision problem between data and voice packets. The proposed PRMA method gives a performance improvement than the existing PRAMA method in terms of voice packet dropping probability and data delay characteristic. From analytic results, we can confirm that the proposed PRMA method show a performance improvement than the existing PRMA protocol.

  • PDF

무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구 (An Efficient Code Assignment Algorithm in Wireless Mesh Networks)

  • 여재현
    • Journal of Information Technology Applications and Management
    • /
    • 제15권1호
    • /
    • pp.261-270
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

  • 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.

A Study on CSMA/CA for IEEE 802.11 WLAN Environment

  • Moon Il-Young;Cho Sung-Joon
    • Journal of information and communication convergence engineering
    • /
    • 제4권2호
    • /
    • pp.71-74
    • /
    • 2006
  • A basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size Also, a time of packet transmission delay increases and efficienty is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (A WGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.