scholarly journals Data Dissemination Scheme for VANET using Genetic algorithm and Particle Swarm Optimization

2021 ◽  
Vol 10 (1) ◽  
pp. 322-328
Author(s):  
Tahera Mahmood
Keyword(s):  
Genetic Algorithm ◽  
Ad Hoc ◽  
Data Dissemination ◽  
Fitness Function ◽  
Delivery Ratio ◽  
Broadcast Storm ◽  
Multi Objective Genetic Algorithm ◽  
Passenger Safety ◽  
Moving Vehicles ◽  
Result Show

A vehicular ad hoc network (VANET) consist of moving vehicles connected via wireless technology e.g., Wireless Access in Vehicular Environment (WAVE) for the aim of exchanging information. Therefore data dissemination in VANET has become issue of debate for researcher. In VANET broadcasting play an important role. The aim of VANET is to ensure passenger safety through emergency message. With multiple objectives broadcast storm is assumed to be an NP-Hard problem. In this paper we propose DDV algorithm to solve broadcast storm problem. Fitness function has used to optimize the objective of proposed algorithm. The proposed algorithm producing better optimization results. We are considering a highway scenario in city with dynamic rotation, to evaluate the performance of the DDV algorithm we compare the result with Smart flooding techniques, MOGA (Multi Objective Genetic algorithm) [1] and EEADP. Our result show the better performance in terms of reduce the number of retransmission, increase the packet delivery ratio and provide better throughput.

scholarly journals Exponential Genetic Algorithm-Based Stable and Load-Aware QoS Routing Protocol for MANET

2017 ◽  
Vol 26 (4) ◽  
pp. 669-682
Author(s):  
A. Rama Rao ◽  
V. Valli Kumari ◽  
Ch. Satyananda Reddy
Keyword(s):  
Genetic Algorithm ◽  
Exponential Function ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Multimedia Data ◽  
Link Quality ◽  
Delivery Ratio

AbstractAs the actual links in mobile ad hoc networks (MANETs) are dynamic, the feasible path generated may not exist during the transmission of multimedia data. There is a need for generating multiple paths for guaranteed transmission. The multi-path finding can be achieved through a genetic-based algorithm that faces the major challenge in quality-of-service (QoS)-aware routing. To enhance the QoS communication over the MANETs, an exponential genetic algorithm (GA)-based stable and load-aware QoS routing protocol (SLAQR) is proposed in this paper. This paper chiefly focuses on the enhancement of the GA-based routing algorithm by including exponential function in the searching process and modifying the fitness function, which incorporates QoS metrics like the node’s static resource capacity, dynamic resource availability, neighborhood quality, and link quality. The originality of the proposed protocol comes from the fact that it introduces multiple parameters into the route quality computation and integrates the exponential function into the GA. For experimental validation, the simulation of the proposed method is done and the results are compared with existing protocols such as GAQR (GA-Based QoS Routing), QMRB-AODV (QoS Mobile Routing Backbone Over Ad Hoc On-Demand Distance Vector Routing), and EISGA (Ensemble of Immigrant Strategies with Genetic Algorithm). From the outcome, we conclude that the delivery ratio, throughput, and delay of our proposed SLAQR approach have improved the GAQR approach by 58%, 56%, and 97%, respectively.

scholarly journals Energy Efficient Routing Protocol in Sensor Networks Using Genetic Algorithm

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7060
Author(s):  
Jatinkumar Patel ◽  
Hosam El-Ocla
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Fitness Function ◽  
Delivery Ratio ◽  
Ad Hoc Routing ◽  
Energy Efficient Routing

In this paper, we examine routing protocols with the shortest path in sensor networks. In doing this, we propose a genetic algorithm (GA)-based Ad Hoc On-Demand Multipath Distance Vector routing protocol (GA-AOMDV). We utilize a fitness function that optimizes routes based on the energy consumption in their nodes. We compare this algorithm with other existing ad hoc routing protocols including LEACH-GA, GA-AODV, AODV, DSR, EPAR, EBAR_BFS. Results prove that our protocol enhances the network performance in terms of packet delivery ratio, throughput, round trip time and energy consumption. GA-AOMDV protocol achieves average gain that is 7 to 22% over other protocols. Therefore, our protocol extends the network lifetime for data communications.

Optimized Routing for Efficient Data Dissemination in MANET to Meet the Fast-Changing Technology

2018 ◽  
Vol 26 (3) ◽  
pp. 25-36
Author(s):  
Deo Prakash ◽  
Neeraj Kumar ◽  
M.L. Garg
Keyword(s):  
Ad Hoc ◽  
Data Dissemination ◽  
Dynamic Network ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Communication Link ◽  
Centralized Control ◽  
Mobile Adhoc Network ◽  
Link Stability ◽  
Efficient Data

