Triangle-based routing for mobile ad hoc networks

Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.     

Survey of multipath routing protocols for mobile ad hoc networks

This survey investigates multipath routing protocols for mobile ad hoc networks (MANETs). The main objectives of multipath routing protocols are to provide reliable communication and to ensure load balancing as well as to improve quality of service (QoS) of MANETs. These multipath protocols are broadly classified into five categories based on their major goals. The goals are to improve delay, provide reliability, reduce overhead, maximize network life and support hybrid routing. Multipath routing protocols address issues such as multiple paths discovery and maintaining these paths. Issues, objectives, performances, advantages and disadvantages of these protocols are investigated and summarized. A checklist is provided as a guideline so that a network designer can choose an appropriate multipath routing protocol to meet the network's application objectives.     

Research on multicast routing protocols for mobile ad-hoc networks

A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to extend mobility into the realm of autonomous, mobile and wireless domains, where a set of nodes form the network routing infrastructure in an ad-hoc fashion. The majority of applications of MANETs are in areas where rapid deployment and dynamic reconfiguration are necessary and wired network is not available. These include military battlefields, emergency search, rescue sites, classrooms and conventions, where participants share information dynamically using their mobile devices. These applications lend themselves well to multicast operations. In addition, within a wireless medium, it is crucial to reduce the transmission overhead and power consumption. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Hence, reliable multicast routing plays a significant role in MANETs. However, to offer effective and reliable multicast routing is difficult and challenging. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and employ different recovery mechanisms. To provide a comprehensive understanding of these multicast routing protocols and better organize existing ideas and work to facilitate multicast routing design for MANETs, we present the taxonomy of the multicast routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate multicast routing protocols for their work.     

移动Ad hoc网络的一种安全路由协议

移动ad hoc网络的开放、动态、分布式特性对网络安全问题提出了巨大挑战。本文指出了几种典型安全路由协议的缺陷,并提出了一种新的安全路由协议AMDSR。它采用对路由请求消息进行逐跳认证、端-端完整性检查和监听的方法来扩展DSR协议的安全功能,并确保建立最快速的路径。AMDSR监听邻居结点广播的路由消恩而不似传统协议混杂收听所有消息,具有更好的适用性。     

Markovian-based traffic modeling for mobile ad hoc networks

Mobile ad hoc networks (MANETs) show very significant difference with respect to other computer networks due to the presence of extremely large packet loss bursts. The development of protocols for mobile ad hoc networks, especially multimedia protocols, require extensive evaluation either through simulation or real-life tests. Such testing consumes a great amount of resources both in terms of time and trace file sizes. Therefore, finding efficient means of reducing the amount of data that is stored and processed is quite important to accelerate the evaluation of different audio/video streaming applications. If, moreover, we are able to model the loss pattern experienced, we can further accelerate the evaluation process.In this work we propose two models based on hidden Markov chains that are able to grasp both packet arrivals and packet loss patterns in MANETs. A simpler two-state model is proposed to model losses when proactive routing protocols are used, while a more complex three-state model is proposed for reactive routing protocols. We also introduce a new set for packet loss pattern measurements that can be of interest for the evaluation of audio/video streaming applications.Experimental results show that the proposed models can adequately reproduce extremely long packet loss patterns, typical of MANET environments, with a high degree of accuracy. Overall, we find that the proposed models are able to significantly reduce both the simulation time and the trace file sizes required.     

一种UC匿名的移动自组网概率组播策略

鉴于现有移动自组网匿名路由协议不能为组播提供匿名通信支持,而只能提供特定非形式化的匿名性分析,提出了一种UC(universally composable)匿名的移动自组网概率组播策略.在路由发现阶段,采用一次性密钥对保持路径记录私密.在数据分组传输阶段,采用Gossip机制、DH秘密路径及Bloom Filter编码实现匿名源路由组播.最后,采用UC框架分析了协议的匿名性,并对协议的性能进行了仿真.分析与仿真结果表明,该策略在实现匿名性的同时还提供了较好的可靠性.     

Jumping ant routing algorithm for sensor networks

Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals – need to ensure they can know the current location of vital but mobile assets. Besides, the sensor node on each device should inform us whether those relative equipments are functional or does not work at all in a hazardous environment, so that vital equipments can be maintained or fixed beforehand. A sensor network is a potential solution to this kind of application, because every node can be found through the routing processes. Due to its working environment and the mobility of sensor node, this kind of sensor network is very similar to MANETs (Mobile Ad-hoc Networks). This study proposes a jumping ant routing algorithm (JARA) which combines the advantages of reactive and proactive routing to speed up the route discovery time and reduce the route discovery overhead in sensor network.     

