无线多跳Ad hoc网络中MAC机制的公平性与网络容量利用率

高效、公平的MAC协议是目前无线多跳Ad hoc网络研究的关键问题之一。该文在给出一种新的无线多跳Ad hoc网络的网络模型前提下,定义了MAC协议公平性、网络容量利用率两个性能参数。给出了一种能在竞争节点间公平共享无线信道并充分利用网络容量的MAC协议(FMAC),仿真比较了FMAC和IEEE 802.11 DCF的公平性和网络容量利用率。结果表明FMAC能在充分利用网络容量的前提下,实现无线信道在竞争节点间的公平共享。     

基于吞吐量比例公平的802.11MAC优化机制

802.11DCF MAC机制为单速率网络节点提供相同的信道接入机会,保证节点公平地使用信道。在多速率网络中依然沿用该接入机制,会导致低速率的节点长期占用信道,高速传输的优势得不到充分利用,使得多速率网络中所有节点的吞吐量都等于低速率节点的吞吐量,这就是著名的多速率网络"性能异常"问题。针对这一问题,通过分析建模,提出CCDa P(Change the CWmin according to Data rate and Packet-size)MAC优化机制以改善多速率网络中的节点的吞吐性能。仿真结果表明,该接入机制不仅可以保证节点公平性,还能提高网络整体吞吐量。特别地,在数据包长度不等的多速率WLAN中,该机制能够保证网络节点吞吐量的比例公平。     

IEEE 802.11多速率条件下信道访问公平性研究

IEEE802.11无线网络的物理层可以支持多速率之间的动态调整,针对网络中存在的不同速率节点间信道占用时间不公平性问题,提出了一种基于Markov模型的多速率条件信道访问公平调度算法FBASHL（FairBandwidth Allocation Schemebetween High-speedandLow-speed）。该算法以每个节点传输数据部分所占用无线信道的时间而不是节点得到信道的概率作为衡量节点公平与否的指标,每个节点通过调整自身竞争信道的次数来维持WLAN中的信道访问时间公平性。仿真结果显示,该协议有效保证了不同速率节点间占用信道时间的公平性。     

IEEE802.11MAC协议中一种改进的退避解决算法

IEEE802.11无线局域网,在共享信道中经历碰撞的网络节点需要随机退避一段时间,这段时间是从竞争窗口中均匀选取,竞争窗口大小由BEB机制动态控制,一些文献研究表明,BEB机制在重负载的情况下,突现出公平性问题和低的吞吐量,本文基于MILD退避机制,提出一种适用于分布式协调功能改进算法。该算法通过修改802.11的MAC层中的DCF(DistributedCoordinationFunction)子协议,改善了IEEE802.11无线局域网在拥塞情况下的性能,提高了网络吞吐量。     

Ad hoc网络中DCF公平性分析与改进

在考虑节点的物理载波检测范围大于通信范围的情况下,该文分析了多跳Adhoc网络中物理载波检测机制对IEEE 802.11DCF协议公平性的影响。针对载波干扰给IEEE802.11DCF协议带来的严重不公平问题,提出了一种基于冲突和干扰感知的退避(CIAB)算法。仿真证明,该算法能有效地改善IEEE802.11DCF协议的公平性,并且没有引起网络吞吐量的严重下降。     

一种用于移动自组织网的多址接入动态时延退避策略

在移动Ad Hoc网络中，信道接入公平性和吞吐率是MAC协议需解决的重要问题，而IEEE802．11等协议采用的二进制指数退避算法BEB难以满足公平性要求。本文提出了一种基于对节点竞争失败次数（无效RTS）进行计数的方法估计信道争用情况，动态地分配退避计数器初值，从而实现移动Ad Hoc网络的公平多址接入。研究表明，该接入方法能够有效地反映源节点特性，接入公平性好，同时在高负荷和低负荷的情况下，都能提高网络吞吐量，提供良好的QoS保障。     

一种联合路由层信息设计的多跳Ad Hoc MAC层协议

提出了一种单信道多跳Ad Hoc网络的媒体接入层协议.利用全向天线的特点,协议控制帧捎带路由信息,使邻居节点获知节点间路由状态.上游节点的ACK应答直接触发下游节点的CTS握手,形成CTS/DATA/ACK三维交互机制.协议可有效减少网络的握手开销,降低重负载时握手帧的冲突概率.仿真表明,协议可适应不同的拓扑.最好情况下,协议较IEEE 802.11协议的吞吐量约提升16.1%,端到端延时约降低16.8%.改善了多跳Ad Hoc网络性能.     

无线Ad Hoc网络中基于活跃节点数预测的时隙ALOHA算法

