4-18

Pervasive Communications Handbook

may be interfered with one another. The available bandwidth of a wireless link depends
not only on the traffics carried by its neighboring links, but also on how well transmissions on its neighboring links are scheduled at the MAC layer. Therefore, BCRP should
be considered with the MAC and network layers. In their work and without considering the optimization of scheduling, they showed that BCRP is an NP-complete under
contention-based MAC protocols. However, both the collision-free channel model and
the First In-First Out (FIFO) scheduling policy are considered to relieve the link interference and coordinate neighboring flows, respectively. Therefore, BCRP can be polynomial-time solvable. In [31], the authors proposes a QoS preemptive routing protocol
with bandwidth estimation (QPRB) that computes the available bandwidth in the route
and then sets up the route based on the network traffic and maintains the route using
preemptive routing procedure. This protocol is intended to provide QoS support to
real-time applications by providing a feedback about the network status. The protocol
executes in three main phases: (a) bandwidth estimation, where the senders current
bandwidth usage and senders one hop neighbors current bandwidth usage are disseminated via hello messages, (b) route discovery, where the source broadcasts RREQ
messages. Each neighbor which receives the message checks if it is the destination. If it
is not the destination, then the request is rebroadcast until the requested destination is
found, (c) and route maintenance to avoid link failures that are mainly due to mobility
using preemptive method. The authors in [32] proposed multiple access collision avoidance with piggyback reservations (MACA/PR), a network architecture which is based
on CSMA/CA and combines the asynchronous operation of WLANs and the QoS support of traditional TDMA-based network architecture. MACA/PR can be viewed as an
extension of IEEE 802.11 and Floor Acquisition Multiple Access (FAMA) [33] which
provides guaranteed bandwidth support (via reservation) to real-time traffic. In
MACA/PR, the network layer is equipped with a bandwidth reservation mechanism
and a QoS routing protocol which are inspired to our earlier work on cluster TDMA
and adaptive clustering. The main contribution to QoS routing is the introduction of
the bandwidth constraint. The bandwidth is a slot within the cycle frame. In its most
complete formulation, the bandwidth routing algorithm keeps track of shortest paths
for all bandwidth values. To compute these paths, each node periodically broadcasts to
its neighbors the bandwidth and hop distance pairs for the preferred paths (one per
bandwidth value) to each destination. In our case, the number of preferred path is the
maximum number of slots (or packets) in a cycle. As such, MACA/PR allows the establishment of real-time connections over a single hop only. However, by complementing
MACA/PR with a QoS routing algorithm and a fast connection setup mechanism,
routing with end-to-end multimedia connectivity in a mobile and multihop network
can be supported. In evaluating the protocol, two bandwidth values were kept: the
bandwidth on the shortest path and the maximum bandwidth (over all possible paths).
Performance results show that MACA/PR can provide a good compromise between
low latency, low packet loss, good acceptance control, fairbandwidth sharing among
connections, good mobility handling, and good scaling properties.
A secure routing protocol with QoS support has been proposed in [34]. The protocol
includes secure route discovery, secure route setup, and trustworthiness-based QoS
routing metrics. The routing control messages are secured by using both public and