Chapar: A Persistent Overlay Event System for MANETs

In this paper, we present Chapar, an event system designed for mobile ad hoc networks that supports the publish/subscribe model as well as point–to–point and point–to–multipoint message delivery. Chapar supports event persistency to resist transient disconnections and network partitioning. Following a cross-layer approach, Chapar is designed as an overlay network that uses Multipoint Relays (MPRs) defined in OLSR, as distributed brokers to disseminate the events in a mobile network. Chapar handles topology changes as it uses the underlaying OLSR routing protocol for message delivery. The implementation performance is promising in the sense that no extra signaling is generated for mobility support and the generated overlay traffic is considerably less than the underlying routing protocol traffic.     

HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks

This article reviews the hierarchical optimized link state routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this work a heterogeneous mobile ad hoc network is defined as a network of mobile nodes that are characterized by different communications capabilities, such as multiple radio interfaces. The article focuses on proposing the HOLSR protocol. The HOLSR mechanism is derived from the OLSR protocol; however, unlike OLSR, the HOLSR protocol takes advantage of different mobile node capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism.     

OLSR performance measurement in a military mobile ad hoc network

Wireless ad hoc networks are autonomous, self-configurating and adaptive. Thus, such networks are excellent candidates for military tactical networks, where their ability to be operational rapidly and without any centralized entity is essential. As radio coverage is usually limited, multihop routing is often needed; this is achieved by an ad hoc routing protocol supporting nodes mobility. In this paper, we present performance measurements of the Optimized Link State Routing (OLSR) routing protocol, having the status of IETF RFC. The measurements are performed at CELAR site on a platform representative of military scenarios in urban areas. This platform consists of ten routers, eight PDAs and laptops using a IEEE 802.11b radio interface and implementing OLSR v7. Some nodes are mobile within vehicles. The emphasis of the measurements is on the performance of the network (route repair, network convergence speed, user traffic performance) in presence of this mobility.     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

A heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks

A mobile ad hoc network does not require fixed infrastructure to construct connections among nodes. Due to the particular characteristics of mobile ad hoc networks, most existing secure protocols in wired networks do not meet the security requirements for mobile ad hoc networks. Most secure protocols in mobile ad hoc networks, such as secure routing, key agreement and secure group communication protocols, assume that all nodes must have pre‐shared a secret, or pre‐obtained public‐key certificates before joining the network. However, this assumption has a practical weakness for some emergency applications, because some nodes without pre‐obtained certificates will be unable to join the network. In this paper, a heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks is proposed to remedy this weakness. Several heterogeneous networks (such as satellite, unmanned aerial vehicle, or cellular networks) provide wider service areas and ubiquitous connectivity. We adopt these wide‐covered heterogeneous networks to design a secure certificate distribution scheme that allows a mobile node without a pre‐obtained certificate to instantly get a certificate using the communication channel constructed by these wide‐covered heterogeneous networks. Therefore, this scheme enhances the security infrastructure of public key management for mobile ad hoc networks. Copyright © 2006 John Wiley & Sons, Ltd.     

WRE‐OLSR,a new scheme for enhancing the lifetime within ad hoc and wireless sensor networks

Within ad hoc and wireless sensor networks, communications are accomplished in dynamic environments with a random movement of mobile devices. Thus, routing protocols over these networks are an important concern to offer efficient network scalability, manage topology information, and prolong the network lifetime. Optimized link state routing (OLSR) is one of those routing protocols implemented in ad hoc and wireless sensor networks. Because of its proactive technique, routes between two nodes are established in a very short time, but it can spend a lot of resources for selecting the multipoint relays (MPRs: nodes responsible for routing data) and exchanging topology control information. Thus, nodes playing for a long time a role of MPR within networks implementing such protocol can rapidly exhaust their batteries, which create route failures and affect the network lifetime. Our main approach relies on analyzing this concern by introducing a new criterion that implements a combination between the residual energy of a node and its reachability in order to determine the optimal number of MPRs and sustain the network lifetime. Simulations performed illustrate obviously that our approach is more significant compared with the basic heuristic used by original OLSR to compute the MPR set of a node.     

An energy‐efficient clustering approach for collaborative data forwarding in heterogeneous MANET

