Adh-oc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding an optimal path. In this paper, however, we consider the routing problem from the viewpoint of sustaining QoS (quality of service) requirement. Some algorithms such as MP-DSR already have considered this problem in terms of the end-to-end reliability requirement. While the Multi-Path Dynamic Source Routing (MP-DSR) algorithm is capable of resolving the issue to a certain extent, it only considers disjoint paths between a pair of source and destination nodes. In reality due to mobility of nodes there may not exist such disjoint paths. In this paper the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement.
|Original language||English (US)|
|Journal||Journal of Computational Methods in Sciences and Engineering|
|State||Published - 2010|
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computational Mathematics