Abstract

 
 
 
 Abstract:
 Wireless Sensor Networks (WSNs) have gained significant traction as a viable solution for a diverse range of applications that necessitate the monitoring and regulation of distant environments. Wireless sensor networks (WSNs) are frequently constrained by the energy resources of the individual sensor nodes, resulting in network failures and reduced operational lifetimes. In response to this challenge, we present a proposed optimised traffic and lifetime routing algorithm for Wireless Sensor Networks (WSNs). The algorithm has been specifically designed to minimise network traffic and ensure equitable energy consumption across all sensor nodes. The algorithm utilises a fusion of clustering and network coding methodologies to leverage spatial diversity and redundancy within the network. The performance of the proposed algorithm is assessed through simulation experiments and is juxtaposed with various contemporary routing algorithms. The findings indicate that the algorithm we employed exhibits superior performance compared to other algorithms with respect to network longevity, network flow, and energy usage. The algorithm under consideration exhibits potential for utilisation in diverse Wireless Sensor Network (WSN) applications that necessitate dependable and energy-efficient data transmission.
 
 
 
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Statistician and Engineering Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
