一种基于Ad Hoc网络的协作MAC方案

在 IEEE 802.11b MAC层协议的研究基础上,提出了一种基于无线Ad Hoc网络的最佳中继选择策略,该策略综合考虑瞬时信道信息和节点剩余能量,能够有效防止信道条件好的节点的过度使用,并能保证系统高吞吐量。文中以饱和吞吐量和网络生存时间为性能指标,对新算法和以往协作MAC算法进行仿真和比较,结果表明新算法在网络吞吐量下降不明显的情况下,能大大增加网络生存时间。     

一种提高802.11无线Ad Hoc网络公平性的新机制-FFMA

实现多个数据流对无线信道的公平共享是802.11无线Ad Hoc网络中的一个重要议题,但802.11DCF机制在无线Ad Hoc网络中存在严重的公平性问题,甚至有可能出现单个节点或数据流独占信道而其他节点和数据流处于"饥饿"状态的情况.论文提出了一种新颖的保证数据流间公平性的MAC层接入机制FFMA(Flow rate-based Fair Medium Access),通过公平调度和公平竞争的方式,FFMA能够在数据流间公平地分配信道带宽资源.仿真结果表明,在无线Ad Hoc网络中,FFMA可以在保证信道吞吐量的前提下取得远优于802.11 DCF的数据流间的公平性.     

采用定向天线Ad Hoc网络MAC协议关键问题研究

介绍基于定向天线的MAC协议,阐述使用定向天线所面临的隐藏终端、暴露终端以及聋节点问题。重点分析定向天线的MAC协议造成隐藏终端和暴露终端的原因以及解决这些问题的相应策略,在此基础上提出了新的改进CSMA协议。通过仿真表明,改进CSMA协议能提高基于定向天线Ad Hoc网络的整体性能。     

Ad Hoc网络中提供QoS保障的MAC协议的研究

在Ad Hoc网络中提供QoS保障是一个复杂的系统问题,而MAC协议是上层应用的服务质量能否得到最终保障的一个关键因素.文章阐述了Ad Hoc网络中QoS MAC协议的提出背景,说明了QoS MAC协议的设计策略.详细分析和讨论了在Ad Hoc网络的MAC层提供QoS支持的各种机制及方法.     

Ad Hoc网络基于TCP吞吐量的速率自适应技术

目前的IEEE 802.11标准在物理层支持多速率传输,但在媒体接入控制(MAC,Media AccessControl)层却没有相应的速率自适应方法。针对目前Ad Hoc网络自适应速率控制方法的不足和在无线通信环境下TCP性能会大幅度恶化,提出了一种改进的MAC层速率自适应协议,该协议实现简单,与传统标准兼容性好,在提高TCP吞吐量的基础上能适应快速变化的无线信道,且能实现分段数据包的速率自适应传输。仿真结果表明,该协议比RBAR协议有更好的吞吐量。     

基于智能天线的Ad Hoc网络MAC协议

天线Ad Hoc网络已经广泛应用于各种无基础架构的环境中。阐述了基于智能天线的Ad Hoc网络MAC协议研究领域的最新进展。对Ad Hoc网络中的隐节点和暴露节点问题作了分析,并对智能天线技术的实现机制进行了简要的概括。在介绍典型MAC协议的基础上,指出了未来MAC协议设计的研究方向,指出基于智能天线的MAC协议研究具有很好的发展前景。     

无线移动网络的协作通信方案研究

结合具体的无线Ad hoc网络,提出了机会性的根据网络实时状况选择最佳中继的协作MAC协议,并在NS-2仿真平台上实现,仿真结果表明,较常规的802.11 DCF协议,协作MAC方案有效地提高了网络的递交率。此外对采用RCPC编码协作的MAC协议进行了数值仿真。这些协议和方案可以直接或修改后应用于现有的Ad hoc等无线网络,在一定程度上可以实现跨层的机会协作通信和组网方案。     

移动Ad Hoc网络安全按需路由协议

Ad Hoc网络的安全性问题越来越引起人们的关注,如何确保Ad Hoc网络路由协议的安全成为Ad Hoc研究的一项关键技术。提出一种适用于移动Ad Hoc网络的安全按需源路由协议,利用移动节点之间的会话密钥和基于散列函数的消息鉴别码HMAC一起来验证路由发现和路由应答的有效性。提出的邻居节点维护机制通过把MAC地址和每个节点的ID绑定来防御各种复杂的攻击如虫洞攻击。NS-2仿真表明该协议能有效地探测和阻止针对Ad Hoc网络的大部分攻击。     

