• Title/Summary/Keyword: Carrier sense multiple access/collision avoidance(CSMA/CA)

Search Result 52, Processing Time 0.026 seconds

Development of Clustering-Based Multi-Channel MAC Protocol to Improve Efficiency of Network in VANET (차량 환경에서 통신 효율 향상을 위한 클러스터링 기반의 멀티채널 매체접속제어 프로토콜 개발)

  • Jung, Sung-Dae;Lee, Seung-Jin;Lee, Sang-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.463-468
    • /
    • 2009
  • In VANET(Vheicle Ad hoc Network), the researches based on the wireless LAN are conducting and the method based on 802.11a is being adapted in IEEE 802.11p WAVE(Wireless Access in Vehicular Environments). However, wireless LAN which uses a single channel in a competition can cause transmission delays because of a frequent collision and a use of CSMA/CA to avoid competition in VANET requiring a fast access. In this paper, we designed CMMP (Clustering based Multi-channel MAC protocol) adequate to VANET and then confirmed the appropriate channel conditions in a V2V communication on the basis of this protocol. The simulation results showed that a packet collision and a transmission delay by the use of an existing single channel based on the contention decreased more than 60% by CMMP.

Unsaturated Throughput Analysis of IEEE 802.11 DCF under Imperfect Channel Sensing

  • Shin, Soo-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.989-1005
    • /
    • 2012
  • In this paper, throughput of IEEE 802.11 carrier-sense multiple access (CSMA) with collision-avoidance (CA) protocols in non-saturated traffic conditions is presented taking into account the impact of imperfect channel sensing. The imperfect channel sensing includes both missed-detection and false alarm and their impact on the utilization of IEEE 802.11 analyzed and expressed as a closed form. To include the imperfect channel sensing at the physical layer, we modified the state transition probabilities of well-known two state Markov process model. Simulation results closely match the theoretical expressions confirming the effectiveness of the proposed model. Based on both theoretical and simulated results, the choice of the best probability detection while maintaining probability of false alarm is less than 0.5 is a key factor for maximizing utilization of IEEE 802.11.

Performance Analysis of IEEE 802.15.4e Time Slotted Channel Hopping for Low-Rate Wireless Networks

  • Chen, Shuguang;Sun, Tingting;Yuan, Jingjing;Geng, Xiaoyan;Li, Changle;Ullah, Sana;Alnuem, Mohammed Abdullah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.1
    • /
    • pp.1-21
    • /
    • 2013
  • The release of IEEE 802.15.4e specification significantly develops IEEE 802.15.4. The most inspiring improvement is the enhancement for medium access control (MAC) sublayer. To study the performance of IEEE 802.15.4e MAC, in this paper we first present an overview of IEEE 802.15.4e and introduce three MAC mechanisms in IEEE 802.15.4e. And the major concern here is the Time Slotted Channel Hopping (TSCH) mode that provides deterministic access and increases network capacity. Then a detailed analytical Markov chain model for TSCH carrier sense multiple access with collision avoidance (CSMA-CA) is presented. Expressions which cover most of the crucial issues in performance analysis such as the packet loss rate, energy consumption, normalized throughput, and average access delay are presented. Finally the performance evaluation for the TSCH mode is given and we make a comprehensive comparison with unslotted CSMA-CA in non-beacon enabled mode of IEEE 802.15.4. It can validate IEEE 802.15.4e network can provide low energy consumption, deterministic access and increase network capacity.

MAC Protocol Design for Visual Light LAN using LED Light (LED 조명 기반의 무선 가시광 LAN 통신을 위한 MAC 프로토콜 설계)

  • Jeon, Jong-Bae;Choi, Jung-Ho;Kim, Sung-Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.391-398
    • /
    • 2011
  • In this paper, we propose a MAC protocol for visible light wireless LAN using LED light. The proposed MAC protocol has a function of automatic direction optimization for LED transceiver. There is periodical time slot for broadcasting and registration in the proposed MAC protocol. We used polling method for data transfer in the protocol since visible light is hard to detect carrier and collision by other mobile stations; thus we cannot use CSMA/CD method in visible light LAN. We also amended the MAC frame of IEEE 802.11 to propose a revised version for visible light wireless LAN using LED light. We investigate the performance of the proposed MAC protocol. When the bit rate of physical layer is 100 Mb/s, the net data throughput using the proposed MAC protocol is estimated to 94.386 Mb/s.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

