Presentation is loading. Please wait.

Presentation is loading. Please wait.

Unit II Topic 8-15 Routing Protocols for Ad Hoc Wireless Networks Department of Computer Science and Engineering Kalasalingam University 1 CSE 6007 Mobile.

Similar presentations


Presentation on theme: "Unit II Topic 8-15 Routing Protocols for Ad Hoc Wireless Networks Department of Computer Science and Engineering Kalasalingam University 1 CSE 6007 Mobile."— Presentation transcript:

1 Unit II Topic 8-15 Routing Protocols for Ad Hoc Wireless Networks Department of Computer Science and Engineering Kalasalingam University 1 CSE 6007 Mobile Ad Hoc Wireless Networks

2 Outline 2 Introduction Topic 8 : Issues in Designing A Routing Protocol for Ad Hoc Wireless Networks Topic 9 : Classification of Routing Protocols Topic 10 : Table Driven Routing Protocols Topic 11 : On-Demand Routing Protocols Topic 12 : Hybrid Routing Protocols Topic 13 : Routing Protocols with Efficient Flooding Mechnisms Topic 14 : Hierarchical Routing Protocol Topic 15 : Power Aware Routing Protocol

3 3

4 4

5 The main routing problems for MANETs Node mobility  Routing path broken frequently

6 6

7 7

8 8

9 9

10 10

11 11

12 12

13 13

14 14

15 15

16 16

17 Traditional ad-hoc routing protocols

18 18

19 19

20 20

21 21

22 22

23 DestNextNodeDistseqNo Routing table for Node 1 Table-driven routing protocol – DSDV (cont.) Example:

24 Routing table for Node 1 DestNextNodeDistseqNo Table-driven routing protocol – DSDV (cont.)

25 25

26 26

27 27

28 28

29 29

30 30

31 31

32 32

33 33

34 34

35 35

36 36

37 37

38 38

39 39

40 40

41 41

42 42 Route Discovery in DSR B A S E F H J D C G I K Z Y Represents a node that has received RREQ for D from S M N L

43 43 Route Discovery in DSR B A S E F H J D C G I K Represents transmission of RREQ Z Y Broadcast M N L [S] [X,Y] Represents route record stored in RREQ

44 44 Route Discovery in DSR B A S E F H J D C G I K Node H receives packet RREQ from two neighbors: potential for collision Z Y M N L [S,E] [S,C] [S,B]

45 45 Route Discovery in DSR B A S E F H J D C G I K C receives RREQ from G and H, but does not forward it again, because C has already forwarded RREQ once Z Y M N L [S,C,G] [S,E,F ] [S,B,A] [S,B,H]

46 46 Route Discovery in DSR B A S E F H J D C G I K Z Y M J and K both broadcast RREQ to D Their transmissions may collide at D N L [S,C,G,K] [S,E,F,J] [S,B,H,I]

47 47 Route Discovery in DSR B A S E F H J D C G I K Z Y D does not forward RREQ, because D is the intended target M N L [S,E,F,J,M]

48 48 Route Reply in DSR B A S E F H J D C G I K Z Y M N L RREP [S,E,F,J,D] Represents RREP control message

49 49 An Example of Route Maintenance J sends a route error to S along route J-F-E-S when it finds link [J-D] broken Nodes hearing RERR update their route cache to remove all invalid routes related with link J-D B A S E F H J D C G I K Z Y M N L RERR [J-D] Route Error Packet : RERR

50 50 Use of Route Caching Can Speed up Route Discovery When node Z sends a route request for node C, node K sends back a route reply [Z,K,G,C] to node Z using a locally cached route B A S E F H J D C G I K Z M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ [K,G,C,S] RREP

51 51 Use of Route Caching Can Reduce Propagation of Route Requests Route Replies (RREP) from node K and D limit flooding of RREQ. B A S E F H J D C G I K Z M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ [K,G,C,S] RREP [D,K,G,,C]

52 52

53 53

54 54

55 55

56 56

57 57 Route Requests in AODV B A E F H J C G I K Z Y Represents a node that has received RREQ for D from S M N L D S

58 58 Route Requests in AODV B A E F H J C G I K Represents transmission of RREQ Z Y Broadcast transmission M N L S D

59 59 Route Requests in AODV B A E F H J C G I K Represents links on Reverse Path Z Y M N L S D

60 60 Reverse Path Setup in AODV B A E F H J C G I K Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once Z Y M N L S D

61 61 Reverse Path Setup in AODV B A E F H J C G I K Z Y M N L S D

62 62 Reverse Path Setup in AODV B A E F H J C G I K Z Y Node D does not forward RREQ, because node D is the intended target of the RREQ M N L S D

63 63 Forward Path Setup in AODV B A E F H J C G I K Z Y M N L Forward links are setup when RREP travels along the reverse path Represents a link on the forward path S D

64 64 Route Maintenance The link from node 3 to D is broken as 3 has moved away to a position 3´. Node 2 sends a RERR message to 1 and 1 sends the message in turn to S. S initiates a route discovery if it still needs the route to D S D RERR 3´

65 65

66 66

67 67

68 68

69 69

70 70

71 71

72 72

73 73

74 74

75 75

76 76

77 77

78 78

79 79

80 80

81 81

82 82

83 83

84 84

85 85

86 86

87 87

88 88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105


Download ppt "Unit II Topic 8-15 Routing Protocols for Ad Hoc Wireless Networks Department of Computer Science and Engineering Kalasalingam University 1 CSE 6007 Mobile."

Similar presentations


Ads by Google