An efficient hop count routing protocol for wireless ad hoc networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

按需式ad hoc移动网络路由协议的研究进展

Ad hoc移动网络是一种完全由移动主机构成的网络，网络拓扑易变，带宽，能源有限是ad hoc移动网络的主要特点，针对这些特点，目前设计的ad hoc路由协议大多采用按需查找方式，该文介绍了这方面研究的最新进展，对几种典型的按需路由协议进行了说明，分析和综合比较，文中分析了目前协议存在的一些问题并提出了相应的改进方法，最后指出了下一步研究方向。     

Ad hoc网络中一种带预测的路由算法

在自组网中,由于网络节点的移动性及拓扑结构的易变性,设计稳定的路由成为最受关注的问题。根据可靠性为多路径路由选择更多的可靠路径,以满足自组网中多路径传输在路径的数量和质量方面的需求,是多路径路由技术中的一个重要研究课题。为此,基于GRID模型和预测模型提出了一种带预测的稳定不相交备用路由算法,其利用有效限制路由查询包的泛洪区域,并结合预测策略和节点不相交路径算法来选择一条最稳定的不相交备用路由,从而进一步提高该路由算法的性能。模拟结果显示,与其他3个多路径路由相比较,该算法是一个有效的自组网路由算法。     

Ad Hoc网络中基于负载均衡的多径路由协议研究

Ad Hoc网络中的多径路由协议可以获得源节点和目的节点之间的多条路径,能够减小路由发现延迟,提高路由稳定性,受到了人们的广泛关注。详细分析了AOMDV多径路由协议的机制和特点,从负载均衡的角度仿真评估了AOMDV协议的性能,研究表明可以显著提高网络整体生存性。在此基础上提出了一种优化的负载均衡传输方案,能够减小TCP在多径传输时的乱序问题,仿真表明显著改善了TCP传输的吞吐量。     

双向路径重选的自组网负载均衡路由协议

基于跨层负载感知和双向路径重选的自纽网负载均衡路由协议（CLBLR）在路由发现阶段和路由维护阶段，将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来，共同作为路由选择和路由调整的重要依据，通过双向路径重选方法实现最优路径选择和网络业务流的均衡分布和均衡传输．协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组，经由重负载中间节点转发，以保证路由发现时能够利用最新负载信息，并避免了节点在重负载情况下成为新建路由的中间节点，使协议具有一定的拥塞控制功能，以间接的方式实现了请求接纳控制．上述措施使分组传输路由很好地避免了拥塞节点，减少了网络瓶颈对网络性能的影响．仿真表明，CLBLR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能，其优良的分布式控制特征能适应自组网的动态环境．     

An Efcient Hop Count Routing Protocol for Wireless Ad Hoc Networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

An anonymous distributed routing protocol in mobile ad-hoc networks

This paper proposes an efficient anonymous routing protocol for mobile ad hoc networks (MANETs). This protocol considers symmetric and asymmetric links during the wireless communication of MANETs. A MANET is one type of self-organized wireless network that can be formed by several wireless devices such as laptops, tablet PCs, and smartphones. Different wireless transmission ranges of different mobile devices lead to a special communication condition called an asymmetric link. Most research on this topic focuses on providing security and anonymity for the symmetric link without considering the asymmetric link. This paper proposes a novel distributed routing protocol beyond the symmetric and asymmetric links. This protocol guarantees the security, anonymity, and high reliability of an established route by avoiding unreliable intermediate nodes. The routes generated by the proposed protocol are shorter than previous research. The proposed protocol enhances MANET performance in assuring security and anonymity.     

一种基于跨层负载感知和双向逐跳信息素更新的自组网蚂蚁算法

本文将跨层优化和蚂蚁优化方法结合起来解决自组网中的负载均衡问题,提出了一种基于跨层负载感知和双向逐跳更新信息素的蚂蚁优化路由协议（CLABHPU）.协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要依据,进行按需路由发现和维护;通过拥塞节点丢弃蚂蚁分组的方法减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚂蚁算法的路由协议中普遍存在的拥塞问题和路由开销问题.同时,协议在路由发现阶段通过中间节点对信息素表进行双向和逐跳更新,提高了算法的收敛速度和对异常情况的反应速度.通过概率选路提供到目的节点的大量冗余路由,提高了算法的可靠性和顽存性.仿真结果表明,CLABHPU在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络业务流负载均衡.     

