An optimal path finding routing protocol for mobile Ad-Hoc network using random mobility model

Author(s):  
Bhabani Sankar Gouda ◽  
Rabindra Kumar Shial ◽  
K Hemant K Reddy
Author(s):  
Ajay Vyas ◽  
Margam Suthar

Mobility models are used to evaluated the network protocols of the ad hoc network using the simulation. The random waypoint model is a model for mobility which is usually used for performance evaluation of ad-hoc mobile network. Mobile nodes have the dynamic mobility in the ad hoc network so the mobility model plays an important role to evaluate the protocol performance.In this article, we developed modify random waypoint mobility (MRWM) model based on random waypoint for the mobile ad hoc network. In this article, the comparative analysis of modifying random waypoint mobility and random waypoint model on the ad hoc On-Demand Distance Vector (AODV) routing protocol has been done for large wireless ad hoc network (100 nodes) with the random mobile environment for the 1800s simulation time. To enhance the confidence on the protocol widespread simulations were accomplished under heavy traffic (i.e. 80 nodes) condition. The proposed model protocol has been investigated with the performance metrics: throughput; packet delivery ratio; packet dropping ratio; the end to end delay and normalized routing overhead. The obtained results revealed that proposed modify random waypoint mobility model reduces the mobility as compared to the random waypoint mobility model and it is trace is more realist.


2018 ◽  
Vol 27 (4) ◽  
pp. 523-536 ◽  
Author(s):  
Rahul K. Ambekar ◽  
Uttam D. Kolekar

Abstract Due to the dynamic nature of the mobile ad hoc network (MANET), all the nodes are mobile and generously connected to other nodes without the use of any fixed communications. Because of the random movement of nodes, the network topology is not predicted easily. Therefore, routing is one of the major challenging tasks in MANET. Significantly, the topology-hiding multipath routing protocol (TOHIP) is used to eliminate the topological exposure problem by transmitting the information through disjoint paths from the source to the destination. To select the optimal routing path, we have proposed the fractional lion algorithm to TOHIP (FL-TOHIP). Initially, the routing path is designed in MANET based on the existing TOHIP, which generates the number of disjoint routing paths. Then, the optimal path selection is done by the proposed fractional lion algorithm. To improve the solution searching, the fractional lion algorithm is adapted to the mathematical theory called fractional calculus. Finally, the performance of the proposed protocol is compared to the existing protocol using the delay, energy, and cost.


Author(s):  
. Harpal ◽  
Gaurav Tejpal ◽  
Sonal Sharma

In this time of instant units, Mobile Ad-hoc Network(MANET) has become an indivisible part for transmission for mobile devices. Therefore, curiosity about study of Mobile Ad-hoc Network has been growing because last several years. In this report we have mentioned some simple routing protocols in MANET like Destination Sequenced Distance Vector, Active Source Redirecting, Temporally-Ordered Redirecting Algorithm and Ad-hoc On Need Distance Vector. Protection is just a serious problem in MANETs because they are infrastructure-less and autonomous. Principal target of writing this report is to handle some simple problems and security considerations in MANET, operation of wormhole strike and acquiring the well-known routing protocol Ad-hoc On Need Distance Vector. This short article will be a great help for the people performing study on real world problems in MANET security.


Sign in / Sign up

Export Citation Format

Share Document