基于NS2的无线自组织网络路由协议仿真

在无线自组织网络中,由于节点移动,网络拓扑结构变化频繁,所以路由协议的选择一直都是关键问题。该文采用NS2软件对两种主要的协议：动态源路由协议（DSR）和自组网按需距离矢量路由协议（AODV）进行了仿真。并且通过端到端延时、路由开销和分组投递率三种参数在不同条件下的数据对两种协议进行了评估。实验结果表明没有一种协议能够完全适用于自组网,对于特殊环境选择不同协议以满足需要。     

移动Ad hoc网络负载的NS2仿真分析

网络负载问题是移动Ad hoc路由算法的研究重点。通过设置不同发送数据频率和不同网络连接度来改变网络负载,利用NS2仿真Ad hoc路由协议分析性能参数：分组投递率、平均端到端延迟和路由开销,对不同负载下的网络性能进行研究。结果表明,在网络负载较小情况下,3种路由协议下的网络相差不大,当网络繁忙时,按需距离矢量路由协议...     

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

路由协议作为影响网络的一个重要因素,是确保移动adhoc网络运行的关键。开发良好的移动adhoc网路由协议是移动adhoc网络要解决的首要问题。移动adhocl网络的路由协议也是目前最主要的研究热点和难点。本文分析对比了当前两种种典型的Adhoc网络路由协议DSR、AODV,并在NS2的真平台下,对路由协议DSR、AODV进行了仿真。在不同的网络规模下,对路由协议DSR,AODV在分组投递率给出了详细的性能比较分析,从而得出结论。     

AODV、DSR和188-220C路由协议比较研究

文章分析研究了AODV、DSR和MIL-STD-188-220C三种无线自组织网络路由协议的思想、原理及优点缺点,并在NS-2平台上这三种路由协议就分组发送成功率、吞吐量,端对端延时和抖动等参数做出仿真和结论.     

Ad hoc网络两种按需路由协议性能分析

Ad hoc网络是一种无需依赖于事先布设的基础设施,而仅依靠网络内部节点之间的协作,就能够完成节点间通信的网络。比较了Ad hoc网络两种主流的按需路由协议：动态源路由协议,自组网按需距离矢量路由协议。使用基于ns-2的仿真模型进行仿真,并通过分组交付率、平均端到端时延、标准化路由负荷、对两种按需路由协议进行评估。实验结果表明即使DSR和AODV协议都是按需路由协议,但它们采取的路由机制的不同,导致它们的性能表现的巨大差异。     

Mesh网下AODV、DSR和ZigBee路由的比较分析

为了研究在Mesh拓扑网络下不同无线自组网络路由协议的性能优劣,在网络设计中有选择地使用,分析和研究了ZigBee路由、动态源路由协议（DSR）和平面距离矢量路由协议（AODV）三种无线自组网络路由协议的思想和原理。通过网络模拟软件NS-2,在其他外部条件相同的条件下对三者在Mesh拓扑结构组网进行模拟,得到端到端平均延迟、包传输率和路由开销率三种性能指标的折线图。从仿真结果图上看,ZigBee路由在其应用范围内具有独特优势,适合在Mesh拓扑网络中应用。     

Ad Hoc网络中两种按需路由协议的比较

Ad hoc网络的特征是多跳的无线连接，网络拓扑的频繁变化，以及需要有效的动态路由协议。重点比较Ad hoc网络中两种主要的按需路由协议：动态源路由（DSR）协议和Ad hoc按需距离矢量路由（AODV）协议。尽管DSR和AODV都是按需路由协议，但不同的协议机制导致了网络性能的显著差异。在OPNET仿真平台下，对采用不用路由协议的网络时延和吞吐量进行比较，从而分析不同的路由机制引起的网络性能差异。     

Ad hoc网络TORA和DSR路由协议的分析比较

TORA和DSR路由协议是Ad hoc网络中具有成果性的两种后应式路由协议。分别对两种路由协议的建立、维护方面进行了分析对比,并给出了两种协议的优缺点。最后通过仿真从路由分组开销、路由建立时间和发送数据分组信息几个方面进行分析论证。     

WSN中基于势能场的多策略路由协议

文章结合无线传感器网络（WSN）中流量分布的向心性特点,借鉴物理学中势能场的概念与机理,提出一种开放的路由协议实现框架。利用不同的网络参数构造不同的“虚拟势能场”,叠加后形成的复合势能场将驱动数据分组沿着势场梯度变化最快的方向移动,一方面可以最终将网络中的数据分组汇聚于目的节点,实现路由协议的基本功能;同时,在动态时变“虚拟势能场”的调节下,还可以为路由协议附加各种有利于实现其他优化目标的策略与属性,如能耗均衡、拥塞避免、支持服务质量保障和利于数据聚合等,在无线传感器网络中实现多策略路由。作为例子,文章提出了一个基于势能场的提供实时传输的路由协议,它能在严格保障实时分组获得最小化端到端延迟的前提下,有效缓解网络拥塞,提高全网吞吐量。     

