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

移动Ad Hoc网络是一个自组织系统,是由许多无线移动主机组成的一个临时动态网络,且不依赖于任何中心化的接入点和网络基础设施。对于这样一个网络,一个有效的路由协议对于适应主体的移动性以及为可能的链路提供可行的数据传输是非常必要的。限定路由协议的因素可归为两类,即无线传输过程中的衰退作用和网络拓扑的边缘效应。现存的各种路由协议着重从不同的角度来实现各自的功能。路由协议可分为两部分,路由发现和路由维护,而路由发现是其中的关键部分。     

Transmission-Efficient Routing in Wireless Networks Using Link-State Information

The efficiency with which the routing protocol of a multihop packet-radio network uses transmission bandwidth is critical to the ability of the network nodes to conserve energy. We present and verify the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than both table-driven and on-demand routing protocols proposed for wireless networks in the recent past. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions. Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol proposed to date and depending on the scenario is up to six times more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols.     

Robust position-based routing for wireless ad hoc networks

We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these protocols is that all wireless nodes have uniform transmission regions modeled by unit disk centered at each wireless node. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because either some connections that are used by routing protocols do not exist, which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most .     

A simple void node and loop‐free three‐dimensional routing protocol for multi‐hop wireless networks

Wireless networks are now very essential part for modern ubiquitous communication systems. The design of efficient routing and scheduling techniques for such networks have gained importance to ensure reliable communication. Most of the currently proposed geographic routing protocols are designed for 2D spatial distribution of user nodes, although in many practical scenarios user nodes may be deployed in 3D space also. In this paper, we propose 3D routing protocols for multihop wireless networks that may be implemented in two different ways depending on how the routing paths are computed. When the routing paths to different user nodes from the base station in the wireless network are computed by the base station, we call it centralized protocol (3DMA‐CS). A distributed routing (3DMA‐DS) protocol is implemented when respective routing path of each user node to the base station is computed by the user node. In both of these protocols, the user (base station) selects the relay node to forward packets in the direction of destination, from the set of its neighbours, which makes minimum angle with the reference line drawn from user (base station) to the base station (user), within its transmission range. The proposed protocols are free from looping problem and can solve the void node problem (VNP) of multihop wireless networks. Performance analysis of the proposed protocol is shown by calculating end‐to‐end throughput, average path length, end‐to‐end delay, and energy consumption of each routing path through extensive simulation under different network densities and transmission ranges.     

面向可扩展的VANETs混合路由的研究与仿真

车载网VANETs(Vehicular ad hoc networks)属于高速移动的无线网络,可供车辆安全、交通监测以及其他的商业服务的应用。然而,为此,提出混合式的位VANETs中车辆的快速移动导致通信链路频繁地断裂,增加路由开销,降低了可扩展性。议地理位置路由的特点。HLAR(Hybrid location-based ad hoc routing)。HLAR结合了反应式路由、HLAR克服了反应式路由的扩展性问题,并改善了地理位置路由对位置误差的敏感性。同时,通过理论分析,量可扩展性,并推导了路由开销的表达式。通过分析、仿真表明,提出的路由协议具有很好的扩展性,并降低了路由开销。在仿真中引入位置误差因子,结果表明。同时,与同类的其他协议相比,输时延方面HLAR到对位置误差具有很强的鲁棒性HLAR在数据传输率、端到端传提升。     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Virtual‐coordinate‐based delivery‐guaranteed routing protocol in three‐dimensional wireless sensor networks

Because of the wide range of applications, many geographic routing protocols have been proposed in three‐dimensional (3D) wireless sensor networks. However, all the methods require assistance from a global positioning system (GPS), which is not always available. In this paper, we propose a method of constructing an axis‐based virtual coordinate assignment in 3D wireless sensor networks (ABVCap_3D) that requires no GPS assistance. We also propose a routing protocol based on ABVCap_3D, which guarantees packet delivery in 3D networks. Using simulations, we evaluate the performance of ABVCap_3D routing and other well‐known routing protocols, such as greedy‐random‐greedy routing, greedy‐hull‐greedy routing, and the routing based on axis‐based virtual coordinate assignment in 2D wireless sensor networks (ABVCap routing). Simulations show that ABVCap_3D routing requires significantly relative lower cost for guaranteeing packet delivery in comparison with ABVCap routing. Simulations also demonstrate that ABVCap_3D routing ensures a moderate ratio for routing path length to the shortest (ideal) path length. Copyright © 2012 John Wiley & Sons, Ltd.     

