MIMO Ad Hoc网络中基于正交阵列的拓扑未知多址接入协议

针对支持MIMO(Multiple Input Multiple Output)的Ad Hoc网络,提出了基于正交阵列的拓扑未知多址接入协议MIMO_O_TTMA(MIMO Supported Orthogonal Array Based Topology Transparent Multiple Access).协议利用正交阵列为节点分配若干时隙,在每个分配时隙中,节点通过与目的节点交互RTS/CTS(Request To Send/Clear To Send)分组来确定发送的数据流数,以机会地利用MIMO的空间复接来提升网络性能.MIMO_O_TTMA在保证节点在一帧内至少有一个时隙能够无干扰地传输的基础上,允许协议的帧长能在一定的范围内进行灵活选择,从而为协议性能的优化提供了更为有利的条件.为评估MIMO_O_TTMA的性能,利用概率方法分析了协议的吞吐量性能,数值结果表明,与已有拓扑未知MAC(Media Access Control)相比,MIMO_O_TTMA有效提升了网络吞吐量.     

支持MIMO链路的Ad hoc网络中的链路激活型拓扑未知MAC协议

该文提出了支持多输入多输出(MIMO)链路的Ad hoc网络的链路激活型拓扑未知多址接入协议。该协议利用正交拉丁方来为网络链路分配传输时隙,保证每个链路在1帧中至少有1个时隙可以成功传输。推导了该协议的平均吞吐量,并以最大化平均吞吐量为准则给出了选择协议参数的方法。数值结果表明,与已有链路激活型和节点激活型拓扑未知协议相比,本文的协议可以提高网络节点的吞吐量。     

多跳Ad Hoc网络中支持MIMO的分布式拓扑未知时分多址接入协议的研究与分析

针对Ad Hoc网络和MIMO的有效结合,提出了适于多跳Ad Hoc网络的支持MIMO的分布式拓扑未知时分多址接入协议.该协议通过有限域无线网络设计算法在每帧给每个节点分配时隙且无需知道全网拓扑信息,这极大地减小了收集全网拓扑信息的开销.通过预约,每个节点在其分配的无干扰时隙并行发送MIMO链路的所有数据流,并在与其他节点共享的时隙发送MIMO链路的一部份数据流来解决传输冲突.同时推导出保证通过率和最佳帧长.结果显示动态分配MIMO的传输容量和抗干扰能力会极大地提高通过率.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

统计优先级多址接入协议的改进与仿真

统计优先级的多址接入（Statistical Priority-based Multiple Access,SPMA）协议的优良性能符合未来数据链的发展趋势。经典的SPMA协议中存在固定门限设置导致的吞吐量下降、退避时间设置过于简单和低优先级分组“饥饿”等三个问题。针对这些问题,提出了统计差值退避算法和虚拟时间戳排队算法。统计差值退避算法使用负载统计量和优先级门限的差值,计算出合理的分组退避时间。虚拟时间戳排队算法根据接入带宽的最低要求,按照虚拟完成时间大小进行分组接入。结合这两个算法,设计了基于SPMA的介质访问控制层改进协议,并使用OPNET软件对改进协议进行了仿真。仿真结果表明,相比于SPMA协议的传统算法,改进协议的系统吞吐量更大且更稳定,优先级平均时延更低,同时保证了低优先级业务的最小带宽接入需求。     

Ad Hoc网络信道接入协议

文章首先介绍了AdHoc网络特有的隐终端和暴露终端问题 ,并对可能的解决方法进行了分析。在总结了前人工作的基础上 ,将AdHoc网络信道接入协议划分成基于单信道、双信道和多信道三类。文章还介绍了几种具有代表性的单信道接入协议 ,并给出了AdHoc网络信道接入协议的发展动向     

一种适用于多跳Ad Hoc网络的增强型协作多址接入协议

 针对多跳Ad Hoc网络提出一种增强型协作多址接入协议.该协议联合考虑数据传输速率和隐藏终端对协作网络性能的影响,通过优化协议的握手规则和协同节点的选择策略,从而在不引入开销的条件下,有效提高了网络的饱和吞吐量并降低了业务的接入时延.另外,基于对节点行为及其所处状态概率的分析,本文建立了协作多址协议在多跳Ad Hoc网络中的饱和吞吐量分析模型,并给出相应的理论分析结果.最后,通过在多跳Ad Hoc网络中的大量仿真,评估了所提增强型协作多址接入协议和分析模型的性能.仿真结果表明:相对于已有的协作多址协议该协议能够有效提高网络的饱和吞吐量.此外,仿真结果和理论分析结果能够很好的匹配,从而也证明了分析模型的正确性和有效性.     

移动Ad HOc网络中的公平按需多址接入协议

