基于多树的移动自组织网多播路由协议

由于移动节点能量耗尽严重影响了移动自组织网(MANET)路由性能,有效地使用移动节点的能量是非常重要的。为此,提出基于多树的移动自组织网多播路由协议(MTMR)。MTMR协议先计算移动节点能量,将能量低于门限值的节点不参与路由。然后,将参与路由的节点构建不同的树,源节点通过这些树向目的节点传输数据,从而实现多播路由。仿真结果表明,提出的MTMR协议有效地提高了数据传输率,降低了端到端传输时延。     

基于分簇结构的无线移动网络多播路由协议

移动自组网（MANET,Mobile Ad hoc Networks）是一种特殊的、应用前景广阔的新型移动无线网络。特有的网络特性使它在诸如灾难救助、战场、传感器网络、分布式计算等领域有着广泛的应用前景。结合在移动自组网络中应用最为广泛的分层结构——簇结构的特点,提出了一种基于簇结构的移动自组网多播波路由协议。协议通过对移动自组网进行簇划分,形成由簇头、簇间节点和簇内节点构成的分簇网络结构,并且在由簇头和簇间节点形成的虚拟骨干网基础上,对其进行回路检测和冗余剪枝算法处理,最终得到一个能满足多播要求的多播树,从而实现在移动自组网中的多播路由。通过对仿真实验结果的分析,该协议具有稳定的数据包发送率和较低的路由建立时间。     

MANET中基于遗传算法的QoS多播路由协议

随着多媒体业务的普及,如何为MANET多播路由提供QoS保障成为研究热点。提出了一种带宽和时延受限的QoS多播路由协议,它利用遗传算法搜索满足QoS要求的最优多播树。仿真结果表明该协议收敛速度快,寻径成功率高,它为移动网络中具有QoS保障的多播通信提供了一种有效途径。     

基于跨层设计的MANET能量约束路由方案

低功耗设计是MANET（Mobile Ad Hoc Network）研究中面临的一个挑战性问题。根据跨层设计思想,提出了一种基于能量约束的MANET路由算法。利用MAC层反馈信息,以分组交付所需的发送次数作为选路标准,提高分组发送的成功率,减少竞争和重传造成的功耗,从而优化网络性能。并具体结合AODV路由协议,通过仿真分析对该方案的可行性进行了评估。     

移动自组网QoS组播路由协议的研究

针对已有的移动自组网中QoS路由协议进行了分析比较,提出了一种基于逻辑超立方体的虚拟动态骨干网模型以支持QoS组播通信。该模型具有高可用性和负载均衡的特性，而这两种特性是在移动自组网中提供QoS保证的重要前提。基于该模型又设计了一种新颖的基于逻辑位置信息的QoS组播路由算法：自路由，模拟结果显示该算法性能良好，具有延迟小、抖动小、容错性强的特点。     

MANET路由中的链路测量及QoS协议实现

MANET的节点资源受限等特点给QoS路由设计提出了诸多挑战。在研究无线网络流量特性的基础上,提出了基于自相似特性的链路测量及QoS路由协议（Link Prediction based on self-similarity and QoS Routing Protocol,LPQRP）。LPQRP协议使用小波分析方法估计自相似特性唯一参数Hurst值,并利用Hurst值对网络性能进行估计,以测量结果作为QoS路由约束条件,以此方式优化了路由选择,提高了测量精度,有效提高了路由QoS保证。给出了LPQRP协议的设计过程,提出抖动因子等机制进一步完善了LPQRP协议。仿真结果显示,LPQRP协议能很好地适应MANET特性,有效优化数据传输路径,均衡网络资源,提高了网络的健壮性,减少了资源损耗。     

A scalability comparison of GST and SST MANET multicast routing algorithms

Since network resource of mobile ad hoc network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MANET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted.     

