• Title/Summary/Keyword: Priority MAC

Search Result 136, Processing Time 0.032 seconds

A Multi-Priority Service Differentiated and Adaptive Backoff Mechanism over IEEE 802.11 DCF for Wireless Mobile Networks

  • Zheng, Bo;Zhang, Hengyang;Zhuo, Kun;Wu, Huaxin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3446-3464
    • /
    • 2017
  • Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

A MAC Protocol for the Integrated Voice/Data Services in Packet CDMA Network (패킷 CDMA 망에서 음성/데이타 통합 서비스를 위한 MAC 프로토콜)

  • Lim, In-Taek
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.1
    • /
    • pp.68-75
    • /
    • 2000
  • In this paper, a media access control protocol is proposed for voice/data integrated services in the packet CDMA network, and the performance of the proposed protocol is analyzed. The proposed protocol uses the spreading code sensing and the reservation schemes. This protocol gives higher priority to the delay-sensitive voice traffic than to the data traffic. A voice terminal can reserve an available spreading code during a talkspurt to transmit multiple voice packets. On the other hand, whenever a data packet is generated, the data terminal transmits the packet through one of the available spreading codes that are not used by the voice terminals. In this protocol, the voice packets do not come into collision with the data packets. The numerical results show that this protocol can increase the maximum number of voice terminals. The performance for the data traffic degrades by increasing the voice traffic load because of the low priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.

  • PDF

Virtual Slot Multiple Access for Wireless Personal Area Network (WPAN을 위한 가상 슬롯 기반 다중 접근 방식)

  • Hwang Do-Youn;Kwon Eui-Hyeok;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.837-843
    • /
    • 2006
  • IEEE802.15.3 and IEEE802.15.4 have defined the hybrid MAC protocols based on TDMA and CSMA where a multi-frame TDMA structure is employed so that multiple data frames can be transmitted within one timeslot to guarantee minimum delay bounds of isochroous traffic. However, TDMA has an intrinsic problem that cannot dynamically allocate optimal length of timeslot to each station. Therefore the idle timeslot can be produced by stations when each transmission queue is instantaneously empty during its timeslot, which would waste lots of timeslots especially in the multi-frame TDMA systems. In this paper, we propose a more flexible multiple-access scheme for the multi-frame TDMA system based on the concept of virtual slot which is accessible by every station with the highest priority for slot owner and lower priority for other stations. Finally, our simulation results from various environments show that proposed scheme can achieve magnitude improvement of total system throughput and average message delay by maximizing channel utilization.

A Study on Priority Allocation Algorithm According to Air Traffic in Aeronautical Communication Environment (항공이동통신환경에서 항공교통량에 따른 우선순위 할당 알고리즘에 관한 연구)

  • Jo, Yun-Hyun;Kim, Yong-Kyun;Kim, Sang-Uk;Park, Hyo-Dal
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.91-100
    • /
    • 2010
  • According to the recent increase in air traffic a more efficient air traffic flow control is required. This paper proposes the algorithm for efficient air traffic flow control. Aeronautical communication environment is different from the common communication environment since it needs a direct communication between stations (or airplanes) and requires a strict priority for safety message. Moreover, the wide area for basic service causes high propagation delay. In this paper, by using existing CSMA/CA Media Access Control (MAC) protocol, we set the message priorities according to air traffic condition (congestion airport area, approach control area, En route area, and ocean area). This prioritization scheme enables the data transmission with higher access probability. Simulation results confirm that our protocol shows better performance in terms of channel efficiency and success probability compared to exisiting CSMA/CA protocol.

A wireless MAC for ABR type data service:APRMA (ABR 형태의 데이터 서비스를 위한 무선 MAC:APRMA)

  • Lee, Yoon-Ju;Kang, Sang-Wook;Yoe, Hyun;Choi, Seung-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2292-2302
    • /
    • 1997
  • In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and maximizing channel utilization. In PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme has to be performed for loss sensitive data packet, and so data packets can get their quality of service. Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. But in service aspects, if a fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency. So in this study, the terminal which wants to request for ABR tyupe service, acquires a minimum bandwidth from system for thefirst time. If the system has extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol cansupporty the data service with loss sensitivity and maintain their channel utilization high. Also high priority services like voice can be satisfied with their QoS by APRMA.

  • PDF

