• Title/Summary/Keyword: CSMA

Search Result 314, Processing Time 0.031 seconds

Multi-Channel MAC Protocol Using Statistical Channel Utilization for Cognitive Networks

  • Xiang, Gao;Zhu, Wen-Min;Park, Hyung-Kun
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.3
    • /
    • pp.273-276
    • /
    • 2010
  • Opportunistic spectrum access (OSA) allows unlicensed users to share licensed spectrum in space and time with no or little interference to primary users, with bring new research challenges in MAC design. We propose a cognitive MAC protocol using statistical channel information and selecting appropriate idle channel for transmission. The protocol based on the CSMA/CA, exploits statistics of spectrum usage for decision making on channel access. Idle channel availability, spectrum hole sufficiency and available channel condition will be included in algorithm statistical information. The model include the control channel and data channel, the transmitter negotiates with receiver on transmission parameters through control channel, statistical decision results (successful rate of transmission) from exchanged transmission parameters of control channel should pass the threshold and decide the data transmission with spectrum hole on data channel. The proposed protocol's simulation will show that proposed protocol does improve the throughput performance via traditional opportunistic spectrum access MAC protocol.

Comparative Analysis of Routing Protocols for Wireless Sensor Networks (무선 센서 네트워크의 라우팅 프로토콜 비교 분석)

  • Gautam, Navin;Pyun, Jae-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.373-376
    • /
    • 2008
  • Wireless sensor networks consist of thousands of sensor nodes that have low power, low footprint and low computational capacities. So the burning issues in the design and deployment of these sensor nodes in the practical application areas include the energy conservation and network lifetime. Efficient routing schemes can help reduce the energy consumption and thus increase the network lifetime. This paper deals with the comparative analysis of popular routing protocols such as LEACH, LEACH-C, MTE, and PEGASIS. The protocols are compared by using performance me tries such as system lifetime, the time for first node death, and total system energy.

  • PDF

Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID

  • Han, Se-Kyung;Choi, Yeon-Suk;Iwai, Masayuki;Sezaki, Kaoru
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.736-752
    • /
    • 2010
  • We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed considering the adequacy for the indoor tracking system. We prove the superiority of the slotted ALOHA in comparison with CSMA for short and fixed length packets like an ID message in RFID. Observed results show that they are not applicable for active type RFID in terms of energy efficiency. Putting these all together, we propose a dedicated collision avoidance algorithm considering the unique features of the indoor tracking system. The proposed method includes a scheduled tag access period (STAP) as well as a random tag access period (RTAP) to address both of the static and dynamic characteristics of the system. The system parameters are determined through a quantitative analysis of the throughput and energy efficiency. Especially, some mathematical techniques have been deployed to obtain the optimal slot count for RTAP. Finally, simulation results are provided to illustrate the performance of the proposed method with variations of the parameters.

An Efficient Downlink MAC Protocol for Multi-User MIMO WLANs

  • Liu, Kui;Li, Changle;Guo, Chao;Chen, Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4242-4263
    • /
    • 2017
  • Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

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.

Coexistence Analysis in Korean RFID/USN Frequency Bands Considering Both PHY and MAC Layers (국내 RFID/USN 대역에서 PHY/MAC 계층을 모두 고려한 주파수 공동사용 분석 방법)

  • Yoon, Hyungoo;Jang, Byung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.1
    • /
    • pp.73-81
    • /
    • 2013
  • In this paper, we have proposed the interference analysis method which uses both an interference probability model at the PHY layer of RFID system and the DTMC model at the MAC layer of USN system. Using the proposed method, we have performed sharing analysis between passive RFID and USN systems at the Korean RFID/USN frequency bands. If 1% performance degradation of USN system is allowed, RFID and USN systems can share the frequency bands where channel number is greater or equal to 20 on condition that radius of protection area is greater than 300 m.

Analysis of Three-Phase Multiple Access with Continual Contention Resolution (TPMA-CCR) for Wireless Multi-Hop Ad Hoc Networks

  • Choi, Yeong-Yoon;Nosratinia, Aria
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.43-49
    • /
    • 2011
  • In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

Throughput analysis of DCF protocol for packet applied to the nonmarkov process in the wireless LAN (비 마르코프 과정을 적용한 무선 LAN의 DCF 패킷 처리율 분석)

  • Ha, Eun-Sil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1410-1418
    • /
    • 2007
  • This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

  • PDF

Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic

  • Islam, Md. Syeful;Rahman, Md. Rezaur;Roy, Anupam;Islam, Md. Imdadul;Amin, M.R.
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.679-690
    • /
    • 2011
  • In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

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 보장을 위해 트래픽 종류에 따른 차별화 파라미터를 이용한다.