On the Quality of Service Routing in Mobile Ad Hoc Networks

4-27

between two nodes is the set of free slots between them. When the destination node
receives an RREQ packet from the source node, it returns an RREP packet by unicasting back to the source. If the reservation process fails, then the scheme gives up and
sends an appropriate message back to the destination. The control messages are also used
to calculate bandwidth hop-by-hop. The success of this scheme is heavily dependent on
the reservation procedure and it may incur large setup times in large networks. It also
does not provide fairness among different connections as slots are not distributed
among nodes in a fair fashion.
In [45], a QoS routing framework that consists of admission control, resource reservation, and QoS routing were proposed. The shortest path was always used for routing packets. The framework deals with finding shortest paths that satisfy a minimum bandwidth
through on-demand channel assignment methods. The framework is heavily dependent
on the resource reservation and admission control components where resources are tentatively reserved when a new connection with certain QoS bounds is required. Since
nodes are mobile, resource reservation is performed at places where mobile node is
expected to visit. Two on-demand channel assignments proposed by the authors in a different work are employed in the proposed framework. The authors claim that their proposed framework is capable of performing well consistently in all performed experiments.
The disadvantage of this approach is that its complexity is high and it is hard to make
resource reservation in MANETs as the nodes are highly mobile. Furthermore, the proposed bandwidth assignment does not really guarantee the bandwidth as links are prone
to failure. In addition, the use of shortest path does not always guarantee the required
quality, hence affecting the percentage of accepted calls and could cause congestion on
some paths.
The authors in [46] consider the issue of route maintenance and repair of active routes
for QoS-sensitive applications. Through simulations, two on-demand route repair techniques tailored for operation in MANETS were demonstrated. Specifically, an FN/
RDM-based ROUTE REPAIR scheme, first presented earlier by the authors, is analyzed
in this paper and its performance is compared with that of an FN-based ROUTE REPAIR
scheme. Moreover, the effects of relative node velocity, node density, and communication range on the communication cost and scalability of a routing protocol are studied.
Results illustrated the importance and significance of the route repair process that
decreases the network resources needed for route reestablishment when route failures
occur as well as to the perceived quality of the call.
Li etal. [47] proposed an on-demand route discovery algorithm that can find multiple
disjoint paths. The motivation is that when using disjoint paths, a single link or node
failure will only cause a single path to fail. Therefore, disjoint paths can provide higher
fault tolerance. The goal of the routing scheme is to find multiple disjoint paths whose
aggregate bandwidth can meet the bandwidth requirement. The routing protocol reactively collects link state information from source to destination. A method for choosing
proper paths, namely largest bandwidth-hop-bandwidth first was proposed. Bandwidth
is measured in the unit of the free timeslots. The timeslots used by a host should differ
from that used by any of its two hop neighbors. The MAC sublayer adopts the CDMAover-TDMA channel model. The source node initiates an RREQ packet and floods it to
its neighbors only when it is necessary. Unlike some protocols that consider resource