An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks.
Bolian YinHongchi ShiYi ShangPublished in: J. Parallel Distributed Comput. (2011)
Keyphrases
- computational cost
- np hard
- computationally efficient
- experimental evaluation
- cost function
- dynamic programming
- detection algorithm
- learning algorithm
- mathematical model
- matching algorithm
- recognition algorithm
- k means
- times faster
- worst case
- high accuracy
- linear programming
- particle swarm optimization
- objective function
- probabilistic model
- optimization algorithm
- search space
- computational complexity
- optimal solution
- similarity measure