Reference Hub11
T-Whale: Trust and Whale Optimization Model for Secure Routing in Mobile Ad-Hoc Network

T-Whale: Trust and Whale Optimization Model for Secure Routing in Mobile Ad-Hoc Network

Ch.Ram Mohan, A. Venugopal Reddy
Copyright: © 2018 |Volume: 8 |Issue: 2 |Pages: 13
ISSN: 1947-3087|EISSN: 1947-3079|EISBN13: 9781522544999|DOI: 10.4018/IJALR.2018070104
Cite Article Cite Article

MLA

Mohan, Ch.Ram, and A. Venugopal Reddy. "T-Whale: Trust and Whale Optimization Model for Secure Routing in Mobile Ad-Hoc Network." IJALR vol.8, no.2 2018: pp.67-79. http://doi.org/10.4018/IJALR.2018070104

APA

Mohan, C. & Reddy, A. V. (2018). T-Whale: Trust and Whale Optimization Model for Secure Routing in Mobile Ad-Hoc Network. International Journal of Artificial Life Research (IJALR), 8(2), 67-79. http://doi.org/10.4018/IJALR.2018070104

Chicago

Mohan, Ch.Ram, and A. Venugopal Reddy. "T-Whale: Trust and Whale Optimization Model for Secure Routing in Mobile Ad-Hoc Network," International Journal of Artificial Life Research (IJALR) 8, no.2: 67-79. http://doi.org/10.4018/IJALR.2018070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.