New routing strategies for RSP problems with concave cost

Abstract

Multi-Constraint Path (MCP) and Restricted Shortest Path (RSP) are important problems studied in the field of QoS routing. Traditional versions of these problems are known to be NP-Complete ones. Various solutions have been proposed for RSP and MCP based on different heuristics, in practical situations. Restricted shortest path problem with concave route costs is studied in this paper. This is a special version of the traditional RSP problem and is widely applicable in wireless and mobile ad hoc networks. In this paper, we propose new algorithms for this kind of routing. The effectiveness and performance of our proposed solutions are shown through simulations. © 2008 Springer-Verlag.