无线Ad Hoc网络中一种基于DSR的QoS路由协议

QoS是无线Ad Hoc网络中的一个重要问题,而QoS路由技术是解决这一问题的关键技术之一.假定无线AdHoc网络中的每个节点的MAC子层能够提供一个参量,这个参量可以量化地表示该节点的忙闲状态,在这个假设的基础上,本文提出一种以DSR路由协议为基础的改进路由,在新的路由协议中,路由请求包中增加一个参量,用这个参量来表示路由请求包所经过的所有节点的状态总和,当路由请求包到达目的节点就找到了源节点到目的节点的路径,并且可以得到每条路径的状况.通过这些信息可以使得发现的路径是状况最好的路径,从而来满足QoS.     

多跳蜂窝网互连性研究

将Ad Hoc网络与蜂窝网融合首要解决的问题是Ad Hoc如何接入蜂窝网,多数方案使用的是移动IP。提出了一种基于扩展Ad Hoc路由协议的多跳转发网络方案。Ad Hoc多种路由协议中可以实现Ad Hoc网络与蜂窝网互连的只有DSDV,但在移动场景中的低性能限制了它的发展。AODV是Ad Hoc路由协议中最有前途的协议,但它并不支持Ad Hoc节点接入基站的路由搜索。研究对AODV协议进行改进,以使它能支持移动节点到固定基站以及有线网络的寻路。     

基于拥塞程度和能量状态的DSR路由协议的改进

无线Ad Hoc网络是由一些无线主机所组成的具有多跳、临时性等特征的网络,这些无线主机还带有无线收发装置;每个无线终端具有路由器和主机两种功能.网络中所有的节点地位平等.无线Ad Hoc网络组网的无基础设施性和自组织性,使它在特定的救灾抢险、军事指挥作战、野外科学考察等特殊场合下得到了广泛的应用.DSR路由协议具有使用源路由机制和路由缓存技术,并且支持中间节点路由回复应答,减少了路由开销等优点.文中主要解决了DSR路由协议节点拥塞、负载不均以及在选择路径时没有考虑节点的能量等问题,经仿真分析比原DSR路由协议在节点的拥塞状态和能量状态方面得到较大的改善.     

一种改进的多路径DSR协议

目前Ad Hoc网络正成为网络发展的热点.文中比较了单路径路由和多路径路由算法,提出多路径路由算法可给Ad Hoc网络的发展带来极大的好处,并在丈后对其性能进行了仿真.然后介绍了DSR协议,重点提出了对该协议的改进,使得在源节点和目的节点之间建立了多条不相关路径,并对改进后协议的开销做了仿真,与DSR协议加以比较.     

基于二进前向神经网络的Ad Hoc网络节点识别方法

提出了一种基于二进前向神经网络的无线移动Ad Hoc网络节点识别方法。安全问题是无线移动Ad Hoc网络的一个关键性问题，路由协议的安全尤为重要，本文针对恶意节点的主动攻击提出了一种基于二进前向神经网络的无线移动Ad Hoc网络节点识别方法，该方法可以有效的避免恶意节点接入网络，从而提高了网络路由的安全性。     

基于不同移动节点数目的Ad Hoc路由协议性能比较

文章主要介绍了基于仿真软件NS的Ad Hoc网络路由协议的仿真和比较.首先对现有Ad Hoc网络的相关路由协议进行分类说明,并主要对DSDV和AODV路协议进行介绍和分析;接着对仿真工具NS进行了介绍;最后设计了两个不同移动节点数目的运动场景对两种Ad Hoc路由协议进行仿真和比较.通过对仿真过程中产生的数据包延迟和丢包率进行分析,给出了结论.     

基于优先级的多路径AODV路由协议的实现

Ad Hoc网络是一个多跳临时性无中心的网络,它不需要现有的基础设施,并且节点在通信时可以随意移动。由于其网络拓扑经常发生变化,稳定的路由协议在Ad Hoc网络中就显得尤为重要。本文提出了基于AODV的改进路由协议M-AODV。M-AODV可以保存多个前往目的节点的不相交路径,并且根据路由的优先级进行路径选择。通过仿真试验可以看出,M-AODV比AODV协议在路由负载、丢包率等性能上有较好的效果。     

Ad Hoc网络中一种基于灰色关联算法的路由协议

针对移动Ad Hoc网络中节点任意移动、网络拓扑频繁变化导致以最小跳数作为路由选择机制的AODV路由协议面临频繁连接中断而造成网络QoS下降的问题,文章综合节点的剩余电量、剩余队列长度和源节点到目的节点的跳数三个跨层信息,提出一种基于灰色关联算法的改进AODV路由协议(GRA-AODV)。仿真结果显示:相比于改进前的AODV协议,改进之后的GRA-AODV(Gray Relevance AlgorithmAODV)协议在稍微增加路由开销的情况下,具有更低的平均端到端时延和更低的分组丢失率,在拓扑频繁变化的移动Ad Hoc网络中具有较好的鲁棒性。     

一种适用于非对称链路的Ad Hoc网络路由协议

提出了一种适用于非对称链路的Ad Hoc网络路由协议。该协议是一种基于路由池的反应式路由协议，当源节点与目标节点有数据交换时，通过路由发现过程分别在源节点和目标节点构建数据路由池和应答路由池，数据的发送和应答路径随机地从相应路由池中选取，并在数据的交换的过程中动态地更新和维护路由池。仿真结果表明该协议适用于普遍存在非对称链路的无线移动Ad Hoc网络。     

