ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency and scalability, and avoids the burden—GPS support.     

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.     

自组网路由协议综述

自组网路由协议用于监控网络拓扑结构变化,交换路由信息,定位目的节点位置,产生、维护和选择路由,并根据选择的路由转发数据。本文综述了自组网路由协议研究方面的一些最新工作,描述了设计自组网路由协议所面临的问题,并着重对该研究开展以来所提出的各种主要协议进行了对比、分析和分类阐述,为进一步的研究提出了新的课题。     

无线自组织网络中一种拥塞意识的多径路由算法

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。     

Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 John Wiley & Sons, Ltd.     

On the Performance of the HSLS Routing Protocol for Mobile Ad hoc Networks

The area of mobile ad hoc networks has recently attracted much scientific interest, as a very appealing research area with many open issues and still unsolved problems. One of the main issues that concerns researchers is the development of routing algorithms that present good performance and face a hostile environment. Many routing protocols have been proposed, attempting to minimize routing overhead, or to reduce the energy consumed by nodes in order to maximize their lifetime. A critical issue, though, is the development of routing protocols that have the ability to maintain their good characteristics at an acceptable level as the network population grows, an ability known as scalability. FSR, ZRP, HierLS and FSLS protocol family are only a sample of scalable algorithms that have been proposed so far. The HSLS protocol is a member of the FSLS family that is proved to scale the best among the algorithms of the FSLS protocol family. In this paper we propose a mechanism to enhance the already good characteristics of the HSLS protocol aiming at the reduction of routing overhead of the original protocol. This new scheme, which we called AFHSLS, exploits the so-called border nodes, in order to deliver routing packets to their destinations. The new algorithm is proved through simulations to significantly reduce routing overhead, with minor or practically no effect on other metrics, such as packet delivery ratio and delay of data packets. Georgios Koltsidas received his Diploma in Electrical and Computer Engineering from Aristotle University of Thessaloniki, Greece in 2003.Currently, his is working towards his Ph.D. in the same department. His research interests include routing and medium access for ad hoc and sensor networks, as well as resource management in UMTS networks. Gerasimos Dimitriadis received his Diploma in electrical and computer engineering from the Aristotle University of Thessaloniki, Greece in 2001. He is currently working towards his Ph.D. degree in the same department. His research interests include medium access, as well as routing in multihop wireless networks. Fotini-Niovi Pavlidou holds a Diploma and a PhD in Telecommunications networks from the Aristotle University of Thessaloniki where she is currently engaged in teaching and research on Mobile Communications and Telecommunications Networks. Her research interests include traffic analysis and design of networks, performance evaluation and QoS studies of mobile satellite communications and multimedia applications over Internet. She is a permanent reviewer in IEEE journals, she has served as Guest-Editor of Special issues in International Journals like IJWIN, WPC etc. She is permanently included in the Program Committee of many IEEE conferences (PIMRC, GLOBECOM, VTC'2001, ISSSTA'2000). She is involved in many European Projects (research or Education): Telematics Applications (INTERVUSE, ATTACH, etc), IST (ISMAEL,B-Bone, SatNEx, OPERA, etc), Tempus programs on Wireless Systems for Albania, Bulgaria, Poland. She is a Senior Member of IEEE (Communications and Vehicular Technology Society), currently chairing the Joint VTS & AES Greece Chapter (http://newton.ee.auth.gr/ieee)     

移动Ad hoc网络路由协议标准

通过重点说明互联网工程任务组(IETF)已通过的两个移动Ad hoc网络路由协议标准,使得相关工程人员在对应用于此种网络的路由协议有一个整体认识基础之上,进一步加深对移动Ad hoc网络原理的理解.     

MERIT: A Scalable Approach for Protocol Assessment

MERIT is a framework that can be used to assess routing protocols in mobile ad hoc networks (manets). It uses the novel concept of a shortest mobile path (SMP) in a mobile graph, a generalization of the shortest path problem for mobile environments. As a measure for routing protocol assessment, we propose the mean ratio of the cost of the route used by a protocol to the cost of the optimal mobile path for the same network history. The cost reflects that the route used in a session can change over time because of network dynamics such as topology changes. The aim is for the ratio to be an abstract, inherent measure of the protocol that is as implementation-independent as possible. The MERIT spectrum, which is the ratio expressed as the function of some parameters of interest, is a characterization of protocol effectiveness. MERIT, for MEan Real vs. Ideal cosT, provides a scalable assessment framework: rather than comparing performance measures of different protocols directly, we compare a protocol to the optimal solution. That is, rather than forcing the comparison to be in the same system, it is done once for each protocol in its own environment. Furthermore, we show that there is an efficient algorithm to solve the underlying SMP problem for important cases, making the approach practically feasible. We also investigate generalizations of and extensions within the MERIT framework. We show that the MERIT framework is rich, with much wider generality and potential applicability than assessing routing protocols.     

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.     

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.     

电力通信PCM组网方式研究

基于64k通道的PCM业务,是现有电力通信网最常见的接入层业务,结合地区PCM组网情况,提出应用VPN技术进行组网,解决了基于HDLC组网时故障无法监测定位的问题,为PCM业务的可靠运行奠定了坚实的基础。     

移动Ad hoc网络基于干扰和连通度的路由协议

移动Ad hoc网络中,节点随机移动会引起通信链路频繁断开,从而导致路由失效,带来大量的路由重建与路由发现,耗费了有限的网络资源。传统按需路由中,采用简单的洪泛进行路由发现,路由请求包的盲目转发会带来大量不必要的冗余转发,造成广播风暴问题。此外,大量的数据包同时发送也会对彼此的传输造成干扰,增加数据包冲突概率。针对这种情况,本文提出一种基于干扰和连通度的路由协议,该协议结合节点的连通度和潜在干扰设计转发概率,不仅减少了路由请求包的传播范围,还减少了路由请求包的冲突概率,提高了传输成功率。仿真结果表明,本文设计的方案在减少路由开销的同时,有效提高了数据包投递率,从而提高了路由性能。     

一种节省能量的移动Ad Hoc网络组播选路协议

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

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.     

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.     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…     

移动Ad hoc网络按需路由协议中的虫洞问题研究

由于移动Ad hoc网络具有动态变化的特性以及自组织和多跳性的特点,更容易遭受多种恶意攻击。其中虫洞攻击就是最严重的一种攻击。本文详细剖析了虫洞问题,在总结已有解决方案的基础上提出了一种简洁的解决方案。此方案利用路由发现过程中中间结点计算的MAC值以及邻居维护机制提供的认证信息一起能够很好的抵抗虫洞攻击,提高了路由协议的安全性。     

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.

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

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

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.