一种能量感知的Ad Hoc网络路由协议

Ad Hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标.基于移动节点能量的不同级别,采取不同的转发策略,提出了一种基于能量感知的Ad Hoc网络路由协议--EARP.并与AODV协议进行了性能比较,仿真结果显示,EARP具有较低的能耗,较长的网络存活时间.     

Checkerboard-Like Routing Protocol for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms.     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

基于路径稳定性的Ad Hoc网络按需路由算法设计

鉴于Ad Hoc网络的高移动性,选择一条稳定的路径进行通信尤为重要.文章借鉴AODV按需路由的思想,提出了基于路径稳定性的路由算法PSR(Path Stable based on-demand Routing),通过引入路径有效因子PEF(Path Efficieney Factor)来考虑可行路径的稳定性问题,增强了所选路径的稳定性,减少了由于节点运动引起的链路断裂次数.性能分析和仿真结果表明,与AODV相比,PSR减少了开销,提高了效率,使得算法的性能得到了提升.     

Scalable Routing Protocol for Ad Hoc Networks

In this paper we present a scalable routing protocol for ad hoc networks. The protocol is based on a geographic location management strategy that keeps the overhead of routing packets relatively small. Nodes are assigned home regions and all nodes within a home region know the approximate location of the registered nodes. As nodes travel, they send location update messages to their home regions and this information is used to route data packets. In this paper, we derive theoretical performance results for the protocol and prove that the control packet overhead scales linearly with node speed and as N ^3/2 with increasing number of nodes. These results indicate that our protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Finally, we use simulations to validate our analytical model.     

Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks

Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential field method that dynamically eliminates the local maximum condition     

An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks

The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This paper contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective.     

Dynamic Relationship-Zone Routing Protocol for Ad Hoc Networks

A new dynamic relationship-zone routing protocol (DRZRP) for ad hoc networks is proposed. In this protocol, each node in the network establishes a neighboring-zone with a radius of ρ hops, and activates a relationship-zone according to the service request frequency and service hotspot condition. DRZRP establishes proactive routing for neighboring-zone and relationship-zone of the node, and the relationship-zone of the node can be dynamically maintained, including: initialization, relationship-zone activation, and relationship-zone inactivation. The simulation results are compared with LSR, ZRP and ZHLS protocols, and DRZRP greatly reduces the communication overhead of routing control messages and significantly improves the average delay of routing requests. The new protocol matches the service relationship among nodes in the network, and has comprehensive performance advantage in communication overhead and routing request delay, which improves the quality of network service.

     

无线Ad Hoc网络中一种基于DSR的QoS路由协议

QoS是无线Ad Hoc网络中的一个重要问题,而QoS路由技术是解决这一问题的关键技术之一.假定无线AdHoc网络中的每个节点的MAC子层能够提供一个参量,这个参量可以量化地表示该节点的忙闲状态,在这个假设的基础上,本文提出一种以DSR路由协议为基础的改进路由,在新的路由协议中,路由请求包中增加一个参量,用这个参量来表示路由请求包所经过的所有节点的状态总和,当路由请求包到达目的节点就找到了源节点到目的节点的路径,并且可以得到每条路径的状况.通过这些信息可以使得发现的路径是状况最好的路径,从而来满足QoS.     

一种适用于战术条件下的自组织网路由协议

应用于战术条件下的自组织网络,其拓扑具有长期稳定而短期突变的特性;其流量具有不均衡性,中心节点的流量比重较大.针对战术无线网络的这种特性设计了一种混合式路由协议(HRP),协议为近端节点采用先应式协议维护路由而为远端节点采用反应式协议维护路由,对远端节点的路由请求采用OLSR协议的MPR思想,限制反应式协议的路由开销.并且,在近端拓扑变化频度超过门限值后,发起针对繁忙节点的路由发现请求,保持到繁忙节点的路由常新,从而提高了路由命中率.仿真结果表明,应用HRP协议后,无论其选路质量还是应用层业务的时延和吞吐量指标都优于DSR和ZRP协议.     

Congestion Control Performance of R-DSDV Protocol in Multihop Wireless Ad Hoc Networks

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.     

A Novel Routing Protocol for Supporting QoS for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to lessen the influence of the fastchanging network topology, rapidly varying bandwidth information, and the increasing size of routing tables onquality of service routing. Based on DSDV (Destination-Sequenced Distance-Vector) routing protocol formaintaining up-to-date routing information, the related research has to update routing tables when networktopology changes; moreover, the routing tables must be updated periodically even though the networktopology has not changed. To put emphasis on QoS routing, they also have to exchange routing tables by thetime of bandwidth information changes. Furthermore, the size of routing tables increases with the numberof mobile nodes; therefore, the precious wireless bandwidth is wasted on transmitting the large-scalerouting tables. In this article, we propose an on-demand-based QoS routing protocol to mitigate theseproblems and to achieve the QoS requirement. The goal of this article is to discover an optimal routewith minimum time delay for transmitting real-time data from a source node hop by hop to adestination node under some predefined constraints. Our contributions are as follows: our researchprovides a rigorous bandwidth definition and bandwidth application, a broad view of bandwidth calculationand reservation, minimizing the size of control packets and the number of control packet transmissions,and an efficient QoS routing protocol.     

