4-28

Pervasive Communications Handbook

reservation during the route discovery, the proposed protocol initially collects link
bandwidth information from source to destination in order to find multiple disjoint
paths. Then, proper paths at the destination node are chosen according to the bandwidth
and hop-count of each path, and finally necessary bandwidth resource is reserved over
each selected path by sending RREP packets. When a source receives a request with
bandwidth requirement B and maximal delay bound D, it initiates a RREQ packet by
setting the TTL to D and floods the RREQ packet to its neighbors. The TTL is used to
limit hop-count of the path. The time slot assignment algorithm is used to acquire the
maximal available bandwidth over a path. The largest hop-bandwidth first considers
bandwidth and hop-count as two important factors in selecting multiple paths. However,
the bandwidth is the most important factor and the hop-count is the second important
factor in selecting multiple disjoint paths in this paper. The protocol was shown to
improve the success rate by means of finding multiple disjoint paths that provide more
aggregate bandwidth. Moreover, simulation results showed a reduced network cost.
An on-demand delay-constrained unicast routing protocol (ODRP) for wireless AHNs
was proposed in [48]. Various strategies are employed in the protocol to reduce the communication overhead in acquiring cost-effective delay-constrained routes. ODRP reduces
the communication overhead by acquiring a low-cost delay constrained path by employing the following strategies in its route-searching operations: hybrid routing, directional
search, and link-delay-based scheduling of (control) packet forwarding. Thus, the operations of ODRP accordingly can be divided into the following two phases: probe the feasibility of the min-hop path and enforcement to perform destination-initiated route
discovery. The hybrid routing strategy checks to see if the minimum hop path will satisfy
arriving QoS request. If not, a destination-initiated route-searching process via restricted
flooding is enforced. Directional search is employed to restrict the search range of the
route-searching process. Link-delay-based scheduling of control packet forwarding is for
an intermediate node to decide on when it retransmits an RREQ packet it receives. In
ODRP, this retransmission is scheduled at a speed proportional to the delay of the link
over which the packet was received. If multiple RREQs are received, the one carrying the
least delay value is chosen. Simulations showed that ODRP provide a better success ratio,
lower average control message overhead, and lower average path cost.
In [49], the authors build on (GAMAN) by adding an effective topology extraction
algorithm, called E-GAMAN, to reduce the search space of GAMAN. The E-GAMAN
uses two QoS parameters for routing, namely delay and transmission success rate to
decide the QoS path. E-GAMAN has two algorithms: search space reduction algorithm
(SSRA) and GAMAN. GAMAN and E-GAMAN support soft QoS without hard guarantees. E-GAMAN is a source-based routing algorithm where a small population size
of few nodes is involved in route computation. The genetic algorithm (GA) search different routes and they are sorted such that the first one is the best route, but other
ranked routes can be used as backup routes. By using a tree-based GA method, the
loops can be avoided. By using SSRA, the algorithm extracts the effective topology of
the MANET by avoiding transient links and hidden terminal problems. The performance evaluation via simulations shows that E-GAMAN has a good performance compared to GAMAN. However, the proposed algorithms can only be applied for small and
medium scale AHNs.