Design of MAC Algorithm Supporting Adaptive Transmission Rate on VANET (VANET에서 적정 전송속도를 지원하는 MAC 설계)

  • Park, Sanghyun;Kim, Nam-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.11
    • /
    • pp.132-138
    • /
    • 2012
  • VANET(Vehicular Ad-hoc Network), standardization of IEEE 802.11p specification is in process. 802.11 MAC protocol grants all nodes equal opportunity to acquire channel without regard to their bit-rates, making it possible for lower bit-rate nodes to occupy communication channel for a fair amount of time thus keeping the higher bit-rate nodes from acquiring connection channel which downward-equalize the overall network performance. Also with the 802.11p MAC protocol, the probability of collision occurring increases as the number of nodes grow. The proposed algorithm is a new MAC protocol that guarantees nodes with acquired channel a firm priority over other nodes for a fixed amount of time with TXOP concept added to 'packet burst' according to the current transmitting speed. This newly designed algorithm allows the construction of wireless network with enhanced network throughput, decreased probability of collisions as well as providing the means to grant each node a fair chance of acquiring connection according to their channel conditions. The algorithm sets the CW's (Contention Window) width wider than the standard's and modulates the continuous transmitting threshold value depending on channel acquired time, thus improving the overall performance of the network.

A bidirectional full duplex medium access control protocol for underwater acoustic networks (수중 음향 네트워크를 위한 양방향 전이중 매체 접속 제어 프로토콜)

  • Kang, Sung Min;Hwang, Ho Young;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.211-217
    • /
    • 2017
  • In this paper, we propose a bidirectional full duplex MAC (Medium Access Control) protocol for underwater acoustic networks. An underwater sensor node can set a back-off timer according to the priority of transmission. When the back-off timer expires, the underwater sensor node acquires a transmission opportunity. If a source node wants to send data to a destination node, it broadcasts RTS (Request-To-Send) including ID of the destination node to neighbor nodes. The destination node receiving RTS sends CTS (Clear-To-Send) to the source node to inform the bidirectional full duplex communication. After the source node receives CTS, the source node and the destination node can send the data to each other. In the underwater environment, the existing MAC protocol may take a lot of time for successful transmission of data due to long underwater propagation delay. On the other hand, the proposed bidirectional full duplex MAC protocol improves the throughput by shortening the time for successful transmission of data. In this paper, we analyze the throughput of the proposed bidirectional full duplex MAC protocol. In addition, we show that the proposed bidirectional full duplex MAC protocol has better performance in the presence of the long underwater propagation delay compared with existing MAC protocols for underwater environments.

Efficient Differentiated Bandwidth Allocation for QoS based Ethernet PON System (QoS 기반의 EPON 시스템에서 효율적인 차등 대역폭 할당)

  • Eom Jong-Hoon;Jung Min-Suk;Kim Sung-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.156-166
    • /
    • 2005
  • Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

A Priority-based MAC Protocol to Support QoS in Ad-hoc Networks (애드 혹 네트워크 QoS 지원을 위한 우선순위 기반 MAC 프로토콜)

  • Wang, Weidong;Seo, Chang-Keun;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2A
    • /
    • pp.80-89
    • /
    • 2005
  • In IEEE 802.11 and 802.11e for ad hoc networks, DCF and EDCA use a contention-based protocol called CSMA/CA, which is simple to implement efficient when the system is light loaded. But the performance of CSMA/CA decreases dramatically when the system load is heavy because of increasing collisions. In PCF and HCF modes, stations are controlled by a base station by polling, no collision ever occurs. However, when the system load is light, the performance is poor because few stations have data to transfer. More important, PCF and HCF can not be used in the ad hoc networks. In this paper, we address a priority-based distributed polling mechanism (PDPM) that implements polling scheme into DCF or EDCA modes for ad hoc networks by adding a polling approach before every contention-based procedure. PDPM takes the advantages of polling mechanism that avoids most of collisions in a high load condition. At the same time, it also keeps the contention-based mechanism for a light loaded condition. PDPM provides quality of service (QoS) with fewer collisions and higher throughput compared with IEEE 802.11e.

Collision Arbitration Rules for Best Effort Service in Wireless MAN: Design and Performance Analysis (무선 MAN에서 Best Effort 서비스를 위한 충돌 중재 방식: 설계 및 성능 분석)

  • Park, Jin-Kyung;Baang, Sung-Keun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.78-87
    • /
    • 2009
  • In the IEEE 802.16 Wireless MAN standard, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision among the requests is unavoidable so that the standard adopted a binary exponential back-off rule to arbitrate a collision. Aiming at improving throughput performance, we present two generic collision arbitration rules based on p-persistence rule, (identified as pristine and metamorphosed rules), as alternatives in a wireless MAN. For each of these rules, we then develop an analytical method to calculate an approximate value of saturated throughput. In comparison with simulation results, we confirm the high accuracy of the analytical method. Also, the pristine and metamorphosed rules are observed to exhibit higher saturated throughput compared with the binary exponential back-off rule.