Payoff-based Dynamic Segment Replication and Graph Classification Method with Attribute Vectors Adapted to Urban VANET

Author(s):  
Bechir Alaya

Due to the number of constraints and the dynamic nature of vehicular ad hoc networks (VANET), effective video broadcasting always remains a difficult task. In this work, we proposed a quality of video visualization guarantee model based on a feedback loop and an efficient algorithm for segmenting and replicating video segments using the Payoff-based Dynamic Segment Replication Policy (P-DSR). In the urban VANET environment, P-DSR is defined by taking into account the position of the vehicles, the speed, the direction, the number of neighboring vehicles, and the reputation of each node to stabilize the urban VANET topology. However, the management of various load control parameters between the different components of the urban VANET network remains a problem to be studied. This work uses a multi-objective problem that takes the parameters of our algorithm based on the Graph Classification Method with Attribute Vectors (GCMAV) as input. This algorithm aims to provide an improved class lifetime, an improved video segment delivery rate, a reduced inter-class overload, and an optimization of a global criterion. A scalable algorithm is used to optimize the parameters of the GCMAV. The simulations were carried out using the NetSim simulator and Multi-Objective Evolutionary Algorithms framework to optimize parameters. Experiments were carried out with realistic maps of Open Street Maps and its results were compared with other algorithms such as Seamless and Authorized Multimedia Streaming and P-DSR. The survey suggests that the proposed methodology works well concerning the average lifetime of the inter-classes and the delivery rate of video segments.

2014 ◽  
Vol 17 (1) ◽  
Author(s):  
Grégoire Danoy ◽  
Julien Schleich ◽  
Pascal Bouvry ◽  
Bernabé Dorronsoro

Cooperative coevolutionary evolutionary algorithms differ from standard evolutionary algorithms’ architecture in that the population is split into subpopulations, each of them optimising only a sub-vector of the global solution vector. All subpopulations cooperate by broadcasting their local partial solutions such that each subpopulation can evalu- ate complete solutions. Cooperative coevolution has recently been used in evolutionary multi-objective optimisation, but few works have exploited its parallelisation capabil- ities or tackled real-world problems. This article proposes to apply for the first time a state-of-the-art parallel asynchronous cooperative coevolutionary variant of the non- dominated sorting genetic algorithm II (NSGA-II), named CCNSGA-II, on the injection network problem in vehicular ad hoc networks (VANETs). This multi-objective optimi- sation problem, consists in finding the minimal set of nodes with backend connectivity, referred to as injection points, to constitute a fully connected overlay that will optimise the small-world properties of the resulting network. Recently, the well-known NSGA- II algorithm was used to tackle this problem on realistic instances in the city-centre of Luxembourg. In this work we analyse the performance of the CCNSGA-II when using different numbers of subpopulations, and compare them to the original NSGA-II in terms of both quality of the obtained Pareto front approximations and execution time speedup.


2020 ◽  
Vol 39 (6) ◽  
pp. 8357-8364
Author(s):  
Thompson Stephan ◽  
Ananthnarayan Rajappa ◽  
K.S. Sendhil Kumar ◽  
Shivang Gupta ◽  
Achyut Shankar ◽  
...  

Vehicular Ad Hoc Networks (VANETs) is the most growing research area in wireless communication and has been gaining significant attention over recent years due to its role in designing intelligent transportation systems. Wireless multi-hop forwarding in VANETs is challenging since the data has to be relayed as soon as possible through the intermediate vehicles from the source to destination. This paper proposes a modified fuzzy-based greedy routing protocol (MFGR) which is an enhanced version of fuzzy logic-based greedy routing protocol (FLGR). Our proposed protocol applies fuzzy logic for the selection of the next greedy forwarder to forward the data reliably towards the destination. Five parameters, namely distance, direction, speed, position, and trust have been used to evaluate the node’s stability using fuzzy logic. The simulation results demonstrate that the proposed MFGR scheme can achieve the best performance in terms of the highest packet delivery ratio (PDR) and minimizes the average number of hops among all protocols.


Sign in / Sign up

Export Citation Format

Share Document