Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/LCOMM.2013.100413.131631 | Communications Letters, IEEE |
Keywords | Field | DocType |
Pareto optimisation,interference (signal),quality of service,wireless sensor networks,NP-hard problem,Pareto optimal solution,SDMAX,biobjective optimization problem for,delay constraint,delay-constrained wireless sensor networks,distributed heuristic aggregation scheduling algorithm,interference constraint,quality of aggregation,spatial dispersion,weighted-sum scalarization,Pareto-optimality,Wireless sensor networks,combinatorial optimization,quality of aggregation | Spatial dispersion,Mathematical optimization,Heuristic,Scheduling (computing),Computer science,Communications system,Quality of service,Computer network,Interference (wave propagation),Optimization problem,Wireless sensor network | Journal |
Volume | Issue | ISSN |
17 | 11 | 1089-7798 |
Citations | PageRank | References |
5 | 0.42 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bahram Alinia | 1 | 20 | 3.02 |
| Hamed Yousefi | 2 | 110 | 9.94 |
| Sadegh Talebi | 3 | 64 | 11.41 |
| Ahmad Khonsari | 4 | 210 | 42.43 |