Ad-hoc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding the optimal path. In this work, 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 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 work the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement.
Identifer | oai:union.ndltd.org:siu.edu/oai:opensiuc.lib.siu.edu:theses-1443 |
Date | 01 January 2009 |
Creators | Nikolaev, Ruslan |
Publisher | OpenSIUC |
Source Sets | Southern Illinois University Carbondale |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Theses |
Page generated in 0.0101 seconds