A localized algorithm for finding disjoint paths in wireless sensor networks.
Ronghui HouHaoshan ShiPublished in: IEEE Commun. Lett. (2006)
Keyphrases
- computational complexity
- wireless sensor networks
- learning algorithm
- worst case
- k means
- objective function
- detection algorithm
- experimental evaluation
- np hard
- improved algorithm
- optimal solution
- times faster
- preprocessing
- high accuracy
- dynamic programming
- selection algorithm
- tree structure
- probabilistic model
- simulated annealing
- graphical models
- linear programming
- expectation maximization
- optimization algorithm
- lower bound
- computational cost
- search space
- graph structure
- significant improvement