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网络组播选路协议都滑考虑如何有效使用电池能量的问题，本文提出了一种节省能量组播选路协议（E^2MRP),E^2MRP协议的两个主要特征是：（1）在创建和维护中继组（RG）的过程中交替采用分组平均能量消耗最少和最大节点花费最小两种标准，（2）采用基于图的组播结构，本文通过仿真分析大大降低了节点的能量消耗，特别是在节移动性较低，组播成员较少时更是如此。     

GMZRP: Geography-aided Multicast Zone Routing Protocol in Mobile Ad Hoc Networks

This paper presents the design and evaluation of a highly efficient on-demand multicast routing protocol for mobile ad hoc networks (MANETs). The protocol, called Geography-aided Multicast Zone Routing Protocol (GMZRP), eliminates as much as possible duplicate route queries by using a simple yet effective strategy for propagating the multicast route request (MRREQ) packets. GMZRP is the first hybrid multicast protocol taking the advantages of both topological routing and geographical routing. It partitions the network coverage area into small zones and guarantees that each geographic zone is queried only once. GMZRP maintains a multicast forwarding tree at two levels of granularities, i.e., the zone granularity and the node granularity. By doing this, it can easily handle route breakage since the zone level information can help recover the link failure at the node level. The results of the performance evaluation of GMZRP using simulation show that, comparing with the well-known multicast protocol ODMRP (On-Demand Multicast Routing Protocol), GMZRP has much lower protocol overhead in terms of query packets and, meanwhile, achieves competing packet delivery ratio and shorter delivery latency.

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.     

An On-Demand Routing Protocol with Backtracking for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Communication between non-neighboring nodes requires a multi-hop routing protocol to establish a route. But, the route often breaks due to mobility. The source must rediscover a new route for delivering the data packets. This wastes the resources that are limited in MANET. In this paper, a new on-demand routing protocol is proposed, named on-demand routing protocol with backtracking (ORB), for multi-hop mobile ad hoc networks. We use the multiple routes and cache data technique to reduce the rediscovery times and overhead. After executing the route discovery phase, we find out a set of nodes, named checkpoint, which has the multiple routes to the destination. When a checkpoint node receives a data packet, it caches this data packet in its buffer within a specific time period. When a node detects a broken route during the data packets delivery or receives an error packet, it will either recover the broken route or reply the error packet to the source. If a node can not forward the data packet to the next node, it replies an error packet to the source. This packet is backtracking to search a checkpoint to redeliver the data packet to the destination along other alternate routes. The main advantage of ORB is to reduce the flooding search times, maybe just delay and cost while a route has broken. The experimental results show that the proposed scheme can increase the performance of delivery but reduce the overhead efficiently comparing with that of AODV based routing protocols. Hua-Wen Tsai received the B.S. degree in Information Management from Chang Jung Christian University, Taiwan, in June 1998 and the M.B.A. degree in Business and Operations Management from Chang Jung Christian University, Taiwan, in June 2001. Since September 2001, he has been working towards the Ph.D. degree and currently is a doctoral candidate in the Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan. His research interests include wireless communication, ad hoc networks, and sensor networks. Tzung-Shi Chen received the B.S. degree in Computer Science and Information Engineering from Tamkang University, Taiwan, in June 1989 and the Ph.D. degree in Computer Science and Information Engineering from National Central University, Taiwan, in June 1994. He joined the faculty of the Department of Information Management, Chung Jung University, Tainan, Taiwan, as an Associate Professor in June 1996. Since November 2002, he has become a Full Professor at the Department of Information Management, Chung Jung University, Tainan, Taiwan. He was a visiting scholar at the Department of Computer Science, University of Illinois at Urbana-Champaign, USA, from June to September 2001. He was the chairman of the Department of Information Management at Chung Jung University from August 2000 to July 2003. Since August 2004, he has become a Full Professor at the Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan. Currently, he is the chairman of the Department of Information and Learning Technology, National University of Tainan. He co-received the best paper award of 2001 IEEE ICOIN-15. His current research interests include mobile computing and wireless networks, mobile learning, data mining, and pervasive computing. Dr. Chen is a member of the IEEE Computer Society. Chih-Ping Chu received the B.S. degree in agricultural chemistry from National Chung Hsing University, Taiwan, the M.S. degree in computer science from the University of California, Riverside, and the Ph.D. degree in computer science from Louisiana State University. He is currently a Professor in the Department of Computer Science and Information Engineering of National Cheng Kung University, Taiwan. His current research interests include parallel computing, parallel processing, component-based software development, and internet computing.     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.     

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.     

一种基于迁移可测度的移动自组织网路由模型

 本文利用链路状态有效估测端到端路径的可达性。路由模型给出最近时间内,任意两点分组传输的迁移可测度;节点根据其邻节点的迁移可测度制定组合策略,计算组合迁移可测度,选取最优中继组合完成分组传输。仿真实验表明,该路由模型既可有效控制分组副本数目,又可获得较高的分组到达率。     

Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks

