T-Whale

2018 ◽  
Vol 8 (2) ◽  
pp. 67-79 ◽  
Author(s):  
Ch.Ram Mohan ◽  
A. Venugopal Reddy
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Search Algorithm ◽  
Random Search ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Data Encryption ◽  
Secure Routing ◽  
Mobile Nodes ◽  
Whale Optimization

One of the infrastructureless networks built by various independent mobile nodes is mobile ad hoc network (MANET), which is an emerging technology, requiring a secure routing protocol for data transmission. Accordingly, literature presents various secure routing protocols for MANETs by utilizing trust and data encryption. In this article, a whale optimization algorithm (WOA) is utilized for selecting the optimal secured routing path in the MANET. The WOA algorithm utilizes the trust factor and the distance between the nodes for computing the fitness for the routing path. Overall, the steps involved in the proposed routing algorithm are as follows: i) Measuring the trust and the distance-based metrics for every node; ii) Discovering k-disjoint path; and iii) Determining the optimal path based on the trust and the distance-based metrics. The performance of the trust-based WOA (T-Whale) is analyzed using the metrics, energy, throughput, and packet delivery rate. From the simulation results, it is evident that the T-Whale algorithm has the improved energy, throughput, and PDR values of 27.4520, 0.4, and 0.4, at the simulation time of 10 sec over the conventional trust random search algorithm when the node is under attack.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

scholarly journals Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

2019 ◽  
Vol 8 (10) ◽  
pp. 912-917
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Mobile Nodes ◽  
Routing Overhead ◽  
End To End Delay ◽  
Stay Time ◽  
End To End ◽  
Neighbor Selection

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming significant from the last decade. A MANET is a kind of wireless network which has been set-up without requirement of fixed infrastructure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the usefulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evaluation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.

scholarly journals Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 4503-4509
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
High Mobility ◽  
Propagation Delay ◽  
Link Failure ◽  
Mobile Nodes ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse’s mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay

scholarly journals Mobility Aware Energy Efficient Cluster Based Secure Routing Protocol for Mobile Adhoc Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 3609-3613
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fitness Function ◽  
Secure Routing ◽  
Energy Distance ◽  
Validation Parameters ◽  
Whale Optimization ◽  
Multiple Input ◽  
Effective Performance ◽  
Fuzzy Logic Technique

Mobile ad-hoc network (MANET) is an evolving technology which derives under the class of wireless networks. Due to the inherent characteristics of nodes in MANET, energy efficiency and security still remains a major design issue. This paper intends to develop a multi-objective optimization (MOO) model for effective load distribution and security in the network. The presented MOO technique operates on two main stages namely clustering and secure routing. In the first stage, fuzzy logic technique with multiple input parameters namely energy, distance, link duration, latency, and trust are used for effective cluster construction. In the next stage, Lion Whale optimization (LWO) algorithm is introduced for secure routing. Using the determined MOO variables, a fitness function is derived to select the optimal routes for secure routing in MANET. The effective performance of the presented FLWO model is tested using a set of validation parameters and the proposed model attains maximum performance over other methods in a considerable way.

scholarly journals Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

2019 ◽  
Vol 8 (11) ◽  
pp. 3529-3535
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
High Mobility ◽  
Base Station ◽  
Mobile Nodes ◽  
Shuffled Frog Leaping Algorithm ◽  
Routing Optimization ◽  
Shuffled Frog Leaping ◽  
Hoc Networks

The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centralized administration or the base station. Routing indicates a method by which information gets forwarded from transmitters to recipients. This is a strategy which guarantees the connection between two of the nodes in this network. For this work, there was a routing algorithm that was proposed for an efficient determination of an optimal path from the source to the destination in the MANETs. The Ad hoc On-Demand Distance Vector Routing (AODV) based protocol has been a routing protocol that has been designed for operating the MANET. This algorithm had been designed by means of using the TABU Search (TS) and the Shuffled Frog Leaping Algorithm (SFLA) which has been a metaheuristic algorithm that is a representation. The TABU_SFLA proposed had carried out two other operations generated in the neighbourhood for determining the optimal path and to minimize the time of execution. The results were compared to prove that the proposed TABU_SFLA was able to outperform all other algorithms that were well-suited for adapting the problem of routing optimization.

scholarly journals Multipath Routing protocol: NCPR and QAMR

2013 ◽  
Vol 11 (10) ◽  
pp. 3065-3070
Author(s):  
Roopali Garg ◽  
Guneet Kaur
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Mobile Nodes ◽  
Mobile Ad Hoc

