Ad Hoc网路由协议在常规靶场中的应用及仿真

在试验通信系统IP化改造的要求下,建设基于多跳路由协议的无线移动自组织(Ad Hoc)试验通信网是必然的选择。传统的试验通信系统多采用集中控制的点对多点星状网,而移动自组网属于网状网,采用完全不同的组网方式,其对特定试验保障通信业务的承载能力,以及路由协议的适应性目前尚没有试验数据可供参考。对自组网路由协议在试验通信中的应用进行研究,根据想定试验场景对网络性能进行仿真分析,分别仿真了4种路由协议的数据包成功递交率、平均吞吐量以及平均时延等网络性能。仿真结果表明,4种路由协议中有3种协议综合性能完全可以满足试验通信保障任务。     

移动Ad Hoc网络路由协议分析

文章首先简单介绍了无线自组网(Ad Hoc网络),然后分析了Ad Hoc网络与现存的一些通信系统在路由选择上的主要区别,介绍了Ad Hoc网络路由协议的分类以及几类典型的Ad Hoc网络路由协议,最后提出了Ad Hoc网络路由协议今后的主要研究方向.     

针对军用自组网环境下的路由协议（MMAR）设计

Ad Hoc网络目前的主要应用领域仍然是军事方面.文中针对战场环境中装甲部队这一特殊移动自组网的运动特性及移动终端配置等特点,参考目前较为完善的AODV、DSR路由协议,提出了适用于装甲车自组网的路由协议MMAR(military mobile ad hoc network routing protocol),通过OPNET仿真表明:相对于军用移动环境,该协议比AODV、DSR能更有效地减少路由负载,并能显著提高端到端时延、相对路由开销和平均投递率等性能.     

Ad Hoc网络路由协议综述

文章分析了Ad Hoc网络的特征以及路由设计协议所面临的问题与挑战,综述了Ad Hoc网络的传统路由协议,针对理想自组网路由协议应满足的7个方面,着重对适用于不同业务需求和网络需求的路由协议进行了介绍,为Ad Hoc网络路由协议的进一步研究提供了参考。     

基于GloMoSim的移动自组网路由仿真

全球移动信息系统仿真平台（CloMoSim）在移动自组织网络仿真中得到了广泛的应用，尤其是对网络路由以及MAC协议的建模支持。在对自组网路由方式特点及协议设计思路进行分析的基础上．结合典型的自组网路由算法策略，重点介绍了GloMoSim仿真环境的特点及其目前所支持的路由层协议。通过多次仿真验证，分析比较了这些路由协议的相关性能并得出结论。     

Ad hoc网络路由协议的仿真及研究

Adhoc网络是一种由节点任意移动、拓扑结构动态、随机且快速变化的自组网。由于其复杂性和多样性,常规路由无法传输信息。所以自组网路由协议一直是无线网络研究中的热点之一。本文对Adhoc网络目前常用的路由协议在OPNET平台上进行了仿真,通过比较和研究网络吞吐量,延时和路由开销等性能参数分析出各路由协议适应的网络环境。     

Ad Hoc网络DSR路由协议仿真性能分析

移动Ad Hoc网络是随着无线通信技术的快速发展而出现的一种新型网络。目前,它的应用越来越广泛。在介绍移动Ad Hoc网络的相关技术后,对动态源路由协议(DSR)进行了研究,通过计算机仿真,在不同的网络负荷、节点移动性条件下,对移动Ad Hoc网络的性能进行了分析,仿真结果表明DSR路由协议对于移动环境下的动态路由适应性较好。     

飞行自组网路由协议的仿真与分析

飞行自组网是移动自组网的一个新的研究方向,它将移动自组网的思想拓展到空天领域。但由于节点的高动态性和拓扑结构快速变化等特点,飞行自组网对路由协议提出更多挑战,传统移动自组网路由协议的适用性有待验证。文章利用OMNe T++仿真工具,针对飞行器组网的特定场景,对多种路由协议进行仿真,分析对比了各协议性能,探讨了无人机自组网路由协议的优选问题。实验结果表明OLSR_ETX协议综合性能优于其他几类协议,更适用于飞行自组网场景,但它在节点需要动态入网时表现不佳,还需要进一步的优化。     

DSLAM传输网技术

无线Mesh网络(Wireless Mesh Network,WMN)是一种新兴的源于移动Ad Hoc网络的宽带无线接入技术.它通过网关节点接入因特网.实际应用中当网络接入业务量很大或网络规模扩大时,一个网关节点将成为网络接入性能的"瓶颈",大量转发的数据包将导致严重的拥塞.针对此问题提出一种基于移动自组网DSR协议的多网关选播路由协议MAMSR,仿真实验表明它能有效解决接入拥塞问题.     

对MANET AODV路由协议攻击效果分析

移动无线自组织网络(Mobile Ad Hoc Network,MANET)具有抗毁性强、组网灵活的特点,战场通信环境是其很重要的应用背景,基于距离向量的按需路由协议(Ad-hoc On-demand Vector Routing,AODV)在移动无线自组织网络中具有广泛的应用。针对移动无线自组网AODV路由协议,在分析其工作原理的基础上,建立网络流量的分析模型。从网络发起泛搜索路由引起网络流量变化的角度,分析不同的协议攻击方法对网络的影响。     

A simulation study of table-driven and on-demand routing protocolsfor mobile ad hoc networks

