A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks.
Hichem BaalaOlivier FlauzacJaafar GaberMarc BuiTarek A. El-GhazawiPublished in: J. Parallel Distributed Comput. (2003)
Keyphrases
- spanning tree
- learning algorithm
- k means
- computational complexity
- minimum spanning tree
- np hard
- expectation maximization
- undirected graph
- cost function
- search space
- optimal solution
- dynamic programming
- worst case
- lower bound
- preprocessing
- detection algorithm
- upper bound
- distance transform
- tree structure
- peer to peer
- distributed systems
- simulated annealing
- bayesian networks