Considering the characters of dynamic topology and the imprecise state information in mobile ad hoc network,we propose a Fuzzy Logic QoS Dynamic Source Routing(FLQDSR)algorithm based on Dynamic Source Routing(DSR)protocol while adopting fuzzy logic to select the appropriate QoS routing in multiple paths which are searched in parallel.This scheme considers not only the bandwidth and end-to-end delay of routing,but also the cost of the path.On the otherhand the merit of using fuzzy logic is that it can be implemented by hardware.This makes the realization of the schemeeasier and faster.However our algorithm is based on DSR,the maximal hop count should be less than 10,i.e.,the scaleof mobile ad hoc network should not be very large.Simulation results show that FLQDSR can tolerate a high degree of in-formation imprecision by adding the fuzzy logic module which integrates the QoS requirements of application and the rout-ing QoS parameters to determine the most qualified one in every node.     

AMRoute: Ad Hoc Multicast Routing Protocol

The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree. Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate domains with different unicast protocols. Certain tree nodes are designated by AMRoute as logical cores, and are responsible for initiating and managing the signaling component of AMRoute, such as detection of group members and tree setup. Logical cores differ significantly from those in CBT and PIM-SM, since they are not a central point for data distribution and can migrate dynamically among member nodes. Simulation results (using ns-2) demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.     

An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks

A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.     

GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. One prospective direction to assist routing in such an environment is to use location information provided by positioning devices such as global positioning systems (GPS). In this paper, we propose a new routing protocol called GRID, which tries to exploit location information in route discovery, packet relay, and route maintenance. Existing protocols, as compared to ours, are either not location-aware or partially location-aware in that location knowledge is not fully exploited in all these three aspects. One attractive feature of our protocol is its strong route maintenance capability – the intermediate hosts of a route can perform a handoff operation similar to that in cellular systems when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to host mobility. Simulation results show that our GRID routing protocol can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.     

A Power-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks With Mobility Prediction

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e., position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). Each destination node collects several feasible routes and then selects the path with the longest RET value as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV (Royer, E. M. & Perkins, C. E. (1999). In Proceedings of the ACM MOBICOM, pp. 207–218, August 1999.) and RMAODV (Baolin, S. & Layuan, L. (2005). In Proceeding of the 2005 IEEE International symposium on microwave antenna, propagation and EMC technologies for wireless communications, Vol. 2, pp. 1514–1517, August 2005.).     

Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks

Efficient routing and medium access control (MAC) are very important for Mobile Ad hoc Networks (MANETs). Most existing routing and MAC protocols consider homogeneous ad hoc networks, in which all nodes are modeled as the same, i.e., they have the same communication capabilities and characteristics. Although a homogeneous network model is simple and easy to analyze, it misses important characteristics of many realistic MANETs such as military battlefield ad hoc networks. In addition, a homogeneous ad hoc network suffers from poor performance and scalability. In many ad hoc networks, multiple types of nodes do co-exist; and some nodes have larger transmission power, higher transmission data rate, and better processing capability, are more reliable and robust than other nodes. Hence, a hybrid network model is more realistic and provides many advantages for designing better routing and MAC protocols. In this paper, we present a new routing protocol called Hybrid Routing, which is specifically designed for hybrid MANETs. In addition, a novel MAC protocol is jointly designed for hybrid MANETs. Extensive simulations demonstrate that the proposed routing MAC protocols have very good performance.

On Address Privacy in Mobile Ad Hoc Networks

The network addresses of principals in a mobile ad hoc network (MANET) are conventionally assumed to be public information. This may cause devastating consequences for MANETs deployed in hostile environments. For example, attackers can easily locate a target principal based his known network address and then launch a pinpoint attack. This paper identifies address privacy as a new security requirement to prevent attackers from ascertaining network addresses of MANET principals. We further present Swarms, the first solution to satisfying this requirement. Swarms eliminates the conventionally explicit one-on-one mappings between MANET principals and network addresses and allows any two principals to communicate while blind to each other’s address. We quantitatively measure the address privacy offered by Swarms via an entropy-based information-theoretic metric.

移动Ad Hoc网络的一种跨层功率控制路由协议

移动ad hoe网络中通信终端能量有限,但在许多应用场景,尤其是战场环境下,节点能量消耗较大,因此采用有效的功率控制策略非常重要.利用信道增益的对称性,在AODV协议的基础上提出了一种不依赖于地理位置信息的跨层功率控制路由协议PBAODV,仿真表明该协议在不影响其他网络性能指标的前提下,有效的降低了系统整体功耗.     

Ad hoc网络中的路由技术

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

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

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

A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links

Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modifications to distance vector based routing algorithms to make them work in ad hoc networks with unidirectional links. For a network of n nodes, neighbors exchange n×n matrices to propagate routing information. This results in loop-free routes.     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.