A QoS routing for Maximum Bandwidth in Ad Hoc Networks

ABSTRACT:

Including some typical examples such as disaster recovery, search and rescue and military
activities, applications of mobile ad hoc networks (MANETs) are drawing more and more
attentions in a civilian life for complements of the Internet. Because of Ad hoc
networks characteristics such as flexibility, fast and easy deployment, robustness which
make them an interesting technology for various applications. Ad hoc networks are
considered as the most promising terminal networks in future mobile communications.
Providing sufficient bandwidth for multimedia applications in ad hoc networks is an urgent
task because of the rising popularity of multimedia applications and potential commercial
usage of ad hoc networks. Bandwidth is more difficult to guarantee in ad hoc networks
than in other types of networks, and providing end-to-end bandwidth guarantee is a critical
and challenging problem in ad hoc networks because of multihop, mutual radio interference
and node mobility. A bandwidth-aware routing protocol of BARP, which is based on
the existing Dynamic Source Routing protocol (DSR), is proposed in this paper in order
to find a route of approximately maximum bandwidth for a flow from a source node
to a destination node in a wireless ad hoc network. BARP is a novel bandwidth-aware
routing protocol by which a route of largest bandwidth can be found. This routing
protocol takes advantage of larger bandwidth t h a n the existing work, and its
effectiveness is demonstrated by some simulations. It will be a great contribution to end-
to-end QoS support research in wireless ad hoc networks.

Dept. of PG Studies (CSE), VTU 1

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

1. INTRODUCTION
Ad hoc networks is a collection of wireless mobile hosts forming a temporary network
without any infrastructure, Each node acts both as a router and as a host. The
fundamental property, which distinguishes ad hoc networks from other wireless
architectures, is that all n o d e s are capable of moving and can be connected dynamically in
an arbitrary manner, nodes mobility causes the network topology to be continuously
changed. To satisfy the requirements o f a d h o c n e t w o r k s , l o t s o f new routing
algorithms are brought forward . TDMA is a technology for shared medium networks. It
allows several users to share the same frequency medium by dividing it into different time
slots. The users transmit data in rapid succession, one after the other, each using its
own time slot. TDMA deterministic scheduling is preferred for networks with heavy
load, carrying mixed traffic and TDMA is suitable for collision-free packet
transmission with QoS support. Therefore, the research on TDMA-based ad hoc networks
has attracted more and more attention. Slotted wireless ad hoc networks based on TDMA
(Time Division Multiple Access) are drawing more and more attention because of
their advantage of QoS support for multimedia applications owing to their collision-free
packet transmission. Bandwidth support is very important for the multimedia applications.
A bandwidth-aware routing protocol of BARP, which is based on the existing
Dynamic Source Routing protocol (DSR), is proposed here in order to find a route of
approximately maximum bandwidth for a flow from a source node to a destination node
in a slotted wireless ad hoc network. A route of approximately maximum
bandwidth can be found rapidly by this bandwidth-aware routing protocol so that data can be
transferred promptly from the source node to the destination node with sufficient throughput.

2. BARP PROTOCOL
lets first introduce DSR briefly because BARP is based on the DSR.

Dept. of PG Studies (CSE), VTU 2

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

2.1DSR Protocol:
DSR is an on-demand routing protocol for ad hoc networks. In DSR the
source includes the full route in the packets header. The intermediate nodes use
this to forward packets towards the destination and maintain a route cache
containing routes to other nodes .
To perform route discovery in DSR, As shown in the figure:1 the source node
broadcasts a route request (RREQ) message specifying the destination node for
which the route is requested. The RREQ message includes a route record which
specifies the sequence of nodes traversed by the message. When an
intermediate node receives a RREQ, it checks to see if it is already in the route
record. If it is, it drops the message. This is done to prevent routing loops. The
intermediate node forwards the RREQ to the next hop according to the route
specified in the header. When the destination receives the RREQ, it sends back a
route reply message. If the destination has a route to the source in its route
cache, then it can send a route response (RREP) message along this route.
Otherwise, the RREP message can be sent along the reverse route back to
the source. Intermediate nodes may also use their route cache to reply to RREQs. If
an intermediate node has a route to the destination in its cache, then it can append
the route to the route record in the RREQ, and send an RREP back to the
source containing this route.

Figure 1. RREQ and RREP in DSR Protocol

2.2 SAGO (Slot Assignment By Global Overview) Algorithm:

Dept. of PG Studies (CSE), VTU 3

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

Suppose there is a route for transmitting multimedia data. It is assumed that the number of
links of this route is known and free time slots of every link of this route are also known.
It should be noted that the assignment avoids radio wave interference so that once a time
slot of a link is assigned then the same time slots of its one-hop neighbor links and two-
hop neighbor links cannot be assigned any more.
SAGO (Slot Assignment by Global Overview) performs the assignment from a global
viewpoint, whereas the conventional approximate methods do the assignment through the
means of local searching. This global treatment of our proposal makes its assignment better
approximation than conventional methods. The principles of this global treatment are as
follows:
- The assignment trial is started from the bottleneck link that has the smallest number of
free slots and is continued in other links towards both end links.
- Time slot assignment is tried assuming a tentative value
of available bandwidth.
- If the assignment trial becomes infeasible, the tentative value is decremented by 1 and
the assignment trial is repeated until it becomes feasible.
- The slots for the assignment are selected according to the order of their free times in
the concerned links.

