基于能量消耗的Ad Hoc网络路由协议的研究

在移动自组网Ad Hoc网络中,链路中的节点一般都是采用电池供电,一旦电池电量耗尽,节点就会离开链路,造成网络中断,因此降低节点的能量消耗对保持链路的稳定至关重要,本文给出了基于最大能量邻居节点的路由发现算法,提出了基于AODV协议改进的Ad Hoc网络路由协议PER-AODV,该协议能够确保延长网络的生存时间和对低能量节点的保护以及重构次数的减少。     

MANET节点移动模型仿真研究

移动自组网（MANET）节点移动特性对网络拓扑结构有重要影响,在合理的节点移动模型下对网络性能的评估才真实可靠。通过对网络仿真软件NS2进行拓展,实现个体、群体和具有地域限制的节点移动模型,提出物理链路和路由协议2个层面的评估准则,给出不同类节点模型对路由协议性能的影响程度。对研究和评估MANET的路由协议有重要的参考价值。     

面向能量和链路优化的水声移动传感器网络路由协议设计

针对水声移动传感器网络中存在水声通信环境恶劣、通信环境复杂多变以及节点能量受限造成的水声移 动传感器网络能量不均和路由链路断裂问题, 提出一种基于能量与链路度量路由的改进按需平面距离向量路由 (AODV)协议. 引入了以能量阈值为基准描述网络节点能量状态的能量指标以及以邻居节点间距离为基准描述链路 状态的链路指标, 并以综合考虑网络路由链路中节点的能量指标、路由链路指标以及路由链路跳数的路由度量作 为协议选择路径的优先条件, 并以此进行路由修复. 仿真实验表明, 本文所设计的改进AODV协议可提升网络整体 数据量、均衡网络节点能量、延长网络的生存周期.     

基于蚁群算法的Ad hoc多径路由协议

针对无线移动自组织网中网络拓扑结构变化迅速,节点间移动速率快的特点,提出一种采用备份路径修复断裂链路的基于蚁群算法的无线移动自组织网路由协议-antPro协议.和传统的路由协议相比,对同一目的节点,新路由协议在源节点建立多条路由,在路由的中间节点缓存有备份路径.协议具有较好的鲁棒性,在链路断裂时采用备份路径及时恢复数据分组的传送,能很好地适应Ad hoc网络环境.     

基于链路稳定性的MANET组播路由协议

移动自组织网络环境中,选择稳定路由可以提高数据传输率并能有效降低控制信息减少网络拥塞。根据无线自组网的特点,提出了一种新颖的基于信号强度评价链路稳定性的方法,并且基于此方法构建组播路由协议。协议中节点能够根据信号强度预估链路稳定性,选择稳定路由,及时发现修复即将断开的链路。仿真结果表明,协议可以明显提高数据传输率,并且控制开销较低。     

基于本地信任系统的可靠动态源路由协议

移动Ad hoc 网自组织、移动性等特性为组网带来便利的同时也增加了路由管理的难度.针对现有可靠路由算法解决问题具有局限性以及获取链路评价信息低效等问题,在DSR(dynamic source routing)协议基础上提出了基于本地信任系统的可靠路由协议(reliable routing protocol based on local trust system,简称TR-DSR).TR-DSR 协议选择路由时,综合考虑路由上各节点和各链路的可靠信任度,并在路由建立过程中利用这些信息,在确保找到可靠路由的基础上降低寻路开销.同时,为了防止自私节点对信任系统评价正确性的影响,提出了基于GTFT(generous tit fortat)策略的激励节点推荐响应行为的DFR(decide forwarding recommendation)算法.仿真实验结果表明,在节点频繁移动和存在大量自私节点的网络中,该协议的性能优势明显,验证了TR-DSR 协议的可靠性.     

一种基于混合运动参数的移动自组织网AODV协议

