A sparsity-based algorithm for power-efficient node localization.
Zacharias PsarakisDimitris ToumpakarisPublished in: WCNC (2016)
Keyphrases
- optimization algorithm
- high accuracy
- single pass
- experimental evaluation
- improved algorithm
- times faster
- computationally efficient
- k means
- learning algorithm
- np hard
- expectation maximization
- detection algorithm
- tree structure
- optimal solution
- similarity measure
- cost function
- dynamic programming
- high dimensional
- preprocessing
- high efficiency
- sparse approximation
- localization algorithm
- data sets
- kalman filter
- path planning
- particle swarm optimization
- computational complexity