SAGO can be described briefly by the following five steps. Table 1 is the notations in SAGO.
STEP 1. To find the starting link s from which the assignment will be started;
STEP 2. To calculate the tentative bandwidth w;
STEP 3. To begin time slot assignment from the starting link s, select w timeslots from the
starting link s; the time slot which is not used by its one-hop neighbors and two-hop
neighbors will be firstly selected.
STEP 4. To continue to assign toward the destination node direction;
STEP 5. To continue to assign toward the source node direction.

Table 1. Notations in SAGO

Dept. of PG Studies (CSE), VTU 4

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

Dept. of PG Studies (CSE), VTU 5

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

The detailed description of SAGO is as follows:

BEGIN
m = CALCULATE_BOTTLENECK_LINKS;
if (m = 1)
s = p;
else
{
independence=CALCULATE_INDEPENDENCE;
s = q;
}
w = SET_TENTATIVE_BANDWIDTH;
LABLE1:
i = s;
LABLE2:
SELECT_w_TIME_SLOTS;
if (SELECT_w_TIME_SLOTS = TRUE)
{
DELETE_w_TIME_SLOTS;
if (i = h -1)
{
i = s -1;
LABLE 3:
SELECT_w_TIME_SLOTS;
if (SELECT_w_TIME_SLOTS = TRUE)
{
DELETE_w_TIME_SLOTS;
if (i = h -1)
{
r = w;
exit(0);
}
else
{
i = i – 1;
goto LABLE 3;
}

Dept. of PG Studies (CSE), VTU 6

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

}
else
{
w = w – 1;
goto LABLE 1;
}
}
else
{
i = i +1;
goto LABLE2;
}
}
ELSE
{
w = w -1;
goto LABLE2;
}
END

The functions are explained as follows:

CALCULATE_BOTTLENECK_LINKS: To calculate the number (m) of bottleneck links that
have the smallest number free time slots in the route;
CALCULATE_INDEPENDENCE: To calculate the independence (y) of every bottleneck link.
The indepence is
determined by the following formula:
y=W1*number0+W2*number1+W3*number2+W4*number3+ number4,
where, W1, W2, W3 and W4 are constants and
W1>W2>W3>W4.numberk(k=0,…,4): the number of slots which are free for just k times in its
interference neighbors, that is one-hopneighbors and two-hop-neighbor;
SET_TENTATIVE_BANDWIDTH: To evaluate the upper limit of the available bandwidth of
the route by the following expression, and set it as the tentative value w for the available
bandwidth;
w = min(t/2, g)

Dept. of PG Studies (CSE), VTU 7

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

SELECT_w_TIME_SLOTS: To select w time slots from the free time slots of link i. The slots
are selected according to the order of their free times in five successive links, that is, link i-2,
link i-1, link i, link i+1, link i+2. The slot of the lowest free times will be first chosen.
DELETE_w_TIME_SLOTS: To delete w time slots from the free time slots of one-hop neighbor
links and two-hop neighbor links of link i;

The flow chart of SAGO in Fig:2.

Dept. of PG Studies (CSE), VTU 8

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

2.3. BARP Protocol

Dept. of PG Studies (CSE), VTU 9
A QoS routing for Maximum Bandwidth in Ad Hoc Networks

We now present our proposed bandwidth-aware dynamic source routing algorithm,

referred to as BARP Protocol, which provides QoS guarantees with respect to end-to-
end reliability by discovering a set of multiple disjoint paths and transmitting data along
these paths.
BARP retains the route discovery mechanism of DSR whereby multiple routes can
be returned. Each route discovered is stored in the route cache with a unique route
index. So it is easy for us to pick multiple routes. There is no looping p r o b l e m in BARP,
as the route information is
contained inside the packet itself; routing loops, either short- lived or long-lived, cannot
be formed as they can be immediately detected and eliminated. Figure 2: shows the
operation of BARP.

Figure 3. RREQ and RREP in BARP Protocol

BARP extended DSR and it is different from DSR in the following aspects.
(1) All the route request packets are forwarded as far as the destination node of the
route and all the route reply packets are generated by the destination node and returned to
the source node.
In DSR, when a node receives a route request for which it has a route in its cache, it
does not propagate the route request, but instead returns a route reply to the source node.
For example, in Figures 1 and 3, there exists a route C->D->E in the cache of node C.
When RREQ reaches node C, node C will propagate it till node E in Figure 3 according
to BARP, though there is a route from node C to node E in the cache of node C. However,
according to DSR, as shown in Figure 1, node C will not propagate the RREQ and it will
send directly RREP to the direction of node A, because there exists a route to the destination
node of E in the cache of node C.
(2) When the route request packets are transferred, the information of already assigned