A new probabilistic broadcasting scheme for mobile ad hoc on-demand distance vector (AODV) routed networks

Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, such as route discovery and sending information messages. The direct method to perform broadcast is a simple flooding, which can decrease the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper presents the Smart Probabilistic Broadcasting (SPB) as a new probabilistic method to improve the performance of existing on-demand routing protocols by reducing the RREQ overhead during the rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead, while achieving low normalized routing load, compared to AODV that uses fixed probability and blind flooding. Simulation experiments have been conducted to examine our proposed scheme. The results show that SPB outperforms its counterparts and opens up a promising framework towards optimal probabilistic broadcasting.     

IE2M: Design of intellectual energy efficient multicast routing protocol for ad-hoc network

In this paper, an intellectual energy efficient multicast routing protocol is proposed. It achieves enhanced performance over On-Demand Multicast Routing Protocol (ODMRP). The proposed protocol finds energy efficient multicast routes from source node to a group of receivers. Multicast mesh creation involves two phases: a Join Query (J-Q) phase and a Join Reply (J-R) phase. The J-Q phase initiates a route discovery process to find routes of the multicast group. In J-R phase, different routes of the multicast groups are set up. In the proposed protocol, we modify ODMRP and introduce fuzzy inference system to deal with imprecise and partial information during the route discovery phase. The decision maker uses two fuzzy variables such as energy and distance for evaluating reward as an output parameter of each multicast route. This output parameter helps to distinguish different multicast route and it also helps to reduce the effect of mutual interference between routes. The proposed protocol is simulated using the NS-2 simulator. The performance of the proposed protocol is compared with existing multicast routing protocols, and results outperform existing protocols in terms of several network metrics.     

Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks

In this paper, a dynamic fuzzy energy state based AODV (DFES-AODV) routing protocol for Mobile Ad-hoc NETworks (MANETs) is presented. In DFES-AODV route discovery phase, each node uses a Mamdani fuzzy logic system (FLS) to decide its Route REQuests (RREQs) forwarding probability. The FLS inputs are residual battery level and energy drain rate of mobile node. Unlike previous related-works, membership function of residual energy input is made dynamic. Also, a zero-order Takagi Sugeno FLS with the same inputs is used as a means of generalization for state-space in SARSA-AODV a reinforcement learning based energy-aware routing protocol. The simulation study confirms that using a dynamic fuzzy system ensures more energy efficiency in comparison to its static counterpart. Moreover, DFES-AODV exhibits similar performance to SARSA-AODV and its fuzzy extension FSARSA-AODV. Therefore, the use of dynamic fuzzy logic for adaptive routing in MANETs is recommended.     

The performance impact of traffic patterns on routing protocols in mobile ad hoc networks

As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. The growing set of diverse applications developed for MANETs pose far more complex traffic patterns than the simple one-to-one traffic pattern, and hence the one-to-one traffic pattern widely used in previous protocol studies has become inadequate in reflecting the relative performance of these protocols when deployed to support these emerging applications.As a first step towards effectively supporting newly developed and future diverse MANET applications, this paper studies the performance impact of diverse traffic patterns on routing protocols in MANETs. Specifically, we propose a new communication model that extends the previous communication model to include a more general traffic pattern that varies the number of connections per source node. We study the performance impact of traffic patterns on various routing protocols via detailed simulations of an ad hoc network of 112 mobile nodes. Our simulation results show that many of the conclusions drawn in previous protocol comparison studies no longer hold under the new traffic patterns. These results motivate the need for performance evaluation of ad hoc networks to not only include rich and diverse mobility models as has been done in the past but also include diverse traffic patterns that stress a wide set of protocol design issues.     

QoS routing with traffic distribution in mobile ad hoc networks

Mobile ad hoc networks (MANETs) follow a unique organizational and behavioral logic. MANETs’ characteristics such as their dynamic topology coupled with the characteristics of the wireless communication medium make Quality of Service provisioning a difficult challenge. This paper presents a new approach based on a mobile routing backbone for supporting Quality of Service (QoS) in MANETs. In real-life MANETs, nodes will possess different communication capabilities and processing characteristics. Hence, we aim to identify those nodes whose capabilities and characteristics will enable them to take part in the mobile routing backbone and efficiently participate in the routing process. Moreover, the route discovery mechanism we developed for the mobile routing backbone dynamically distributes traffic within the network according to current network traffic levels and nodes’ processing loads. Simulation results show that our solution improves network throughput and packet delivery ratio by directing traffic through lowly congested regions of the network that are rich in resources. Moreover, our protocol incurs lower communication overheads than AODV (ad hoc on-demand distance vector routing protocol) when searching for routes in the network.     

移动自主网络多路径路由技术研究进展

