International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 08 Issue: 03 | Mar 2021 www.irjet.net p-ISSN: 2395-0072 © 2021, IRJET | Impact Factor value: 7.529 | ISO 9001:2008 Certified Journal | Page 1311 Effective Implementation of Efficient Data Collection in WSN C. Jisha Chandra 1 , L.Suganya 2 , J.Manjushree Kumari 3 , R.Nagarajan 4 , S.Kannadhasan 5 1 Research Scholar, Department of Electrical and Electronics Engineering, Gnanamani College of Technology, Tamilnadu, India. 2 Assistant Professor, Department of Electrical and Electronics Engineering, PGP. College of Engineering &Technology Tamilnadu, India 3 Research Scholar, Department of Electrical and Electronics Engineering, Gnanamani College of Technology, Tamilnadu, India. 4 Professor, Department of Electrical and Electronics Engineering, Gnanamani College of Technology, Tamilnadu, India 5 Assistant Professor, Department of Electronics and Communication Engineering, Cheran College of Engineering, India ---------------------------------------------------------------------***---------------------------------------------------------------------- Abstract - Present wireless sensor network routing research has mainly centered on protocols that are energy conscious in order to increase the network's lifespan, are flexible to support a wide number of sensor nodes, and are immune to sensor damage and battery exhaustion. It is important to save resources in wireless sensor networks. Since energy considerations have overshadowed most sensor network science, the principles of delay have not been a primary concern in most of the published work. In WSANs, however, depending on the program, it may be appropriate to respond to sensor input quickly. Furthermore, in order to have effective behavior, sensor data must be current at the moment of operation. Routing focused on Forwarding Sets and the Random Wakeup Scheme is the two key components of AEPRA. The AEPRA routing approach is planned to take account of the dense implementation of sensor networks. The shortest route between two nodes is calculated proactively or reactively in standard routing protocols, and a node just forwards a packet to the next node on the computed shortest path. Because of the high node density, there are many routes between two nodes, many of which are very similar to the length of the shortest route. Key Words: Mobile Node, WSN, AEPRA, Shortest Path and Packet Ratio 1. INTRODUCTION Sensors probe their environments and transmit data to actor nodes in wireless sensor-actor networks. Actors collaborate together to accomplish a predetermined application task. Since actors must coordinate their behavior, a well-connected network topology must be maintained at all times. Furthermore, to satisfy latency criteria, the duration of inter-actor contact paths can be reduced. However, if one of the actors fails, the network can be partitioned into disjoint blocks, which would breach the communication target. To regain connectivity, one of the most successful recovery methodologies is to autonomously reposition a subset of the actor nodes. Modern recovery schemes either involve a lot of node relocation or expand any of the inter-actor data routes. The Adaptive energy Efficient Protocol for Fault Recovery Actors (AEPRA) algorithm presented in this paper addresses these flaws. AEPRA utilizes a node's local vision of the network to formulate a recovery strategy that relocates the fewest amount of nodes necessary while ensuring that no route between any two nodes is expanded. AEPRA is a distributed and localized algorithm that utilizes the network's current route exploration operations and introduces no extra pre- failure connectivity overhead [1]-[5]. AEPRA increases the network lifespan by changing the actors' energy use. AEPRA's output is mathematically evaluated and tested by detailed simulation studies. Replica node attacks are risky since they enable an intruder to take control over a significant portion of the network by leveraging the compromise of a few nodes. To protect against such attacks in static sensor networks, many replica node detection schemes have been suggested in the literature. These systems, on the other hand, are focused on fixed sensor positions and therefore do not operate in mobile sensor networks, where sensors are supposed to travel. Using the Sequential Likelihood Ratio Measure, we propose a quick and efficient mobile replica node detection scheme in this article. To our knowledge, this is the first paper to address the issue of replica node attacks in mobile sensor networks. The issues of node relation likelihood and ratio of mobile access nodes in a network are explored in this work, as well as the issue of energy-efficient data collection through mobile sensors with Three-Tier protection [6]-[10]. Mobile wireless sensor networks (MWSNs) are a type of WSN in which versatility is essential for the application's execution. Mobility has been a significant field of study for the WSN group in recent years. While WSN implementations were never meant to be entirely static, versatility was initially seen as presenting a range of challenges, including accessibility, coverage, and energy usage, to name a few. Latest research, on the other hand, has portrayed versatility in a more positive way. Rather than exacerbating these