基于网络拥塞程度阈值的退避算法

对IEEE802.11无线网络MAC层技术所使用的DCF协议退避算法进行了分析,针对二进制指数退避算法BEB存在的不足,改进了从平均退避窗口取阈值的方案,基于这个阈值提出了适合Aol Hoc网络的NCT退避算法.OPNET仿真结果表明,改进的退避算法能提高网络吞吐量,改善网络性能.     

无线Ad Hoc网络异步MAC层接入协议研究

本文针对无线Ad Hoc网络中,三种典型的异步MAC层接入协议MACAW、FAMA-NTR和DBTMA,从协议的基本思想,算法描述、协议状态流程等方面进行了讨论。本文可以为进一步研究无线Ad Hoc网络异步MAC层接入协议提供参考。     

Cross-layer TCP with bitmap error recovery scheme in wireless ad hoc networks

Current TCP is not able to distinguish corruption losses from packet loss events. Hence, high transmission errors and varying inherent latency within a wireless network would cause seriously adverse effects to TCP performance. To improve TCP in IEEE 802.11 multi-hop ad hoc wireless networks, this study proposes an error recovery mechanism based on coordination of TCP and IEEE 802.11 MAC protocols. The simulation results confirm that the proposed error recovery approach could provide a more efficient solution for frequent transmission losses, and enable TCP to distinguish between congestion errors and transmission errors, and thus, to respond with proper remedial actions.     

Cross-Layer Interaction of TCP and Ad Hoc Routing Protocols in Multihop IEEE 802.11 Networks

In this research, we first investigate the cross-layer interaction between TCP and routing protocols in the IEEE 802.11 ad hoc network. On-demand ad hoc routing protocols respond to network events such as channel noise, mobility, and congestion in the same manner, which, in association with TCP, deteriorates the quality of an existing end-to-end connection. The poor end-to-end connectivity deteriorates TCP's performance in turn. Based on the well-known TCP-friendly equation, we conduct a quantitative study on the TCP operation range using static routing and long-lived TCP flows and show that the additive-increase, multiplicative-decrease (AIMD) behavior of the TCP window mechanism is aggressive for a typical multihop IEEE 802.11 network with a low-bandwidth-delay product. Then, to address these problems, we propose two complementary mechanisms, that is, the TCP fractional window increment (FeW) scheme and the Route-failure notification using BUIk-losS Trigger (ROBUST) policy. The TCP FeW scheme is a preventive solution used to reduce the congestion-driven wireless link loss. The ROBUST policy is a corrective solution that enables on-demand routing protocols to suppress overreactions induced by the aggressive TCP behavior. It is shown by computer simulation that these two mechanisms result in a significant improvement of TCP throughput without modifying the basic TCP window or the wireless MAC mechanisms.     

Congestion control with dynamic threshold adaptation and cross‐layer response for TCP Vegas over IEEE 802.11 wireless networks

Wireless technologies provide mobile access and enable rapid andcost‐effective network deployment. But a wireless link is generally accompanied by high interference, transmission errors and a varying latency. The erratic packet losses usually lead to a curbing of the flow of segments on the TCP connection, and thus limit TCP performance. This paper presents a threshold control mechanism with cross‐layer response approach for improving TCP Vegas performance in IEEE 802.11 wireless networks. By making slight modifications to the legacy IEEE 802.11 MAC and TCP, the numerical results reveal that the proposed scheme provides a significant improvement in TCP performance under IEEE 802.11 wireless environments. Copyright © 2013 John Wiley & Sons, Ltd.     

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     

Removing redundant TCP functionalities in wired‐cum‐wireless networks with IEEE 802.11e HCCA support

The TCP was originally designed for wired networks, assuming transmission errors were negligible. Actually, any acknowledgment time‐out unconditionally triggers the congestion control mechanism, even in wireless networks in which this assumption is not valid. Consequently, in wireless networks, TCP performance significantly degrades. To avoid this degradation, this paper proposes the so‐called split TCP and UDP. In this approach, the access point splits the TCP connection and uses a customized and lighter transport protocol for the wireless segment. It takes advantage of the IEEE 802.11e Hybrid Coordination Function Controlled Channel Access (HCCA) mechanisms to remove redundant TCP functionalities. Specifically, the HCCA scheduler allows disabling of the congestion control in the wireless link. Similarly, the IEEE 802.11e error control service makes possible to eliminate TCP acknowledgments, therefore reducing the TCP protocol overhead. Finally, the usage of an HCCA scheduler permits providing fairness among the different data flows. The proposed split scheme is evaluated via extensive simulations. Results show that split TCP and User Datagram Protocol outperforms the analyzed TCP flavors—specifically designed for wireless environments—and the split TCP solution, achieving up to 95% of end‐user throughput gain. Furthermore, the proposed solution is TCP friendly because TCP flows are not degraded by the presence of flows by using this approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Shielding TCP from last hop wireless losses

