Ondemand Routing

8/6/2019 Ondemand Routing

1/25


2/25

2

VARIOUS AD-HOC ROUTING

NETWORKS USING NS-2SIMULATOR

:Submitted by

hinmay Kumar Behera Regd

:No 0701227154: ( )Group 7ET01 A

:Under the Guidance of.Prof Seli

Mohapatra


3/25

3

NETWORK

A network is basically a set of two or more articles that are linked so, , ,the computers can share resources such as printers software and internet connections .


4/25

4

What is an ad hoc network?

A decentralized wirelessnetwork.


5/25

5

PROBLEM STATEMENT


6/25

6

NS2 SIMULATOR NS is LBNLs ( Lawrence

Berkeley National Laboratory ) USNetwork Simulator.

It is based on 2 languages i.e;1)OTCL2)C++

It uses tools such as

1)NAM operator2)XGARPH3)Terminal


7/25

7

OTCL AND TCL Tclwas created by Jhon Ousterhout. It allows a fast development and

provides a graphic interface. It is compatible with many interfaces. It is easy to use.


8/25

8

Steps to write a TCL script


9/25

9

Hidden terminal problem

In th is exa m p le n od e A a n d B com m u n ica te w ith th e h u b b u t h id d en from ea ch o th er


10/25

10

Exposed terminal problem


11/25

11

Different protocols AODV

-CA-AODV

-E2CA-AODV-EKCA-AODV MC-MAC


12/25


13/25

13

CA-AODV Routing protocol channel assignment is combined with the

AODV routing protocol

channel assignment is performed duringthe route discovery phase

assigns different channels for neighboringnodes within a k-hop region along thesame path


14/25

14

CA-AODV(cont.) 1 st the source sends RREQ message

to its neighbor nodes. destination node or an intermediate

node thathas a valid route to the destination willsend back a Route Reply (RREP)message. If a node does not know a valid

channel then it picks a random

channel.


15/25

15

CA-AODV(cont.)

1

2

3

4

5

6

7

D

8

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ

RREQ


16/25

16

CA-AODV(cont.)


17/25


18/25

18

EK-CA-AODV Communication overhead is further

increased considers both collisions and

interference within a k-hopneighborhood , (k>=2)

introduces an extra control messagecalled ChannelTaken.


19/25

19

MC-MAC PROTOCOL designed to allow simultaneous data

transmissions on different datachannels

when a sender, say node A, intends totransmit, its Transceiver I willbroadcast an RTS message

Upon receiving the RTS message, thedestination, say Node B, replies a CTSmessage

After Node A receives the CTS from thecontrol channel, its Transceiver IIswitches to the confirmed data


20/25

20

PERFORMANCE ANALYSIS Performance evaluation is done by

NS-2 simulator. Performance

-throughput-End to end delay


21/25

21


22/25

22


23/25

23

CONCLUSION Effective channel assignment

protocols like CA-AODV, and its twoextensions E2-CA-AODV and EK-CA-

AODV and MC-MAC combinechannel assignment with on-demand routing.

These protocols exhibit fastercomputation, and reduces storagecomplexity, and require fewerchannels.


24/25

24

REFERENCES [1]Michelle X. Gong , Scott F. Midkiff , Shiwen Mao, On-

demand routing and channel assignment in multi-channel mobile ad hoc networks,science directadhoc networks ,2009.

[2] M. Gong, S. Midkiff, S. Mao, Design principles fordistributed channel assignment in wireless ad hocnetworks,in: Proceedings of the 2005 IEEEInternational Conferenceon Communications (ICC),Seoul, Korea, 2005, pp. 34013406

[4] A. Raniwala, T. Chiueh, Architecture and algorithmsfor an IEEE 802.11-based multi-channel wirelessmesh network, in: Proceedings of the IEEEINFOCOM05, Miami, FL, 2005, pp. 22232234.

[5] S.-L. Wu, C.-Y. Lin, Y.-C. Tseng, J.-P. Sheu, A newmultichannel MAC protocol with on-demand channelassignment for multihop mobile ad hoc networks,in: Proc. International Symposium on ParallelArchitectures, Algorithms and Networks


25/25

25

THANK YOU

Documents

Ondemand Routing