Secured Communication using Distributed Caching Techniques

Due to erratic connections, a lack of adaptability, and transmission rate failures in mobile communication. Beginning with the destination node, the projected connection quality, energy, and latency are used to determine the reliable path. The mobile ad hoc network’s nodes are mobile, thus it is necessary to take the link quality into account. In order to detect routing tree faults and launch a failure recovery strategy that can boost data transmission speeds while minimising failures along the selected reliable path, the Distributed Caching and Fault-tolerant Communication (DCFC) protocol is utilised. The Trusted Security Policy based Routing Algorithm (TSPRA) is employed to prevent packet losses and additional overhead caused by security issues. This programme demonstrates how well-protected data is as a result of precise access control procedures and increasing the quantity of the highly secured data. A suggested solution uses the Hybrid Optimal Trust (HOT) technology to transmit a Safe Alert Routing (SAR) protocol for a route free of accidents. The Privacy Preservation Authentication Secure Geographical Routing Protocol (PPASGR) is compared to the SAR-HOT method to generate successful outcomes in the simulation section for all characteristics including delay, energy, and speed.

Author(s) Details:

D. Bhuvana Suganthi,
B. N. M. Institute of Technology, Bengaluru, Karnataka, India.

A. Punitha,
M. A. M. School of Engineering, Thiruchirapalli, Tamil Nadu, India.

S. Raghupathi,
Department of Electrical Engineering, University of Technology and Applied Science, Ibri, Oman.

Please see the link here:  

Keywords: Mobile distributed networks, trusted security, distributed caching, routing algorithm, overhead ratio, mobile host, reliable paths, bloom filter, mobile agent

Leave a Reply

Your email address will not be published. Required fields are marked *

Previous post The Non-parametric Regression Methods in Sequence Data Study
Next post Combinatorial Problems on Algebraic Configured Graphs