在移动自组织网中由于节点的移动性引起网络拓扑变化，成为影响网络性能优劣的关键因素。在反应式路由算法的基础上，提出了一种基于节点位置、速度与方向混合参数的路由协议AODV-PVD(AODV Routing Protocol based on Node Position, Velocity and Direction)以衡量链路稳定性并预测链路持续时间。在路由发现阶段，根据节点的混合运动信息，使用节点筛选机制排除相对不稳定的链路，并通过节点相对移动速度预测链路持续时间，为数据传输选取稳定且路径较短的路由。NS2仿真结果显示，相较于按需距离矢量路由AODV(Ad Hoc On-demand Distance Vector)及现有改进协议，AODV-PVD路由协议可以获得更好的分组投递率、端到端传输时延和吞吐量性能。     

移动自组织网络基于极端预测的节能路由算法

在移动自组织网络中,减少移动节点电池能量消耗,延长网络生存时间,是路由协议性能优劣的一个重要指标.针对这一问题,提出了一种基于极端预测的路由算法,根据门限值划分节点稳定域,计算链路有效性,以最大最小路径有效性原则选路.同时,节点根据下一跳节点的位置自动调整发射功率,以达到节能的目的.仿真结果表明该算法与DSR相比能有效...     

IGR:面向车载网的基于地理信息的数据传输协议

由于车辆的高速移动和拓扑的动态变化,基于地理信息的数据传输协议被广泛应用于车载网.然而,现存的多数协议在路由决定时并没有考虑链路的质量,导致数据包丢失率升高,增加了传输时延.为此,提出了新的基于地理信息的数据包传输协议(IGR).IGR协议在路由决策时充分考虑车辆的移动方向、位置和链路质量3项信息.其中,利用beacon接收率体现链路质量.将这3项信息融合成节点权值.源节点择优选择权值高的节点作为下一跳转发节点.与同类协议相比,提出的IGR协议具有低的传输时延和高的传输率.     

移动Ad Hoc网络中基于分簇结构的多播路由协议

随着移动计算设备的普及和面向组计算的需求上升,移动Ad Hoc网络的多播路由问题成为研究热点.但网络中节点可任意移动、加入或离开多播组,使得多播组的管理以及链路的维护变得十分困难,对此提出了一种基于分簇结构的多播路由协议.该协议首先根据节点ID号和标识对网络进行分簇,然后按需建立多播树,在维护过程中控制报文只在与多播分支相关的局部簇内进行转发.仿真实验表明,该协议能保持较高的分组递交率以及稳定的控制报文开销,为大规模网络中的多播通信提供了一种有效的途径.     

Research on multicast routing protocols for mobile ad-hoc networks

A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to extend mobility into the realm of autonomous, mobile and wireless domains, where a set of nodes form the network routing infrastructure in an ad-hoc fashion. The majority of applications of MANETs are in areas where rapid deployment and dynamic reconfiguration are necessary and wired network is not available. These include military battlefields, emergency search, rescue sites, classrooms and conventions, where participants share information dynamically using their mobile devices. These applications lend themselves well to multicast operations. In addition, within a wireless medium, it is crucial to reduce the transmission overhead and power consumption. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Hence, reliable multicast routing plays a significant role in MANETs. However, to offer effective and reliable multicast routing is difficult and challenging. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and employ different recovery mechanisms. To provide a comprehensive understanding of these multicast routing protocols and better organize existing ideas and work to facilitate multicast routing design for MANETs, we present the taxonomy of the multicast routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate multicast routing protocols for their work.     

移动自主网络多路径路由技术研究进展

MANET具有许多与传统有线网络截然不同的特性，包括移动性、有限的带宽资源、易变的网络拓扑等，因而就需要一种新的路由协议来解决这些缺点。大多数已提出的MANET路由协议没有考虑公平性，它们倾向于把重的负载分布到源一目的对的路径最短的主机上。结果，超重负载的主机会迅速耗尽能源，这将导致网络分离，应用会话失败。为解决
决这个问题，众多专家学者提出用多路径的方法来承担路由任务。本文回顾了MANET多路径路由技术的研究进展，并对有关路由协议进行了评述，比较了各自的贡献和不足；最后对路由协议研究的发展方向进行了展望。     

