Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks
Deepali Virmani, Satbir Jain

TL;DR
This paper proposes a decentralized clustering-based tree structure to maximize lifetime and reduce energy consumption in wireless sensor networks, enhancing data delivery efficiency.
Contribution
It introduces an application-independent, decentralized tree approach utilizing clustering to improve energy efficiency and data transmission in WSNs.
Findings
Reduced energy consumption in data aggregation
Extended network lifetime
Improved data delivery efficiency
Abstract
A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Efficient Wireless Sensor Networks · Water Quality Monitoring Technologies · Indoor and Outdoor Localization Technologies
