Simulated annealing based polynomial time QoS routing algorithm for MANETs
Authors:
- 1 September 2006
- journal article
- Published by Springer Nature in Journal of Electronics (China)
- Vol. 23 (5) , 691-697
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A QoS routing method for ad-hoc networks based on genetic algorithm2004
- Supporting service differentiation for real-time and best-effort traffic in stateless wireless ad hoc networks (SWAN)IEEE Transactions on Mobile Computing, 2002
- An overview of constraint-based path selection algorithms for QoS routingIEEE Communications Magazine, 2002
- Heuristic algorithms for multiconstrained quality-of-service routingIEEE/ACM Transactions on Networking, 2002
- A randomized algorithm for finding a path subject to multiple QoS requirementsComputer Networks, 2001
- INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc NetworksJournal of Parallel and Distributed Computing, 2000
- CEDAR: a core-extraction distributed ad hoc routing algorithmIEEE Journal on Selected Areas in Communications, 1999
- Quality-of-service routing for supporting multimedia applicationsIEEE Journal on Selected Areas in Communications, 1996
- Simulated Annealing: Theory and Applications1987
- Algorithms for finding paths with multiple constraintsNetworks, 1984