Fractwhale-dsr: Fractional whale optimization based secure dynamic source routing algorithm for mobile ad-hoc network

被引：0
作者：
Suma P. [1 ]
Hussain M.A. [2 ]
机构：
[1] Department of Computer Science Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram
[2] Department of Electronics and Computer Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram
来源：
Recent Advances in Computer Science and Communications | 2020年 / 13卷 / 05期
关键词：
Congestion; Connectivity; Dynamic nature; Dynamic secured routing; Fractional whale optimization algorithm; MANET;
D O I：
10.2174/2213275912666190715165444
中图分类号：
学科分类号：
摘要：
Background: Nodes in the mobile Ad-hoc network (MANET) have the dynamic nature due to their vast separation distance. The dynamic nature of the MANET nodes changes the routing path established for the communication. The dynamic secured routing (DSR) has gained popularity since they provide the routing path based on the demand provided by the source and destination nodes. Various literature works have discussed the DSR strategy for routing path establishment, but faces challenges since it consumes high energy during the route discovery phase. Objectives: To overcome the challenges in the existing works, a DSR strategy based on the Fractional Whale optimization algorithm (FWOA) is introduced in this work. Methods: The proposed algorithm uses the C 2 TE based selection criteria which depend on the connectivity, congestion, trust, and energy for selecting the suitable nodes for the communication. The proposed FractWhale-DSR algorithm finds the secured routing path in three phases. Results: The parameters, such as throughput, delay, Packet Delivery Ratio (PDR), and the energy define the performance of the proposed model. From the simulation results, the proposed Frac-tWhale-DSR algorithm has an overall better performance with the values of 0.57265, 0.005118, 0.786325, and 75.88636% for throughput, delay, PDR, and energy respectively at the round of 25 for the MANET with 100 nodes. Conclusion: The proposed DSR strategy has the advantage of adaptability and scalability. Also, the router selects the alternate paths, when there is a link failure in the current network. © 2020 Bentham Science Publishers.
引用
收藏
页码：942 / 956
页数：14
相关论文
共 27 条
  • [1] Prakash M. J. V., Kaliappan M., Development of a secure routing protocol using game theory model in mobile ad hoc net-works, J. Commun. Netw. (Seoul), 17, 1, pp. 75-83, (2015)
  • [2] Sethuraman P., Kannan N., Refined trust energy-ad hoc on demand distance vector (ReTE-AODV) routing algorithm for secured routing in MANET, Wirel. Netw, 1, pp. 1-11, (2016)
  • [3] Chatterjee S., Das S., Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network, Inf. Sci, 295, pp. 67-90, (2015)
  • [4] Mao Y., Zhu P., A game theoretical model for energy-aware DTN routing in MANETs with node’s selfishness, Mob. Netw. Appl, 20, 5, pp. 593-603, (2015)
  • [5] Shankar S., Varaprasad G., Suresh H. N., Importance of on-demand modified power aware dynamic source routing protocol in mobile ad-hoc networks, IET Microw. Antennas Propag, 8, 7, pp. 459-464, (2014)
  • [6] Rafsanjani M.K., Fatemidokht H., FBeeAdHoc: A secure routing protocol for BeeAdHoc based on fuzzylogic in MANETs, Int. J. Electron. Comm, 69, 11, pp. 1613-1621, (2015)
  • [7] Borkar G.M., Mahajan A.R., A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks, Wirel. Netw, 23, pp. 1-18, (2016)
  • [8] Tan S., Li X., Dong Q., Trust based routing mechanism for securing OSLR-based MANET, Ad Hoc Netw, 30, 3, pp. 84-98, (2015)
  • [9] Singh G., Kumar N., Verma A. K., ANTALG:An innovative ACO based routing algorithm for MANETs, J. Netw. Comput. Appl, 45, pp. 151-167, (2014)
  • [10] Attimarad G. V., Prasad M. N. G., MECOR: Minimal energy consumption with optimized routing in MANET, Wirel. Pers. Commun, 88, 4, pp. 963-983, (2016)
123