The pervasiveness of the transport control protocol (TCP) and the proliferation of wireless local area networks (WLAN) of the 802.11 type make the topic of TCP performance over last hop wireless networks very relevant. The Snoop protocol, a link layer solution introduced several years ago to improve the performance of TCP in this scenario, has been shown to neglect its benefits to the most widely used TCP version, TCP SACK. In this paper, we introduce the TCP SACK‐Aware Snoop protocol to address this problem. Our results indicate that the TCP SACK‐Aware Snoop protocol improves the performance of TCP SACK by around 30% compared with the original Snoop protocol and by about 8% in an environment where no TCP enhancing mechanism is in place. In addition, we introduce further modifications to the proposed protocol to make its advantages available to any TCP sender. We also show that the mechanism does not introduce unfairness among TCP sources and somewhat protects TCP against UDP traffic. Our results show important throughput improvements to all TCP versions and demonstrate that the TCP SACK‐Aware Snoop protocol shields TCP from last hop wireless losses providing throughtput values very close to the maximum possible. Copyright © 2006 John Wiley & Sons, Ltd.     

A cross‐layer TCP for providing fairness in wireless mesh networks

The fair allocation of resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate‐limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as its recently proposed solution, the ‘Minimum Content Window’ policy based on IEEE 802.11e. It is found that the aggregate throughput degrades sharply because the effect of this policy on the TCP congestion mechanism has been overlooked. This paper proposes a priority‐based congestion control by using ‘Cross‐Layer Explicit Congestion Notification’. Analysis and simulation results demonstrate that our scheme can improve the fairness of TCP flows while the aggregate throughput is at least 20% higher than the ‘Minimum Content Window’ policy. Copyright © 2011 John Wiley & Sons, Ltd.     

Game theory models for IEEE 802.11 DCF in wireless ad hoc networks

Because wireless nodes decide their channel accesses independently in the IEEE 802.11-based ad hoc networks, and the channel access of a node has an influence on those of its neighboring nodes, game theory naturally becomes a useful and powerful tool to research this kind of network. In this article a game model is proposed to interpret the IEEE 802.11 distributed coordination function mechanism. In addition, by designing a simple Nash equilibrium backoff strategy, we present a fairness game model. Our simulation results show that the new backoff strategy can improve TCP performance almost perfectly.     

Performance analysis of the IEEE 802.11e wireless networks with TCP ACK prioritization

With the advent of multimedia over wireless local area networks, the IEEE 802.11e standard was proposed to incorporate Quality of Service (QoS). It has been found that the throughput of Transmission Control Protocol (TCP) is less than that of User Datagram Protocol (UDP) in the IEEE 802.11e. This is because the TCP acknowledgment packets are queued up at the access points. In this paper, two types of TCP acknowledgment prioritizing schemes are proposed. The proposed schemes improve the overall throughput of TCP while maintaining the QoS requirements. We also analyze the problem of starvation of lower priority traffic and its effects on the performance of lower priority TCP traffic. The proposed dynamic scheme of TCP acknowledgment prioritization aims at improving the throughput of the lower priority TCP traffic under heavy network load while maintaining the QoS requirements of the higher priority traffic. The schemes have been verified through extensive simulation.     

A cross-layer congestion and contention window control scheme for TCP performance improvement in wireless LANs

Neither the current TCP protocol nor the standard backoff algorithm of IEEE 802.11 protocol is able to distinguish corruption loss from congestion or collision loss. Hence, high transmission errors and a varying latency inherent in wireless channel would have a seriously adverse effect on the performance of TCP. In this paper, we propose a novel and pragmatic cross-layer approach with joint congestion and contention window control scheme to improve the performance of TCP in IEEE 802.11 wireless environments. In addition to theoretical analysis, simulations are conducted to evaluate the proposed scheme. As it turns out, our design indeed provides a more efficient solution for frequent transmission loss and enables TCP to distinguish between congestion loses and transmission errors, thus to take proper remedial actions.