A Survey on the Application of Evolutionary Algorithms for Mobile Multihop Ad Hoc Network Optimization Problems

Evolutionary algorithms are metaheuristic algorithms that provide quasioptimal solutions in a reasonable time. They have been applied to many optimization problems in a high number of scientific areas. In this survey paper, we focus on the application of evolutionary algorithms to solve optimization problems related to a type of complex network likemobilemultihop ad hoc networks. Since its origin, mobile multihop ad hoc network has evolved causing new types of multihop networks to appear such as vehicular ad hoc networks and delay tolerant networks, leading to the solution of new issues and optimization problems. In this survey, we review the main work presented for each type of mobile multihop ad hoc network and we also present some innovative ideas and open challenges to guide further research in this topic

A Survey on Multihop Ad Hoc Networks for Disaster Response Scenarios

Disastrous events are one of the most challenging applications of multihop ad hoc networks due to possible damages of existing telecommunication infrastructure.The deployed cellular communication infrastructure might be partially or completely destroyed after a natural disaster. Multihop ad hoc communication is an interesting alternative to deal with the lack of communications in disaster scenarios. They have evolved since their origin, leading to differentad hoc paradigms such as MANETs, VANETs, DTNs, or WSNs.This paper presents a survey on multihop ad hoc network paradigms for disaster scenarios.It highlights their applicability to important tasks in disaster relief operations. More specifically, the paper reviews the main work found in the literature, which employed ad hoc networks in disaster scenarios.In addition, it discusses the open challenges and the future research directions for each different ad hoc paradigm

Towards Improving Road Safety using Advanced Vehicular Networks

Vehicular Ad-hoc Networks (VANETs) are advanced network technologies applied to improve safety on roads and to offer suitable solutions for Intelligent Transportation Systems (ITS). The goal of VANETs is to assistdrivers and to act as a smart co-pilot that can alret about accidents and help avoiding them while prodivding high-end infotainment systems for both the driver and passengers. Consequently, VANETs can save millions of lives around the world, especially in Saudi Arabia, which has a very high rate of road accidents annualy. In this paper, we introduce and discuss VANETs, related routing protocols, challenging problems, and the existing solutions. This work is a part of a bigger project that aims to enhance VANETs technologies and to updapteITS to significantly promote road safety in general and Saudi Arabia’s roads in particular

Fuzzy and Position Particle Swarm Optimized Routing in VANET

In Intelligent Transport Systems, traffic management and providing stable routing paths between vehicles using vehicular ad hoc networks (VANET\u27s) is critical. Lots of research and several routing techniques providing a long path lifetime have been presented to resolve this issue. However, the routing algorithms suffer excessive overhead or collisions when solving complex optimization problems. In order to improve the routing efficiency and performance in the existing schemes, a Position Particle Swarm Optimization based on Fuzzy Logic (PPSO-FL) method is presented for VANET that provides a high-quality path for communication between nodes. The PPSO-FL has two main steps. The first step is selecting candidate nodes through collectively coordinated metrics using the fuzzy logic technique, improving packet delivery fraction, and minimizing end-to-end delay. The second step is the construction of an optimized routing model. The optimized routing model establishes an optimal route through the candidate nodes using position-based particle swarm optimization. The proposed work is simulated using an NS2 simulator. Simulation results demonstrate that the method outperforms the standard routing algorithms in packet delivery fraction, end-to-end delay and execution time for routing in VANET scenarios

Named Data Networking in Vehicular Ad hoc Networks: State-of-the-Art and Challenges