Mobile ad hoc network is an assembly of mobile nodes with no centralized server. Due to mobility of nodes and decentralized network it is difficult to maintain the quality of service (QoS) in routing the packets from source to destination.  QoS can be defined in terms of various metrics like delay, bandwidth, packet loss, routing overhead, jitter. Routing can be unicast, multicast or multipath.  This paper presents the description about the QoS multipath routing algorithm.

scholarly journals Mobility-Aware Routing Algorithm for Mobile Ad Hoc Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Chalew Zeynu Sirmollo ◽  
Mekuanint Agegnehu Bitew
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Performance Metrics ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Central Administration ◽  
Discovery Process ◽  
Mobile Nodes ◽  
Mobile Ad Hoc

Mobile ad hoc network (MANET) is a group of wireless mobile nodes that create a temporary network without the help of any central administration or standard support services. Mobility of nodes determines the overall performance of MANET networks. High mobility of nodes causes frequent changes in the network topology, and this leads to link breakage and increases reinitiating of the route discovery process. MANETs commonly use broadcasting techniques for route discovery process. However, it can cause redundant rebroadcasts, packet collisions, and channel contention. The main objective of this paper is to design and develop the mobility-aware routing algorithm (MARA) to enhance the performance of the routing protocol in MANETs. The proposed scheme allows mobile nodes to rebroadcast or discard received broadcasted messages. The decision is based on the combination of node speed, distance between nodes, and residual energy of nodes. These parameters are considered both in route request and route reply process to reduce the chance of link breakage and broadcast storm problems. The proposed algorithm has been evaluated based on the performance metrics: packet delivery ratio, average end-to-end delay, throughput, and routing overhead. We have used network simulator NS-2 V-2.35. The simulation results revealed that MARA outperforms ad hoc on-demand distance vector (AODV), mobility and direction aware (MAD), and mobility and energy-aware (MAE) routing protocols.

Performance Evaluation of Secure Routing in Mobile Ad Hoc Network Using Ad Hoc on-Demand Distance Vector Routing Protocol

2019 ◽  
Vol 16 (9) ◽  
pp. 3835-3839
Author(s):  
Nippun Kamboj ◽  
Dalip ◽  
Munishwar Rai
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Communication ◽  
Secure Routing ◽  
Mobile Nodes ◽  
Efficient Data ◽  
Mobile Ad Hoc ◽  
The Comparative Study

In modern era, MANET i.e., Mobile Ad-hoc Network is a very powerful, interactive tool and useful resource for transmission/communication in computer networks. About composition of MANET, a collection of mobile nodes have the potential of creating self-maintaining and self-configurable network without having any centralized infrastructure i.e., MANET is a self-organized network without any infrastructure. Nodes in the network require energy for transmission of data after collapse of energy a node become inactive and it can’t participate in the communication. Due to exhaustation of energy the network becomes unstable. An unstable network requires extra routing process for coin out a route. In future security of MANET is a major challenge for smooth and efficient data communication. There are many protocols in MANET but in this paper, we discussed AODV routing protocol for data communication. In this paper a new algorithm is designed i.e., modified AODV with security constraint. This paper also gives the comparative study of original AODV and modified AODV.

scholarly journals A Review Paper on Different Application of Genetic Algorithm for Mobile Ad-hoc Network (MANET)

2020 ◽  
Vol 16 (05) ◽  
pp. 119
Author(s):  
Jinfa Shi ◽  
Misbah Habib ◽  
Hai Yan
Keyword(s):  
Genetic Algorithm ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Review Paper ◽  
Search Algorithm ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Function Evaluation ◽  
Mobile Ad Hoc

<p class="0abstract">A Genetic algorithm is a search algorithm depends on the methodology of natural selection and natural genetics. A Mobile Ad hoc network (MANET) is a type of wireless nodes (Devices) which are free to move anywhere in the network without any constraints. The nodes which are in range can communicate each other through radio waves and those who are not in range use any routing algorithm for communication. In this review paper, we focus on the problems of MANET that has been solved by applying GA for it and highlights the characteristic and challenges of MANET in the literature. More specifically, we present the summary of review papers and basic solutions that use and in the last, we present some future direction. Consequently, we concluded that modification in Fitness function (Evaluation function) according to the problem is the base of Genetic algorithm and variation in algorithm parameters can give solutions in a reasonable time.</p>

Sign in / Sign up

Export Citation Format

Share Document