Abstract
In wireless sensor networks, sensors handle the aggregation of data from neighboring nodes to the base station, in addition to their primary sensing task. Networks can minimize energy usage by batching together multiple outbound packets at certain nodes over a data aggregation tree. Constructing optimal data aggregation trees is an NP-hard problem, thus requiring approximation methods for larger instances. In this paper, we propose a new Multifactorial Evolutionary Algorithm to solve multiple Data Aggregation Tree Problem with Minimum Energy Cost instances simultaneously. Our method utilizes a novel operator scheme for Edge-Set Tree Representation enabling the unification of search spaces between instances, which helps us to obtain better results than contemporary approaches.
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 callDisclaimer: 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.
