Maximizing Quality of Aggregation in Delay-Constrained Wireless Sensor Networks
2013 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 17, no 11, 2084-2087 p.Article in journal (Refereed) Published
In this letter, both the number of participating nodes and spatial dispersion are incorporated to establish a bi-objective optimization problem for maximizing the quality of aggregation under interference and delay constraints in tree-based wireless sensor networks (WSNs). The formulated problem is proved to be NP-hard with respect to Weighted-sum scalarization and a distributed heuristic aggregation scheduling algorithm, named SDMAX, is proposed. Simulation results show that SDMAX not only gives a close approximation of the Pareto-optimal solution, but also outperforms the best, to our knowledge, existing alternative proposed so far in the literature.
Place, publisher, year, edition, pages
IEEE Press, 2013. Vol. 17, no 11, 2084-2087 p.
Wireless sensor networks, quality of aggregation, combinatorial optimization, Pareto-optimality.
IdentifiersURN: urn:nbn:se:kth:diva-138917DOI: 10.1109/LCOMM.2013.100413.131631ISI: 000327979900018ScopusID: 2-s2.0-84890435565OAI: oai:DiVA.org:kth-138917DiVA: diva2:681936
QC 201401102013-12-202013-12-202014-02-21Bibliographically approved