Efficient Opportunistic Routing in Utility-Based Ad Hoc Networks

Due to resource scarcity, a paramount concern in ad hoc networks is utilizing limited resources efficiently. The self-organized nature of ad hoc networks makes the network utility-based approach an efficient way to allocate limited resources. However, the effect of link instability has not yet been adequately addressed in literature. To efficiently address the routing problem in ad hoc networks, we integrate the cost and stability into a network utility metric, and adopt the metric to evaluate the routing optimality in a unified, opportunistic routing model. Based on this model, an efficient algorithm is designed, both centralized and distributed implementations are presented, and extensive simulations on NS-2 are conducted to verify our results.     

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网络路由技术

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

无线Ad Hoc网络中的QoS路由协议

无线Ad Hoc网络的应用环境以及与Internet的互连都要求其必须提供一定的服务质量(QoS)保证,QoS路由技术是在无线Ad Hoc网络中实现QoS的重要方法。本文对近年来国内外在无线Ad Hoc网络中的QoS路由技术方面取得的研究成果进行了全面的概括总结和分类,对资源预留路由、多径路由和跨层优化路由3类QoS路由协议进行比较分析,并且提出了QoS路由技术亟待解决的问题和今后的发展方向。     

Routing in Sparse Vehicular Ad Hoc Wireless Networks

A vehicular ad hoc network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the market penetration rate of the wireless communication devices. In this paper, we use empirical vehicle traffic data measured on 1-80 freeway in California to develop a comprehensive analytical framework to study the disconnected network phenomenon and its network characteristics. These characteristics shed light on the key routing performance metrics of interest in disconnected VANETs, such as the average time taken to propagate a packet to disconnected nodes (i.e., the re-healing time). Our results show that, depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication (DSRC) technology, the network re-healing time can vary from a few seconds to several minutes. This suggests that, for vehicular safety applications, a new ad hoc routing protocol will be needed as the conventional ad hoc routing protocols such as Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) will not work with such long re-healing times. In addition, the developed analytical framework and its predictions provide valuable insights into the VANET routing performance in the disconnected network regime.     

无线adhoc网络中的多径源路由

本文针对无线ad hoc网络提出了一种基于DSR(动态源路由)的路由算法,多径源路由(MSR).MSR对DSR中的路由搜索和路由维护机制进行了扩展,用来解决多径路由问题.本文还提出,在多条路径之间基于测量的RTT进行负载分配.仿真结果表明,MSR在只增加少量网络开销的情况下,提高了TCP和UDP的投递率,降低了丢包率,并减少了端到端之间的延迟以及队列长度,从而有效地减少了网络拥塞.     

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.     

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

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

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

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

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.     

A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the ad hoc wireless network changes dynamically. Our simulation results show that the proposed approach outperforms a classical algorithm in terms of finding a small connected dominating set and doing so quickly. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.     

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

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

基于能量有效的Ad hoc无线网络路由协议的研究

Ad hoc是一种无固定基础设施的特殊无线网络,此网络中节点一般由电池供能,需要考虑能量有效因素来最大化网络生命周期.对各类基于能量有效的Ad hoc无线网络路由协议进行比较和分析,可以看出路由协议对能量优化有着显著作用.     

Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks

A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is possible. However, since there is no stationary infrastructure such as base stations, mobile hosts need to operate as routers in order to maintain the information about the network connectivity. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. In this paper, we study and compare the performance of the following routing protocols AODV, PAODV (preemptive AODV), CBRP, DSR, and DSDV. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP. PAODV has shown little improvements over AODV.     

一种无线Ad hoc网络中恶意程序的传播模型

提出了一种描述无线Ad hoc网络上恶意程序传播的模型,并通过仿真实验研究了恶意程序的传播行为.研究表明,无线Ad hoc网络中恶意程序的传播临界值明显高于Internet中恶意程序的传播临界值,并且恶意程序在无线网络中的传播速度远远低于它在Internet中的传播速度.同时,无线MAC协议的引入会影响恶意程序在Ad hoc网络中的传播特性.     

Survey of Secure Routing Protocols for Wireless Ad Hoc Networks

The mobile ad hoc network is a type of wireless network characterized by mobile nodes without a centralized administration. Frequent variations of the topology and the nature of the radio links have a negative impact on the stability of the links. Indeed, the link quality deteriorates rapidly and link breaks become frequent. To overcome these problems, new forms of routing protocols are used as the MultiPath routing. In addition, routing protocols require the knowledge of the nodes neighborhood to build and manage routes. The neighbor discovery process is performed by a Hello protocol. The Hello protocol typically involves several parameters such as the packet’s period; node’s transmit power, node’s position and node’s battery level. The purpose of this paper is to change the behavior of ad hoc On demand Multi-path Distance Vector (AOMDV) routing protocol by considering the density of the nodes as well as the interference of the neighboring nodes. This selection of paths goes through two stages. In the first step, we study the impact of the neighbor discovery process to select a set of paths having a minimum number of neighboring nodes to diminish contention problems and interference rate. In the second step, the Interference Ratio (IR) metric is used to select the paths in which the nodes are surrounded by a minimum of interference. We choose for our study two proposed approaches based on AOMDV routing protocol. The first is called AOMDV_neighbor and considers the density parameter as a path metric. The second is called AOMDV_neighbor_IR which considers the interference rate (IR) between each node and its neighborhood as a path metric. We evaluate the proposed routing protocols performance under various NS2 simulation scenarios in a shadowing environment.

     

Biological Swarm Intelligence Based Opportunistic Resource Allocation for Wireless Ad Hoc Networks

Particle swarm optimization (PSO) is one of the most important biological swarm intelligence paradigms. However, the standard PSO algorithm can easily get trapped in the local optima when solving complex multimodal problems. In this paper, an improved adaptive particle swarm optimization (IAPSO) is presented. Based on IAPSO, a joint opportunistic power and rate allocation (JOPRA) algorithm is proposed to maximize the sum of source utilities while minimize power allocation for all links in wireless ad hoc networks. It is shown that the proposed JOPRA algorithm can converge fast to the optimum and reach larger total data rate and utility while less total power is consumed by comparison with the original APSO. This thanks to the dynamic change of the maximum movement velocity of the particles, the use of the modified replacement procedure in constraint handling, and the consideration of the state of the optimization run and the population diversity in stopping criteria. Numerical simulations further verify that our algorithm with the IAPSO outperforms that with the original APSO.     

Density-Based Anycast: A Robust Routing Strategy for Wireless Ad Hoc Networks

Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing paradigm particularly suitable for wireless ad hoc networks. Instead of routing packets merely on proximity information to the closest member, density-based anycast routing considers the number of available anycast group members for its routing decision. We present a unified model based on potential fields that allows for instantiation of pure proximity-based, pure density-based, as well as hybrid routing strategies. We implement anycast using this model and simulate the performance of the different approaches for mobile as well as static ad hoc networks with frequent link failures. Our results show that the best performance lies in a tradeoff between proximity and density. In this combined routing strategy, the packet delivery ratio is considerably higher and the path length remains almost as low than with traditional shortest-path anycast routing.