基于火场救灾的动态分组和多路径 DYMO 协议

针对消防员如何有效和安全的开展火场救灾工作这一问题,在动态自组网按需路由协议（DYMO）的基础上提出一种基于动态分组和多路径的消防路由协议（F-DYMO）,适用于消防员们在火灾现场的通信。该协议通过存储多条路径并设置最优路径的选择原则来加强通信链路的可靠性,并根据消防员执行任务的不同对消防员进行动态的分组。通过在网络模拟软件 NS2上的仿真,证明了该协议具有很好的链路可靠性和可扩展性,是适用于火场救灾的路由协议。     

Mixed time-constrained and non-time-constrained communications inlocal area networks

It is well known that some time-token medium access protocols for local area networks (LANs) like the IEEE 802.4 token bus and the FDDI token ring can guarantee the medium access delay for time-constrained packets. However, a problem which has been largely overlooked is how these protocols can be made to provide a maximum throughput for nontime-constrained packets while guaranteeing the delay bound of time-constrained packets. The authors first show how the parameters of the IEEE 802.4 token bus and the FDDI token ring can be set to solve the above problem. Then, they design a new timer mechanism for the timed-token protocols which provides the highest guaranteed throughput of nontime-constrained packets among a set of medium access protocols called the token passing protocol, to which most of the existing non-contention LAN protocols belong. They present numerical examples to compare different protocols, all of which have shown the superiority of the proposed protocol to the others     

Multiple-packet forwarding protocols for frequency-hop packet radio networks

Reliable data distribution within multiple-hop spread-spectrum packet radio networks requires high performance from the network protocols. The high variability in quality among the links and the unique characteristics of frequency-hop spread-spectrum signaling impose special requirements for network protocols that are to be employed in frequency-hop packet radio networks. These features can be exploited in the forwarding protocols by allowing multiple packets to be included in each forwarding attempt. The use of multiple-packet transmissions exploits the capture property of frequency-hop signaling, and it reduces the overhead required for acknowledgments. A potential trade-off arises because the use of multiple-packet transmissions increases the throughput, but in some situations it can also increase the delay. Two new transmission protocols that employ multiple-packet transmissions are described, and their performance is evaluated.     

Primary user supported routing protocol for cognitive radio ad hoc networks in search of higher throughput

A routing protocol for cognitive radio ad hoc networks (CRAHNs), namely, primary user supported routing (PSR) is demonstrated in this research. Unlike existing routing protocols for CRAHN, where routing of cognitive users (CUs) is accomplished within CUs, in this proposed protocol, some of the primary users (PUs) support CUs to communicate, by forwarding CU packets. This service provided by PU is of voluntary nature. However, such assistance shall be provided by the PUs, only when they are idle, thereby, preserving the principles of cognitive radio networks (CRNs), which indicates that the operation of PU should not be disturbed by the CU activities. The proposed work is compared with cognitive ad hoc on-demand distance vector (CAODV) protocol. The performance parameters considered are routing overhead, rate of loss of packets, and e2e packet delay. PSR outperforms CAODV in all these performance parameters. There has been on average 26.25% improvement in routing overhead, 34.12% decrease in loss, and 27.01% improvement in e2e delivery in the proposed PSR.     

An Adaptive Partial FCS Scheme to Enable the Corruption-aware Transport Protocols over IP Networks for Fourth Generation Wireless Communications

The traditional reliable transport protocols are originally designed for the wired networks, which regard any packet loss as the indication of network congestion and halve their congestion windows to alleviate the traffic overload of network. However, unlike in wired networks, non-congestion losses will severely degrade the performance of traditional transport protocols in wireless networks. Thus some corruption-aware transport protocols have been proposed to overcome the performance degradation caused in the error-prone wireless networks. Unfortunately, the corruption-aware transport protocols cannot work in realistic networks up to now since the corrupted packets will be discarded by the link layer checksum mechanisms before they are delivered to the transport layer. This paper introduces a cross-layer adaptive partial Frame Check Sequence scheme to safely enable the corruption-aware transport protocols in the next generation wireless communications without disabling the link layer 32-bit Cyclic Redundancy Check checksum mechanisms. Simulation results show that the proposed scheme can help the corruption-aware transport protocols to significantly improve their performance compared to that of the existing schemes.     

Practical relay networks: a generalization of hybrid-ARQ

Wireless networks contain an inherent distributed spatial diversity that can be exploited by the use of relaying. Relay networks take advantage of the broadcast-oriented nature of radio and require node-based, rather than link-based protocols. Prior work on relay networks has studied performance limits either with unrealistic assumptions, complicated protocols, or only a single relay. In this paper, a practical approach to networks comprising multiple relays operating over orthogonal time slots is proposed based on a generalization of hybrid-automatic repeat request (ARQ). In contrast with conventional hybrid-ARQ, retransmitted packets do not need to come from the original source radio but could instead be sent by relays that overhear the transmission. An information theoretic framework is exposed that establishes the performance limits of such systems in a block fading environment, and numerical results are presented for some representative topologies and protocols. The results indicate a significant improvement in the energy-latency tradeoff when compared with conventional multihop protocols implemented as a cascade of point-to-point links.     