自组网中一种基于跨层负载感知的按需负载均衡路由

本文提出了一种新的基于跨层负载感知的自组网负载均衡路由协议（CLLOR）。CLLOR在路由发现阶段和路由维护阶段将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来共同作为路由选择和路由调整的重要依据,以实现网络业务流的均衡分布和均衡传输。协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组经由重负载的中间节点转发,以保证路由发现时能够利用最新的负载信息,并避免了节点在重负载情况下成为新建路由的中间节点,使得协议具有一定的拥塞控制功能,以间接的方式实现了请求接纳控制。通过上述措施,可以很好地避免网络中出现拥塞节点,减少了网络瓶颈对网络性能的影响。仿真表明,CLLOR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好的性能,其优良的分布式控制特征能适应自组网的动态环境。     

一种快速而高效的MANET路由协议

MANET是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。由于其拓扑的动态性,其路由协议与其它传统网络有着很大的区别。传统的MANET路由协议都在路由破裂后由源节点重新建路,存在较大建路延时,极大阻碍了信息的实时传送。为此,该文提出了一种支持实时传送的路由协议,该协议通过在路由破裂处用最快方法重新建路来实现数据的实时传输。模拟结果表明这种协议具有较好的网络性能。     

高能量节点驱动的按需距离矢量路由协议

无线自组织网络中的按需距离矢量路由协议(AODV)没有考虑到能量消耗的均衡性和网络生命期的问题。针对AODV的这一缺点,提出了一种高能量节点驱动的AODV协议(HN-AODV)。此协议将高能量节点驱动的策略应用于按需路由发现过程,尽量选择能量较高的节点来承担转发任务,以此来平衡网络能耗。仿真结果显示,HN-AODV在基本不降低数据传输性能的前提下,显著提高了网络生命周期。这种高能量节点驱动的方案同样可以运用在其它类似的反应式路由协议中。     

一种基于Ad hoc网络AODV协议的不相交节点多路径路由算法

针对Ad hoc 网络低功耗无线通信的链路不确定性、链路质量不稳定性以及节点失效等问题,基于AODV路由协议提出了不相关节点路由算法。该算法使用简单的数字标志来搜寻不相关节点路径,并通过设置节点的阈值判断链路质量和失效节点来确定可靠的路由链路。仿真实验表明,该算法有很好的报文投递率,并能有效地减少网络链路中断的数量,降低端到端的延迟。     

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

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

多跳无线移动Ad Hoc网络路由协议的研究分析

无线移动Ad Hoe网络(MANET)作为可移动分布式多跳无线网络，没有预先确定的网络拓扑或网络基础设施以及集中控制．为了在如此的网络中促进通信，路由协议主要用于在节点之间发现路径．Ad Hoe网络路由协议的主要目的是网络拓扑的动态变化、任意两个节点之间建立一个使得通信总费用和带宽消费最少的正确和有效的通信路径．描述了设计移动Ad Hoe网络路由协议所面临的问题以及对它们的评价，详细比较了七种典型无线移动AdHoe网络路由协议的特性和功能，即DSDV，CGSR，WRP，AODV，DSR，TORA和ABR，为进一步的研究提出了新的课题．     

移动自组网路由局部修复算法的研究

移动自组织网(mobile ad hoc networks,MANET)的多跳的无线连接、动态拓扑和有限的带宽等特征,给其路由协议带来了很多挑战.当多跳路径失效时,路由协议需要对其进行修复.已有的修复机制需要很多的开销和很长的端到端时延.在此修复机制的基础上,提出了一种新的路由局部修复算法,将修复尽量限制在断链的局部范围内,以减少对链路断裂的反应时间和降低路由维护的开销,而且不用考虑失效链路在整个路由上的相对位置,都可以对其进行修复,提高了处理失效链路的能力,有利于提高MANET的可扩展性.仿真表明,这种新的路由局部修复算法明显地提高了网络多方面的性能.     