MANET具有许多与传统有线网络截然不同的特性,包括移动性、有限的带宽资源、易变的网络拓扑等,因而就需要一种新的路由协议来解决这些缺点。大多数已提出的MANET路由协议没有考虑公平性,它们倾向于把重的负载分布到源一目的对的路径最短的主机上。结果,超重负载的主机会迅速耗尽能源,这将导致网络分离,应用会话失败。为解决
决这个问题,众多专家学者提出用多路径的方法来承担路由任务。本文回顾了MANET多路径路由技术的研究进展,并对有关路由协议进行了评述,比较了各自的贡献和不足;最后对路由协议研究的发展方向进行了展望。     

Influence of mobility models on the performance of data dissemination and routing in wireless mobile ad hoc networks

Many routing protocols are proposed in the literature on mobile ad hoc networks (MANETs). Some of those protocols which have been investigated under different assumptions are unable to capture the actual characteristics of MANETs. Therefore, there is a necessity to investigate the performance of MANETs under a number of different protocols with various mobility models. This paper evaluates the performance of the single path routing protocols (AODV, DSR, and DSDV), in the presence of different network loads and differing mobility models. Our findings show that DSR routing protocol has a better performance compared to other protocols with respect to various metrics.     

SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks

Data replication, as an essential service for MANETs, is used to increase data availability by creating local or nearly located copies of frequently used items, reduce communication overhead, achieve fault-tolerance and load balancing. Data replication protocols proposed for MANETs are often prone to scalability problems due to their definitions or underlying routing protocols they are based on. In particular, they exhibit poor performance when the network size is scaled up. However, scalability is an important criterion for several MANET applications. We propose a scalable and reactive data replication approach, named SCALAR, combined with a low-cost data lookup protocol. SCALAR is a virtual backbone based solution, in which the network nodes construct a connected dominating set based on network topology graph. To the best of our knowledge, SCALAR is the first work applying virtual backbone structure to operate a data lookup and replication process in MANETs. Theoretical message-complexity analysis of the proposed protocols is given. Extensive simulations are performed to analyze and compare the behavior of SCALAR, and it is shown to outperform the other solutions in terms of data accessibility, message overhead and query deepness. It is also demonstrated as an efficient solution for high-density, high-load, large-scale mobile ad hoc networks.     

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).     

Cryptographic Versus Trust-based Methods for MANET Routing Security

Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In the process, however, these protocols created new avenues for denial of service (DoS). Consequently, the trade-off between security strength and DoS vulnerability has emerged as an area requiring further investigation. It is believed that different trust methods can be used to develop protocols at various levels in this trade-off. To gain a handle on this exchange, real world testing that evaluates the cost of existing proposals is necessary. Without this, future protocol design is mere speculation. In this paper, we give the first comparison of SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively. We provide performance comparisons on actual resource-limited hardware. Finally, we discuss design decisions for future routing protocols.     

Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks

In mobile ad hoc networks (MANETs), flooding is a required message dissemination technique for network-wide broadcast. The conventional blind flooding algorithm causes broadcast storm problem, a high number of unnecessary packet rebroadcasts thus resulting in high contention and packet collisions. This paper proposes a new probabilistic approach that dynamically fine-tunes the rebroadcasting probability of a node for routing request packets (RREQs) according to the number of neighbour nodes. We evaluate the performance of the proposed approach for the ad hoc on demand distance vector (AODV) routing protocol and compared against the blind flooding, fixed probabilistic and adjusted probabilistic flooding [L.M.M.M. Bani-Yassein, M. Ould-Khaoua et al., Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks, International Journal of Wireless Information Networks 13(2) (2006) 127–140; M.B. Yassein, M.O. Khaoua et al., Improving route discovery in on-demand routing protocols using local topology information in MANETs, Proceedings of the ACM international workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks, Terromolinos, Spain, ACM Press, 2006, pp. 95–99.] approaches. The simulation results show that our proposed approach demonstrates better performance than blind flooding, fixed probabilistic and adjusted flooding approaches.     

基于稳定链路MANETs路由协议的研究现状

移动自组网(MANETs,mobile Ad Hoc networks)中节点随机移动,且无固定基础设施、节点能量受限等诸多的因素影响了链路的稳定性,给路由协议提出了挑战.目前,研究人员对基于稳定链路的路由协议进行了深入的研究,并提出不同的基于稳定链路的路由协议.为此,首先对现有的基于稳定链路的路由协议进行分类,然后,分析了每类的经典协议的性能,最后,讨论基于稳定链路的路由协议的未来发展方向.     

Automating the security analysis process of secure ad hoc routing protocols

Conventional security property evaluation approaches for ad hoc network routing protocols do not provide an automated or exhaustive capability. This paper provides an automated process to evaluate security properties in the route discovery phase for on-demand source routing protocols. For a given network topology, model checking is used to exhaustively evaluate protocol abstractions against an attacker attempting to corrupt the route discovery process. Additionally, topology reduction techniques are developed to reduce computational requirements while maintaining exhaustive analysis results.