On the Quality of Service Routing in Mobile Ad Hoc Networks

4-11

more often as nodes are free to move. The proposed scheme cannot guarantee that by
trying to capture network state in advance, that the paths found are optimal.
In [18], a QoS routing protocol with mobility prediction was proposed. This protocol
searches for paths that consist of low mobility nodes. Therefore, the lifetime of this
pathwill be longer than other paths. The protocol uses a metric of path expiration time
which is based on the nodes mobility speed and location with respect to other nodes.
Although this protocol shows a good performance, the nodes mobility patterns and
speeds in MANETs cannot be enforced or assumed before hand. Hence, the accuracy of
the calculated path or the expected lifetime of that path cannot really be measured.
An adaptive QoS routing scheme based on the prediction of the local performance in
AHNs is proposed in [19]. The scheme is implemented by a link performance prediction
strategy. In each local area, the QoS is estimated based on translating the effects of the
lower layer parameters into the link state information. In the prediction approach, several mechanisms are built to complete the location information management process
(i.e., information monitoring, collecting, and updating functions). The node movement
is characterized by the probabilities of the link state and the prediction of the local QoS
performance. In this sense, the proposed QoS routing is adaptive to nodes mobility. To
summarize, the local QoS performance information in this scheme is built based on
nodes mobility, but does not depend on nodes location information where the QoS
routing is adaptive to the changes in the mobile network due to the special local exchange
mechanism. Local exchange of information would slightly increase network overhead
due to the distributed structure of the routing scheme. Finally, the scheme only provides
statistical QoS guarantee.
4.3.2.2 Ticket-Based Probing Routing
In core extraction distributed ad hoc routing algorithm (CEDAR), the bandwidth is used
as the only QoS parameter for routing. Also, in ticket-based routing method, the delay
and bandwidth are used for QoS routing but not together. They are implemented as different algorithms.
The basic idea of the ticket-based probing scheme [14] is to utilize tickets to limit the
number of paths searched during route discovery. A ticket is the permission to search a
single path. When a source wishes to discover an admissible route to a destination, it
issues a probe (routing message) to the destination. A probe is required to carry at least
one ticket, but may carry more tickets (i.e., connection requests with tighter requirements are issued more tickets). At an intermediate node, a probe with more than one
ticket is allowed to split into multiple ones, each searching a different downstream subpath. Hence, when an intermediate node receives a probe, it decides, on the basis of its
available state information, whether the received probe should be split and to which
neighbors the probe(s) should be forwarded. In the case of route failures, ticket-based
probing utilizes three mechanisms: path re-routing, three-level path redundancy, and
path repairing. Re-routing requires that the source node be informed of a path failure.
After which, the source initiates the ticket-based algorithm to locate another admissible
route. The path redundancy scheme establishes multiple routes for the same connection.
For the highest level of redundancy, resources are reserved along multiple paths and
every packet is routed along each path. In the second level of redundancy, resources are