Mobile Adhoc Network (MANET) is a dynamic network without any centralized control. Due to frequent topological change, routing has been always a challenging task in these networks. This article presents optimized routing for efficient data dissemination in MANETs to meet the fast-changing technology of today's world. A novel metric for such optimized routing in MANET is proposed. The main parameters considered to evaluate this metric are the energy consumed during the communication, link stability, Packet Delivery Ratio (PDR) and traffic. The concept is based on a scenario in which a mobile node (source) sends data packets to another mobile node (destination) through its dynamically connected neighboring nodes. The path which consumes the lowest energy and also shows highest link stability is selected for consideration. In case the paths consume the same amount of energy, the highest stable path is chosen. In this manner, the most optimized path is selected. The authors' routing approach shows more efficiency than earlier in dissemination of data and information over the Mobile Ad-Hoc Networks.

scholarly journals Multicriteria Based Next Forwarder Selection for Data Dissemination in Vehicular Ad Hoc Networks Using Analytical Network Process

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Shahid Latif ◽  
Saeed Mahfooz ◽  
Bilal Jan ◽  
Naveed Ahmad ◽  
Haleem Farman ◽  
...  
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Dissemination ◽  
Mathematical Formulation ◽  
Traffic Information ◽  
Network Resources ◽  
Analytical Network Process ◽  
Multicriteria Decision ◽  
Broadcast Storm ◽  
Network Process

Vehicular ad hoc network (VANET) is a wireless emerging technology that aims to provide safety and communication services to drivers and passengers. In VANETs, vehicles communicate with other vehicles directly or through road side units (RSU) for sharing traffic information. The data dissemination in VANETs is a challenging issue as the vehicles have to share safety critical information in real time. The data distribution is usually done using broadcast method resulting in inefficient use of network resources. Therefore, to avoid the broadcast storm and efficiently use network resources, next forwarder vehicle (NFV) is selected to forward data to nearby vehicles. The NFV selection is based on certain parameters like direction, distance, and position of vehicles, which makes it a multicriteria decision problem. In this paper, analytical network process (ANP) is used as a multicriteria decision tool to select the optimal vehicle as NFV. The stability of alternatives (candidate vehicles for NFV selection) ranking is checked using sensitivity analysis for different scenarios. Mathematical formulation shows that ANP method is applicable for NFV selection in VANETs. Simulation results show that the proposed scheme outperforms other state-of-the-art data dissemination schemes in terms of reachability, latency, collisions, and number of transmitted and duplicate data packets.

scholarly journals Spectrum-Aware Geographic Routing in Cognitive Vehicular Ad Hoc Network Using a Kalman Filter

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Huma Ghafoor ◽  
Insoo Koo
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Relay Node ◽  
Primary User ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Vehicle Communication ◽  
Moving Vehicles ◽  
Hoc Networks ◽  
The One

We propose a position-based routing protocol for cognitive radio vehicular ad hoc networks (CR-VANETs) using aKalmanfilter algorithm. The protocol first selects an idle channel from among all the channels available to a vehicle while moving on a straight road and then finds the best relay node to deliver the packet to the destination. The selection of a relay node is done by dividing the vehicular transmission range into five regions, and then the source/relay node selects the one that is in the region having a higher preference than other regions. Communication between two vehicles occurs only when both the vehicles are on the same channel. Delay may increase while sensing the channel and selecting the relay node. To reduce the delay, we use aKalmanfilter to predict the future positions of all moving vehicles in the network. We consider vehicle-to-vehicle communication and compare our protocol for different probabilities of primary user being idle. Our proposed protocol shows improvement in both packet delivery ratio and end-to-end delay.

scholarly journals Connectivity Investigation of Channel Quality-Based Adaptive Gossip Flooding Mechanism for AODV

2020 ◽  
Vol 10 (1) ◽  
pp. 25-40
Author(s):  
Prasanna Shete ◽  
Raval N Awale
Keyword(s):  
Ad Hoc ◽  
Simulation Analysis ◽  
Signal Strength ◽  
Fringe Benefit ◽  
Delivery Ratio ◽  
Cross Layer Design ◽  
Route Discovery ◽  
Node Mobility ◽  
Broadcast Storm ◽  
Channel Quality

To address the “broadcast storm” problem associated with flooding-based route discovery mechanism of reactive routing protocols, probabilistic approaches are suggested in the literature. In the earlier work, Gossip flooding mechanism of Haas et.al. was extended with signal quality, to propose channel quality based adaptive gossip flooding mechanism for AODV (CQAG-AODV). Following the cross-layer design principle, CQAG-AODV algorithm tried to discover robust routes, as well as address the “broadcast storm” problem by controlling the rebroadcast probability of Route request (RREQ) packets on the basis of signal strength experienced at the physical layer. This paper investigates the connectivity of CQAG-AODV through theoretical and simulation analysis. Results show that, by accounting the signal strength in the route discovery process, not only does the proposed algorithm floods  a lesser number of route requests and controls the broadcast storm, but also maintains a higher level of connectivity to offer high packet delivery ratio; independent of network density and node mobility. Moreover, due to controlled routing overhead and robust route discovery, channel quality based adaptive flooding mechanism offers fringe benefit of energy efficiency as well. CQAG-AODV thus proves its suitability in a variety of use cases of multi-hop ad hoc networks including WSNs and VANETs.

scholarly journals Context-Aware Data Dissemination for ICN-Based Vehicular Ad Hoc Networks

