An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks.
Natarajan MeghanathanAndrás FaragóPublished in: WiMob (3) (2005)
Keyphrases
- dynamic programming
- computational complexity
- learning algorithm
- detection algorithm
- optimization algorithm
- times faster
- space complexity
- significant improvement
- computational cost
- worst case
- high accuracy
- optimal solution
- memory requirements
- globally optimal
- closed form
- optimal path
- computationally efficient
- matching algorithm
- probabilistic model
- experimental evaluation
- np hard
- recognition algorithm
- cost function
- preprocessing
- estimation error
- k means
- optimal strategy
- scaling factors