共查询到20条相似文献,搜索用时 93 毫秒
1.
移动自组网是由无线移动主机组成的没有基础设施或集中管理中心的临时性网络。在其组建应用过程中,路由协议起着重要的作用。文中基于仿真软件NS2对移动自组网三种典型路由协议DSDV、DSR、TORA在TCP与CBR业务下的性能进行了比较分析。仿真结果表明,在发送速率144kb/s时,DSR与DSDV性能优于TORA,且TCP业务性能优于CBR业务。 相似文献
2.
基于NS2的Ad hoc网络路由协议性能分析比较 总被引:5,自引:0,他引:5
A d Hoc网络的路由协议是A d Hoc网络研究的关键问题,对于研究A d Hoc网络是至关重要的。本文采用网络仿真软件N S2评价移动自组网的路由协议。通过实例仿真,利用编写的脚本程序,对仿真结果进行分析,从而对移动自组网路由协议AODV(自组网按需路由协议)、DSR(动态源路由)以及DSDV(基于目的序号和距离矢量路由)的性能参数进行比较。 相似文献
3.
目前的移动自组网研究主要针对运动速度较慢的地面网络。本文研究由高速节点组成的高动态移动自组网的路由协议,提出了一个结合表驱动路由和地理位置路由的混合路由协议TOPOS,在局部使用表驱动路由加快数据包的转发,而在全局使用地理位置路由以适应快速变化的网络拓扑。在OPNET仿真平台上对TOPOS和已有的AODV及GRP协议的性能比较表明,TOPOS对于节点的运动速度和网络规模具有更好的适应性。 相似文献
4.
分析了移动自组网的先应式路由协议DSDV和按需路由协议AODV与DSR,并通过网络仿真软件ns2进行了仿真实验,对其分组投递率,端到端平均时延、吞吐量、路由开销等方面的性能进行了分析和比较.实验结果表明,按需路由协议具有更好的性能. 相似文献
5.
6.
7.
8.
9.
10.
11.
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. 相似文献
12.
This paper compares ad hoc on‐demand distance vector (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP) for MANETs to distance vector protocol to better understand the major characteristics of the three routing protocols, using a parallel discrete event‐driven simulator, GloMoSim. MANET (mobile ad hoc network) is a multi‐hop wireless network without a fixed infrastructure. Following are some of our key findings: (1) AODV is most sensitive to changes in traffic load in the messaging overhead for routing. The number of control packets generated by AODV became 36 times larger when the traffic load was increased. For distance vector, WRP and DSR, their increase was approximately 1.3 times, 1.1 times and 7.6 times, respectively. (2) Two advantages common in the three MANET routing protocols compared to classical distance vector protocol were identified to be scalability for node mobility in end‐to‐end delay and scalability for node density in messaging overhead. (3) WRP resulted in the shortest delay and highest packet delivery rate, implying that WRP will be the best for real‐time applications in the four protocols compared. WRP demonstrated the best traffic scalability; control overhead will not increase much when traffic load increases. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
13.
A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks 总被引:3,自引:0,他引:3
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology information obtained during the location request phase to establish geographic paths to their respective destinations. Geographic paths decouple node ID’s from the paths and are immune to changes in the network topology. Further, they help nodes avoid dead-ends due to greedy forwarding. To utilize geographic paths even in sparser networks, OGPR uses a path-healing mechanism that helps geographic paths adapt according to the network topology. We present extensions to OGPR protocol to cope with networks containing unidirectional links. Further, we present results from an extensive simulation study using GloMoSim. Simulation results show that OGPR achieves higher percentage packet delivery and lower control overhead, compared to a combination of GPSR+GLS protocols, AODV, and DSR under a wide range of network scenarios. 相似文献
14.
Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure" routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model 相似文献
15.
Jyoti Jain Roopam Gupta T.K. Bandhopadhyay 《International Journal of Electronics》2013,100(9):1230-1243
Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load. 相似文献
16.
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 相似文献
17.
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. 相似文献
18.
Ad Hoc网络路由协议性能分析 总被引:4,自引:4,他引:0
介绍了移动自组网的表驱动和按需驱动两类路由协议.提出了定量评估网络路由协议性能的六个基本指标.利用网络仿真器NS-2,对四种典型的路由协议(DSR、DSDV、AODV和TORA)建立仿真模型,配置仿真参数,并进行了仿真.对仿真过程产生的文档进行处理,分析,比较它们的性能指标.试验结果表明,模型仿真结果接近理论分析和实际情况,该方法在路由协议研究,设计与仿真方面具有较强的实用性和通用性. 相似文献
19.
In recent years, a variety of new routing protocols for mobile ad hoc wireless NETworks (MANETs) have been developed. Performance evaluation and comparison of many of these routing protocols have been performed using detailed simulation models. Zone routing protocol (ZRP) is one of these routing protocols, which is a hybrid routing protocol that proactively maintains routing information for a local neighbourhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. The studies on ZRP have assumed homogeneous scenarios where all mobile nodes have uniform mobility and are statistically identical, lacking the studies on heterogeneous scenarios where mobile nodes move with non‐uniform mobilities in the same network. In this paper, we study the performance of ZRP in such scenarios. We propose an efficient scheme for ZRP to adapt to the non‐uniform mobilities scenario and study its performance for different mobility scenarios, network loads and network sizes. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
20.
To ameliorate high collision, a nefarious side effect of route discovery stage of reactive routing protocols in wireless networks, jitter mechanisms are proposed which enforce wireless nodes to postpone their transmission for a random amount of time so as to reduce probability of simultaneous transmission. Although it has been shown that jitter mechanisms can dramatically improve reactive routing protocols, it was not until recently that jitter mechanisms have been subjected to study. In this paper, different random distributions are proposed for jittering mechanisms and also shaping function, with the aim of which a simple routing protocol like AODV becomes sensitive to any arbitrary metric, is defined. Comprehensive simulation of routing metrics and jitter mechanisms have revealed that simple modification of a jitter mechanism, which can be even implemented independent of a routing protocol, greatly improves routes discovered by any routing protocol. 相似文献