Routing with a density-based probabilistic algorithm for mobile ad-hoc networks.
Hean-Loong OngEssam NatshehTat Chee WanPublished in: J. High Speed Networks (2011)
Keyphrases
- probabilistic model
- learning algorithm
- preprocessing
- k means
- computational complexity
- times faster
- matching algorithm
- expectation maximization
- dynamic programming
- linear programming
- recognition algorithm
- theoretical analysis
- np hard
- computational cost
- routing decisions
- routing problem
- similarity measure
- optimal solution
- clustering method
- optimization algorithm
- cost function
- data sets
- high accuracy
- segmentation algorithm
- search algorithm
- detection algorithm
- anomaly detection
- objective function
- convergence rate
- improved algorithm
- ant algorithm
- mobile robot