• Title/Summary/Keyword: CSMA/CA

Search Result 199, Processing Time 0.022 seconds

Media Access Control Protocol Considering MANET of Underwater Environment (수중 환경의 MANET을 고려한 매체 접근 제어 프로토콜)

  • Shin, Seung-Won;Yun, Nam-Yeol;Lee, Jin-Young;Lee, Seung-Joo;Park, Soo-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.97-107
    • /
    • 2013
  • Underwater wireless communication systems can be useful for underwater environment observation, catastrophe prevention, ocean resources exploration, ocean organism research, vessel sinking exploration, and so on. However, unlike terrestrial wireless communication, underwater wireless communication should consider factors such as long propagation delay, limited transmission capacity, high bit-error rate due to potential loss in power, ambient noise, man-made noise, multi-path, etc., because of the inherent characteristics of water. Thus, in this paper, we propose a suitable media access control(MAC) protocol that applies a combination of the ALOHA MAC protocol and the CSMA/CA MAC protocol to underwater environment. We further propose a mathematical analysis model to evaluate performance. We also verify performance improvement in the proposed scheme in comparison with existing MAC protocols.

Resource Allocation Algorithm for Throughput Enhancement in IEEE 802.11e (IEEE 802.11e의 전송률 향상을 위한 자원할당 알고리듬)

  • Joung, Soo-Kyoung;Park, In-Kap
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.63-70
    • /
    • 2010
  • In IEEE 802.11e system providing differentiated services, there exist some problems as follows; collision probability increase due to the increase in the number of nodes by employing CSMA/CA transmission mode, transmission speed declining tendency towards the worst of it, which is caused by different transmission mode and decrease of TCP transmission rate as the result of the link occupancy by UDP when TCP shares the link with UDP by the TCP’s flow control characteristic. In this thesis, the initial minimum and maximum CW are set differently according to the number of connected nodes in the network to avoid collisions and TXOP is adjusted according to the channel state, in which ACs with low priority but better channel state will get gradually more chances to transmit leading to optimal channel capacity. Also, by allowing higher priority for ACK frames which control the TCP transmission, the flow control becomes better because that reduces the channel occupancy by UDP flow, and by this, fair transmission is obtained from the result of the more fair transmission and active resource allocation.

A Deterministic Access Protocol in WiMedia Wireless Personal Area Networks (WiMedia 초고속 근거리 무선 통신에서의 결정적 접근 프로토콜)

  • Park, Hyun-Hee;Pack, Sang-Heon;Kim, Yong-Sun;Kang, Chul-Hee
    • Journal of IKEEE
    • /
    • v.13 no.3
    • /
    • pp.7-17
    • /
    • 2009
  • WiMedia UWB technology is a fully distributed data communication technology developed for the application demanding a high data transmission rate in the wireless PAN area. In general, devices can send data either by reserving time slots or by using prioritized CSMA/CA. If the PCA protocol of prioritized CSMA/CA is used, they are suffered congestion as the number of devices increases. In this paper, we propose a Deterministic Access Protocol(DAP) in WiMedia WPANs. A DAP is a method to transmit data in the non-reserved DRP period without competition as each device informs the beacon order information in the beacon period and the queue information. In addition, the problem that the devices with a lower beacon slot number have more transmission opportunities is addressed by introducing the reference point. Simulation results are given to demonstrate that a DAP can improve the throughput and reduce the packet loss rate.

  • PDF

Dynamic Carrier Sensing Threshold Scheme based on SINR for Throughput Improvement in MANET (MANET에서 처리율 향상을 위한 SINR 기반 동적 캐리어 감지 임계값 방법)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.15 no.3
    • /
    • pp.319-326
    • /
    • 2014
  • IEEE 802.11 WLAN uses CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance) method in MAC(Media Access Control) protocol, and through the carrier sense checks whether other users use the channel during the data transmission to avoid the data collision. Currently, IEEE 802.11 standard recommends the use of a fixed threshold which gives an impact on carrier sensing range. However, the existing scheme using the fixed threshold causes the operation of network to be inefficiency owing to the mobility in MANET(Mobile Ad hoc NETwork). In this paper, we found the better network throughput to be obtained by applying the proposed scheme, which chooses properly the carrier sensing threshold and transmission rate considering SINR(Signal to Interference-plus-Noise Ratio), to the MANET.

