Open Access
ARTICLE
Energy Based Random Repeat Trust Computation in Delay Tolerant Network
National Engineering College, Kovilpatti, 628503, India
* Corresponding Author: S. Dheenathayalan. Email:
Computer Systems Science and Engineering 2023, 46(3), 2845-2859. https://doi.org/10.32604/csse.2023.033326
Received 14 June 2022; Accepted 08 October 2022; Issue published 03 April 2023
Abstract
As the use of mobile devices continues to rise, trust administration will significantly improve security in routing the guaranteed quality of service (QoS) supply in Mobile Ad Hoc Networks (MANET) due to the mobility of the nodes. There is no continuance of network communication between nodes in a delay-tolerant network (DTN). DTN is designed to complete recurring connections between nodes. This approach proposes a dynamic source routing protocol (DSR) based on a feed-forward neural network (FFNN) and energy-based random repetition trust calculation in DTN. If another node is looking for a node that swerved off of its path in this situation, routing will fail since it won’t recognize it. However, in the suggested strategy, nodes do not stray from their pathways for routing. It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route, based on their pattern of mobility. The EBRRTC-DTN algorithm (Energy based random repeat trust computation) is based on the time that has passed since nodes last encountered the destination node. Compared to other existing techniques, simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node, which improves routing performance, increases the number of delivered messages, and decreases delivery delay. Therefore, the suggested method is better at providing better QoS (Quality of Service) and increasing network lifetime, tolerating network system latency.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.