Research Breakthrough Possible @S-Logix pro@slogix.in

Office Address

Social List

Secure Trust-Aware Multi-Objective Routing Protocol Based on Battle Competitive Swarm Optimization in IoT - 2023

secure-trust-aware-multi-objective-routing-protocol-based-on-battle-competitive-swarm-optimization-in-iot.png

Research Paper On Secure Trust-Aware Multi-Objective Routing Protocol Based on Battle Competitive Swarm Optimization in IoT

Research Area:  Internet of Things

Abstract:

A true routing system for the Internet of Things (IoT), Routing Protocol for Low Power and Lossy Networks (RPL) offers protection against many types of routing threats. The attacker can exploit the routing structure of RPL for launching devastating and destructive attacks counter to an IoT network. Moreover, Sybil and Rank attacks are most familiar among IoT attacks. Additionally, the resource-constrained design of IoT devices results in a routing protocol for RPL that is susceptible to a number of assaults. Even though the RPL condition offers encryption protection for controlling messages, RPL is susceptible to selfish behaviors and also internal attackers. In this research, the Battle Competitive Swarm Optimisation (BCSO) algorithm is developed to address the absence of reliable security measures in RPL. This approach principally encompasses two segments, namely IoT simulation and RPL routing, whereas Destination Oriented Directed Acyclic Graph is also applied in RPL. In this approach, different fitness functions, such as node energy, delay, trust, and distance are considered. The devised BCSO_RPL achieved better performance than other conventional techniques with energy consumption, throughput, delay, link quality, and packet loss of 0.7038 J, 0.2964Gbps, 0.6950 s, 2.178, and 0.0950, respectively.

Keywords:  

Author(s) Name:  N. V. Rajeesh Kumar, N. Jaya Lakshmi, Balasubbareddy Mallala & Vaishali Jadhav

Journal name:  Artificial Intelligence Review

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s10462-023-10560-x

Volume Information:  Volume 56, pages 1685-1709, (2023)