A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Networks (VANET) are the foundation of Intelligent Traffic System (ITS), and recently many MAC protocols for VANET are proposed, among which a reliable MAC protocol called ADHOC has aroused much attention. By investigating the details of ADHOC protocol, we have discovered several unsolved problems that might lead to network failure. In this paper, we provide a quantitative analysis of the success probability for contending nodes and prove that an adaptive frame length is quite necessary. We propose Adaptive-ADHOC (A-ADHOC) MAC protocol, which implements a robust mechanism supporting the adaptive frame length. Evaluation result shows that A-ADHOC can maintain a high contending success probability and obtain about 50% reduction of response time over original ADHOC protocol, while providing important enhancement on network scalability and robustness.     

An efficient network coded ARQ for multisource multidestination relay networks over mixed flat fading channels

This paper proposes a new reliable automatic repeat request (ARQ) transmission protocol for wireless multisource multidestination relay networks over mixed fading channels. Conventional application of ARQ protocols to retransmit lost or erroneous packets in relay networks can cause considerable delay latency with a significant increase in the number of retransmissions when networks consist of multiple sources and multiple destinations. To address this issue, a new ARQ protocol based on network coding (NC) is proposed where the relay detects packets from different transmission sources, then uses NC to combine and forward lost packets to their destinations. An efficient means for the retransmission of all lost packets is proposed through two packet-combination algorithms for retransmissions at the relay and sources. The paper derives mathematical formulation of transmission bandwidth for this new NC-based ARQ protocol and compares analytical and simulation results with some other ARQ protocols over both mixed Rayleigh and Rician flat fading channel. The mixed fading model permits investigation of two typical fading scenarios where the relay is located in the neighbourhood of either the sources or the destinations. The transmission bandwidth results show that the proposed NC-based ARQ protocol demonstrates superior performance over other existing ARQ schemes.     

Adding sense of spatial locality to routing protocols for mobile ad hoc networks

Recently, there has been an increasing interest in mobile ad hoc networks. In a mobile ad hoc network, each mobile node can freely move around and the network is dynamically constructed by collections of mobile nodes without using any existing network infrastructure. Compared to static networks, it faces many problems such as the inefficiency of routing algorithms. Also, the number of control packets in any routing algorithm increases as the mobile speed or the number of mobile nodes increases. Most of the current routing protocols in ad hoc networks broadcast the control packets to the entire network. Therefore, by reducing the number of control packets, the efficiency of the network routing will be improved. If we know where the destination is, we can beam our search toward that direction. However, without using global positioning systems, how can we do this? Define the range nodes as the 1‐hop or 2‐hop neighbors of the destination node. In this paper, we propose using the range nodes to direct our searches for the destination. It can be combined with the existing routing protocols to reduce the control overhead. We show through simulations that AODV and DSR combined with the range node method outperforms the original AODV and DSR routing protocols in terms of control packets overhead. We also show that the delay introduced in find range nodes is insignificant. Copyright © 2006 John Wiley & Sons, Ltd.     

A Bluetooth Routing Protocol Using Evolving Fuzzy Neural Networks

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the routing path and increase the network loads in the existing ad hoc routing protocols, we selectively use multiple unicasts or one broadcast when the destination device is out of the routing zone radius coverage of the routing table. The simulation results show that the dynamic adjustment of the routing table size in each master device results in much less reply time of routing request, fewer request packets and useless packets compared with two representative protocols, Zone Routing Protocol and Dynamic Source Routing.     

OGHAM: On-demand global hosts for mobile ad-hoc multicast services

Recent advances in pervasive computing and wireless technologies have enabled novel multicast services anywhere, anytime, such as mobile auctions, advertisement, and e-coupons. Routing/multicast protocols in large-scale ad-hoc networks adopt two-tier infrastructures to accommodate the effectiveness of the flooding scheme and the efficiency of the tree-based scheme. In these protocols, hosts with a maximal number of neighbors are chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations or bottlenecks of the network and spend significant amount of time forwarding packets. In this paper, a distinct strategy is proposed for constructing a two-tier infrastructure in a large-scale ad-hoc network. Hosts with a minimal number of hops to the other hosts rather than those with a maximal number of neighbors will be adopted as BHs in order to obtain shorter multicast routes. The problem of determining BHs can be formulated with linear programming. BHs thus found have the advantages of shorter relay and less concentration. Besides, BHs are selected on-demand and can be globally reused for different multicast groups without flooding again. Simulation results show that the proposed protocol has shorter transmission latency, fewer control/data packets and higher receiving data packet ratios than other existing multicast protocols. Besides, the two-tier infrastructure constructed by the proposed protocol is more stable.