scholarly journals Multi-Objective based Adaptive Meta-Heuristic Algorithm for Optimal Multicast Route Selection in Wireless Ad-Hoc Network

2019 ◽  
Vol 9 (1) ◽  
pp. 6721-6729
Keyword(s):  
Heuristic Algorithm ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Multicast Routing ◽  
Optimal Path ◽  
Path Selection ◽  
Delivery Ratio ◽  
Route Selection ◽  
Multi Objective

Mobile Ad-hoc Network (MANET) built by a lot of mobile nodes which are communicated over remote channel without having any centralized administration and fixed infrastructure. Multicasting is a method to forward a data packet from one node to a number of receivers’ node at a time. There are different challenges in a MANET because of restricted resources and dynamic network topology. Because of the node mobility, performance metrics of the network such as energy, delay, and bandwidth make uncertainty problems in MANET. These uncertainty problems affect the performance of optimal path selection between the source node and the number of destination nodes. So, in this paper, multi-objective based adaptive meta-heuristic algorithm is presented for optimal multicast route selection in MANET. Among the multicast routing paths, optimal routing path is selected using adaptive artificial fish swarm algorithm (AAFSA). For fitness calculation, three objective functions based on energy, delay and bandwidth are derived in this algorithm. Simulation results show that the performance of the proposed multicast routing protocol outperforms existing multicast routing protocols in terms of delivery ratio, delay, energy consumption and network lifetime.

scholarly journals FL-TOHIP (Fractional Lion Algorithm to Topology-Hiding Multipath Routing Protocol) in Mobile ad hoc Network

2018 ◽  
Vol 27 (4) ◽  
pp. 523-536 ◽  
Author(s):  
Rahul K. Ambekar ◽  
Uttam D. Kolekar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Multipath Routing ◽  
Path Selection ◽  
Lion Algorithm ◽  
Mobile Ad Hoc ◽  
Exposure Problem

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.

scholarly journals Metaheuristic Technique for Dynamic and Energy Efficient Routing (METDEER) in MANET

2019 ◽  
Vol 9 (1) ◽  
pp. 1282-1289
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimization Technique ◽  
Path Selection ◽  
Delivery Ratio ◽  
Route Selection ◽  
Energy Efficient Routing ◽  
Mobile Ad Hoc ◽  
Ratio Energy ◽  
Selection Of

The Metaheuristic Technique in Mobile Ad-hoc Network (MANET) is an experiment based model for improving lifetime of the MANET. This contribution proposes a Balanced Network Monitoring and Routing-Based on Ant Colony Optimization Technique (BNMR-ACOT) that enhances the lifetime of the network by providing a balanced selection of nodes during the routing process. Experiments were conducted with various parameters – packet delivery ratio, energy consumption of node and total overhead were compared with existing models with BNMR, which exhibits two times better route selection levels and twenty times faster route selection times. Node usage levels and randomization levels in the path selection component were observed to exhibit effective performances.

scholarly journals An improved harmony search algorithm for optimized link state routing protocol in vehicular ad hoc network

2018 ◽  
Vol 7 (2.14) ◽  
pp. 177
Author(s):  
Mustafa Raad Hammoodi ◽  
Ravie Chandren Muniyand
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Delivery Ratio ◽  
Roulette Wheel Selection ◽  
Link State ◽  
Improved Harmony Search

Vehicle Ad-hoc Network (VANET) is a direct application of Mobile Ad-hoc Network (MANET). Nodes in VANET are vehicles that communicate using vehicle to vehicle (V2V) or vehicle to infrastructure (V2I). These types of communications have led to the emergence of various applications that provide safer driving. Due to the high changing of topology and frequent fragmentation of VANET, routing pack-ets in this type of network is a hard task. In this work, the authors deal with the well-known MANET proactive Optimized Link State Rout-ing protocol (OLSR). The deployment of OLSR in VANET gives the moderate performance; this is due to its necessity of constant ex-changing of control packets. The performance of OLSR is highly dependent on its parameters, thus finding optimal parameters configura-tions that best fit VANETs environment and improves the network is essential before its deployment. Therefore, this research proposes a modified Harmony Search optimization (HSO) by incorporating selection methods in its memory consideration; roulette wheel selection to obtain fine-tuned OLSR for high density and velocity scenario. The experimental analysis showed that the OLSR with the proposed ap-proach acquired promising results regarding packet delivery ratio, end-to-end delay and overhead when compared with previous approaches.  

scholarly journals On Demand Multicasting Routing Protocol compared with AODV and FSR in Mobile Ad hoc Network

2013 ◽  
Vol 6 (1) ◽  
pp. 705-710
Author(s):  
Kavita Kundlik Bondre ◽  
Prof. Ajitsinh.N. Jadhav
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Multicast Routing ◽  
Mesh Networks ◽  
On Demand ◽  
Multicast Routing Protocol ◽  
Mobile Ad Hoc ◽  
Acquisition Delay

Mobile ad hoc network is a collection of wireless nodes that dynamically organize themselves to form a network without the need for any fixed infrastructure or centralized administration. The network topology dynamically changes frequently in an unpredictable manner since nodes are free to move. Support for multicasting is essential in such environment as it is considered to be an efficient way to deliver information from source nodes to many client nodes. On-Demand Multicast Routing Protocol is a protocol for routing multicast and unicast traffic throughout adhoc wireless mesh networks. ODMRP creates routes on demand so they suffer from a route acquisition delay,although it helps reduce network traffic in general. In future this  results will be compared with AODV and FSR protocol and ODMRP performs better as compared with AODV and FSR protocol.

scholarly journals Efficient Heuristic Based on Clustering Approach for OLSR

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Choukri ◽  
Ahmed Habbani ◽  
Mohamed El Koutbi
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
End To End Delay ◽  
Delay Control ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss.

Sign in / Sign up

Export Citation Format

Share Document