Abstract

This paper presents a data-aggregation algorithm in the environment of wireless sensor network based on maximum lifetime. In this algorithm, the whole network is constructed into a tree structure with sink being the root of the tree. In the process of data-aggregation tree structure, in order to enable the data transmission path is the shortest, selected the smallest deflection angle relative to the sink as the next hop node. By the same time the remaining energy of the nodes is taken into account and achieves load balancing, maximizes the network lifetime. Keywords-Wireless sensor networks, data-aggregation, tree structure, maximum lifetime, minimum routing

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 call

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.