一种改进的多跳分组无线网路由协议

对于多跳分组无线网来说,路由协议非常重要.而传统的主动式路由、按需路由和混合路由由于自身的缺陷,都不能保证多跳分组无线网传输的可靠性.为了适应网络拓扑不断变化的客观环境,提高数据通信的可靠性,提出了一种相邻矩阵路由协议,它克服了传统路由协议的缺点,大大提高了多跳分组无线网的链路性能.     

Ad hoc网络路由协议分析

Ad hoc无线网络是一组具有路由和转发功能的移动节点组成的一个多跳的临时性自治系统，是一种无中心的无线网络。现有的主动路由协议或者按需路由协议都不能很好地满足Ad hoc网络的需要。在简要介绍现有的路由协议后，分析了基于能量的路由协议，这几种路由协议增强了Ad hoc无线网络的性能。最后介绍了路由维护模型，它在路由维护中利用切换技术使路由的能量消耗值最小。     

移动代理技术在Ad Hoc无线网络中的应用研究

Ad Hoc无线网络是一组具有路由和转发功能的移动节点组成的一个多跳的临时性自治系统,是一种无中心的无线网络。现有的主动路由协议或者按需路由协议都不能很好地满足Ad Hoc网络的需要。介绍了Ad Hoc无线移动网络和移动代理技术。在分析了现有的2种路由协议后,提出了在按需路由协议中加入移动代理技术来增强Ad Hoc无线网络的性能。在这些结果的基础上,提出了移动代理通信协议。     

Ad Hoc 网络按需路由协议性能分析

无线移动Ad Hoc网络作为可移动分布式多跳无线网络，没有预先确定的网络拓扑或网络基础设施以及集中控制。为了在这样的网络中促进通信，路由协议主要用于在节点之间发现路径。Ad Hoc网络路由协议的主要目的是网络拓扑的动态变化任意两个节点之间建立一个使得通信总费用和带宽消费最少的正确和有效的通信路径。使用OPNET仿真软件对AODV、DSR协议这两种典型无线移动Ad Hoc网络按需路由协议的参数和性能进行了详细比较和分析。     

移动Ad hoc网络路由协议FSR研究

随着无线通信技术的发展和移动终端性能的提高，Ad hoc的应用越来越广泛。无线Ad hoc是一种不依赖于任何基础设施，无中心自组织的多跳无线网络。本文从Ad hoc网络的特点出发，在分析当前路由协议设计思想的基础上，对Ad hoc的路由协议FSR进行了研究。     

无线Mesh网络路由协议研究

无线Mesh网络WMN（wireless mesh networks）是一种新型的无线网络，它融合了无线局域网（WLAN）和Ad Hoc网络的优势，成为宽带接入的一种有效手段。首先介绍了无线Mesh网的网络结构和特点．并在此基础上讨论了无线Mesh网络对路由协议的要求。无线Mesh网络的路由算法是Mesh领域的研究难点，通过分析比较4种针对WMN的路由协议，总结了现有的路由协议的优缺点，并对今后的研究方向做出了展望。     

DSR的一种自适应路由自动缩短机制

动态源路由协议是无线自组织网络众多路由协议中被广泛关注的一种按需路由协议，目前，关于该协议的优化措施有很多。本文先分析了动态源路由协议的一种优化机制——路由自动缩短，该机制能动态缩短处于工作状态路由的跳数，但不保证缩短路由的质量，在此基础上，提出一种自适应路由自动缩短机制，新机制既可缩短路由．又能保证缩短路由质量．理论分析及仿真结果表明，自适应路由缩短机制的各项性能优于原路由缩短机制。     

移动Ad hoc网络路由协议FSR研究

随着无线通信技术的发展和移动终端性能的提高,Ad hoc的应用越来越广泛。无线Ad hoe是一种不依赖于任何基础设施,无中心自组织的多跳无线网络。本文从Ad hoc网络的特点出发,在分析当前路由协议设计思想的基础上,对Ad hoc的路由协议FSR进行了研究。     

跳频分组无线网的路由算法分析

跳频分组无线网抗干扰性好,保密性强,广泛应用于战术通信系统。讨论了几种跳频分组无线网的路由选择算法,着重分析了针对传输多类型分组跳频网的ALR路由算法,并将此路由算法的性能与DAR算法的性能进行了比较,证实了该算法在吞吐量、端-端正确传输率等方面都优于传统的方法。     

Ad hoc网络路由问题的研究

随着无线网络的广泛应用，设计一种有效安全的路由协议是目前亟待研究的重要课题。Ad hoc的应用产生了传统网络所未遇到过的安全问题。研究了目前常见的标准路由算法，分析了发生在路由层的攻击手段，阐述了几种路由安全机制。     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

Improving UDP and TCP performance in mobile ad hoc networks withINSIGNIA

There is a growing need to provide better service differentiation in mobile ad hoc networks; however, this is challenging. These networks are characterized as being multihop in nature where the wireless topology that interconnects mobile hosts/routers can change rapidly in unpredictable ways or remain relatively static over long periods of time. Power and bandwidth constrained, mobile ad hoc networks typically only support best effort communications where the transport protocol's “goodput” is often lower than the maximum radio transmission rate after encountering the effects of multiple access, fading, noise, and interference. We evaluate three routing protocols with INSIGNIA, an in-band signaling system that supports adaptive reservation-based services in mobile ad hoc networks. INSIGNIA represents a general-purpose approach to delivering quality of service in mobile ad hoc network supporting “operational transparency” between a number of IETF mobile ad hoc network routing protocols that include Ad Hoc On-Demand Distance Vector, Dynamic Source Routing, and the Temporally Ordered Routing Algorithm. We evaluate the performance gains delivered when using INSIGNIA with these MANET routing protocols in support of UDP and TCP traffic. The INSIGNIA ns-2 code used for the study reported in this article is available from the Web at comet.columbia.edu/insignia     

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     

移动自组网QoS路由协议研究

移动自组网是由一组带有无线收发装置的移动节点组成的一个多跳的临时性的自治系统。随着无线通信中多媒体业务的增加,在移动自组网中提供QoS(Quality of Sevice服务质量)保障具有越来越重要的意义,而QoS路由技术则是其中的核心技术和热点问题。文章指出移动自组网QoS路由的困难,对移动自组网典型QoS路由协议进行了详细的分析与比较,并对几种较新的移动自组网QoS路由协议进行了介绍,末了对移动自组网QoS路由协议的发展进行了展望。     

Ad Hoc网络的安全问题和安全策略

AdHoc网络作为一种无线移动网络正成为网络研究,特别是军事研究的一个热点。由于AdHoc网络的特点,其安全问题和安全策略正受到越来越广播的重视。文中介绍了AdHoc网络的特点,论述了AdHoc网络和路由协议的安全问题,最后讨论并提出了AdHoc网络的一些安全策略。     

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.     

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     

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.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

Secure routing in mobile wireless ad hoc networks

We discuss several well known contemporary protocols aimed at securing routing in mobile wireless ad hoc networks. We analyze each of these protocols against requirements of ad hoc routing and in some cases identify fallibilities and make recommendations to overcome these problems so as to improve the overall efficacy of these protocols in securing ad hoc routing, without adding any significant computational or communication overhead.