You are on page 1of 17

A QoS Routing Protocol for Delay Sensitive Applications in ADHOC Networks

TEAM MEMBERS: 1.B.PRANISA 2.T.PRATHIBAH 3.C.HEMALATHA 4.T.A.SHANDHIYA

Internal Guide: G.Prakash Assistant Professor / IT

External Guide: Mr. K. Kanagasundaram M/s. Juniper Networks India (P) Ltd., Bangalore

The purpose of our project is to improve QoS in mobile

adhoc networks for delay sensitive applications like voice or video. QoS has number of parameters like bandwidth, jitter, delay etc. The Adhoc On Demand distance Vector (AODV) protocol intended for route selection in mobile adhoc networks is considered for improving QoS.

EXISTING VS PROPOSED
In the existing AODV protocol, the route has been selected by

considering only the minimum hop count. The delay has not been considered in any of the field in the routing table entry structure. Fig.1 Routing Table Entry
..

DEST. DEST. NO.OF ADDR SEQ.N HOPS


O

NEXT HOP

ACTIVE NEIGHB OURS

TIME OUT

EXPIR ......... ATION TIME

Hence to improve QoS in AODV, the delay has been added as

the extension to the message for route selection in the routing table entry. The proposed protocol will be AODV-D(delaybased). The routing table fields will be as follows.

Fig.2: Routing Table Entry with Delay field

DEST. ADDR

DEST. NO.OF NEXT SEQ. HOPS HOP NO

ACTIV NEIGH BOUR.

TIME OUT

EXPIR MAX ATION DELA TIME Y

PROPOSED QoS ROUTING ALGORITHM


For better route selection, in addition to the minimum hop count,

the delay(end to end) has been considered.


The end to end delay is nothing but the summation of node delay

and link delay.


In wireless networks, the propagation delay is negligible because

it is almost equal for each and every hop.

DELAY CALCULATION
Packet arrival
STA senses channel idle and waits a countdown back off time

STA senses channel idle for DIFS and waits a countdown back off time.

Attempt
STA sends RTS and receives CTS successfully

Packet Arrival

STA senses a channel busy in DIFS.

Idle
STA senses channel busy in DIFS and goes back off again.

Back off

STA did not receive CTS within a slot time after issuing RTS.

Transmit

Fig 1:State transition diagram.

RTS(Request to send) and CTS(Clear to send) signals will be

send and received by the intermediate nodes in order to avoid hidden and exposed terminal problem.
HIDDEN AND EXPOSED TERMINAL PROBLEM. The delay will be calculated as follows:

Di delay= Pi idle(DIFS) (DIFS + b + EA(I ) + (1-Piidle(DIFS)) (DIFS + EB(I )) +T trans

Back off time is nothing but the random amount of time where

every node should wait before sensing the channel.


DCF(Distributed Coordination Function) is an asynchronous

function (i.e.) it is not time bounded.


And if the randomized waiting time for a node is over and the

medium is still idle the node can access the medium immediately.

ROUTE DISCOVERY
Step 1: If (source node S has data packets to send ) Then initiate a RREQ with Acc_Delay= 0 and Max_Delay= d where d is an upper bound to delay. Also each node along the path calculates its own delay. Step 2: diff= Max_Delay field value Acc_Delay field value

Step 3:

If ( diff > FORWARDING_DELAY) { a. Then Update Acc_Delay field of RREQ as Acc_Delay=(Acc_Delay+ FOR_DELAY); b. Record Acc_Delay of RREQ in Acc_Delay field of routing table c. broadcast the RREQ } Else Drop RREQ packet Step 4: If destination receives RREQ message and if it satisfies the QoS delay parameter Then buffer it.

Step 5: If
destination receives RERR message with a RREPFAIL flag, Then select a fresh route, next better route, from buffer and unicast RREP to source

Step 6: If
source does not receive RREP in RREP_WAIT_TIME from destination Then restart route discovery with new session Id.

Step 7: If
S receives a fresh RREP with same session Id Then

divert data transmission through new route.

ROUTE MAINTENANCE
Step 1: if
a node receives link break, then perform local route repair.

Step 2: if
local repair successful, then

update the route table


else send RERR to source and invalidate the associated route entry.

CONCLUSION
In order to investigate the performance of the protocols,

we will use the following performance metrics: Packet Delivery Ratio: It is the ratio between the packets received at the destination and the packet generated by the source.

Normalized routing overhead:

It is defined as the percentage of control packets with respect to the received data packets. Each hop of any control packets is computed as a new control packet. End to end delay: It is the delay in transmitting data packets through wireless links plus the delay in the network interface queue due to the network congestion. The performance of AODV D will be compared with AODV using NS-2.

Future work
In this paper, only QoS metric considered is end-to-

end delay for a QoS flow, as finding a route subject to multiple metrics . It can be extended to bandwidth and other resource reservation schemes.

THANK YOU

You might also like