Ad Hoc网络基于簇的多信道MAC协议研究

介绍了一种适用于Ad Hoc网络的基于簇的多信道媒体接入控制协议。在该协议中,整个网络被划分成使用不同频道的若干个簇,每个节点配置有3个独立的无线收发信机,由簇首节点负责簇的维持功能,由簇首和簇成员节点通过共同执行信道重配置算法来完成信道分配工作。仿真结果表明,该协议可以很好地适应网络拓扑结构的频繁变化,在充分利用多信道优势工作的同时,解决了普遍存在于多跳无线移动网络中的隐藏终端和暴露终端问题。     

Ad Hoc网络

首先介绍了Ad Hoc网络的基本概念、技术特点以及关键技术等，然后较为全面地归纳了Ad Hoc网络的典型应用，最后讨论了Ad Hoc网络的发展趋势和有待解决的问题。     

一种Ad Hoc网络收方发起的媒体接入控制算法

在结合多包接收技术以及功率控制的基础上提出了一种发射能级可控的应用于Ad Hoc网络的收方发起的媒体接入控制算法，并对其吞吐量和能耗作了分析。与RTS/CTS(request to send／clear to send)握手机制相比，在一定假设条件下，网络吞吐量有着明显的提高，与此同时，系统发射功率最多可降低60％以上     

一种新的Ad Hoc网络的MAC协议及实现

MAC协议是无线AdHoc网络的一个重要的研究领域,特别是暴露终端和隐终端的解决尤为重要,同时网络的无组织性和多跳性也给接入带来了麻烦。首先介绍了MAC协议设计所面临的各种问题,然后叙述了一种新的在单信道下的MAC接入方法,采用了CSMA和时隙相结合的方式来提高效率,部分地解决了暴露终端和隐终端的问题,同时提高了路由效率。论述了如何在软件无线电平台以及嵌入式系统上实现这种接入方法。     

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有效提升了网络吞吐量.     

一种基于中心代理的移动Ad—Hoc网络接入方法

本文针对已有接入方法所存在的缺点,提出一种以移动节点间相互竞争出现的中心节点作为移动代理,利用移动IP协议实现MANET接入Internet的新方法,并对中心代理节点的选取、MANET整体移动接入等问题进行了探讨。该方法具有开销小、接入灵活、不需对移动IP做大的改动等优点。     

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

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

Ad Hoc网络的可生存性研究

对Ad Hoc网络的可生存性问题进行了阐述和分析,说明了A d Hoc网络可生存性面临的问题和挑战,特别强调了军事需求。从三个方面探讨了A d Hoc网络的可生存性问题:可生存的网络连接、可生存的通信及可生存性技术,尤其对可生存性技术进行了较全面的剖析。     

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

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

一种用于Ad Hoc网络的分簇算法

Ad Hoc网络是动态变化的拓扑结构,具有无中心和自组织的特点,如何对它进行有效地管理至今没有得到很好的解决。提出了一种基于权值的分簇算法,有效解决了这个问题,从而提高了网络管理的灵活性和可扩展性,使之更适合于管理大规模、多种环境的Ad Hoc无线网络。     

车载自组织网络的体系结构和通信协议研究

在对车载自组织网络的特点和研究现状分析的基础上,文章给出了车载自组织网络（VANET）中多维多层的理论模型和网络体系结构,讨论了物理层技术及其相关标准以及MAC层、网络层协议设计的重点和难点,阐述了广播协议的设计思路。     

A Cross-layer Approach to Channel Assignment in Wireless Ad Hoc Networks

To improve the capacity of wireless ad hoc networks by exploiting multiple available channels, we propose a distributed channel assignment protocol that is based on a cross-layer approach. By combining channel assignment with routing protocols, the proposed channel assignment protocol is shown to require fewer channels and exhibit lower communication, computation, and storage complexity than existing channel assignment schemes. A multi-channel MAC (MC-MAC) protocol that works with the proposed channel assignment protocol is also presented. We prove the correctness of the proposed channel assignment protocol. In addition, through a performance study, we show that the proposed protocol can substantially increase throughput and reduce delay in wireless ad hoc networks, compared to the IEEE 802.11 MAC protocol and an existing multi-channel scheme.

