scholarly journals Optimized Node Clustering in VANETs by Using Meta-Heuristic Algorithms

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 394 ◽  
Author(s):  
Waleed Ahsan ◽  
Muhammad Fahad Khan ◽  
Farhan Aadil ◽  
Muazzam Maqsood ◽  
Staish Ashraf ◽  
...  
Keyword(s):  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Heuristic Algorithms ◽  
Dynamic Change ◽  
Grey Wolf Optimizer ◽  
Node Density ◽  
Dragonfly Algorithm ◽  
Node Clustering ◽  
On The Road

In a vehicular ad-hoc network (VANET), the vehicles are the nodes, and these nodes communicate with each other. On the road, vehicles are continuously in motion, and it causes a dynamic change in the network topology. It is more challenging when there is a higher node density. These conditions create many difficulties for network scalability and optimal route-finding in VANETs. Clustering protocols are being used frequently to solve such type of problems. In this paper, we proposed the grasshoppers’ optimization-based node clustering algorithm for VANETs (GOA) for optimal cluster head selection. The proposed algorithm reduced network overhead in unpredictable node density scenarios. To do so, different experiments were performed for comparative analysis of GOA with other state-of-the-art techniques like dragonfly algorithm, grey wolf optimizer (GWO), and ant colony optimization (ACO). Plentiful parameters, such as the number of clusters, network area, node density, and transmission range, were used in various experiments. The outcome of these results indicated that GOA outperformed existing methodologies. Lastly, the application of GOA in the flying ad-hoc network (FANET) domain was also proposed for next-generation networks.

An Improved Ad Hoc Network Communication Based on Cluster

2013 ◽  
Vol 660 ◽  
pp. 184-189 ◽  
Author(s):  
Yan Zhai ◽  
Xing Wei ◽  
Lei Liu ◽  
Liao Yuan Wu
Keyword(s):  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Cluster Head ◽  
Directional Antennas ◽  
Directional Antenna ◽  
Gateway Node ◽  
Adaptive Clustering ◽  
Communication Method ◽  
Hoc Networks

In order to tackle the data transmission bottlenecks of the gateway node in clustering Ad hoc Networks, the paper proposes a communication method. Firstly, DMAC (Distributed and Mobility-Adaptive Clustering) algorithm and Omni-directional antenna is well introduced and discussed. Then the ICMMDA (The Inter-cluster Communication Method based on Directional Antennas) policy building virtual channels between two hops away cluster-head and using directional antenna is brought about. Lastly, the simulation shows that the method can reduce the end-to-end delay between two clusters and improve the network throughput.

scholarly journals A Novel Clustering Algorithm Based on Agent Technology for VANET

2016 ◽  
Vol 8 (2) ◽  
pp. 1 ◽  
Author(s):  
Samira Harrabi ◽  
Ines Ben Jaafar ◽  
Khaled Ghedira
Keyword(s):  
Traffic Congestion ◽  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Clustering Algorithms ◽  
High Mobility ◽  
Agent Technology ◽  
Related Data ◽  
Network Overhead

Vehicular Ad-hoc Network (VANET) is a sub-family of Mobile Ad-hoc Network (MANET).The means goal of VANET is to provide communications between nearby nodes or between nodes and fixed infrastructure. Despite that VANET is considered as a subclass of MANET, it has for particularity the high mobility of vehicles producing the frequent changes of network topology that involve changing of road, varying node density and locations of vehicles existing in this road. That‘s why, the most proposed clustering algorithms for MANET are unsuitable for VANET. Various searches have been recently published deal with clustering for VANETs. But most of them are focused on minimizing network overhead value, number of created clusters and had not considered the vehicles interests which defined as any related data used to differentiate vehicle from another (such as traffic congestion, looking for free parking space etc). In this paper, we propose a novel clustering algorithm based on agent technology to solve the problems mentioned above and improve routing in VANET. Experimental part show promising results regarding the adoption of the proposed approach.

On the Impact of Network Dynamics on a Discovery Protocol for Ad-Hoc Networks

2010 ◽  
pp. 1595-1613
Author(s):  
Fei Liu ◽  
Geert Heijenk
Keyword(s):  
Ad Hoc Networks ◽  
Linear Relation ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Network Dynamics ◽  
Bloom Filters ◽  
Context Information ◽  
Node Density ◽  
Hoc Networks ◽  
The Impact

A very promising approach to discovering services and context information in ad-hoc networks is based on the use of Attenuated Bloom filters. In this paper we analyze the impact of changes in the connectivity of an ad-hoc network on this approach. We evaluate the performance of the discovery protocol while nodes appear, disappear, and move, through analytical and simulative analysis. The analytical results are shown to be accurate when node density is high. We show that an almost linear relation exists between the density of the network and the number of update messages to be exchanged. Further, in case of nodes moving, the number of messages exchanged does not increase with the speed of movement.

Sign in / Sign up

Export Citation Format

Share Document