基于快速、有效竞争预约接入、无冲突轮询传输的思想和带冲突预防的冲突分解策略,本文提出了适于移动Ad Hoc网络的公平按需多址接入(FODA)协议.该协议在分群结构的基础上,利用公平冲突预防算法预约信道资源获得轮询服务,从而完全消除了载波侦听方式下多跳无线网络业务传输中的隐藏终端和暴露终端问题.另外,公平冲突预防算法解决了节点竞争接入时的冲突问题和不公平现象.最后,仿真结果表明,与带冲突避免的载波侦听多址接入(CSMA/CA)和轮询协议相比,FODA协议可以提供较高的信道吞吐量、较低的平均消息丢弃率和平均消息时延.     

移动Ad Hoc网络的MAC协议综述

媒体访问控制（MAC）协议能否有效地使用无线信道的有限资源．对AdHoc网络的性能起着决定性的作用。AdHoc网络中MAC协议设计的复杂性源自节点的移动性、链路的易变性和缺乏中心协调性。本文首先介绍了AdHoc网络中MAC协议的作用．说明了MAC协议的设计挑战．然后对现有的各种MAC协议进行了详尽的分类比较和分析．最后对MAC协议进行了总结和展望。     

依据用户妥善安排的多址接入协议在分布式无线网络中的性能研究

本文基于有效竞争预约接入、无冲突轮询传输的思想提出了在多跳分布式无线网络中支持节点移动性和多跳网络结构的依据用户妥善安排的多址接入(UPMA)协议.该协议能够保证发送节点快速接入信道,从而大大提高信道的使用效率.用仿真方法研究了多跳分布式无线网络中采用该协议时的网络性能.结果表明,UPMA协议可以提供较高的通过量、较低的平均分组时延和较小的平均分组丢失率.     

An Adaptive Generalized Transmission Protocol for Ad Hoc Networks

Wireless networking and group communication in combination allows groups of dispersed mobile users to collaborate. This paper presents AGENT, a medium access control (MAC) protocol that unifies point-to-point and multi-point transmission services to facilitate group communication in ad hoc networks. Analysis and experiments performed in a simulated ad hoc network demonstrate that AGENT exhibits reliable and stable performance with high spatial bandwidth reuse. Moreover, variation in the proportion of point-to-point and multi-point traffic is shown to have little impact on the overall performance of AGENT. Comparison with the other tested MAC protocols reveals that the performance of AGENT is superior, achieving higher channel utilization and lower access delay.     

An Optimization Framework for Demand-based Fair Stream Allocation in MIMO Ad Hoc Networks

In this paper, we investigate the problem of scheduling flows for fair stream allocation (or, stream scheduling) in ad hoc networks in which the transmitter and receiver use multiple antennas called Multiple Input Multiple Output (MIMO) technology. Our main contributions include: i) the concept of stream allocation to flows based on their traffic demands or class, ii) stream allocation to flows in the network utilizing single user or multiuser MIMO communication, iii) achieving the proportional fairness of the stream allocation in the minimum possible schedule length, and iv) performance comparison of the stream scheduling in the network for single user and multiuser communication and the tradeoff involved therein. We first formulate demand-based fair stream allocation as an integer linear programming (ILP) problem whose solution is a schedule that is guaranteed to be contention-free. We then solve this ILP in conjunction with binary search to find a minimum length contention-free schedule that achieves the fairness goals. We show that an implementation of our algorithm for a number of sample topologies in fact yields minimum length schedules that achieve the fairness goals. We then give performance comparison results that show the benefit of multiuser MIMO links over single user links at higher traffic workloads in the network. Finally, we also give a greedy heuristic for stream scheduling and compare its performance with the ILP-based algorithm in terms of the fairness goals achieved in a given schedule length.

Receiver-Oriented Multiple Access in Ad Hoc Networks with Directional Antennas

Directional antennas can adaptively select radio signals of interest in specific directions, while filtering out unwanted interference from other directions. A couple of medium access protocols based on random access schemes have been proposed for networks with directional antennas, using the omnidirectional mode for the transmission or reception of control packets in order to establish directional links. We propose a distributed receiver-oriented multiple access (ROMA) scheduling protocol, capable of utilizing multi-beam forming directional antennas in ad hoc networks. Unlike random access schemes that use on-demand handshakes or signal scanning to resolve communication targets, ROMA computes a link activation schedule in each time slot using two-hop topology information. It is shown that significant improvements on network throughput and delay can be achieved by exploiting the multi-beam forming capability of directional antennas in both transmission and reception. The performance of ROMA is studied by simulation, and compared with a well-know static scheduling scheme that is based on global topology information.     

A Priority MAC Protocol to Support Real-Time Traffic in Ad Hoc Networks

Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks. However, most existing access mechanisms cannot guarantee quality for real-time traffic. This paper presents a distributed medium access control protocol that provides multiple priority levels for stations to compete for the wireless channel. One common channel is assumed to be shared by all stations. Stations are assumed to be able to hear each other (i.e., the network is fully connected). The channel is accessed by stations according to their priorities, and for stations with the same priority, they send frames in a round robin manner. The channel access procedure is divided into three stages: priorities classification period, ID initialization period, and transmission period. Simulation results indicate that our protocol provides high channel utilization and bounded delays for real-time frames.