Bandwidth and power constraints are the main concerns in current wireless networks because multihop ad hoc mobile wireless networks rely on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power, and computation demands on mobile hosts which must be taken into account when choosing the best routing protocol. In previous years, protocols that build routes based on demand have been proposed. The major goal of on-demand routing protocols is to minimize control traffic overhead. We perform a simulation and performance study on some routing protocols for ad hoc networks. The distributed Bellman-Ford (1957, 1962), a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless network. In addition, two on-demand routing protocols (dynamic source routing and associativity-based routing) with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast their performance. The final selection of an appropriate protocol will depend on a variety of factors, which are discussed in this article     

High throughput reactive routing in multi-rate ad hoc networks

A reactive routing algorithm for multi-rate ad hoc wireless networks is proposed. It enhances the AODV protocol and achieves higher throughput by utilising the multi-rate capability of the underlying wireless channel via the MAC delay routing metric. Simulations show that the protocol leads to a significant throughput increase over traditional ad hoc routing protocols.     

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency and scalability, and avoids the burden—GPS support.     

PACMAN: passive autoconfiguration for mobile ad hoc networks

Mobile ad hoc networks (MANETs) enable the communication between mobile nodes via multihop wireless routes without depending on a communication infrastructure. In contrast to infrastructure-based networks, MANET's support autonomous and spontaneous networking and, thus, should be capable of self-organization and -configuration. This paper presents passive autoconfiguration for mobile ad hoc network (PACMAN), a novel approach for the efficient distributed address autoconfiguration of mobile ad hoc networks. Special features of PACMAN are the support for frequent network partitioning and merging, and very low protocol overhead. This is accomplished by using cross-layer information derived from ongoing routing protocol traffic, e.g., address conflicts are detected in a passive manner based on anomalies in routing protocol traffic. Furthermore, PACMAN assigns Internet protocol (IP) addresses in a way that enables their compression, which can significantly reduce the routing protocol overhead. The performance of PACMAN is analyzed in detail based on various simulation results.     

Active routing for ad hoc networks

Ad hoc networks are wireless multihop networks whose highly volatile topology makes the design and operation of a standard routing protocol hard. With an active networking approach, one can define and deploy routing logic at runtime in order to adapt to special circumstances and requirements. We have implemented several active ad hoc routing protocols that configure the forwarding behavior of mobile nodes, allowing data packets to be efficiently routed between any two nodes of the wireless network. Isolating a simple forwarding layer in terms of both implementation and performance enables us to stream delay-sensitive audio data over the ad hoc network. In the control plane, active packets permanently monitor the connectivity and setup, and modify the routing state     

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward approach. In this paper, an opportunistic routing protocol is proposed, along with its compatible media access control, for non-real-time services in delay-tolerant networks. The scheme is mobility-aware such that each network node needs to know its own position and velocity. The media access control employs a four-fold handshake procedure to probe the wireless channel and cooperatively prioritize candidate nodes for packet replication. It exploits the broadcast characteristic of the wireless medium to utilize long-range but unreliable links. The routing process seizes opportunities of node contacts for data delivery. It takes a multiple-copy approach that is adaptive with node movements. Numerical results in mobile ad hoc networks and vehicular ad hoc networks show superior performance of the proposed protocol compared with other routing protocols. The mobility-aware media access control and routing scheme exhibits relatively small packet delivery delay and requires a modest amount of total packet replications/transmissions.     

QoS routing for wireless ad hoc networks: problems, algorithms, and protocols

QoS routing plays an important role for providing QoS in wireless ad hoc networks. The goals of QoS routing are in general twofold: selecting routes with satisfied QoS requirement(s), and achieving global efficiency in resource utilization. In this article we first discuss some key design considerations in providing QoS routing support, and present a review of previous work addressing the issue of route selection subject to QoS constraint(s). We then devise an on-demand delay-constrained unicast routing protocol. Various strategies are employed in the protocol to reduce the communication overhead in acquiring cost-effective delay-constrained routes. Simulation results are used to verify our expectation of the high performance of the devised protocol. Finally, we discuss some possible future directions for providing efficient QoS routing support in wireless ad hoc networks.     

SMORT: Scalable multipath on-demand routing for mobile ad hoc networks

Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.     

A quantitative comparison of ad hoc routing protocols with and without channel adaptation

To efficiently support tetherless applications in ad hoc wireless mobile computing networks, a judicious ad hoc routing protocol is needed. Much research has been done on designing ad hoc routing protocols and some well-known protocols are also being implemented in practical situations. However; one major imperfection in existing protocols is that the time-varying nature of the wireless channels among the mobile-terminals is ignored; let alone exploited. This could be a severe design drawback because the varying channel quality can lead to very poor overall route quality in turn, resulting in low data throughput. Indeed, better performance could be achieved if a routing protocol dynamically changes the routes according to the channel conditions. In this paper, we first propose two channel adaptive routing protocols which work by using an adaptive channel coding and modulation scheme that allows a mobile terminal to dynamically adjust the data throughput via changing the amount of error protection incorporated. We then present a qualitative and quantitative comparison of the two classes of ad hoc routing protocols. Extensive simulation results indicate that channel adaptive ad hoc routing protocols are more efficient in that shorter delays and higher rates are achieved, at the expense of a higher overhead in route set-up and maintenance.     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.