MCTRP: An Energy Efficient Tree Routing Protocol for Vehicular Ad Hoc Network Using Genetic Whale Optimization Algorithm

2019 ◽  
Vol 110 (1) ◽  
pp. 185-206 ◽  
Author(s):  
Usha Mohanakrishnan ◽  
B. Ramakrishnan
Author(s):  
Suresh R. Halhalli ◽  
B. N. Jagdale ◽  
Shounak Rushikesh Sugave

Mobile ad hoc network (MANET) consists of a group of self-operated mobile nodes that form a network without considering predefined infrastructure. In the network, each node poses less energy due to battery-operated sensor nodes. Numerous methods are devised for routing, but each method suffered from the energy constraint. This paper proposes an energy-efficient multipath routing protocol for exploiting different routes between source and destination to mitigate energy constraints. The key idea is to determine the optimal path from a set of paths available between the source and the target node. To improve the security in routing protocol, the factors, like energy, trust, and mobility are considered as major components. Here, the trust is modeled by considering trust factors, like average encounter rate (AER), successful cooperation frequency (SCF), direct trust, integrity factor, and forwarding rate factor. Moreover, secure routing is performed between the nodes using the proposed Adaptive-Atom Whale Optimization algorithm (Adaptive-AWOA). The proposed Adaptive-AWOA) is designed by incorporating the Adaptive concept in the Atom Whale Optimization algorithm (AWOA). The fitness function is newly modeled considering mobility, energy, and trust factors. The proposed Adaptive-AWOA outperformed the other methods with a minimal end-to-end delay of 0.009, maximal throughput of 85.802% and maximal packet delivery ratio (PDR) of 97.391%, respectively.


Computing ◽  
2012 ◽  
Vol 96 (2) ◽  
pp. 119-131 ◽  
Author(s):  
Jian-Ming Chang ◽  
Chin-Feng Lai ◽  
Han-Chieh Chao ◽  
Rongbo Zhu

2011 ◽  
Vol 467-469 ◽  
pp. 972-977
Author(s):  
Bon Yeh Lin ◽  
Chi Hua Chen ◽  
Chi Chun Lo

The Vehicular Ad-hoc NETwork (VANET) requires a suitable routing protocol to accommodate its special characteristics (e.g., high mobility, short-lived links, and fast-changing topology). There are many routing algorithms which are developed for transmitting information more quickly and cost-effective. In this paper, we propose a routing protocol which relies on Defer-Time Control Function (DTCF) to reduce the hop count, the transmission delay, and the probability of collisions during transmission. We provide an extensive analysis of DTCFs and choose the power-law model for routing protocol optimization. The function can be adjusted dynamically according to the distribution of the neighboring nodes (vehicles) of each hop. We also propose a mechanism to prevent the selected next-hop leaves the transmission range.


Sign in / Sign up

Export Citation Format

Share Document