Mobile ad hoc network consists of a group of mobile nodes that can communicate with each other without any infrastructure. Clustering of the mobile nodes ensures efficient use of available bandwidth and high network throughput. Various clustering schemes are developed to improve the energy efficiency and lifetime of the network. However, there is an increase in the energy consumption with the increase in the number of clusters for forwarding data. This paper presents an energy‐efficient clustering approach for collaborative data forwarding in mobile ad hoc network. The cluster head (CH) is selected based on the processing capability of the nodes and link connection metrics. The CH receives the data from the server and forwards the data to the member nodes at a corresponding data rate of the nodes. Data offloading technique manages the data traffic in the network. The CH rejoining approach enables load balancing in the network. The proposed clustering approach achieves a significant reduction in the energy consumption and data traffic and improvement in the throughput rate through stable routing.     

Multi‐interface cognitive radio for enhanced routing in multi‐hop cellular networks

Multi‐hop cellular network (MCN) is a wireless communication architecture that combines the benefits of conventional single‐hop cellular networks and multi‐hop ad hoc relaying networks. The route selection in MCN depends on the availability of intermediate nodes and their neighborhood connectivity. Cognitive radio (CR) is an emerging communication paradigm that exploits the available radio frequencies opportunistically for the effective utilization of the radio frequency spectrum. The incorporation of CR and mobile ad hoc network routing protocols in MCN could potentially improve the spectrum utilization and the routing performance of MCN. This paper firstly presents the proposed model for the multi‐interface CR mobile node with transceiver synchronization and then investigates its opportunistic spectrum utilization and routing performance in MCN. Copyright © 2015 John Wiley & Sons, Ltd.     

一种基于地理位置信息的LEO/Ad Hoc双模网络路由协议

基于终端的LEO/Ad Hoc网络双模组网模型,分析在LEO卫星通信系统业务溢出情况下地面终端组织Ad Hoc网络的路由查找算法问题,提出一种利用高层LEO卫星通信系统供给的地理信息和信令支持下的路由算法(Geographic Location Based Route,GLBR),通过仿真实验验证了其有效性。     

Routing protocol development for quality of service optimization of video‐on‐demand system over mobile ad hoc networks

A video‐on‐demand (VoD) application system over mobile ad hoc networks typically requires particular quality of service (QoS) parameters to be achieved. In this paper, we have proposed a novel QoS‐based routing protocol called as mobile VoD protocol. This protocol has been developed for improving the QoS of the mobile VoD system (normal Mobi_VoD approach). The protocol uses customer caching scheme for storing the first fragment of the entire video in the mobile customers and thereafter broadcast them when the new mobile customers missed the portion of the already transmitted first fragment for reducing the service delay of the customer, consequently optimizing QoS parameters. Various scenarios have been studied, and the efficacy of simulation results proves that the proposed system architecture in which the mobile customers use an ad hoc network caching scheme (mobile VoD protocol) is more efficient and performs better than the existing system (ad hoc on‐demand distance vector protocol) when compared in terms of QoS parameters such as the end‐to‐end delay, energy consumption, packet delivery ratio, throughput, and overhead.     

Multipath routing in mobile ad hoc network with probabilistic splitting of traffic

Multipath routing is a burning issue in mobile ad hoc network due to its various advantages over single path routing. Some of these advantages are load balancing, bandwidth aggregation, and fault tolerance. Multipath routing means multiple paths exist between source and destination pair. Many works discussed in section 2 addressed queuing delays, but none of them suggested queuing delay for multiple path deliveries of data in mobile ad hoc network context. In this paper, we have designed a mathematical model to compute delay and throughput for multipath. Our model follow the network of M/M/1 queues, and we have applied Burke’s theorem to calculate the queuing delay of the packet in mobile network scenario. This model can be used to estimate delay and throughput of an individual path. Further, through the analysis the best path for data delivery out of available multiple paths as well as the multipath path can be used simultaneously for data delivery to the destination. Simulation result shows that splitted traffic multiple paths outperform splitted traffic. Therefore, our model is useful for design and analysis of ad hoc network. The simulation work has been carried out in Qualnet simulator.     

U2RV: UAV‐assisted reactive routing protocol for VANETs

