Wednesday, 9 August 2023

The Impact of Sensor Networks' Packet Redundancy Elimination Technique | Chapter 1 | Research Highlights in Science and Technology Vol. 8

 This affiliate highlights the technique utilizing Rabin Karp hashing invention is to take full benefit of the duration of network with repetition removal by growing reliability, reducing delay and lowering energy consumption. A network that consists of any of bulky sensor nodes that are delivered over a region in an adhoc fashion is popular as Wireless Sensor Networks (WSN’s). Information from the source node is composed by the intermediary growth. These intermediary growth have information about the detected dossier that is both singular to them and additional.The result is redundancy. Further nodes above the network accept the redundancy. The fundamental goal search out identify and therefore get rid of any bundle level redundancy.  Using In-network storage is trailed as the existing habit of avoiding redundancy is for one application of Data Centric Storage Schemes. This scheme is suitableto dossier that is neither very ripened and existing data’s and those are still considered to be query nor present at the sensor bud which is secondhand for measure. Proficient data access is exhausted network storage by aim nodes and sensor nodes. The aim of Rabin Karp's packet redundancy removal hashing system is to reduce strength usage while identifying and removing packet level repetition, which will result in less duplicate dossier being received. The network energy level and bundle delivery are the focus of the accomplishment analysis.  The level of energy bewitched by the nodes in variable time period is eminent. The energy levels for existing and projected methods are compared. The contrasting is made with period and energy level of the nodes. The frequency range of the network is also compared and enhanced bandwidth be honest to 65% in sensor networks when compared with unoriginal networks. In order to reduce the amount momentary required for its killing, the advanced technique focuses on acquiring a superior time complicatedness. Additionally, the method can be improved in the future by choosing the cluster head growth based on a fluffy algorithm to reduce bundle redundancy and incorporate videos into original-time imitation for data aggregation and broadcast.

Author(s) Details:

B. S. Deepapriya,
Department of Artificial Intelligence and Datascience, Erode Sengunthar Engineering College, Perundurai, Tamil Nadu, India.

K. R. Priya Dharshini,
Department of Electronics and Communication Engineering, Erode Sengunthar Engineering College, Perundurai, Tamil Nadu, India.

N. R. Raghapriya,
Department of Computer Science and Engineering, Erode Sengunthar Engineering College, Perundurai, Tamil Nadu, India.

M. Kowsalya,
Department of Computer Science and Engineering, Erode Sengunthar Engineering College, Perundurai, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/RHST-V8/article/view/11536


No comments:

Post a Comment