A cost matrix agent for shortest path routing in ad hoc networks

Wireless ad hoc networks do not rely on an existing infrastructure. They are organized as a network with nodes that act as hosts and routers to treat packets. With their frequent changes in topology, ad hoc networks do not rely on the same routing methods as for pre-established wired networks; they require routing methods for mobile wireless networks. To select a path from a source to a destination in dynamic ad hoc networks, an efficient and reliable routing method is very important. In this paper, we introduce a cost-matrix-based routing algorithm. An agent node creates topology information in the form of the adjacency-cost matrix which shows link costs of the network.Based on the adjacency-cost matrix, the minimum-cost matrix and the next-node matrices can be calculated. Based on the minimum-cost matrix and the next-node matrices, the minimum cost between source and destination nodes and between intermediate nodes on the minimum-cost paths can be calculated.The matrices are periodically distributed by the agent to the other nodes. Based on the minimum-cost matrix and the next-node matrices, each node decides the minimum-cost path to its destination. Because none of the nodes except the agent needs to gather network topology information, the control overhead of the proposed method is small compared with those of the general table-driven routing protocols.     

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

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

Reliable Routing in Wireless Ad Hoc Networks: The Virtual Routing Protocol

A novel routing protocol for wireless, mobile ad hoc networks is presented. This protocol incorporates features that enhance routing reliability, defined as the ability to provide almost 100% packet delivery rate. The protocol is based on a virtual structure, unrelated to the physical network topology, where mobile nodes are connected by virtual links and are responsible for keeping physical routes to their neighbors in the virtual structure. Routes between pairs of mobiles are set up by using information to translate virtual paths discovered in the virtual structure. Route discovery and maintenance phases of the protocol are based on unicast messages travelling across virtual paths, with sporadic use of flooding protocol. Most flooding is executed in the background using low priority messages. The routing protocol has been evaluated and compared with the Dynamic Source Routing protocol and with the Zone Routing Protocol by means of simulation.

移动Ad hoc网络路由协议安全研究

移动ad hoc网络是一种完全由移动主机构成的网络,其主要特点为网络拓扑易变,带宽、能源有限。这些特点使得适应于固定网络的安全策略在移动ad hoc网络上不能很好地发挥作用,需要设计一些针对其特点的解决方案.该文介绍了针对移动ad hoc网络路由协议安全方面的最新研究进展,首先介绍了移动ad hoc网络的安全弱点和攻击类型,其后时一些典型方案进行了说明,分析了各种方案的优点和缺点,并进行了综合比较。文中分析了目前协议存在的一些问题并提出了相应的改进方法,最后指出了下一步研究方向。     

Adaptive TCP congestion control and routing schemes using cross-layer information for mobile ad hoc networks

Compared with traditional networks, ad hoc networks possess many unique characteristics. For example, ad hoc networks can drop a packet due to network events other than buffer overflow. Unfortunately, the current layered network architecture makes it impossible to pass the information specific to one layer to other layers. As a result, if a packet is lost due to reasons other than buffer overflow, TCP adversely invokes its congestion control procedure. Similarly, the routing algorithm may misinterpret that a path is broken and adversely invoke the route recovery procedure.This study addresses the limitations of the current layered network architecture by adopting a cross-layer protocol design for TCP and routing algorithms in ad hoc networks. The objective of this approach is to enable the lower-layered ad hoc network to detect and differentiate all possible network events, including disconnections, channel errors, buffer overflow, and link-layer contention, that may cause packet loss. Using the information exploited by lower layers, the upper layer-3 routing algorithm, and the layer-4 TCP can take various actions according to the types of network events. Simulation results demonstrate that the combination of the cross-layer optimized TCP and routing algorithms can effectively improve the performance of TCP and DSR, regardless of whether it is in a stationary or a mobile ad hoc network.