NPR – A new QoS-based routing protocol for mobile ad-hoc networks
Issue title: Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
Affiliations: [a] Department of Computer Science, Southern Illinois University Carbondale, IL, USA | [b] Department of Computer Science, South East Missouri State University, Cape Gerardeau, MO, USA | [c] Department of Computer Science, Winona State University, Winona, MN, USA
Correspondence:
[*]
Corresponding author: Bidyut Gupta, Department of Computer Science, Southern Illinois University Carbondale, Mailcode 4511, IL 62901, USA. Tel.: +1 618 453 7194; Fax: +1 618 453 6044; E-mail: [email protected].
Abstract: Ad-hoc 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.