Random Backoff Scheme of Emergency Warning Message for Vehicle-to-Vehicle Communications (차량 간 통신에서 충돌을 완화하기 위한 랜덤 백오프 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.165-173
    • /
    • 2012
  • In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.

Performance Analysis on DCF Considering the Number of Consecutive Successful Transmission in Wireless LAN (무선랜에서 연속적인 전송성공 횟수를 고려한 DCF 성능분석)

  • Lim, Seog-Ku
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.388-394
    • /
    • 2008
  • In this paper, MAC(Medium Access Control) algorithm for the IEEE 802.11 DCF(Distributed Coordination Function) 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 and PCF(Point Coordination function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access With Collision Avoidance). 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.

Packet Scheduling Scheme to Enhance Throughput at IEEE 802.11e WLAN System (IEEE 802.11e 무선 LAN 시스템에서 서비스 처리율 증대를 위한 패킷 스케줄링 기법)

  • Jang Jae-Shin;Jeon Hyung-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4A
    • /
    • pp.412-420
    • /
    • 2006
  • With the appearance of various types of traffic services in communication networks, a study on QoS(Quality of Service) packet scheduling mechanisms which can support differentiated service to each traffic service becomes very important. To meet this requirement, IEEE 802.11 Working Group established the IEEE 802.11e MAC protocol which categorizes every traffic services into 4 access categories(AC) and provides the differentiated service to each AC. In addition, the physical layer of IEEE 802.11a/g standards provide up to 54 Mbps transmission rate per one wireless LAN terminal. However, since the radio resource is hardly limited in wireless channel, it is necessary to find an efficient packet scheduling scheme to maximize the transmission efficiency. Therefore, in this paper, we proposed a new packet scheduling scheme that can enhance the total throughput by setting different contention windows(CW) of CSMA-CA channel access scheme to each wireless LAN terminal according its current channel states. Numerical results derived from using NS-2 network simulator have shown that our proposed packet scheduling scheme can enhance the performance of IEEE 802.11e more and more.

Effective Emergency-Warning Message Transmission in the Vehicle-to-Vehicle Communication Environment (차량 간 통신 환경에서 효과적인 위험 경고 메시지 전송 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1B
    • /
    • pp.1-8
    • /
    • 2012
  • In this paper, we propose an algorithm to improve collision avoidance in Vehicle-to-Vehicle (V2V) networks based on IEEE 802.11p. Since IEEE 802.11p adopts CSMA/CA as a multiple access scheme and an emergency warning message (EWM) is delivered to behind vehicles in a multi-hop manner, due to transmission collision, the more vehicles in the vehicle chain results in a longer delay. The longer delay increases the possibility of a rear-end collision. In order to ensure message reception with low latency, we consider implicit acknowledgement of a broadcasted EWM message and propose an algorithm to reduce redundant message transactions, called Two-Way Implicit Acknowledgement (TWIA). By simulations, we show that our proposed algorithm can reduce the latency until the last car receives the message by 9% and the success rate every car receives the message within 0.7sec by 12% at 100 fixed-number-of-car environment.

Bio-Inspired Resource Allocation Scheme for Multi-Hop Networks (멀티홉 네트워크에서 생체모방 기반 자원할당 기법)

  • Kim, Young-Jae;Jung, Ji-Young;Choi, Hyun-Ho;Han, Myoung-Hun;Park, Chan-Yi;Lee, Jung-Ryun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.10
    • /
    • pp.2035-2046
    • /
    • 2015
  • Recently, researches on resource allocation algorithms operating in a distributed way are widely conducted because of the increasing number of network nodes and the rapidly changing the network environment. In this paper, we propose Multi-Hop DESYNC(MH DESYNC), that is bio-inspired TDMA-based resource allocation scheme operating in a distributed manner in multi-hop networks. In this paper, we define a frame structure for the proposed MH DESYNC algorithm and firing message structure which is a reference for resource allocation and propose the related operating procedures. We show that MH DSYNC can resolve the hidden-node problem effectively and verify that each node shares resources fairly among its neighboring nodes. Through simulation evaluations, it is shown that MH DESYNC algorithm works well in a multi-hop networks. Furthermore, results show that MH DESYNC algorithm achieves better performance than CSMA/CA algorithm in terms of throughput.

Efficient Relay Selection Algorithm Using S-MPR for Ad-Hoc Networks Based on CSMA/CA (CSMA/CA 기반 애드혹 네트워크에서 S-MPR을 이용한 효율적인 중계 노드 선택 알고리즘)

  • Park, Jong-Ho;Oh, Chang-Yeong;Ahn, Ji-Hyoung;Seo, Myung-Hwan;Cho, Hyung-Weon;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.657-667
    • /
    • 2012
  • In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.