Cooperative Protocols Design for Wireless Ad-Hoc Networks with Multi-hop Routing

Wireless ad-hoc networks can experience significant performance degradation under fading channels. Spatial diversity has been shown to be an effective way of combating wireless fading with the multiple-input multiple-output (MIMO) technique by transmitting correlated information through multiple antennas. The virtual MIMO technique, which allows multiple wireless stations with single antenna to form a virtual transmission array, is shown to be a viable solution from several recent studies. In this paper, we propose a complete system framework for wireless ad-hoc networks utilizing two different cooperative relaying techniques at the physical layer: the repetition coding and the space-time coding. In the data link layer, two medium access control protocols are proposed to accommodate the corresponding physical layer cooperative diversity schemes. In the network layer, diversity-aware routing protocols are proposed to determine the routing path and the relaying topology. Simulations with both constant bit rate and TCP (transmission control protocol) traffic show significant performance gains of the proposed cooperative relaying schemes.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.     

Middleman covert channel establishment based on MORE routing protocol using network coding in ad hoc networks

Covert channels have been recently the subject of the study in both creation and countermeasure aspects. There are many different ways to embed the covert data in network standards and protocols, especially in wireless networks. MORE (MAC‐independent opportunistic routing) is an opportunistic routing protocol which uses networks coding to enhance routing performance by reducing the repetitions. This protocol can be a suitable medium for covert channel establishment. A middleman covert channel establishment method is proposed in this paper over MORE routing protocol and with the use of network coding. Hidden data are transferred through packet's payload bytes. Covert sender manipulates coding mechanism by calculating packets' coefficients instead of random selection. The proposed covert channel provides the average throughput of 218 and 231 bps, using two different data length approaches which is relatively a good comparing to the previous network layer covert channels. The proposed covert channel is also a covert storage channel and cannot be removed or restricted. Effect of different network characteristics on the proposed method's capacity and security is investigated by a simulation study, and the results are discussed.     

Increasing the network performance using multi-path routing mechanism with load balance

Research on multi-path routing protocols to provide improved throughput and route resilience as compared with single-path routing has been explored in details in the context of wired networks. However, multi-path routing mechanisms have not been explored thoroughly in the domain of ad hoc networks. In this paper, we propose a new routing protocol which increases the network throughput. The protocol is a multi-path routing protocol with a load balance policy. The simulations show a significant improvement in terms of connection throughput and end-to-end delay, when compared to single-path routing. The second significant contribution of this paper is a theoretical analysis allowing to compare reactive single-path and multi-path routing with load balance mechanisms in ad hoc networks, in terms of overheads, traffic distribution and connection throughput. The results reveal that multi-path routing (using a load balance policy) provides better performance than reactive single-path routing in terms of congestion and connection throughput, provided that the average route length is smaller than certain upper bounds which are derived and depend on parameters specific to the network. These upper bounds are very crucial because they can be taken into account as constraints in the route discovery mechanism so that the multi-path routing protocol is guaranteed to lead to an increase performance than a simple single-path one. Also, our analysis provide some insight into choosing the right trade-off between increased overheads and better performance. We show in particular that for certain networks, a multi-path routing strategy is not worth considering.     

Scalability enhancement of AODV using local link repairing

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.     

The Optimization of Combination Scheme in Cooperative Spectrum Sensing Based on the Practical Reporting Frame Format

Wireless mesh networks (WMNs) are emerged as prominent solution to provide seamless connection to the internet. WMNs are typically used for providing broadband wireless internet access to a large number of users and networks. Guaranteeing the quality of service to end users with efficient resource utilization is a challenging issue in WMNs. To accomplish this, we propose a hybrid routing protocol for wireless mesh networks. It is a combination of intra cluster routing protocol (ICR) and inter cluster routing protocol for mesh networks (ICMR). Intra cluster routing protocol is intended to facilitate the communication between mesh clients within a same cluster and inter cluster routing protocol (ICMR) intended to facilitate the communication for mesh clients from different clusters. Intra cluster routing protocol is a proactive type of routing protocol and inter cluster routing protocol is a reactive type of routing protocol. The performance of the proposed protocol is analyzed and the results shown superior performance compared to baseline routing protocols in terms of throughput, end to end delay, packet delivery ratio and jitter.     