针对采用时隙ALOHA算法的无线Ad Hoc网络,考虑数据包到达的动态性与数据包传输的随机性,以最大化吞吐量为目标,同时满足数据队列稳定性,构建了关于接纳控制与竞争接入的随机优化问题。由于在时隙ALOHA算法中数据包传输的最优概率取决于无线Ad Hoc网络中数据队列非空的活跃节点数,提出了一种基于活跃节点数预测的时隙ALOHA算法。该算法要求无线Ad Hoc网络中的所有发送节点实时地侦听通信信道的忙闲状态,计算基于信道状态的活跃节点数条件期望,从而动态地预测无线Ad Hoc网络在不同时刻的活跃节点数,达到网络节点依据局部网络状态信息自适应地优化数据包传输概率的目的。仿真结果表明,所提算法能够有效估计无线Ad Hoc网络在每个时隙的活跃节点数,从而显著提升网络吞吐量并且降低数据包的平均排队时延。     

无线Ad Hoc 网的公平性问题

目前的Ad hoe网中，为了解决隐蔽站问题提出了许多方法，IEEE 802.11 DCF MAC协议作为一种在无线Ad hoe网中被建议使用的标准，受到人们的关注。在IEEE 802．11 DCF中通过使用RTS／CTS握手，以及ACK确认帧，减轻了隐蔽站的影响，但它将导致“捕获”效应，即一些站占有共享信道，而其他站得不到信道，这也叫“公平性”问题。这篇文章叙述了一些有关“公平性”的解决办法，并通过仿真，说明改变IEEE 802．11中的退避算法，可提高Ad hoe网的公平性。     

IEEE 802.11中多速率多节点公平的数据分组长度调整策略

在深入剖析多速率机制导致不公平性根源的基础上,提出了基于传输速率的数据分组长度调整(TRPSA)策略,该策略保证了传输速率不同的节点能公平地占用无线信道。理论证明和仿真验证了该策略能有效实现多速率多节点情况下的公平性,显著提高网络性能。该策略只需对IEEE 802.11做细小修改,易于在实际网络中实现和推广。     

Self-coordinating localized fair queueing in wireless ad hoc networks

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose maximize-local-minimum fair queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.     

Enhancing Fairness for Short-Lived TCP Flows in 802.11b WLANs

The problem of providing throughput fairness in a wired-cum-wireless network where the wireless portion is an 802.11 wireless local area network (WLAN) is addressed. Due to the distributed nature of the primary 802.11 media access control protocol and the unpredictability of the wireless channel, quality of service guarantees in general and fairness in particular are hard to achieve in WLANs. This fact seriously compromises the interaction between 802.11-based networks and well-established architectures such as DiffServ. The focus of this paper is on transmission control protocol (TCP) traffic, and two fundamental problems related to throughput fairness are identified. First, the basic requirement of providing fair access to all users conflicts with the nature of TCP, which is fair only under certain conditions and hardly met by 802.11b WLANs. Second, short-lived TCP flows that are sensitive to losses during the early stages of TCP window growth need to be protected. To address these issues, a logical-link-control-layer algorithm that can be implemented at both access points and wireless stations is proposed. The algorithm aims at guaranteeing fair access to the medium to every user, independent of their channel conditions. At the same time, the proposed scheme protects short-lived flows, while they strive to get past the critical "small window regime." A simulation study that shows the effectiveness of the new algorithm in comparison to the standard 802.11b implementation is presented     

A topology-independent wireless fair queueing model in ad hoc networks

Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network is challenging due to the unique design issues. These issues include: 1) spatial contention among transmitting flows in a spatial locality, as well as spatial reuse of bandwidth through concurrent flow transmissions in different network locations; 2) conflicts between ensuring fairness and maximizing spatial channel reuse; and 3) the distributed nature of ad hoc fair queueing. In this paper, we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our fairness model ensures coordinated fair channel access among spatially contending flows, while seeking to maximize spatial reuse of bandwidth. We describe packetized algorithms that realize the fluid fairness model with analytical performance bounds. We further design a distributed implementation which approximates the ideal centralized algorithm. We present simulations and analysis on the performance of our proposed algorithms.     

Improving Spatial Reuse in Multihop Wireless Networks - A Survey

In multihop wireless ad-hoc networks, the medium access control (MAC) protocol plays a key role in coordinating the access to the shared medium among wireless nodes. Currently, the distributed coordination function (DCF) of the IEEE 802.11 is the dominant MAC protocol for both wireless LANs and wireless multihop ad hoc environment due to its simple implementation and distributed nature. The current access method of the IEEE 802.11 does not make efficient use of the shared channel due to its conservative approach in assessing the level of interference; this in turn affects the spatial reuse of the limited radio resources and highly affect the achieved throughput of a multihop wireless network. This paper surveys various methods that have been proposed in order to enhance the channel utilization by improving the spatial reuse.     