移动Ad Hoc网络安全按需路由协议

Ad Hoc网络的安全性问题越来越引起人们的关注,如何确保Ad Hoc网络路由协议的安全成为Ad Hoc研究的一项关键技术。提出一种适用于移动Ad Hoc网络的安全按需源路由协议,利用移动节点之间的会话密钥和基于散列函数的消息鉴别码HMAC一起来验证路由发现和路由应答的有效性。提出的邻居节点维护机制通过把MAC地址和每个节点的ID绑定来防御各种复杂的攻击如虫洞攻击。NS-2仿真表明该协议能有效地探测和阻止针对Ad Hoc网络的大部分攻击。     

On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.     

AO2P: ad hoc on-demand position-based private routing protocol

Privacy is needed in ad hoc networks. An ad hoc on-demand position-based private routing algorithm, called AO2P, is proposed for communication anonymity. Only the position of the destination is exposed in the network for route discovery. To discover routes with the limited routing information, a receiver contention scheme is designed for determining the next hop. Pseudo identifiers are used for data packet delivery after a route is established. Real identities (IDs) for the source nodes, the destination nodes, and the forwarding nodes in the end-to-end connections are kept private. Anonymity for a destination relies on the difficulty of matching a geographic position to a real node ID. This can be enforced by the use of secure position service systems. Node mobility enhances destination anonymity by making the match of a node ID with a position momentary. To further improve destination privacy, R-AO2P is proposed. In this protocol, the position of a reference point, instead of the position of the destination, is used for route discovery. Analytical models are developed for evaluating the delay in route discovery and the probability of route discovery failure. A simulator based on ns-2 is developed for evaluating network throughput. Analysis and simulation results show that, while AO2P preserves communication privacy in ad hoc networks, its routing performance is comparable with other position-based routing algorithms.     

FPN‐SAODV: using fuzzy petri nets for securing AODV routing protocol in mobile Ad hoc network

In this paper, we use fuzzy Petri nets (FPNs) to propose a secure routing protocol in mobile ad hoc network. The proposed method is based on secure ad hoc on‐demand distance vector (SAODV), which is named FPN‐SAODV. In FPN‐SAODV routing protocol, for each packet delivery or firing each transition, a type of bidirectional node‐to‐node fuzzy security verification is conducted that can be carried out with five security threshold levels. This inference uses four fuzzy variables that have been selected to well represent the malicious behaviors of some public attacks in mobile ad hoc network. Furthermore, a through route security verification has been used for selecting the most secure route among each candidate path through source node to destination. Both of these verifications utilize FPN inherent features for their operation. For evaluation purpose, we used the metrics such as packet delivery ratio, end‐to‐end delay, average security level of the nodes, and percentage of true/false detector nodes. These metrics have been used for investigating the inner operation of FPN‐SAODV as determining the proper level of security threshold level in node‐to‐node security verification module. Also, these are used for comparison of FPN‐SAODV performance versus the original AODV. Copyright © 2015 John Wiley & Sons, Ltd.     

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.     

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.     

A peer-to-peer zone-based two-level link state routing for mobilead hoc networks

A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This “peer-to-peer” manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment     

Ad hoc网络中基于数据流的QoS路由协议

已有ad hoc网络中的QoS路由都是基于目的地址的选路并预留资源,当源节点针对同一个目的节点先后建立两个或者多个实时业务流的时候,将导致几个数据流争用资源,使得几个流的QoS都无法得到保证。针对这个问题,文章提出了基于流的QoS路由机制,并且进行了仿真分析,仿真结果表明这种机制能够解决这个问题,使QoS得到保证。     

Probabilistic analysis of routes on mobile ad hoc networks

The ad hoc network is comprised of mobile nodes without wires or any infrastructures. All data are transmitted from source node to destination node through wireless channels. The ad hoc network is self-organized by ad hoc network routing protocols. Due to the mobility of nodes, the route which is constructed from many proposed ad hoc network routing protocols and comprised of several direct node-to-node links exists only for a certain period. That also means the route is subject to frequent breakages. In this letter, the probabilistic behavior of a constructed route is investigated through simulation and curve fitting. The simulation results show that the probability density function of a route is exponential distribution. The simulation also shows how the time proportion is distributed among different route lengths under a certain scenario. The route is a basic factor in the ad hoc network which operates without any central controller. The characteristics of the route have much influence on the performance of the ad hoc network. Thus the probabilistic analysis provides important implications when we are designing ad hoc network routing protocols and deploying ad hoc networks.     

Secure way routing protocol for mobile ad hoc network

Mobile adhoc network is dynamic in nature and it operates completely in an infrastructure-less environment. It discovers the way routes dynamically to reach the destination. Securing a dynamic way route, which is not known before establishing communication, is always a challenge in the mobile ad hoc network. Most of the existing secure routing protocols target to evade specific type of attacks or malicious behaviour of the nodes or networks. We propose a novel secure way routing protocol for securing the dynamic way routes in MANET. It provides a unique session key for each route to secure the data communication. Moreover, it authenticates the data packets using asymmetric cryptography and secures the routing field message using two-way asymmetric cryptography. The proposal is implemented and tested for assessing the protocol’s performance. We have also compared the protocol with the other secure routing protocols for evaluating its performance.