Modular metric spaces : Some fixed-point theorems and application of secure dynamic routing for WSN

Abstract

Data exchange within a Wireless Sensor Network (WSN) needs to adhere to high security protocols. The shortest possible route for the transfer of data between two interconnected packets is selected by dynamic routing algorithms, which increases privacy while requesting additional data to be transmitted. Several applications involving remote sensing of environmental requirements, such as WSN, are becoming more prevalent. Highly dense WSNs are evolving into a vital sensor framework enabling the Internet of Things (IoT). WSNs have the potential to synthesize a great deal of actual data, and in order to guarantee that data communication is being performed successfully, they need network architectures that have successful links between Sensor Nodes (SN). The collection of data is a term WSN utilises to define a data fusion/compression technique to minimize the volume of data sent throughout the network’s bandwidth. The process of iteration of Fixed Points (FP) of contractions will be examined in the present paper, which is scheduled to take part under a Modular Metric Space (M-MS) context. The main objective of this research is to arrive at an algorithm for secure dynamic data transmission routing in WSN by integrating the demonstrated results of the Functional Equation (FE) with randomization. An implementation is a tool for evaluating and modelling a network’s architecture in which sensors can be aggregated with a high level of security and least risk in a more secure area (Sensor Field), thereby improving the accuracy of the findings collected by the entire network.