Loading...

Maximizing quality of aggregation in delay-constrained wireless sensor networks

Alinia, B ; Sharif University of Technology | 2013

709 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/LCOMM.2013.100413.131631
  3. Publisher: 2013
  4. Abstract:
  5. 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
  6. Keywords:
  7. quality of aggregation ; Wireless sensor networks ; Bi-objective optimization ; Close approximation ; Delay constraints ; Formulated problems ; Pareto optimal solutions ; Pareto-optimality ; Spatial dispersion ; Wireless sensor network (WSNs) ; Combinatorial optimization ; Pareto principle
  8. Source: IEEE Communications Letters ; Volume 17, Issue 11 , 2013 , Pages 2084-2087 ; 10897798 (ISSN)
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6626320&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6626320