Regional Gossip Routing for Wireless Ad Hoc Networks

Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagated through the network unnecessarily despite various optimizations. Gossip based routing method has been used and re-investigated to reduce the number of messages in both wired networks and wireless ad hoc networks. However, the global gossiping still generates many unnecessary messages in the area that could be far away from the line between sender node and receiver node. We propose a regional gossip approach, where only the nodes within some region forward a message with some probability, to reduce the overhead of the route discovery in the network. We show how to set the forwarding probability based on the region and the network density both by theoretical analysis and by extensive simulations. Our simulations show that the number of messages generated using this approach is much less than the simple global gossiping method, which already saves many messages compared with global flooding. We expect that the improvement should be even more significant in larger networks.     

Ad hoc网络中的路由技术

Ad hoc网络是一些移动节点组成一个多跳的临时性无线自治系统，这种新型的通信网络具有动态变化的拓扑结构和分布控制的网络机制。文中针对Ad hoc网络作了简单的介绍并重点介绍了针对Ad hoc网络特性而提出的路由协议。     

Ad Hoc网络路由技术

无线自组织网络(Adhoc)是一个复杂的系统,其中路由协议是该领域中的研究热点。通过采用合理的路由技术,可使无线自组网具有更为灵活的组网方式,从而达到提升网络性能、减少网络开销等目的。通过与认知无线电(CR)技术、协同通信(CC)技术以及多输入多输出(MIMO)天线技术等物理层新技术的有效结合,可以大大改善Adhoc路由协议的性能。     

即时无线移动网络及相关路由协议

即时无线网络需要设置固定的路由设备,网络中的每一个移动终端都可以充当路由器,即时无线网络的路由协议包括路由表驱动型路由协议和源节点发起型路由协议。本文分别以无线路由协议和即时指令型距离向量路由协议对上述两类协议进行了详细讨论。     

Cross-Layer Congestion and Contention Control for Wireless Ad Hoc Networks

We consider joint congestion and contention control for multihop wireless ad hoc networks, where the goal is to find optimal end-to-end source rates at the transport layer and per-link persistence probabilities at the medium access control (MAC) layer to maximize the aggregate source utility. The primal formulation of this problem is non-convex and non-separable. Under certain conditions, by applying appropriate transformations and introducing new variables, we obtain a decoupled and dual-decomposable convex formulation. For general non-logarithmic concave utilities, we develop a novel dual-based distributed algorithm using the subgradient method. In this algorithm, sources at the transport layer adjust their log rates to maximize their net benefits, while links at the MAC layer select transmission probabilities proportional to their conceived contribution to the system reward. The two layers are connected and coordinated by link prices. Our solutions enjoy the benefits of cross-layer optimization while maintaining the simplicity and modularity of the traditional layered architecture.     

Predictive Congestion Control Protocol for Wireless Sensor Networks

Available congestion control schemes, for example transport control protocol (TCP), when applied to wireless networks, result in a large number of packet drops, unfair scenarios and low throughputs with a significant amount of wasted energy due to retransmissions. To fully utilize the hop by hop feedback information, this paper presents a novel, decentralized, predictive congestion control (DPCC) for wireless sensor networks (WSN). The DPCC consists of an adaptive flow and adaptive back-off interval selection schemes that work in concert with energy efficient, distributed power control (DPC). The DPCC detects the onset of congestion using queue utilization and the embedded channel estimator algorithm in DPC that predicts the channel quality. Then, an adaptive flow control scheme selects suitable rate which is enforced by the newly proposed adaptive backoff interval selection scheme. An optional adaptive scheduling scheme updates weights associated with each packet to guarantee the weighted fairness during congestion. Closed-loop stability of the proposed hop-by-hop congestion control is demonstrated by using the Lyapunov-based approach. Simulation results show that the DPCC reduces congestion and improves performance over congestion detection and avoidance (CODA) [3] and IEEE 802.11 protocols.     

移动自组网的CARPs协议分析

移动自组网备受关注的同时也暴露了其在某些方面的局限性,尤其是能量、带宽问题,因此有必要设计最佳路由协议来减少能量消耗、缩短路由、限制泛播,介绍了2种自适应的、无链接的路由协议及其子系统。当采用定向天线时,该协议能减少在分组传送过程中涉及的节点数量,因此减少了能量消耗,充分利用带宽。     

自适应速率需求的无线Ad hoc网络MAC协议

在802.11的基础上,从服务质量(QoS)中的速率需求角度出发,采取了跨层设计的方法,把应用层对数据传输速率的需求直接同MAC层中对无线信道的随机接入过程相结合,提出了一种自适应速率需求的Ad hoc无线网络MAC协议(Rate-requirement Aware Adaptive MAC Protocol,RAA-MAC).模拟实验的结果显示,与802.11协议相比,RAA-MAC在网络吞吐量、数据包延迟等性能上有较大提高.