Contention Window Tuning Scheme for Providing Differentiated QoS in Wireless LANs (무선 랜에서 차별화된 서비스 품질 제공을 위한 경쟁윈도우 설정 방법)

  • Ha, Seongwoo;Kim, Sunmyeng
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.387-389
    • /
    • 2015
  • IEEE 802.11e EDCA(Enhanced Distributed Channel Access)는 4개의 AC(Access Category)를 이용하여 트래픽에 따른 우선순위를 부여하고 QoS(Quality of Service)를 제공하기 위해 표준화되었다. EDCA는 이진 백오프 알고리즘을 갖는 CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) 방법을 이용한다. EDCA에서 패킷 전송에 실패할 경우 경쟁 윈도우 값은 두 배씩 증가 되고, 성공할 경우에는 최소 경쟁 윈도우 값으로 초기화된다. 따라서 경쟁 윈도우 값이 최적의 값을 유지하지 못해 많은 패킷 충돌을 야기하여 네트워크 성능을 감소시킨다. 이 문제를 해결하기 위해 기존에 제안된 논문에서는 패킷 전송 성공 후 경쟁 윈도우 값을 최소 경쟁 윈도우 값이 아닌 채널 혼잡 정도에 따라 계산된 값으로 설정한다. 그러나 이 방법은 트래픽 종류와 상관없이 같은 방법으로 동작하기 때문에 트래픽 종류에 따른 차별적 QoS를 보장하지 않는다. 또한 계산된 경쟁 윈도우 값은 현재 값에 비해 상대적으로 낮은 값을 갖기 때문에 여전히 높은 충돌율을 갖는다. 본 논문에서는 이 문제를 해결하기 위해 새로운 프로토콜을 제안한다. 제안된 방법에서는 네트워크의 혼잡 정도를 잘 반영하기 위한 새로운 경쟁 윈도우 계산 알고리즘을 제시한다. 또한 제안된 알고리즘은 트래픽 종류에 따른 QoS 보장을 위해 트래픽 종류에 따른 차별화 파라미터를 이용한다.

Collision Reduction Scheme based on Station Grouping in IEEE 802.11 Wireless LANs (IEEE 802.11 무선 랜에서 단말 그룹화를 통한 충돌 감소 방법)

  • Choi, Jun-Hyuk;Kim, Sunmyeng
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.393-395
    • /
    • 2015
  • IEEE 802.11 무선 랜은 단말들 간의 채널을 공유하기 위해 CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) 기반의 DCF(Distributed Coordination Function) 프로토콜을 제공한다. DCF는 네트워크상의 단말수가 증가할수록 충돌 확률이 증가하여 전체적인 성능 감소를 야기한다. 이는 네트워크에 있는 모든 단말이 동시에 채널 경쟁을 하기 때문이다. 충돌 확률을 줄이고 성능을 향상시키기 위해 단말을 여러 그룹으로 나누고 각 그룹에 속하는 단말들간 채널 경쟁을 수행하는 가상 그룹 방법이 제안되었다. 그러나 가상 그룹 방법은 각 단말이 독립적으로 그룹 수를 결정하고 자신이 어느 그룹에 속해 동작할지 결정한다. 따라서 단말마다 서로 그룹 수가 다를 수 있고 단말이 하나도 포함되지 않은 그룹이 존재할 수 있다. 즉, 가상 그룹 방법은 단말간 공평성 문제가 있고 오동작 가능성이 있다. 이 문제를 해결하기 위해 본 논문에서는 비지톤과 타이머를 이용하여 단말간 동기화를 맞춰 그룹 수 및 자신의 그룹 번호를 독립적으로 결정하는 방법을 제안한다. 그룹 수는 현재 채널 경쟁 수준을 고려하여 결정한다. 단말들의 그룹화를 통해 충돌확률을 줄이고 네트워크 성능을 향상시킨다.

Performance Analysis of Opportunistic Spectrum Access Protocol for Multi-Channel Cognitive Radio Networks

  • Kim, Kyung Jae;Kwak, Kyung Sup;Choi, Bong Dae
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.77-86
    • /
    • 2013
  • Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

Binary Negative-Exponential Backoff Algorithm to Enhance The Performance of IEEE 802.11 WLAN (IEEE 802.11 무선랜의 성능 향상을 위한 Binary Negative-Exponential Backoff 알고리즘)

  • Ki, Hyung-Joo;Choi, Seung-Hyuk;Chung, Min-Young;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12A
    • /
    • pp.1229-1237
    • /
    • 2006
  • IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stages by one and double their contention window sizes. However, DCF with BEB wastes wireless resource when there are many contending stations. Therefore, in this paper, to enhance the performance of wireless LAN, we propose binary negative-exponential backoff (BNEB) algorithm which maintains a maximum contention window size during collisions and reduces a contention window size to half after successful transmission of a frame without retransmissions. For IEEE 802.11, 802.11a and 802.11b standards, we also compare the performance of DCF with BEB to that with BNEB.

A DCF Throughput Analysis of the Ideal and Fading Channel in the Wireless LAN (무선 LAN에서 이상 및 페이딩 채널 환경의 DCF 처리율 비교 분석)

  • Lee, Yong-Sik;Lee, Ha-Cheol;Lee, Byung-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.7
    • /
    • pp.741-753
    • /
    • 2008
  • This paper explores the throughput performance of CSMA/CA-based DCF protocol over both ideal channels and fading channels with payload size at the MAC layer in the 802.11a wireless LAN. In the ideal channel, there are no errors and at the transmission cycle there is one and only one active station which always has a packet to send and other stations can only accept packets and provide acknowledgements. In the fading channel, bit errors appear in the channel randomly and the number of stations is assumed to be fixed. And each station always has packets for transmission. In other words, we operate in saturation conditions. Up to now conventional research work about DCF throughput analysis of IEEE 802.11 a wireless LAN has been done over the ideal channel, but this paper is done over the Rayleigh/Ricean fading channel. So, the ratio of received average energy per bit-to-noise power spectral density $E_b/N_o$ is set to 25 dB and the ratio of direct-to-diffuse signal power in each sub-channel $\xi$ is set to 6 for combined Rayleigh/Ricean fading channel. In conclusion, it is shown that the saturation throughput is always less than the maximum throughput at all the payload size and the higher the transmission rate be, the higher the decreasing rate of saturation throughput compared to the maximum throughput be.