DV Based Positioning in Ad Hoc Networks

Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute position of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding position without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Position would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.     

一种提高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协议(英文)

Existing multi-channel Medium Access Control (MAC) protocols have been demonstrated to significantly increase wireless network performance compared to single channel MAC protocols. Traditionally, the channelization structure in IEEE 802.11 based wireless networks is pre-configured, and the entire available spectrum is divided into subchannels and equal channel widths. In contrast, this paper presents a Traffic-Aware Channelization MAC (TAC-MAC) protocol for wireless ad hoc networks, where each node is equipped with a single half duplex transceiver. TAC-MAC works in a distributed, fine-grai-ned manner, which dynamically divides variable-width subchannels and allocates subchannel width based on the Orthogonal Frequency Division Multiplexing (OFDM) technique according to the traffic demands of nodes. Simulations show that the TAC-MAC can significantly improve network throughput and reduce packet delay compared with both fixed-width multi-channel MAC and single channel 802.11 protocols, which illustrates a new paradigm for high-efficient multi-channel MAC design in wireless ad hoc networks.     

一种节省能量的移动Ad Hoc网络组播选路协议

鉴于现有基于网孔的移动Ad Hoc网络组播选路协议都滑考虑如何有效使用电池能量的问题，本文提出了一种节省能量组播选路协议（E^2MRP),E^2MRP协议的两个主要特征是：（1）在创建和维护中继组（RG）的过程中交替采用分组平均能量消耗最少和最大节点花费最小两种标准，（2）采用基于图的组播结构，本文通过仿真分析大大降低了节点的能量消耗，特别是在节移动性较低，组播成员较少时更是如此。     

Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks

Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the route which requires the lowest total energy consumption. This optimization problem is referred to as Minimum-Energy Routing. While the minimum-energy unicast routing problem can be solved in polynomial time by shortest-path algorithms, it remains open whether the minimum-energy broadcast routing problem can be solved in polynomial time, despite the NP-hardness of its general graph version. Recently three greedy heuristics were proposed in [11]: MST (minimum spanning tree), SPT (shortest-path tree), and BIP (broadcasting incremental power). They have been evaluated through simulations in [11], but little is known about their analytical performances. The main contribution of this paper is a quantitative characterization of their performances in terms of approximation ratios. By exploring geometric structures of Euclidean MSTs, we have been able to prove that the approximation ratio of MST is between 6 and 12, and the approximation ratio of BIP is between 13/3 and 12. On the other hand, we show that the approximation ratio of SPT is at least n/2, where n is the number of receiving nodes. To the best of our knowledge, these are the first analytical results for the minimum-energy broadcasting problem.     

移动Ad Hoc网络的一种跨层功率控制路由协议

移动ad hoe网络中通信终端能量有限,但在许多应用场景,尤其是战场环境下,节点能量消耗较大,因此采用有效的功率控制策略非常重要.利用信道增益的对称性,在AODV协议的基础上提出了一种不依赖于地理位置信息的跨层功率控制路由协议PBAODV,仿真表明该协议在不影响其他网络性能指标的前提下,有效的降低了系统整体功耗.     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…     

基于机器学习的移动自组网MAC协议研究综述

MAC协议设计是移动自组网的一项重要关键技术,主要通过有效的多节点协商机制,实现各节点对空间、时间、频率等有限资源的合理共享,完成各节点的随机接入和资源分配功能。随机接入和资源分配问题通常可用最优化和马尔科夫决策问题表述,机器学习可成为提升移动自组网MAC协议性能的有力手段之一。该综述在分析机器学习和移动自组网MAC协议特点基础上,结合现有研究成果,介绍了基于机器学习的关键技术原理和仿真性能,展望了未来研究方向。现有研究成果表明,基于机器学习的MAC协议设计性能改善显著。