International audienceInformation-Centric Networking (ICN) has been proposed as one of the future Internet architectures. It is poised to address the challenges faced by today's Internet that include, but not limited to, scalability, addressing, security, and privacy. Furthermore, it also aims at meeting the requirements for new emerging Internet applications. To realize ICN, Named Data Networking (NDN) is one of the recent implementations of ICN that provides a suitable communication approach due to its clean slate design and simple communication model. There are a plethora of applications realized through ICN in different domains where data is the focal point of communication. One such domain is Intelligent Transportation System (ITS) realized through Vehicular Ad hoc NETwork (VANET) where vehicles exchange information and content with each other and with the infrastructure. To date, excellent research results have been yielded in the VANET domain aiming at safe, reliable, and infotainment-rich driving experience. However, due to the dynamic topologies, host-centric model, and ephemeral nature of vehicular communication, various challenges are faced by VANET that hinder the realization of successful vehicular networks and adversely affect the data dissemination, content delivery, and user experiences. To fill these gaps, NDN has been extensively used as underlying communication paradigm for VANET. Inspired by the extensive research results in NDN-based VANET, in this paper, we provide a detailed and systematic review of NDN-driven VANET. More precisely, we investigate the role of NDN in VANET and discuss the feasibility of NDN architecture in VANET environment. Subsequently, we cover in detail, NDN-based naming, routing and forwarding, caching, mobility, and security mechanism for VANET. Furthermore, we discuss the existing standards, solutions, and simulation tools used in NDN-based VANET. Finally, we also identify open challenges and issues faced by NDN-driven VANET and highlight future research directions that should be addressed by the research community

Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

Performance improvement in geographic routing for vehicular Ad Hoc networks

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and spee

Road-based routing in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as high density and constrained mobility, can provide good performance for a large spectrum of applications. This work proposes a novel class of routing protocols as well as three forwarding optimizations for VANETs. The Road-Based using Vehicular Traffic (RBVT) routing is a novel class of routing protocols for VANETs. RBVT protocols leverage real-time vehicular traffic information to create stable road-based paths consisting of successions of road intersections that have, with high probability, network connectivity among them. Evaluations of RBVT protocols working in conjunction with geographical forwarding show delivery rate increases as much as 40% and delay decreases as much as 85% when compared with existing protocols. Three optimizations are proposed to increase forwarding performance. First, one- hop geographical forwarding is improved using a distributed receiver-based election of next hops, which leads to as much as 3 times higher delivery rates in highly congested networks. Second, theoretical analysis and simulation results demonstrate that the delay in highly congested networks can be reduced by half by switching from traditional FIFO with Taildrop queuing to LIFO with Frontdrop queuing. Third, nodes can determine suitable times to transmit data across RBVT paths or proactively replace routes before they break using analytical models that accurately predict the expected road-based path durations in VANETs

CodeTorrent: Content Distribution using Network Coding in VANETs

Mobile peer-to-peer systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a network coding based file swarming protocol targeting vehicular ad hoc networks (VANET). We argue that file swarming protocols in VANET should deal with typical mobile network issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous mobile peer-to-peer researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Through simulation, we show that the efficiency and effectiveness of our protocol allows shorter file downloading time compared to an existing VANET file swarming protocol

BRT: Bus-based Routing Technique in Urban Vehicular Networks

International audienceRouting data in Vehicular Ad hoc Networks is still a challenging topic. The unpredictable mobility of nodes renders routing of data packets over optimal paths not always possible. Therefore, there is a need to enhance the routing service. Bus Rapid Transit systems, consisting of buses characterized by a regular mobility pattern, can be a good candidate for building a backbone to tackle the problem of uncontrolled mobility of nodes and to select appropriate routing paths for data delivery. For this purpose, we propose a new routing scheme called Bus-based Routing Technique (BRT) which exploits the periodic and predictable movement of buses to learn the required time (the temporal distance) for each data transmission to RoadSide Units (RSUs) through a dedicated bus-based backbone. Indeed, BRT comprises two phases: (i) Learning process which should be carried out, basically, one time to allow buses to build routing tables entries and expect the delay for routing data packets over buses, (ii) Data delivery process which exploits the pre-learned temporal distances to route data packets through the bus backbone towards an RSU (backbone mode). BRT uses other types of vehicles to boost the routing of data packets and also provides a maintenance procedure to deal with unexpected situations like a missing nexthop bus, which allows BRT to continue routing data packets. Simulation results show that BRT provides good performance results in terms of delivery ratio and end-to-end delay