MIT-World Peace University (MIT-WPU) is a top educational institute located in Pune, India. It is recognized within&nbsp;UGC under Government of Maharashtra Act No. XXXV 2017.&nbsp;

It is part of the MIT group of institutions (established in 1983) which covers 10+ campuses across India and has more than 50,000+ students enrolled across various disciplines at a given point of time. The institute houses 15 schools ranging from Engineering &amp; Technology, Design, Pharmacy, Commerce, Governance among others. It offers undergraduate, postgraduate and PhD programs among different disciplines.&nbsp;

&nbsp;

MIT World Peace University

School of Computer Engineering & Technology

Engineering and Technology

nternational Journal for Research in Applied Science and Engineering Technology

"Planning an Optimal Road Trip Analysis and Drowsiness Detection Using Genetic Algorithm”

The main challenge of wireless sensor network is its lifetime. In this type of network, single static sink node is present and a sensor device node requires more energy for estimating information packet specifically those that are available in the area of the sink node. Such nodes separate the energy so fast due to the numerous tone traffic patterns and at the end they die. This uneven event is named as hotspot issue which gets more real as the numbers of sensor nodes increase. Generally, replacement of such energy sources is not a feasible and cost-effective solution. For this problem, there is one solution regarding to distance. If the distance among sensor and sink node is minimized, the energy consumption will be effectively reduced. This paper presents the solution for enhancing network lifetime with energy saving of sensor nodes. Here, we also discuss on the limitations and advantages of previous methods. The sensors nodes consume more battery power which is at minimum distance from sink node. Therefore, energy of sensor nodes in network will quickly consume their energy. So that, the lifetime of a sensor nodes will be produced. To overcome this drawback of this system, we propose alternate shortest path technique. To enhance the efficiency of energy along with network lifespan, this approach is used. Furthermore, we developed a novel technique known as Energy Aware Sink Relocation (EASR) for remote base station in WSN if the energy of alternate path is going to die. This system exploits information recognized with the remaining energy of sensor nodes battery for increasing the range of transmission of sensor node and relocation technique for the sink node in network. Some calculated numerical and theoretical calculations are given to demonstrate that the EASR strategy is used to increase the network energy of the remote system essentially. Our system proposes secure data sending using ECC algorithm and increases more network lifetime.

World University root node

Advances in Intelligent Systems and Computing

Routing with secure alternate path selection for limiting the sink relocation and enhanced network lifetime

A Survey On Secure Alternate Path Selection For Enhanced Network Lifetime in Wireless Sensor Network

The prior communication between the mobile nodes(beacons)in the network is not possible in some situations. As the network topologies and the network traffic conditions vary, the optimum position of the neighbor node should be determined. Localization is one of the fundamental problems in wireless adhoc networks, since locations of the mobile nodes are critical to both network operations and most application level tasks. Localization accuracy and reduction in the number of position information messages can be achieved, in real-time, by determining the optimal position from where the beacon should transmit its next position information. The RREQ sent by the sender is broadcasted leading to the flooding of the information messages. Directional Routing Protocol floods the RREQ packet in the network.We, first outline localized directional routing protocol to unicast the RREQ messages. For this an advisory can keep track of nodes using three hop concepts to find the shortest hop. We further present the pseudo formation control problem as an unconstrained optimization problem under free space propagation model.