无线局域网与无线个域网QoS机制的对比分析

无线局域网(WLAN)和无线个域网(WPAN)技术的发展带来的多媒体业务流量的剧增,使无线网络的资源管理、服务质量(QoS)保障等问题日益突出。传统的媒体访问控制(MAC)协议需要重新设计才能对无线网络的QoS问题进行有效地解决。文中研究了IEEEWLAN和WPAN工作组分别于2002年5月和2003年2月提出的IEEE802.11eD3.0和IEEE802.15.3D16两种协议标准的工作机制并对两者的性能作出了比较分析。     

Dynamic Code Assignment Medium Access (DCAMA) Protocol for Wireless Integrated Services Networks

A medium access control (MAC) protocol for wireless mobile networks that supports integrated services and provides quality of service (QoS) support is presented and evaluated via simulation. A controlled random access protocol which allows all terminals to dynamically share a group of spread spectrum spreading codes is used. The protocol provides mobile terminals the access control required for efficient transfer of integrated traffic with QoS guarantees. Two service classes are provided; "best-effort" service, with priority queueing, and reserved bandwidth circuit service. The performance of the protocol is evaluated via simulation for traffic consisting of integrated voice, data and compressed video. The performance assessment measure is packet delay.     

Arbitration Interframe Space‐controlled Medium Access Control: a medium access control protocol guaranteeing absolute priority in wireless local area networks

The demand for multimedia services, such as voice over Internet Protocol, video on demand, information dissemination, and ?le sharing, is increasing explosively in wireless local area networks. These multimedia services require a certain level of QoS. Thus, it is important to provide QoS for multimedia applications. IEEE 802.11e tries to meet the QoS requirement of multimedia services by using Enhanced Distributed Channel Access. This gives more weights to high‐priority tra?c than low‐priority tra?c in accessing the wireless channel. However, Enhanced Distributed Channel Access suffers from many problems such as low aggregate throughput, high collision rates, and ineffective QoS differentiation among priority classes. In this paper, we propose a new medium access scheme, the Arbitration Interframe Space‐controlled Medium Access Control (AC‐MAC), that guarantees absolute priority in 802.11 wireless networks. In AC‐MAC, the AIFS and contention window values are controlled, so that a higher‐priority tra?c can preferentially access and effectively utilize the channel. Extensive simulations show that AC‐MAC can perfectly provide absolute priority and good throughput performance regardless of the number of contending nodes. In the simulation of voice over Internet Protocol service, AC‐MAC provides effective QoS differentiation among services and also meets the high level of QoS requirements. AC‐MAC also adapts quickly in a dynamic environment and provides good fairness among the nodes belonging to the same priority class. Copyright © 2011 John Wiley & Sons, Ltd.     

Comparative performance evaluation of EDCF and EY-NPMA protocols

Medium access represents one of the most critical building blocks regarding the performance of a wireless LAN. In this letter, we compare the performance of two well-known medium access control protocols specifically developed for the wireless environment, EDCF and EY-NPMA. To our knowledge, it is the first time that these two quality-of-service (QoS) aware medium access schemes are compared. Furthermore, we propose a novel scheme for medium access based on EY-NPMA, that demonstrates reduced overhead compared to the base protocol and better utilization of the common medium. The conclusions of this paper are based on extensive simulation trials.     

Medium Access Control for QoS Provisioning in Vehicle-to-Infrastructure Communication Networks

The emerging vehicular networks are targeted to provide efficient communications between mobile vehicles and fixed roadside units (RSU), and support mobile multimedia applications and safety services with diverse quality of service (QoS) requirements. In this paper, we propose a busy tone based medium access control (MAC) protocol with enhanced QoS provisioning for life critical safety services. By using busy tone signals for efficient channel preemption in both contention period (CP) and contention free period (CFP), emergency users can access the wireless channel with strict priority when they compete with multimedia users, and thus achieve the minimal access delay. Furthermore, through efficient transmission coordination on the busy tone channel, contention level can be effectively reduced, and the overall network resource utilization can be improved accordingly. We then develop an analytical model to quantify the medium access delay of emergency messages. Extensive simulations with Network Simulator (NS)-2 validate the analysis and demonstrate that the proposed MAC can guarantee reliable and timely emergency message dissemination in a vehicular network.     

Contention-based MAC protocols with erasure coding for wireless data networks