A dynamic multicast tree based routing scheme without replication in delay tolerant networks

Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that supports the distribution of data to a group of users: a service needed for many potential DTN applications. While multicasting in the Internet and in mobile ad hoc networks has been studied extensively, efficient multicasting in DTNs is a considerably different and challenging problem due to the probabilistic nature of contact among nodes. This paper aims to provide a non-replication multicasting scheme in DTNs while keeping the number of forwardings low. The address of each destination is not replicated, but is assigned to a particular node based on its contact rate level and active level. Our scheme is based on a dynamic multicast tree where each leaf node corresponds to a destination. Each tree branch is generated at a contact based on the compare–split rule proposed in this paper. The compare part determines when a new search branch is needed, and the split part decides how the destination set should be partitioned. When only one destination is left in the destination set, we use either wait (no further relay) or focus (with further relay) to reach the final destination. The effectiveness of our approach is verified through extensive simulations. Ratio-based-split performs best in the compare–split step, both in synthetic and real traces. Using the wait scheme can reduce the number of forwardings, while using the focus scheme can reduce the latency.     

Applying link stability estimation mechanism to multicast routing in MANETs

Mobile ad hoc networks are self-organizing network architectures of mobile nodes. Node mobility causes network topologies to change dynamically over time, which complicated important tasks such as routing. In this paper, a novel link stability estimation model based on received signal strength indication is proposed. We have integrated this model into MAODV and present a stability-based multicast routing protocol termed as SMR. SMR can discover more available stable routes and better adapt to network topology changes. Simulation results show the superiority of SMR over the existing methods in terms of packet delivery ratio, average end-to-end delay and routing packet overhead.     

基于量子遗传算法的QoS多播路由算法

QoS多播路由算法的核心问题就是建立满足QoS约束的多播树,它是计算机网络中著名的受约束最小Steiner树问题,是一个NP完全问题。量子遗传算法是基于量子计算理论的新型遗传算法,基于量子遗传算法的基本原理,提出了QoS约束的多播路由算法（QoSMR-QGA）,并详细介绍了QoSMR-QGA算法的实现过程。仿真实验表明,该算法具有较好的算法收敛性和多播路由成功率。     

基于牛顿插值的MANET能量有效路由机制

移动Ad Hoc网络中的一个主要问题是节点的能量有限。因此，许多研究侧重于减少能量消耗。提出一种基于牛顿插值的能量有效路由机制，首先根据节点的剩余电池能量和流经该节点的当前流量大小，计算出该节点的寿命；从寿命较长的节点中，选择当前状态下的最小功率路由。这样不仅保证了各节点的能量均衡问题，而且考虑到整个网络的最小功率路由。实验模拟结果显示，与以前算法相比，其具有更好的性能。     

MANET中一种基于信任模型的安全路由协议

节点间的信任关系对MANET网络路由协议的可靠性和安全性有重要意义,由于MANET网络的特性,难以通过传统的方式建立节点间信任关系。提出一个适用于MANET的信任评估模型CETM（Contribution and Evaluation Trust Model）,用来度量MANET节点间信任关系,并将此模型应用于AODV协议中,提出了一种新的安全路由协议TAODV。仿真结果表明当网络中存在少于一半的恶意节点时,CETM能有效抵御如诋毁等恶意行为,从而显著地提高了交易的成功率。基于CETM的TAODV建立在可靠的节点信任关系之上,具有较好的安全性。     

动态延时的无线多播路由协议

在分析基于共享树的Ad Hoc网络多播路由协议MAODV的基础上,结合能量模型,提出了一种Ad Hoc网络基于动态延时的多播路由协议ECBMR。算法分析和仿真结果显示,在不增加算法复杂性的前提下,ECBMR明显地改善了MAODV协议的延时特性,节点的能量消耗比较均衡,一方面降低了系统的能耗,另一方面有效地延长了网络的存活时间,比较好地解决了Ad Hoc网络能量和延时相互矛盾的问题。     

Uncertainty analysis framework for trust based routing in MANET