Information ◽  
2018 ◽  
Vol 9 (11) ◽  
pp. 263 ◽  
Author(s):  
Yuhong Li ◽  
Xinyue Shi ◽  
Anders Lindgren ◽  
Zhuo Hu ◽  
Peng Zhang ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Data Dissemination ◽  
Delivery Ratio ◽  
Relative Distribution ◽  
Context Aware ◽  
Packet Forwarding ◽  
Information Centric Networking ◽  
Hoc Networks

Information-centric networking (ICN) technology matches many major requirements of vehicular ad hoc networks (VANETs) in terms of its connectionless networking paradigm accordant with the dynamic environments of VANETs and is increasingly being applied to VANETs. However, wireless transmissions of packets in VANETs using ICN mechanisms can lead to broadcast storms and channel contention, severely affecting the performance of data dissemination. At the same time, frequent changes of topology due to driving at high speeds and environmental obstacles can also lead to link interruptions when too few vehicles are involved in data forwarding. Hence, balancing the number of forwarding vehicular nodes and the number of copies of packets that are forwarded is essential for improving the performance of data dissemination in information-centric networking for vehicular ad-hoc networks. In this paper, we propose a context-aware packet-forwarding mechanism for ICN-based VANETs. The relative geographical position of vehicles, the density and relative distribution of vehicles, and the priority of content are considered during the packet forwarding. Simulation results show that the proposed mechanism can improve the performance of data dissemination in ICN-based VANET in terms of a successful data delivery ratio, packet loss rate, bandwidth usage, data response time, and traversed hops.

An advanced forwarding routing protocol for urban scenarios in VANETs

2017 ◽  
Vol 13 (4) ◽  
pp. 334-344 ◽  
Author(s):  
Sushil Kumar ◽  
Anil Kumar Verma
Keyword(s):  
Ad Hoc ◽  
Data Dissemination ◽  
Local Maximum ◽  
Movement Pattern ◽  
Delivery Ratio ◽  
Content Type ◽  
Greedy Forwarding ◽  
Suppression Technique ◽  
Efficient Data ◽  
Network Overhead

Purpose The purpose of this paper is to give an insight in to the routing protocols in Vehicular ad hoc Network (VANET). In this direction, for the efficient data dissemination in VANETs, a street-based forwarding protocol (SBFP) has been proposed. Design/methodology/approach The interferences among different street segments are considered and a unique street-based forwarding concept is introduced to reduce the local maximum problem. In this protocol, the greedy forwarding concept along with the broadcasting mechanism and suppression technique is implemented to minimize the overhead created in the regular beacons forwarding processes. QualNet simulator is used to implement and simulate SBFP. SUMO and MOVE tools are used to create the vehicle’s movement pattern and network topology. Findings The simulated results demonstrated improved packet delivery ratio (PDR) with a minimum average number of broadcast by each individual vehicle in the proposed SBFP than in its peer protocols. Originality/value This paper will be discussing a unique street-based forwarding technique exploring the advantages of global positioning system to obtain the location of vehicles and streets. This technique results in higher PDR and reduced network overhead.

scholarly journals Robust and Secure Data Transmission Using Artificial Intelligence Techniques in Ad-Hoc Networks

Sensors ◽  
2021 ◽  
Vol 22 (1) ◽  
pp. 251
Author(s):  
Pooja Rani ◽  
Kavita ◽  
Sahil Verma ◽  
Navneet Kaur ◽  
Marcin Wozniak ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Data Transmission ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Simulation Analysis ◽  
Fitness Function ◽  
Training Data ◽  
Support Vector ◽  
Destination Node ◽  
Delivery Ratio

The paper presents a new security aspect for a Mobile Ad-Hoc Network (MANET)-based IoT model using the concept of artificial intelligence. The Black Hole Attack (BHA) is considered one of the most affecting threats in the MANET in which the attacker node drops the entire data traffic and hence degrades the network performance. Therefore, it necessitates the designing of an algorithm that can protect the network from the BHA node. This article introduces Ad-hoc On-Demand Distance Vector (AODV), a new updated routing protocol that combines the advantages of the Artificial Bee Colony (ABC), Artificial Neural Network (ANN), and Support Vector Machine (SVM) techniques. The combination of the SVM with ANN is the novelty of the proposed model that helps to identify the attackers within the discovered route using the AODV routing mechanism. Here, the model is trained using ANN but the selection of training data is performed using the ABC fitness function followed by SVM. The role of ABC is to provide a better route for data transmission between the source and the destination node. The optimized route, suggested by ABC, is then passed to the SVM model along with the node’s properties. Based on those properties ANN decides whether the node is a normal or an attacker node. The simulation analysis performed in MATLAB shows that the proposed work exhibits an improvement in terms of Packet Delivery Ratio (PDR), throughput, and delay. To validate the system efficiency, a comparative analysis is performed against the existing approaches such as Decision Tree and Random Forest that indicate that the utilization of the SVM with ANN is a beneficial step regarding the detection of BHA attackers in the MANET-based IoT networks.

Sign in / Sign up

Export Citation Format

Share Document