Contention-based medium access control (MAC) protocol is a key component for the success of wireless data networks. Conventional random access protocols like ALOHA and Carrier Sense Multiple Access (CSMA) suffer from packet collision which leads to low throughput. Aimed at improving the throughput performance, we propose to integrate erasure coding with contention-based MAC protocols for recovering collided packets. To demonstrate the effectiveness of this approach, we focus on combining erasure coding with slotted ALOHA and slotted non-persistent CSMA in this paper. The performances of the resulting protocols are evaluated by both analytical model and simulation. Simulation results match very well with analytical results and show that the system throughput is increased for low to medium traffic loading. Packet loss ratio is also improved considerably with our scheme when the maximum number of packet retransmission times is limited. However, the delay for our scheme is higher due to the longer waiting time in our scheme for recovering collided packets. It is also shown that delay can be significantly reduced if we choose appropriate coding parameters though throughput will be sacrificed.     

Design and analysis of a denial-of-service-resistant quality-of-service signaling protocol for MANETs

Quality-of-service (QoS) signaling protocols for mobile ad hoc networks (MANETs) are highly vulnerable to attacks. In particular, a class of denial-of-service (DoS) attacks can severely cripple network performance with relatively little effort expended by the attacker. A distributed QoS signaling protocol that is resistant to a class of DoS attacks on signaling is proposed. The signaling protocol provides QoS for real-time traffic and employs mechanisms at the medium access control (MAC) layer, which serve to avoid potential attacks on network resource usage. The key MAC layer mechanisms that provide support for the QoS signaling scheme include sensing of available bandwidth, traffic policing, and rate monitoring, all of which are performed in a distributed manner by the mobile nodes. The proposed signaling scheme achieves a compromise between signaling protocols that require the maintenance of per-flow state and those that are completely stateless. The signaling scheme scales gracefully in terms of the number of nodes and/or traffic flows in the MANET. The authors analyze the security properties of the protocol and present simulation results to demonstrate its resistance to DoS attacks.     

Design and performance evaluation of a MAC protocol for wireless local area networks

We propose and analyze, from a performance viewpoint, a Medium Access Control (MAC) protocol for Wireless Local Area Networks (WLANs). The protocol, named Prioritized-Access with Centralized-Control (PACC), supports integrated traffics by guaranteeing an almost complete utilization of network resources. The proposed protocol combines random access for signalling, with collision-free access to the transmission channel. The transmission channel is assumed to be slotted, with slots grouped into frames. Access to transmission slots is controlled by a centralized scheduler which manages a multiclass queue containing the users' requests to access the transmission channel. Three classes of users are assumed: voice traffic (voice), data traffic with real-time constraints (high-priority data), and classical data traffic (low-priority data). A priority mechanism ensures that speech users have the highest priority in accessing the idle slots, since speech packets have a more demanding delay constraint. The remaining channel bandwidth is shared fairly among the high-priority data terminals. The low-priority data terminals use the slots left empty by the other classes. Specifically, access to transmission slots is controlled by the centralized scheduler by managing a transmission cycle for each class of terminals. The voice-terminals cycle has a constant length equal to one frame, while the lengths of the data-terminals cycles are random variables which depend on the number of active voice and data terminals. In this paper we show that the proposed scheme can support the same maximum number of voice terminals as an ideal scheduler, while guaranteeing an almost complete utilization of network capacity. In addition, via a performance analysis, we verify that by limiting the number of real-time data terminals in the network this class of traffic can be statistically guaranteed access delays in the order of 200–300 msec. Hence, the QoS the network gives to the real-time data terminals makes this service suitable for real-time applications such as alarms or low bit rate video. This revised version was published online in June 2006 with corrections to the Cover Date.     

A cross-layer scheme for medium access control with QoS guaranteeing for Ad hoc networks

1 Introduction medium access control (MAC) protocols play a crucial role in determining the performance of Ad hoc networks. However, the design of MAC protocols for Ad hoc networks has traditionally been separated from that of the physical layer. In most …     

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms for QoS communication in multi-hop wireless networks. First, we devise distributed priority scheduling, a technique that piggybacks the priority tag of a node's head-of-line packet onto handshake and data packets; e.g., RTS/DATA packets in IEEE 802.11. By monitoring transmitted packets, each node maintains a scheduling table which is used to assess the node's priority level relative to other nodes. We then incorporate this scheduling table into existing IEEE 802.11 priority backoff schemes to approximate the idealized schedule. Second, we observe that congestion, link errors, and the random nature of medium access prohibit an exact realization of the ideal schedule. Consequently, we devise a scheduling scheme termed multi-hop coordination so that downstream nodes can increase a packet's relative priority to make up for excessive delays incurred upstream. We next develop a simple analytical model to quantitatively explore these two mechanisms. In the former case, we study the impact of the probability of overhearing another packet's priority index on the scheme's ability to achieve the ideal schedule. In the latter case, we explore the role of multi-hop coordination in increasing the probability that a packet satisfies its end-to-end QoS target. Finally, we perform a set of ns-2 simulations to study the scheme's performance under more realistic conditions.     

PRIN: A Priority-Based Energy Efficient MAC Protocol for Wireless Sensor Networks Varying the Sample Inter-Arrival Time