When it comes to keeping the data routing robust and effective in vehicular ad hoc networks (VANETs), stable and durable connectivity constitutes the keystone to ensure successful point‐to‐point communication. Since VANETs can comprise all kinds of mobile vehicles moving and changing direction frequently, this may result in frequent link failures and network partitions. Moreover, when VANETs are deployed in a city environment, another problem arises, that is, the existing obstructions (eg, buildings, trees, and hoppers) preventing the line‐of‐sight between vehicles, thus degrading wireless transmissions. Therefore, it is more complicated to design a routing technique that adapts to frequent changes in the topology. In order to settle all these problems, in this work, we design a flooding scheme that automatically reacts at each topology variation while overcoming the present obstacles while exchanging data in ad hoc mode with drones that are commonly called unmanned aerial vehicles (UAVs). Also, the aim of this work is to explore well‐regulated routing paths providing a long lifetime connectivity based on the amount of traffic and the expiration time of each discovered path. A set of experiments is carried out using a simulation, and the outcomes are confronted with similar protocols based on a couple of metrics. The results clearly show that the assistance of UAVs to vehicles is capable of providing high delivery ratios and low delivery delays while efficiently extending the network connectivity.     

OLSR在广义AD-HOC网络中的扩展应用研究

无线AD-HOC网络发展到广义阶段,势必要满足网络需求与IP网络相联通,这便需要一种性能优异的网络协议来实现这种联通。OLSR协议作为目前公认的最优的AD-HOC路由协议,理所当然地成为向广义AD-HOC网络扩展的先锋,但目前的OLSR协议并未满足网络互联的需求,因此论文的主要目的就在于研究如何对OLSR扩展以应用于广义AD-HOC网络中,并在研究过程中期待发现更新的路由解决办法,能更好地使AD-HOC网络和IP网络相结合。     

EEAODR: An energy‐efficient ad hoc on‐demand routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are characterized by random, multi‐hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite power sources. In this work, we propose an energy‐efficient routing protocol for MANETs to minimize energy consumption and increase the network's consistency. Traditional works mainly focused on the shortest path‐based schemes to minimize energy, which might result into network failure because some nodes might exhaust fast as they are used repetitively, while some other nodes might not be used at all. This can lead to energy imbalance and to network life reduction. We propose an energy‐efficient ad hoc on‐demand routing protocol that balances energy load among nodes so that a minimum energy level is maintained among nodes and the network life increases. We focused on increasing the network longevity by distributing energy consumption in the network. We also compared the simulation results with a popular existing on‐demand routing protocol in this area, AODV, to establish the superiority of our approach. Copyright © 2009 John Wiley & Sons, Ltd.     

Improving UDP and TCP performance in mobile ad hoc networks withINSIGNIA

There is a growing need to provide better service differentiation in mobile ad hoc networks; however, this is challenging. These networks are characterized as being multihop in nature where the wireless topology that interconnects mobile hosts/routers can change rapidly in unpredictable ways or remain relatively static over long periods of time. Power and bandwidth constrained, mobile ad hoc networks typically only support best effort communications where the transport protocol's “goodput” is often lower than the maximum radio transmission rate after encountering the effects of multiple access, fading, noise, and interference. We evaluate three routing protocols with INSIGNIA, an in-band signaling system that supports adaptive reservation-based services in mobile ad hoc networks. INSIGNIA represents a general-purpose approach to delivering quality of service in mobile ad hoc network supporting “operational transparency” between a number of IETF mobile ad hoc network routing protocols that include Ad Hoc On-Demand Distance Vector, Dynamic Source Routing, and the Temporally Ordered Routing Algorithm. We evaluate the performance gains delivered when using INSIGNIA with these MANET routing protocols in support of UDP and TCP traffic. The INSIGNIA ns-2 code used for the study reported in this article is available from the Web at comet.columbia.edu/insignia     

Comparison of two routing metrics in OLSR on a grid based mesh network

