Abstract
: The energy efficiency the most important and vital performance metrics of wireless sensor networks (WSNs) as the lifetime of battery is limited. Energy efficiency helps in deciding the long running WSNs functionality. There are different solutions have been presented for energy efficiency based on hardware and software. However, particularly clustering based routing algorithms are most promising approaches and hence studied extensively for energy efficiency and load balancing. The existing clustering methods having drawbacks like cluster heads suffered from excessive energy consumption due to all loads on it, therefore this can be later overcome by placing the gateways in WSNs which can acts cluster head with more energy sources in it. However with use only gateways with clustering again imposing limitation of energy consumption as gateways are also battery operated as well as load balancing is not addressed. In this paper, aim is to design and simulate novel tree based distributed for energy efficiency and data aggregation in WSNs. The proposed method is composed of three main steps such as hop tree building from source node to the destination sensor node, then cluster head selection and cluster formation. Finally the efficient and reliable route setup for data transmission is presented. The working of proposed algorithm is based on existing SPT (shortest path tree) routing method. The experimental evaluation of proposed method is done using NS2. The simulation results claims that proposed method is outperforming the existing energy efficient routing solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.