Wireless sensor networks (WSNs) are used in a variety of applications to sense and transfer information to the centralized node with energy efficiency increasing the network’s lifespan. Other factors, such as quality of service (QoS) is also important to improve the performance of the WSNs, by increasing throughput and reducing end-to-end delay. In this paper, we evaluate the importance of QoS in the Medium Access Control (MAC) protocol for WSNs using different metrics and parameters such as energy efficiency, throughput, delay, and the network lifespan. We propose a new QoS MAC protocol, “PRIority in Node” (PRIN), using static priority in the source and the intermediate node and priority among the node which is one hop from the sink node to achieve QoS in WSNs. Simulation results are compared with those of the synchronous MAC protocol in terms of QoS parameters to show the improved performance of the proposed MAC protocol.     

Design of MAC protocols with fast collision resolution for wireless local area networks

Development of efficient medium access control (MAC) protocols providing both high throughput performance for data traffic and good quality of service (QoS) support for real-time traffic is the current major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention resolution algorithm for wireless local area networks, namely, the fast collision resolution (FCR) algorithm. The MAC protocol with this new algorithm attempts to provide significantly higher throughput performance for data services than the IEEE 802.11 MAC algorithm and more advanced dynamic tuning backoff (DTB) algorithm. We demonstrate that this algorithm indeed resolves collisions faster and reduces the idle slots more effectively. To provide good fairness performance and to support good QoS for real-time traffic, we incorporate the self-clocked fair queueing algorithm and a priority scheme into the FCR algorithm and come up with the real-time FCR (RT-FCR) algorithm, and show that RT-FCR can simultaneously achieve high throughput and good fairness performance for nonreal-time traffic while maintaining satisfactory QoS support for real-time traffic.     

一种基于CoMP的随机接入方案

提出了一种新的基于协作多点传输和接收（CoMP）技术的多发随机接入流程,并根据 随机接入的目的和业务类型设计了接入优先级,在此基础上设计了一种新的随机接入方案, 对 不同类型的随机接入请求提供不同的接入机制,以保证边缘用户的接入性能和满足不同业务 的QoS需求。仿真结果表明,与LTE标准随机接入方案相比,该方案对系统整体接入性能略有 提高,且大大提高了边缘高优先级用户的接入性能。     

Analytical modeling of bidirectional multi‐channel IEEE 802.11 MAC protocols

This paper presents an analytical approach to model the bi‐directional multi‐channel IEEE 802.11 MAC protocols (Bi‐MCMAC) for ad hoc networks. Extensive simulation work has been done for the performance evaluation of IEEE 802.11 MAC protocols. Since simulation has several limitations, this work is primarily based on the analytical approach. The objective of this paper is to show analytically the performance advantages of Bi‐MCMAC protocol over the classical IEEE 802.11 MAC protocol. The distributed coordination function (DCF) mode of medium access control (MAC) is considered in the modeling. Two different channel scheduling strategies, namely, random channel selection and fastest channel first selection strategy are also presented in the presence of multiple channels with different transmission rates. M/G/1 queue is used to model the protocols, and stochastic reward nets (SRNs) are employed as a modeling technique as it readily captures the synchronization between events in the DCF mode of access. The average system throughput, mean delay, and server utilization of each MAC protocol are evaluated using the SRN formalism. We also validate our analytical model by comparison with simulation results. The results obtained through the analytical modeling approach illustrate the performance advantages of Bi‐MCMAC protocols with the fastest channel first scheduling strategy over the classical IEEE 802.11 protocol for TCP traffic in wireless ad hoc networks. Copyright © 2010 John Wiley & Sons, Ltd.     

A dynamic ID management protocol for CSMA/IC in ad hoc networks

Contention based MAC protocols are widely used in ad hoc networks because they are suitable, where no central control node exists. However, contention based MAC protocols waste much time because of frequent collisions and long contention times. Moreover, it is hard for them to fairly distribute medium access opportunities. As a result, the problem of unfair medium access may arise under normal network conditions. Recently, another contention based MAC protocol, named the Carrier Sense Multiple Access/ID Countdown (CSMA/IC) was proposed. CSMA/IC resolves medium access contention by comparing the IDs of contending nodes with a simple signaling process. Therefore, medium access collisions never happen as long as each node possesses a unique ID, and the time cost for contention may be smaller than any other contention based MAC protocols if the number of IDs is managed so as to be as small as possible. Furthermore, CSMA/IC may support fair medium access by manipulating the ID of each node properly. In this paper, we propose a novel dynamic ID management protocol which enables a node to acquire a unique ID without any message exchanges and fairly distributed the number of medium access opportunities to all contending nodes. The proposed protocol also makes the contention process of CSMA/IC efficient by dynamically managing the length of the ID field according to the network traffic. The simulation results show that the proposed ID management protocol significantly improves the aforementioned aspects of CSMA/IC MAC protocol compared to previous ID management schemes.     