Enhanced binary exponential backoff algorithm for fair channel access in the ieee 802.11 medium access control protocol

The medium access control protocol determines system throughput in wireless mobile ad hoc networks following the ieee 802.11 standard. Under this standard, asynchronous data transmissions have a defined distributed coordination function that allows stations to contend for channel usage in a distributed manner via the carrier sensing multiple access with collision avoidance protocol. In distributed coordination function, a slotted binary exponential backoff (BEB) algorithm resolves collisions of packets transmitted simultaneously by different stations. The BEB algorithm prevents packet collisions during simultaneous access by randomizing moments at stations attempting to access the wireless channels. However, this randomization does not eliminate packet collisions entirely, leading to reduced system throughput and increased packet delay and drop. In addition, the BEB algorithm results in unfair channel access among stations. In this paper, we propose an enhanced binary exponential backoff algorithm to improve channel access fairness by adjusting the manner of increasing or decreasing the contention window based on the number of the successfully sent frames. We propose several configurations and use the NS2 simulator to analyze network performance. The enhanced binary exponential backoff algorithm improves channel access fairness, significantly increases network throughput capacity, and reduces packet delay and drop. Copyright © 2013 John Wiley & Sons, Ltd.     

A Hybrid Collision Avoidance Scheme for Ad Hoc Networks

A novel hybrid collision avoidance scheme that combines both sender-initiated and receiver-initiated collision-avoidance handshake is proposed for multi-hop ad hoc networks. The new scheme is compatible with the popular IEEE 802.11 MAC protocol and involves only some additional queue management and book-keeping work. Simulations of both UDP- and TCP-based applications are conducted with the IEEE 802.11 MAC protocol, a measurement-based fair scheme and the new scheme. It is shown that the new scheme can alleviate the fairness problem with almost no degradation in throughput. More importantly, it is shown that without explicit information exchange among nodes, the fairness problem cannot be solved conclusively if reasonable throughput is to be maintained. Hence it calls for further work to integrate the new collision avoidance scheme with other schemes that approximate fair queueing and use more contention information in channel access to achieve some QoS assurances in ad hoc networks.     

Flow rank based probabilistic fair scheduling for wireless ad hoc networks

Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc networks due to infrastructure free operation and location dependent contentions. As there is no entity to serve coordination among nodes, we need a mechanism to overcome inherent unreliability of the network to provide reduced collision and thereby higher throughput and adequate fair allocation of the shared medium among different contending flows. This paper proposes a flow rank based probabilistic fair scheduling technique. The main focus is to reduce the collision probability among the contending flows while maintaining the prioritized medium access for those flows, which ensures a weighted medium access control mechanism based on probabilistic round robin scheduling. Each flow maintains a flow-table upon which the rank is calculated and backoff value is assigned according to the rank of the flow, i.e., lower backoff interval to lower ranked flow. However, flow-table instability due to joining of a new flow, partially backlogged flow, hidden terminal and partially overlapped region exhibits a challenging problem that needs to be mitigated for our mechanism to work properly. We take appropriate measures to make the flow-table stabilized under such scenarios. Results show that our mechanism achieves better throughput and fairness compared to IEEE 802.11 MAC and existing ones.     

Distributed cooperative MAC for multihop wireless networks

This article investigates distributed cooperative medium access control protocol design for multihop wireless networks. Cooperative communication has been proposed recently as an effective way to mitigate channel impairments. With cooperation, single-antenna mobile terminals in a multi-user environment share antennas from other mobiles to generate a virtual multipleantenna system that achieves more reliable communication with a higher diversity gain. However, more mobiles conscribed for one communication inevitably induces complex medium access interactions, especially in multihop wireless ad hoc networks. To improve the network throughput and diversity gain simultaneously, we investigate the issues and challenges in designing an efficient MAC scheme for such networks. Furthermore, based on the IEEE 802.11 DCF, a cross-layer designed cooperative MAC protocol is proposed. The MAC scheme adapts to the channel condition and payload length.     

An enhancement to the IEEE 802.11e EDCA providing QoS guarantees

One of the challenges that must be overcome to realize the practical benefits of ad hoc networks is quality of service (QoS). However, the IEEE 802.11 standard, which undeniably is the most widespread wireless technology of choice for WLANs and ad hoc networks, does not address this issue. In order to support applications with QoS requirements, the upcoming IEEE 802.11e standard enhances the original IEEE 802.11 MAC protocol by introducing a new coordination function which has both contention-based and contention-free medium access methods. In this paper, we consider the contention-based medium access method, the EDCA, and propose an extension to it such that it can be used to provide QoS guarantees in WLANs operating in ad hoc mode. Our solution is fully distributed, uses admission control to regulate the usage of resources and gives stations with high-priority traffic streams an opportunity to reserve time for collision-free access to the medium.