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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.