A Distributed Cooperative MAC Protocol for QoS Improvement and Mobility Support in WiMedia Networks

A Distributed Medium Access Control (D-MAC) protocol based on UWB for high-rate Wireless Personal Area Networks is specified by the WiMedia Alliance. D-MAC protocol is suitable for ubiquitous connection in home networks, military/medical applications due to its inexpensive cost, low power consumption, high data rate, and distributed approach. In contrast to IEEE 802.15.3, D-MAC makes all devices have the same functionality. And its networks are self-organized and provide devices with functions such as access to the medium, channel allocation to devices, data transmission, quality of service and synchronization in a distributed manner. D-MAC fundamentally removes the problems of the centralized MAC approach revealed at IEEE 802.15.3 MAC by adopting a distributed architecture. However, the current D-MAC can’t prevent QoS degradations, occurred by mobile nodes with low data rate due to bad channel status, which cause critical problems in QoS provisioning to isochronous streams and mobile applications. Therefore, we propose a distributed cooperative MAC protocol for multi-hop WiMedia networks using virtual MIMO links. Based on instantaneous Channel State Information among WiMedia devices, our proposed protocol can intelligently select the transmission path with higher data rate to provide advanced QoS with minimum delay for real-time multimedia streaming services.     

Enhanced cooperative MAC for wireless local area networks

A novel network protocol,enhanced cooperative medium access control(ECoop MAC),is present in this article.Its function is to guarantee the quality of service(QoS)in wireless local area networks.For the sake of supporting different application scenarios,two proposed schemes,namely E-scheme I for lower priority traffic and E-scheme II for higher priority traffic can be adopted independently or in combination.ECoop MAC takes into account request failure problems,and utilizes cooperative protocol information to boost the system performance as well as to effectively cut control packets overhead.Simulation results show that the proposed algorithm can not only improve network throughput,but also lead to reduced network delays for individual packets.     

RPSF: a new QoS bandwidth request mechanism for the IEEE?802.16

The IEEE 802.16 standard is a Broadband Wireless Access (BWA) technology which offers Quality of Service (QoS) support to different types of applications. This standard defines the physical (PHY) and medium access control (MAC) layers. Its MAC layer defines different types of QoS mechanisms to support various types of applications, being the multicast polling one of these mechanisms. Under this mechanism, based on a contention process, every connection competes to gain access to the channel in order to place its bandwidth requests. In this paper, we propose a new signalling mechanism, called Requests Per Service Flow (RPSF), to reduce the contention phase in the frame. Additionally, we undertake a comparison of this new method with respect to other mechanisms. The simulation results show that our new proposal outperforms other mechanisms recently reported in the literature, in terms of throughput and end-to-end delay.     

BPC – A binary priority countdown protocol

In modern wireless ad hoc networks, with a high speed PHY, every collision means a significant loss of useful bandwidth. In the last few years different binary contention protocols have been introduced to address this problem. In this work we propose a novel binary contention protocol called binary priority countdown (BPC) protocol, whose goal is to reduce collisions as well as contention time. BPC uses a new priority countdown mechanism which exploits the efficiency of binary countdown, but the priority countdown process is not constrained to a single binary countdown round. This way, the priority space is not defined by the length of binary countdown round, like in other binary countdown protocols proposed in the literature, and arbitrary medium access priorities can be decremented through multiple binary countdown rounds if necessary. The ability of a new priority countdown mechanism to count down any priority number without changing the length of a binary countdown round, allows independent management of priority space. This “independence” of priority space introduces new optimization and adaptation possibilities. Collision memory effect is recognized and described. BPC protocol reveals connection between unary, binary and digit contention protocols. All three groups of protocols can now be seen as members of the same class of contention algorithms. Preliminary simulation results are shown.     

Modeling and performance analysis of an alternative to IEEE 802.11e Hybrid Control Function

Modern wireless networks are offering a wide range of applications that require the efficient integration of multimedia and traditional data traffic along with QoS provision. The IEEE 802.11e workgroup has standardized a new QoS enhanced access scheme for wireless LANs, namely Hybrid Control Function (HCF). HCF consists of the Enhanced Distributed Channel Access (EDCA) and the Hybrid Control Channel Access (HCCA) protocols which manage to ensure QoS support. However, they exhibit specific weaknesses that limit network performance. This work analyzes an alternative protocol, called Priority Oriented Adaptive Polling (POAP). POAP is an integrated channel access mechanism, is collision free, it employs priorities to differentiate traffic in a proportional way, it provides fairness, and generally supports QoS for all types of multimedia applications, while efficiently serving background data traffic. POAP is compared to HCF in order to examine the wireless network performance when serving integrated traffic.