A routing protocol for mobile ad‐hoc networks using the profit optimization model

Recently, wireless networks have become one of the major development trends in computer network technology. Because there is no more need of the wired transmission medium, applications have thus diversified. One such growing field of wireless networks is the mobile ad‐hoc network (MANET). A MANET consists of mobile hosts (such as portable laptops, vehicles, etc.), and no fixed infrastructure is required. MANETs provide ease of self‐configuration and can extend coverage at a low cost. Numerous applications have therefore been proposed under this network environment for daily life use. Because MANETs nodes are capable of moving, MANET network topology changes frequently. Thus, the traditional routing protocols fail to fit such an environment. In this paper, we propose an efficient routing protocol for MANETs, which integrates the mathematical model of profit optimization (the Kelly formula) from the field of economics to cope with the routing problem caused by node mobility. Some numerical simulations have been conducted to evaluate the performance of the proposed method using the network simulator NS‐2. The results show that our proposed method outperforms conventional routing protocols in packet delivery ratio comparisons; and the average end‐to‐end delays are within a tolerable range. Copyright © 2013 John Wiley & Sons, Ltd.     

无线网络编码增益感知的低时延路由协议

降低无线网络数据包传递时延对实时应用有重要的意义.该文提出了一种编码增益的计算方法和编码图的简化方法,并基于此提出了编码增益感知的路由协议CGAR(Coding Gain Aware Routing).CGAR利用网络编码增益和无线链路的期望传输次数ETX(Expected Transmission Count)计算传递一个来自新流的数据包所需要的时间,并以此为选路度量,旨在降低数据传递时延.仿真试验表明,CGAR的时延优于COPE和DCAR协议.     

车载自组织网络路由协议研究进展与比较

车载自组织网络（VANET）是一种新型移动自组织网络。作为移动无线网络的热点研究领域,车载自组织网络的间歇连通性使路由设计充满挑战。首先阐述了车载自组织网络的主要特征和应用;在对车载网络路由协议进行分类的基础上,详细描述了一批有代表性的路由协议;对比和总结了各类路由协议的特点,并提出相关研究建议,可为车载网络路由协议研究提供一定的参考价值。     

车载自组织网络路由协议研究进展与比较

车载自组织网络( VANET)是一种新型移动自组织网络。作为移动无线网络的热点研究领域,车载自组织网络的间歇连通性使路由设计充满挑战。首先阐述了车载自组织网络的主要特征和应用;在对车载网络路由协议进行分类的基础上,详细描述了一批有代表性的路由协议;对比和总结了各类路由协议的特点,并提出相关研究建议,可为车载网络路由协议研究提供一定的参考价值。     

Wireless Ad Hoc Multicast Routing with Mobility Prediction

An ad hoc wireless network is an infrastructureless network composed of mobile hosts. The primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. Thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. A multicast scheme, On-Demand Multicast Routing Protocol (ODMRP), has been recently proposed for mobile ad hoc networks. ODMRP is a reactive (on-demand) protocol that delivers packets to destination(s) on a mesh topology using scoped flooding of data. We can apply a number of enhancements to improve the performance of ODMRP. In this paper, we propose a mobility prediction scheme to help select stable routes and to perform rerouting in anticipation of topology changes. We also introduce techniques to improve transmission reliability and eliminate route acquisition latency. The impact of our improvements is evaluated via simulation.     

一种无线传感器网路由算法的设计与实现

讨论了无线传感器网络的特殊性,分析了其路由算法的需求。借鉴Ad Hoc网中比较成熟的AODV(Ad Hoc按需平面距离矢量)协议和DSR(动态源路由)协议,采用了按需驱动的路由策略,优化了路由建立和维护算法,提出了RODR(简化的按需路由)协议。采用该路由算法的网络协议已在由ATmega128L微处理器和CC2420构成的节点机上实现,通过组网实验,初步验证了其可行性。