Predicting topology propagation messages in mobile ad hoc networks: The value of history

This research was funded by the Spanish Government under contracts TIN2016-77836-C2-1-R,TIN2016-77836-C2-2-R, and DPI2016-77415-R, and by the Generalitat de Catalunya as Consolidated ResearchGroups 2017-SGR-688 and 2017-SGR-990.The mobile ad hoc communication in highly dynamic scenarios, like urban evacuations or search-and-rescue processes, plays a key role in coordinating the activities performed by the participants. Particularly, counting on message routing enhances the communication capability among these actors. Given the high dynamism of these networks and their low bandwidth, having mechanisms to predict the network topology offers several potential advantages; e.g., to reduce the number of topology propagation messages delivered through the network, the consumption of resources in the nodes and the amount of redundant retransmissions. Most strategies reported in the literature to perform these predictions are limited to support high mobility, consume a large amount of resources or require training. In order to contribute towards addressing that challenge, this paper presents a history-based predictor (HBP), which is a prediction strategy based on the assumption that some topological changes in these networks have happened before in the past, therefore, the predictor can take advantage of these patterns following a simple and low-cost approach. The article extends a previous proposal of the authors and evaluates its impact in highly mobile scenarios through the implementation of a real predictor for the optimized link state routing (OLSR) protocol. The use of this predictor, named OLSR-HBP, shows a reduction of 40–55% of topology propagation messages compared to the regular OLSR protocol. Moreover, the use of this predictor has a low cost in terms of CPU and memory consumption, and it can also be used with other routing protocols.Peer ReviewedPostprint (published version

Localization Enhanced Mobile Networks

The interest in mobile ad-hoc networks (MANETs) and often more precisely vehicular ad-hoc networks (VANETs) is steadily growing with many new applications, and even anticipated support in the emerging 5G networks. Particularly in outdoor scenarios, there are different mechanisms to make the mobile nodes aware of their geographical location at all times. The location information can be utilized at different layers of the protocol stack to enhance communication services in the network. Specifically, geographical routing can facilitate route management with smaller overhead than the traditional proactive and reactive routing protocols. In order to achieve similar advantages for radio resource management (RRM) and multiple access protocols, the concept of virtual cells is devised to exploit fully distributed knowledge of node locations. The virtual cells define clusters of MANET nodes assuming a predefined set of geographically distributed anchor points. It enables fast response of the network to changes in the nodes spatial configuration. More importantly, the notion of geographical location can be generalized to other shared contexts which can be learned or otherwise acquired by the network nodes. The strategy of enhancing communication services by shared contexts is likely to be one of the key features in the beyond-5G networks

Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks

This article is posted here with permission of IEEE - Copyright @ 2010 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council of U.K. underGrant EP/E060722/

A NEW APPROACH OF MULTICAST ROUTING PROTOCOLS IN MANETS BASED ON CBR (CASE-BASED REASONING) METHOD

Multicast routing protocols significantly increase the performance of the network using a new approach of group-orientedservices which become recently apparent for MANETs. Due to this reason several MANET-specific multicasting routingprotocols have been proposed. Although numerous challenges in designing multicast routing protocols in MANETs becomeostensible due to node mobility, contention for channel access, multi hop communications and dynamic topology,researchers tend to address such problems by designing simple, scalable and robust routing protocols. In this paper tried toexplore the existing On-Demand Multicast Routing Protocol (OMRP) with its limitation and propose a new approach ofCBR based multicast routing protocols without changing the basic structure of the protocol. Nodes with CBR based OMRPbecome autonomous by keeping track of previous route discovery experience to reuse back as a solution. This will reducechannel overhead and improves the scalability of the ad hoc network.Keywords: Mobile ad hoc networks (MANETs), Multicast Routing Protocols, and Case-Based Reasoning (CBR)

Internet protocol MANET vs named data MANET: A critical evaluation

Many researches have been done in the field of mobile networking, specifically in the field of ad-hoc networks.The major aim of these networks is the delivery of data to a given node at the destination, irrespective of its location.Mobile Ad-hoc Network (MANET) employs the traditional TCP/IP structure to provide end-to-end communication between nodes (we named this type of architecture is IP-MANET).However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model requires redefinition or modifications to function efficiently in MANET. Named Data MANET (NDMANET) architecture is a recently emerging research area. The in-network chunk-based caching feature of NDN is beneficial in coping with the mobility and intermittent connectivity challenges in MANETs.In the natural disaster field, MANET is considered a challenging task because of the unpredictable changes in the network topology due to the absence of any centralized control.The goals of this paper have two ways: first, this study provides a performance comparison of IP-MANET to ND-MANET in terms of throughput, delay, and packet loss.While the second contribution is to identify which architecture has an impact on the natural disaster (i.e., Flooding disaster) in rural areas and suggests which one may perform better.For experimental purposes, our analyses IP-MANET and ND-MANET by extensive simulations in the NS 3 simulator under a number of different network scenarios, and show that how number of nodes and variety packets size affect their performance