MANET (Mobile Ad hoc Network) has distinctive characteristics like node mobility, broadcast nature of wireless communication, and peer to peer data transfer. Due to these characteristics uncertainty is an integral part of MANET behavior. Uncertainty quantification is important for performance evaluation and better decision making in MANET. Packet dropping is a serious issue in MANET which degrades the performance of the network to a great extent. The packet dropping attack increases uncertainty in the network communication and eventually of the MANET. Trust based routing mechanisms are useful for neutralizing packet dropping attack. There are many existing trust based routing protocols which uses uncertainty for precise trust calculations. Thus, trust and uncertainty are closely related to each other. The paper proposes Uncertainty Analysis Framework (UAF) for MANET, it calculates the network Belief, Disbelief, and Uncertainty (BDU) values. The UAF framework integrated into different trust variants of AODV protocol which use direct trust, indirect trust, and global trust. The research work discovers impact of different trust models on MANET BDU using various mobility models. Experimental analysis shows that, trust based routing protocols show average 3 % gain in packet delivery ratio and at least 5 % increase in the network belief.     

基于J-Sim的MANET路由协议仿真实现

MANET路由协议一直是国内外学者的研究热点,但仿真验证却影响了科研工作者研究的进度。引入一种新的网络仿真平台J-Sim。在J-Sim下,对MANET中具有代表性的两种路由协议（AODV、GPSR）进行性能仿真,实验结果表明J-Sim可以真实的仿真MANET的运行,获取有价值的仿真结果。     

A hardware supported multicast scheme based on XY routing for 2-D mesh InfiniBand networks

The multicast operation is a useful operation in parallel applications. It is therefore important to ensure that for a given architecture, the parallel application runs efficiently. With the hardware-supported multicast of the InfiniBand Architecture (IBA), we propose a multicast scheme for m×n mesh InfiniBand networks based on XY routing. The basic concept of the proposed multicast scheme is to find the union sets of the output ports of switches, which are in the paths between the source node and each destination node in a multicast group. Furthermore, in the proposed scheme, we consider the usage of virtual lanes and evaluate their performance. We implement the proposed multicast scheme on a 2-D mesh InfiniBand network simulator. Several multicast configurations consisting of different message size, different traffic workload and different number of virtual lanes are simulated. The simulation results show that the proposed multicast scheme outperforms its corresponding unicast scheme for all simulation cases. The larger the message size, the larger the number of multicast source nodes, and the larger the size of the multicast group, the better the speedup that can be expected from the proposed multicast scheme. The usage of virtual lanes is also shown to improve the speed of the multicast operations.     

一种分区MANET路由协议

MANET是一种无基础设施支持的动态、自组织、多跳无线移动网络,为之设计适当的路由协议是一大挑战。该文在分析MANET特性及应用需求的基础上,提出了一种的分区MANET路由协议,该协议基于到最小ID节点的距离形成分区并维护简化的全局网络拓扑,通过巧妙地利用节点的邻接点信息使得路由请求的时间和通讯复杂度均降为O（2R）。仿真结果表明,该协议具有路由请求时延低,控制开销少的特点。     

QoS多播路由算法研究

随着当前Intemet的发展和各种多媒体应用的出现,多播技术得到大量应用。多播路由算法主要用来建立一棵性能良好的多播树,并使它能够满足各种业务的服务质量需求。将多种群并行技术和退火技术相结合,克服了基于标准遗传算法的多播路由算法过早收敛和后期搜索速度较慢的缺陷,且使用树状编码方法,提出求解带宽、时延、时延抖动和分组丢失率约束的代价最小多播树的多种群并行退火遗传多播路由算法。对QoS多播路由选择问题进行了描述,给出多种群并行退火多播路由遗传算法和一种有效去除冗余信息的遗传算法编码设计技术,通过仿真实验证明了算法的正确性,分析了算法的时间性能,表明该算法快速有效。