Cryptographic Versus Trust-based Methods for MANET Routing Security

Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In the process, however, these protocols created new avenues for denial of service (DoS). Consequently, the trade-off between security strength and DoS vulnerability has emerged as an area requiring further investigation. It is believed that different trust methods can be used to develop protocols at various levels in this trade-off. To gain a handle on this exchange, real world testing that evaluates the cost of existing proposals is necessary. Without this, future protocol design is mere speculation. In this paper, we give the first comparison of SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively. We provide performance comparisons on actual resource-limited hardware. Finally, we discuss design decisions for future routing protocols.     

Triangle-based routing for mobile ad hoc networks

Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.     

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).     

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.     

Improving discovery phase of reactive ad hoc routing protocols using Jaccard distance

Recently, more and more research focus has been directed towards optimum designs for Mobile Ad Hoc Networks (MANETs). In this paper, the authors explore novel broadcasting schemes to improve the discovery phase of reactive routing protocols in MANETs. The objective is to reduce the redundancy of routing packets during the discovery phase of the reactive routing protocols for MANETs. For this purpose, the Jaccard distance is used to select dissimilar nodes during the discovery phase in order to reduce redundancy. Furthermore, it is shown that the Jaccard distance is correlated to the Euclidean distance. The simulation results obtained indicate that the Jaccard distance is a suitable metric for improving the discovery phase of the reactive routing protocols in MANETs.     

基于博弈的MANETs信任模型研究

移动Ad-Hoc网络(MANET)是由一组带有无线收发装置的移动节点组成的无须固定设置支持的临时性的通信网络.MANETs具有开放的媒质、动态的拓扑结构、分布式的合作和受限的网络能力等基本特点.在MANETs中,节点之间相互信赖路由和转发数据包,节点间的合作是非常重要的.但是由于自私节点为了储存能量和其他资源,而不参与转发数据.由于MANETs通信没有第3方的中心认证,所以集中于强制合作是不适应的.基于博弈研究MANETs中的节点行为,根据节点的信誉度来获得资源,刺激节点共享资源和转发数据.提出了基于博弈理论的信任模型,鼓励包转发,约束自私节点.仿真结果表明该信任模型能够识别自私节点并且能在信任节点之间建立信任,提高了整个网络效率.     

AHBP: An efficient broadcast protocol for mobile Ad hoc networks

Broadcast is an important operation in many netowkr protocols.It is utilized to discover routes to unknown nodes in mobile ad hoc networks(MANETs) and is the key factor in scaling on -demand routing protocols to large networks.This paper presents the Ad Hoc Broadcast Protocol(AHBP)and its performance is discussed.In the protocol,messages,are only rebroadcast by broadcast relay gateways that constitute a connected dominating set of the network.AHBP can efficiently reduce the redundant messages which make flookding-like protocols perform badly in large dense networks.Simulations are conducted to determine the performance characteristics of the protocol.The simulation results have shown excellent reduction of broadcast redundancy with AHBP.It also contributes to a reduced level of broadcast collision and congestion.     

Influence of mobility models on the performance of data dissemination and routing in wireless mobile ad hoc networks

Many routing protocols are proposed in the literature on mobile ad hoc networks (MANETs). Some of those protocols which have been investigated under different assumptions are unable to capture the actual characteristics of MANETs. Therefore, there is a necessity to investigate the performance of MANETs under a number of different protocols with various mobility models. This paper evaluates the performance of the single path routing protocols (AODV, DSR, and DSDV), in the presence of different network loads and differing mobility models. Our findings show that DSR routing protocol has a better performance compared to other protocols with respect to various metrics.