Predicting the performance of ad hoc networking protocols for mesh networks has typically been performed by making use of software based simulation tools. Experimental study and validation of such predictions is a vital to obtaining more realistic results, but may not be possible under the constrained environment of network simulators. This paper presents an experimental comparison of OLSR using the standard hysteresis routing metric and the ETX metric in a 7 by 7 grid of closely spaced Wi-Fi nodes to obtain more realistic results. The wireless grid is first modelled to extract its ability to emulate a real world multi-hop ad hoc network. This is followed by a detailed analysis of OLSR in terms of hop count, routing traffic overhead, throughput, delay, packet loss and route flapping in the wireless grid using the hysteresis and ETX routing metric. It was discovered that the ETX metric which has been extensively used in mesh networks around the world is fundamentally flawed when estimating optimal routes in real mesh networks and that the less sophisticated hysteresis metric shows better performance in large dense mesh networks.     

FPN‐SAODV: using fuzzy petri nets for securing AODV routing protocol in mobile Ad hoc network

In this paper, we use fuzzy Petri nets (FPNs) to propose a secure routing protocol in mobile ad hoc network. The proposed method is based on secure ad hoc on‐demand distance vector (SAODV), which is named FPN‐SAODV. In FPN‐SAODV routing protocol, for each packet delivery or firing each transition, a type of bidirectional node‐to‐node fuzzy security verification is conducted that can be carried out with five security threshold levels. This inference uses four fuzzy variables that have been selected to well represent the malicious behaviors of some public attacks in mobile ad hoc network. Furthermore, a through route security verification has been used for selecting the most secure route among each candidate path through source node to destination. Both of these verifications utilize FPN inherent features for their operation. For evaluation purpose, we used the metrics such as packet delivery ratio, end‐to‐end delay, average security level of the nodes, and percentage of true/false detector nodes. These metrics have been used for investigating the inner operation of FPN‐SAODV as determining the proper level of security threshold level in node‐to‐node security verification module. Also, these are used for comparison of FPN‐SAODV performance versus the original AODV. Copyright © 2015 John Wiley & Sons, Ltd.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

Dynamic Adaptive Routing for a Heterogeneous Wireless Network

This paper presents an integrated architecture of a Heterogeneous Wireless Network (HWN) and a dynamic adaptive routing protocol (DARP) for a HWN. To allow mobile users versatile communication with anyone or any device at any place and anytime, HWN integrates cellular network with an ad hoc network (independent Basic Service Set) in wireless local area network (WLAN) and reserves advantages of sizable coverage in a cellular network and high data rate in deployable ad hoc network. It also enlarges the scope of communication for ad hoc network and improves the throughput for cellular network. Consequently, nodes in HWN can communicate with each other or access Internet ubiquitously. We also address the routing issues for HWN, because the routing protocol for HWN is different from those used in cellular network or ad hoc network. The dynamic adaptive routing protocol establishes a better path for the source to arrive at the destination across multiple hops or cellular network and provides appropriate QoS (quality of service) in HWN.Through simulation, we will demonstrate the merit of the HWN, proposed routing performance on HWN and overhead of control traffic. A performance analysis of the proposed protocol is depicted. The results of the analysis, and simulations, are presented and discussed.     

Self‐adaptive routing protocols for integrating cellular networks,WLANs, and MANETs

A growing need to have ubiquitous connectivity has motivated our research to provide continuous connection between various wireless platforms such as cellular networks, wireless local area networks (WLANs), and mobile ad hoc networks (MANETs). In this paper, we consider integration at the routing layer and propose two adaptable routing protocols (IRP‐RD and IRP‐PD) that exploit topology information stored at the fixed network components (cellular base stations and WLAN access points) for the route discovery and maintenance processes. Our proposed protocols can provide connectivity to the cellular network and/or WLAN hotspots through multihop routing, while differ in the gateway discovery approach used. In IRP‐RD, multihop routes to gateways to the cellular network or WLAN hot spots are discovered on demand, while in IRP‐PD out of coverage users proactively maintain routes to the gateways. Furthermore, proposed protocols can be used in any heterogeneous scenario, combining a cellular network and WLANs operating in infrastructure or ad hoc (MANET) mode. We provide simulation results that demonstrate the effectiveness of the proposed integrated routing protocols and show the advantages and drawbacks of each gateway discovery approach in different heterogeneous scenarios. Copyright © 2006 John Wiley & Sons, Ltd.