Dept. of PG Studies (CSE), VTU 10

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

and used time slots of every route between a pair of source node and destination node is
gathered by the destination node at the same time. Thus, the destination node keeps the
status information of time slots concerned in every route between a pair of source node and
destination node.

(3) Using the information of already assigned time slots stored in the destination node
of the route, the route of maximum bandwidth can be found by the following steps.
Step 1: To estimate the bandwidth of every route stored in the destination node.
We assume that R routes (r1,r2,…,rR) are discovered between nodes Source and
Destination by (1) and (3) above. As shown in the figure 4.

gi: the number of free time slots in the bottleneck link of route ri, where the bottleneck
link is the link with the minimum number of free time slots in the route.
Step 2: To find the largest estimated bandwidth by destination node.
If there is only one route of bandwidth, then this route is the one found by BARP. If
there are U(U>1) routes of largest bandwidth, go to Step 3.
Step 3: To assign the time slots for U routes in order to
get every bandwidth cj(j=1…….U) of these routes assigned by SAGO. SAGO is the slot
assignment algorithm.
Let BA = max cj, j=1,̖,U
Where BA is the maximum bandwidth. Then the route of bandwidth BA is the result
one by BARP, that is, the route of approximately maximum bandwidth.

Dept. of PG Studies (CSE), VTU 11

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

Figure 4: Route selecting in BARP Protocol

3. PERFORMANCE EVALUATION

In order to demonstrate the effectiveness of BARP, Evaluate proposed protocol and

compare its performance to the DSR. We suppose that the total number of time slots of
every link in the network is 16 and that there is 6 hops in a route. We perform the simulation
on different ratios of free time slots in the network.
Figure 5 is bandwidth comparison between BARP and DSR. In DSR, the forward
algorithm is used to calculate the bandwidth on the partial path the RREQ has traversed so
far. Thus, it can be seen that DSR only searches for local maximum which ends up
to sub-optimality instead of searching for the global maximum. From the results in
Figure 4, much more bandwidth is obtained by BARP than by DSR. One reason is that
BARP can get more routes than DSR. The other reason is that even they get same routes, a
route of larger bandwidth can be obtained by BARP owing to its global overview of time
slot assignment.

Figure 5: Bandwidth comparison between DSR and BARP Protocol

Dept. of PG Studies (CSE), VTU 12

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

4. CONCLUSION
BARP is an extension of DSR. On one hand, BARP retains the route discovery
mechanism of DSR. On the other hand, BARP is different from DSR in some aspects. In
BARP, all the RREQs are transferred to destination node regardless of intermediate
nodes in which routes to destination node are saved. In addition, all the concerned
information of time slots is gathered by destination node in the process of RREQ
propagation. The destination node manages the information of slots and routes, and it
estimates the bandwidth of every route between the source node and the destination node,
and it obtains the accurate bandwidth of routes of the same estimated bandwidth by
assigning their time slots.
BARP is a novel bandwidth-aware routing protocol by which a route of largest
bandwidth can be found. This routing protocol takes advantage of larger bandwidth
than the existing work, and its effectiveness is demonstrated by some simulations. It will
be a great contribution to end-to- end QoS support research in wireless ad hoc networks.

Dept. of PG Studies (CSE), VTU 13

A QoS routing for Maximum Bandwidth in Ad Hoc Networks

REFERENCES:

[1] Imad Jawhar, and Jie Wu, “QoS Support in TDMA-based Mobile AdHoc
Networks,”Journal of Computer Science and Technology, vol 20, pp. 797-810,
November2005.

[2] Kuei-Ping Shih, Chih-Yung Chang, Yen-Da Chen, and Tsung-Han Chuang,
“Dynamic bandwidth allocation for QoS routing on TDMA- based mobile ad hoc
networks,” Computer Communications, vol. 29, pp. 1316-1329 , May 2006.
[3] Li Hongyan and Shahrokh Valaee, “An Effcient Algorithm for Time Slot Assignment
in Ad Hoc Networks,” in the proceedings of 22nd Biennial Symposium in
Commucications, pp. 225–227, June 2004.
[4] Yuh-Shyan Chen, Yu-Chee Tseng, Jang-Ping Sheu, and Po-Hsuen Kuo, “An on-
demand, link-state, multi-path QoS routing in a wireless mobile ad-hoc network,”
Computer Communications, vol. 27, pp. 27–40, January 2004.
[5] Keming DU and Yahui YANG. Policy-Based Time Slot Assignment Algorithm in a
MANET(PBTSA). China: Proceedings of The 3rd International Conference on
Anti -counterfeiting, Security, and Identification (2009 ASID), 2009. IEEE
International Conference on. Nov. 2009:8. pp. 93-96.
[6] Jianping LI and Yasushi WAKAHARA, “Time Slot Assignment for End-to-end
Bandwidth Guarantee in a Mobile Ad Hoc Network”, Journal of Communications,
Vol. 2 Issue 6, pp. 56-64, 2007

Dept. of PG Studies (CSE), VTU 14