Broadcast Tree Construction for Secure and Shortest Path Finding Techniques in WSN for Smart Farming Application

A wireless sensor network (WSN) consists of a large number of distributed sensing devices that use little power and processing capabilities. Data packet switching in sensing devices is often achieved by using multi-hop transmission due to the limited range of connection and the dense distribution of sensor nodes. Dynamic routing in wireless sensor networks (WSN) has been more popular in recent years. In modern times, sensor networks often use the multipath data transmitting approach to optimize system performance by using the available bandwidth. The main objective of this paper is to elucidate the concept of multipath routing, along with its inherent challenges and fundamental justifications for using this approach in sensor networks. This study presents a method for determining the shortest route using the Broadcast Tree Construction (BTC) algorithm, which incorporates data aggregation methods to reduce network overhead during communication. This method is suitable for both cluster networks and Wireless Sensor networks. We conducted a comprehensive experimental study to assess the performance of our proposed system in the NS2 environment. We tested the system using four distinct protocols and examined its efficiency. The system conserves 15% of the energy of internal nodes and improves network life by 7% when it operates with SAODV.