Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks

Size: px
Start display at page:

Download "Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks"

Transcription

1 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

2 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

3 3 Network with nodes, edges Goal: transfer message from one node to another Which is the best path? Who decides - source or intermediate nodes? Routing Overview msg

4 4 Which path? Generally try to optimize one of the following: Shortest path (fewest hops) Shortest time (lowest latency) Shortest weighted path (utilize available bandwidth, battery) Who determines route? Source ( path ) routing [Like airline travel] Source specifies entire route Intermediate nodes just forward to specified next hop Destination ( hop-by-hop ) routing [Like postal service] Source specifies only destination in message header Routing Overview Intermediate nodes look at destination in header, consult internal tables to determine appropriate next hop

5 5 No external network setup: self-configuring MANET Routing Properties Efficient when network topology is dynamic (frequent network changes links break, nodes come and go) Self Starting Adapt to network conditions Qualitative Properties Distributed operation Loop Freedom Demand Based Operation Security Sleep period operation Unidirectional link support Quantitative Properties End-to-End data throughput Delays Route Acquisition time Out of order delivery (percentage) Efficiency

6 6 Host mobility Why is Routing in MANET different? link failure/repair due to mobility may have different characteristics than those due to other causes Rate of link failure/repair may be high when nodes move fast New performance criteria are used route stability despite mobility energy consumption host position Dynamic Solution much more difficult to be deployed

7 7 Proactive protocols Types of protocols behaviour They determine routes independently from the traffic patterns Traditional protocols like link-state and distance-vector are proactive Reactive protocols They create a route only if required There are also hybrid solutions Aspects to take into consideration Waiting time for getting a route Proactive protocols are typically faster Reactive protocols normally have a higher latency Overhead for route discover and maintenance Proactive protocols typically have an higher overhead because they are always updating routing tables Reactive protocols normally have a lower overhead because they add control traffic only when necessary The solution to adopt depends on the type of the data traffic and the type of mobility!

8 8 IETF WG: Mobile Ad-hoc Networks (manet) Additional MANET links: Additional information is available at: manet Working Group Purpose of MANET working group standardize IP routing protocol functionality suitable for wireless routing application within both static and dynamic topologies with increased dynamics due to node motion or other factors. Approaches are intended to be: relatively lightweight in nature suitable for multiple hardware and wireless environments, and address scenarios MANETs are deployed at the edges of an IP infrastructure hybrid mesh infrastructures (e.g., a mixture of fixed and mobile routers) should also be supported by MANET specifications and management features.

9 9 manet Working Group The group is pursuing a reactive and a proactive protocol. On the charter page these are called RMP and PMP respectively. Proactive MANET Protocol (PMP) Reactive MANET Protocol (RMP) In practice the reactive protocol is DYMO and the proactive is OLSRv2. If significant commonality between RMP and PMP modules is observed, the WG may decide to go with a converged approach. Both IPv4 and IPv6 will be supported. Routing security requirements and issues will also be addressed. The MANET WG will also develop a scoped forwarding protocol that can efficiently flood data packets to all participating MANET nodes.

10 Work in progress perspective 10

11 11 Here: Proposed protocols

12 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

13 13 Node that just forwarded a frame Flooding as a basic mechanism 1/1 Y Node that just received a frame Frame broadcasted Z S E L B C F J M A G D H I K destination N

14 14 Node that just forwarded a frame Flooding as a basic mechanism 1/2 Y Node that just received a frame Frame broadcasted Z B S E F M L C J A G D H I K possible collision!! N

15 15 Node that just forwarded a frame Flooding as a basic mechanism 1/3 Y Node that just received a frame Frame broadcasted Z B S E F J M L C A G D H K I N Receives the frame but does not forward it. Already done

16 16 Node that just forwarded a frame Flooding as a basic mechanism 1/4 Y Node that just received a frame Frame broadcasted Z B S E F J M L C A G D H K I Receives the frame form J and from K (which are mutually hidden) possible collision N

17 17 Node that just forwarded a frame Flooding as a basic mechanism 1/5 Y Node that just received a frame Frame broadcasted Z B S E F J M L C A G D H K I D does not forward it because is the final destination N

18 18 Node that just forwarded a frame Flooding as a basic mechanism 1/6 Y Node that just received a frame Frame broadcasted Z B S E F J M L C A G D H K I Flooding is over! N

19 19 Flooding as a basic mechanism: a few considerations Many protocols use limited flooding of the control packets. Control packets are used to discover the routes. The established routes are then used to send packets of data. Advantage: simplicity Disadvantage: Overhead possibly very high

20 20 Most relevant routing protocols D. Johnson, D. Maltz, and Y-C. Hu. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), RFC 4728, February C. Perkins, E. Belding-Royer, and S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561, July I. Chakeres, C. Perkins. Dynamic MANET On-demand (DYMO) Routing. draft-ietf-manet-dymo-17, March T. Clausen et al. The Optimized Link-State Routing Protocol version 2. draft-ietf-manet-olsrv2-08, March T. Clausen and P. Jacquet. Optimized Link State Routing Protocol (OLSR). RFC 3626, October

21 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

22 22 Dynamic Source Routing (DSR) For networks of medium size (200 nodes), admits high speeds When node S wants to send a packet to node D, but does not have a route to D, begins a route discovery process. Source node S floods Route Request (RREQ) packets Each node adds its own id when it forwards a RREQ. Use of the send buffer

23 23 Node that just forwarded an RREQ Route Request in DSR, 1/5 Y Node that just received a RREQ [X,Y] IDs list added to the RREQ L S [S] E B C F J M A G D H I K destination N

24 24 Node that just forwarded an RREQ Route Request in DSR, 2/5 Y [X,Y] Node that just received a RREQ IDs list added to the RREQ L Z S E [S,E] L B F M C [S,C] J A G D H I K Possible collision!! N

25 25 Node that just forwarded an RREQ Route Request in DSR, 3/5 Y [X,Y] Node that just received a RREQ IDs list added to the RREQ L Z B S E F [S,E,F] J M L C A G [S,C,G] D H K I RREQ is not forwarded N

26 26 Node that just forwarded an RREQ Route Request in DSR, 4/5 Y [X,Y] Node that just received a RREQ IDs list added to the RREQ L Z B S E F J [S,E,F,J] M L C A H G K[S,C,G,K] D I Possible collision N

27 27 Node that just forwarded an RREQ Route Request in DSR, 5/5 Y [X,Y] Node that just received a RREQ IDs list added to the RREQ S B L E F J Z M [S,E,F,J,M] L C A G D H K I N

28 28 Destination D, when receiving the first RREQ send a Route Reply (RREP) RREP is sent using the route obtained by reversing the one that is in the received RREQ Route Reply Z Y S E RREP [S,E,F,J,D] M L B F J C A G D H I K N

29 29 Route Reply en DSR Route Reply can be sent by reversing the route in Route Request (RREQ) only if links are guaranteed to be bi-directional To ensure this, RREQ should be forwarded only if it received on a link that is known to be bi-directional If unidirectional (asymmetric) links are allowed, then RREP may need a route discovery for S from node D Unless node D already knows a route to node S If a route discovery is initiated by D for a route to S, then the Route Reply is piggybacked on the Route Request from D. If IEEE MAC is used to send data, then links have to be bidirectional (since Ack is used)

30 30 Dynamic Source Routing (DSR) Node S on receiving RREP, caches the route included in the RREP When node S sends a data packet to D, the entire route is included in the packet header hence the name source routing Intermediate nodes use the source route included in a packet to determine to whom a packet should be forwarded

31 31 Packet header size grows with route length Data Delivery in DSR Y B S DATA [S,E,F,J,D] E F J Z M L C A G D H K I N

32 32 DSR Optimization: Route Caching (1/2) Each node caches a new route it learns by any means When node S finds route [S,E,F,J,D] to node D, node S also learns route [S,E,F] to node F When node K receives Route Request [S,C,G] destined for node, node K learns route [K,G,C,S] to node S When node F forwards Route Reply RREP [S,E,F,J,D], node F learns route [F,J,D] to node D When node E forwards Data [S,E,F,J,D] it learns route [E,F,J,D] to node D A node may also learn a route when it overhears Data packets A B H S C I E G F J K Z D M Y N L

33 33 DSR Optimization: Route Caching (2/2) When node S learns that a route to node D is broken, it uses another route from its local cache, if such a route to D exists in its cache. Otherwise, node S initiates route discovery by sending a route request Node X on receiving a Route Request for some node D can send a Route Reply if node X knows a route to node D Use of route cache can speed up route discovery can reduce propagation of route requests Y A B H S C I E G F J K Z D M N L

34 34 J sends a route error to S along route J-F- E-S when its attempt to forward the data packet S (with route SEFJD) on J-D fails Route Error (RERR) Nodes hearing RERR update their route cache to remove link J-D Y Each node is responsible for confirming that the link can be used to transmit data. Ack del MAC (p.ej., ) Passive acks DSR-specific ACK B S C E Z RERR [J-D] F J M L A H I G K D N

35 35 DSR additional techniques Expading ring technique playing with the TTL of the packets non propagating Route Request Route salvaging technique for route maintenance Dynamic substitution of routes for intermediate ndoes Automatic route shortening technique for routes optimization Based on gratuitous Route Reply The flows

36 36 Routes maintained only between nodes who need to communicate reduces overhead of route maintenance DSR: advantages and disadvantages Packet header size grows with route length due to source routing Flood of route requests may potentially reach all nodes in the network Route caching can further reduce route discovery overhead A single route discovery may yield many routes to the destination, due to intermediate nodes replying from local caches Care must be taken to avoid collisions between route requests propagated by neighboring nodes insertion of random delays before forwarding RREQ Increased contention if too many route replies come back due to nodes replying using their local cache Route Reply Storm problem Reply storm may be eased by preventing a node from sending RREP if it hears another RREP with a shorter route

37 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

38 38 First Back to basics : Distance Vector protocol Basic Routing Protocol known also as Distributed Bellman-Ford or RIP Every node maintains a routing table all available destinations the next node to reach to destination the number of hops to reach the destination Periodically send table to all neighbors to maintain topology Bi-directional links are required! Thanks to Raoul Reuter

39 39 First Back to basics : Distance Vector -> tables A 1 2 B C Dest. Next Metric Dest. Next Metric Dest. Next Metric A A 0 B B 1 C B 3 A A 1 B B 0 C C 2 A B 3 B B 2 C C 0 Thanks to Raoul Reuter

40 40 First Back to basics : Distance Vector -> update B broadcasts the new routing information to his neighbors Routing table is updated (A, 1) (B, 0) (C, 1) (A, 1) (B, 0) (C, 1) A change occurs so A B C Dest. Next Metric Dest. Next Metric Dest. Next Metric A A 0 B B 1 C B 3 2 A A 1 B B 0 C C 1 A B 3 2 B B 1 C C 0 Thanks to Raoul Reuter

41 41 First Back to basics : Distance Vector -> new node broadcasts to update tables of C, B, A with new entry for D (A, 1) (B, 0) (C, 1) (D, 2) (A, 2) (B, 1) (C, 0) (D, 1) (D, 0) A 1 1 B C 1 D Dest. Next Metric Dest. Next Metric Dest. Next Metric A A 0 A A 1 A B 2 B B 1 C B 2 D B 3 B B 0 C C 1 D C 2 B B 1 C C 0 D D 1 Thanks to Raoul Reuter

42 42 Broken Link and consequent Loops First Back to basics : Distance Vector A 1 1 B C 1 D Dest. Next Metric Dest.c Next Metric Dest. Next Metric D B 3 D C 2 D DB 1 (D, 2) (D, 2) A 1 1 B C 1 D Dest. Next Metric D B 3 Dest. Next Metric D C 2 Dest. Next Metric D B 3 Thanks to Raoul Reuter

43 43 create the Count to Infinity problem First Back to basics : Distance Vector (D,5) (D,4) (D,4) (D,3) (D,2) (D,2) A 1 1 B C 1 D Dest. Next Metric D B 3, 5, Dest.c Next Metric D C 2, 4, 6 Dest. Next Metric D B 3, 5, Thanks to Raoul Reuter

44 44 Ad Hoc On-Demand Distance Vector Routing (AODV) DSR includes source routes in packet headers Resulting large headers can sometimes degrade performance particularly when data contents of a packet are small AODV attempts to improve on DSR by maintaining routing tables at the nodes, so that data packets do not have to contain routes AODV retains the desirable feature of DSR that routes are maintained only between nodes which need to communicate

45 45 Route Requests (RREQ) are forwarded in a manner similar to DSR AODV When a node re-broadcasts a Route Request, it sets up a reverse path pointing towards the source AODV assumes symmetric (bi-directional) links When the intended destination receives a Route Request, it replies by sending a Route Reply Route Reply travels along the reverse path set-up when Route Request is forwarded

46 46 Node that just forwarded a frame Route Request in AODV Y Node that just received a frame RREQ broadcast Z S E L B C F J M A G D H I K destination N

47 47 Node that just forwarded a frame Node that just received a frame RREQ broadcast Inverse link Route Request in AODV Z Y B S E F M L C J A G D H I K N

48 48 Node that just forwarded a frame Node that just received a frame RREQ broadcast Inverse link Route Request in AODV Z Y B S E F J M L C A G D H K I N

49 49 Node that just forwarded a frame Node that just received a frame RREQ broadcast Inverse link Route Request in AODV Z Y B S E F J M L C A G D H K I N

50 50 Node that just forwarded a frame Node that just received a frame RREQ broadcast Inverse link Route Request in AODV Z Y B S E F J M L C A G D H K I N

51 51 Node that just forwarded a frame Node that just received a frame RREQ broadcast Inverse link Route Request in AODV Z Y B S E F J M L C A G D H K I N

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

53 53 AODV table entries AODV uses the following fields with each route table entry: Destination IP Address Destination Sequence Number Valid Destination Sequence Number flag Other state and routing flags (e.g., valid, invalid, repairable, being repaired) Network Interface Hop Count (number of hops needed to reach destination) Next Hop List of Precursors Lifetime (expiration or deletion time of the route)

54 54 Details about the route reply Route Reply in AODV An intermediate node (not the destination) may also send a Route Reply (RREP) provided that it knows a more recent path than the one previously known to sender S To determine whether the path known to an intermediate node is more recent, destination sequence numbers are used If Node:dsn >= RREQ:dsn do not forward The likelihood that an intermediate node will send a Route Reply when using AODV not as high as DSR A new Route Request by node S for a destination is assigned a higher destination sequence number. An intermediate node which knows a route, but with a smaller sequence number, cannot send Route Reply Timeouts A routing table entry maintaining a reverse path is purged after a timeout interval timeout should be long enough to allow RREP to come back A routing table entry maintaining a forward path is purged if not used for a active_route_timeout interval if no data is being sent using a particular routing table entry, that entry will be deleted from the routing table (even if the route may actually still be valid)

55 55 Notificación sobre interrupción de enlaces A neighbor of node X is considered active for a routing table entry if the neighbor sent a packet within active_route_timeout interval which was forwarded using that entry When the next hop link in a routing table entry breaks, all active neighbors are informed Link failures are propagated by means of Route Error messages, which also update destination sequence numbers When node X is unable to forward packet P (from node S to node D) on link (X,Y), it generates a RERR message Node X increments the destination sequence number for D cached at node X The incremented sequence number N is included in the RERR When node S receives the RERR, it initiates a new route discovery for D using destination sequence number at least as large as N

56 56 Link Failure Detection Hello messages: Neighboring nodes periodically exchange hello message Absence of hello message is used as an indication of link failure Alternatively, failure to receive several MAC-level acknowledgement may be used as an indication of link failure

57 57 DYMO DYMO Reactive Protocol like AODV, but with path accumulation feature S I1 I2 I3 D Type Len TTL I A Res TargetAddress TargetSeqNum THopCnt Res G RBPrefix Res RBHopCnt RBNodeAddress RBNodeSeqNum NL RREQ RREP RREQ RE-S RREQ RE-S RE-I1 RREQ RE-S RE-I1 RE-I2 RE-S Route Element with NL of S RE-I1 Route Element with NL of I1 RREQ RE-S RE-I1 RE-I2 RE-I3

58 58 Avoid expiring good routes Update reverse route lifetime on data reception Update forward route lifetime on data transmission Inform sources of broken routes quickly Active links must be monitored Several mechanisms available Route Error (RERR) Optional additional invalid routes DYMO Route Maintenance

59 59 DYMO vs AODV Answers by Ian Chakeres to the question: could you briefly explain what are the differences between DYMO and AODV 8 Mar 2005 There are several differences between AODV, AODV-bis, DSR and DYMO. To list just a few. 23 Mar 2006 New packet format. Generic packet handling. Unsupported element handling. Optional path accumulation. Much more. DYMO is a simpler version of AODV. DYMO is easier to implement and has lower requirements (in terms of memory, code, etc.) than AODV. DYMO is close to what has been implemented for sensor networks, such as tinyaodv. AODV is no longer being explored in the MANET WG.

60 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

61 61 Optimized Link State Routing (OLSR) Proactive scheme based on the link-state mechanism. Each node periodically floods status of its links Each node re-broadcasts link state information received from its neighbor Each node keeps track of link state information received from other nodes Each node uses above information to determine next hop to each destination The overhead of flooding link state information is reduced by requiring fewer nodes to forward the information Does not require modifying the structure of the IP packets

62 62 OLSR v2 Compared to OLSRv1, OLSRv2 retains the same basic mechanisms and algorithms, while providing an even more flexible signaling framework and some simplification of the messages being exchanged. OLSRv2 takes care to accommodate both IPv4 and IPv6 addresses in a compact fashion. The message exchange format has been factored out to an independent specification Clausen, T., Dean, J., Dearlove, C., and C. Adjih, "Generalized MANET Packet/Message Format", work in progress. The OLSRv2 neighborhood discovery protocol using HELLO messages has been factored out to an independent specification Clausen, T., Dean, J., and C. Dearlove, "MANET Neighborhood Discovery Protocol (NHDP)", work in progress.

63 63 The overload of broadcasting the status information on the links is reduced by limiting the number of nodes which forward this information A broadcast from node X is forwarded only by its multipoint relays The multipoint relays of X are its neighbors chosen so that every twohops neighbors of X is a one-hop neighbors of at least one of its multipoint relay Each node periodically transmits the list of its neighbors so that all nodes can know which are their two-hops neighbors, therefore being able to choose their multipoint relays 24 broadcasts are needed to spread the message up to three hops away 11 broadcasts are needed to spread the message up to three hops away LSR vs. OLSR Sending node Sending node

64 64 Nodes can have various OLSR interfaces, each with its own IP address Each node is assigned a unique reference IP ( main address ) neighbor: x is a neighbor of y if y can receive x signal 2-hop neighbor: a node whose signal is received by its neighbor. strict 2-hop neighbor P multipoint relay (MPR): A node selected by its neighbor x, to forward all the broadcast messages received from x, if it is not a duplicate message and if life-time is >1 multipoint relay selector (MS) A node that selected its neighbor x as a MPR X Y S Terminology M Z

65 65 Each node periodically broadcasts Hello messages: List of neighbors with bi-directional link List of other known neighbors. Neighbor sensing Hello messages permit each node to learn topology up to 2 hops Based on Hello messages each node selects its set of MPR s

66 66 Each point u has to select its set of MPR. MPR selection algorithm Goal: select in the 1-neighborhood of u ( 1 (u)) a set of nodes as small as possible which covers the whole 2-neighborhood of u ( 2 (u)), in two steps : Step 1: Select nodes of 1 (u) which cover isolated points of 2 (u). (That we call MPR 1 (u).) Step 2: Select among the nodes of 1 (u) not selected at the first step, the node which covers the highest number of points (not already covered) of 2 (u) and go on till every points of 2 (u) are covered.

67 67 MPR selection algorithm : example u First step: select nodes in 1 (u) which cover «isolated points» of 2 (u).

68 68 MPR selection algorithm : example Second step: Consider in 1 (u) only points which are not already selected at the first step MPR 1 (u) and points in 2 (u) which are not covered by the MPR 1 (u). While there exists points in 2 (u) not covered by the selected MPR, select in 1 (u), the node which covers the highest number of non-covered nodes in 2 (u). u

69 MPR selection algorithm: example; final result u 69

70 70 TC Topology control message: MPR information declaration Sent periodically. Message might not be sent if there are no updates and sent earlier if there are updates Contains: MPR Selector Table Sequence number Each node maintains a Topology Table based on TC messages Routing Tables are calculated based on Topology tables

71 71 Example of neighbor table One-hop neighbors Two-hop neighbors Neighbor s id State of Link Neighbor s id Access through B Bidirectional E C G Unidirectional D C C MPR Also every entry in the table has a timestamp, after which the entry in not valid

72 72 Topology Table Destination address Destination s MPR MPR Selector sequence number Holding time MPR Selector in the received TC message Last-hop node to the destination. Originator of TC message

73 73 Upon receipt of TC message: Topology Table (cont) If there exist some entry to the same destination with higher Sequence Number, the TC message is ignored If there exist some entry to the same destination with lower Sequence Number, the topology entry is removed and the new one is recorded If the entry is the same as in TC message, the holding time of this entry is refreshed If there are no corresponding entry the new entry is recorded

74 74 All nodes manage a routing table Its structure is: 1. R_dest_addr R_next_addr R_dist R_iface_addr 2. R_dest_addr R_next_addr R_dist R_iface_addr 3.,,,,,,,, Routing table Each entry indicates that node R_dest_addr is R_dist hops away, and the first hop is through R_next_addr. This node can be reached through the local interface R_iface_addr There is an entry for each destination in the network The table is updated each time a change is detected in: the link set, the neighbor set, the 2-hop neighbor set, the topology set, the Multiple Interface Association Information Base, The table is built using a shortest path algorithm

75 Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks A. Specific properties B. Flooding as a basic mechanism C. Basic routing protocols DSR AODV y DYMO OLSR y OLSRv2 D. Advanced protocols and techniques Acknowledgments : Nitin H. Vaidya, Tutorial on Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Available at: Máster de Ingeniería de Computadores 2008/2009

76 76 Location-Aided Routing (LAR) Exploits location information to limit scope of route request flood Location information may be obtained using GPS Expected Zone is determined as a region that is expected to hold the current location of the destination Expected region determined based on potentially old location information, and knowledge of the destination s speed Route requests limited to a Request Zone that contains the Expected Zone and location of the sender node

77 77 X = last known location of node D, at time t 0 Expected Zone in LAR Y = location of node D at current time t 1, unknown to node S r = (t 1 - t 0 ) * estimate of D s speed r X Expected Zone Y

78 78 Request Zone in LAR Only nodes within the request zone forward route requests Node A does not forward RREQ, but node B does (see previous slide) Request zone explicitly specified in the route request Each node must know its physical location to determine whether it is within the request zone Network Space Request Zone r X A S B Y

79 79 Forwarding in LAR Only nodes within the request zone forward route requests If route discovery using the smaller request zone fails to find a route, the sender initiates another route discovery (after a timeout) using a larger request zone the larger request zone may be the entire network Rest of route discovery protocol similar to DSR

80 80 Advantages reduces the scope of route request flood reduces overhead of route discovery Location Aided Routing (LAR) Disadvantages Nodes need to know their physical locations Does not take into account possible existence of obstructions for radio transmissions

81 81 Geographic Distance Routing (GEDIR) Location of the destination node is assumed known Each node knows location of its neighbors Each node forwards a packet to its neighbor closest to the destination Route taken from S to D shown below A H D S B C G E F obstruction

82 82 Geographic Distance Routing (GEDIR) The algorithm terminates when same edge traversed twice consecutively Algorithm fails to route from S to E Node G is the neighbor of C who is closest from destination E, but C does not have a route to E A H D S B C G E F obstruction

83 83 Zone routing protocol combines Zone Routing Protocol (ZRP) Proactive protocol: which pro-actively updates network state and maintains route regardless of whether any data traffic exists or not Reactive protocol: which only determines route to a destination if there is some data to be sent to the destination All nodes within hop distance at most d from a node X are said to be in the routing zone of node X All nodes at hop distance exactly d are said to be peripheral nodes of node X s routing zone Intra-zone routing: Pro-actively maintain state information for links within a short distance from any given node Routes to nodes within short distance are thus maintained proactively (using, say, link state or distance vector protocol) Inter-zone routing: Use a route discovery protocol for determining routes to far away nodes. Route discovery is similar to DSR with the exception that route requests are propagated via peripheral nodes.

84 84 ZRP: Example with Zone Radius = d = 2 S performs route discovery for D B F A S C E D Denotes route request

85 85 ZRP: Example with d = 2 S performs route discovery for D B F A S C E D Denotes route reply E knows route from E to D, so route request need not be forwarded to D from E

86 86 ZRP: Example with d = 2 S performs route discovery for D B F A S C E D Denotes route taken by Data

87 87 Landmark Routing (LANMAR) for MANET with Group Mobility A landmark node is elected for a group of nodes that are likely to move together A scope is defined such that each node would typically be within the scope of its landmark node Each node propagates link state information corresponding only to nodes within it scope and distance-vector information for all landmark nodes Combination of link-state and distance-vector Distance-vector used for landmark nodes outside the scope No state information for non-landmark nodes outside scope maintained

88 88 LANMAR Routing to Nodes Within Scope Assume that node C is within scope of node A H C D G A B E F Routing from A to C: Node A can determine next hop to node C using the available link state information

89 89 LANMAR Routing to Nodes Outside Scope Routing from node A to F, which is outside A s scope Let H be the landmark node for node F H C D G A B E F Node A somehow knows that H is the landmark for C Node A can determine next hop to node H using the available distance vector information

90 90 LANMAR Routing to Nodes Outside Scope Node D is within scope of node F H C D G A B E F Node D can determine next hop to node F using link state information The packet for F may never reach the landmark node H, even though initially node A sends it towards H

91 91 LUNAR (Lightweight Underlay Network Ad hoc Routing) Instead of having routing protocol logic that actively maintains and repairs existing routing paths, LUNAR always establishes paths from scratch. LUNAR floods the network every 3 s for discovering a route. During the 3 s interval, all data packets are shipped over the same path and no attempts are made to discover lost packets or to monitor link changes.

Mobile Ad-Hoc Networks & Routing Algorithms

Mobile Ad-Hoc Networks & Routing Algorithms Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 6 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so

More information

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala. Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction

More information

Wireless Networking & Mobile Computing

Wireless Networking & Mobile Computing Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless

More information

ECS-087: Mobile Computing

ECS-087: Mobile Computing ECS-087: Mobile Computing Mobile Adhoc Networks and Routing in MANETS (most of the slides borrowed from Prof. Sridhar Iyer) Diwakar Yagyasen 1 Index Mobile Ad Hoc Networks (MANET) MAC in MANET MANET routing

More information

Politecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone

Politecnico di Milano Facoltà di Ingegneria dell Informazione. WI-7 Ad hoc networks. Wireless Internet Prof. Antonio Capone Politecnico di Milano Facoltà di Ingegneria dell Informazione WI-7 Ad hoc networks Wireless Internet Prof. Antonio Capone Acknowlegments o This class notes are mostly based on the teaching material of:

More information

2013, IJARCSSE All Rights Reserved Page 85

2013, IJARCSSE All Rights Reserved Page 85 Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of

More information

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path

More information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 9. Ad hoc Networks and Routing 1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links

More information

Mobile Ad Hoc Networks: Routing, MAC and Transport Issues

Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Mobile Ad Hoc Networks: Routing, MAC and Transport Issues Nitin H. Vaidya University of Illinois at Urbana-Champaign nhv@uiuc.edu http://www.crhc.uiuc.edu/~nhv 2004 Nitin Vaidya 1 Notes Names in brackets,

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 5 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so

More information

Ad Hoc Networks: Issues and Routing

Ad Hoc Networks: Issues and Routing Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/

More information

Outline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I

Outline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part I Outline Routing Protocols for Ad hoc Networks Example of a reactive routing protocol AODV: Ad hoc On-demand

More information

Mobile Communications. Ad-hoc and Mesh Networks

Mobile Communications. Ad-hoc and Mesh Networks Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Mobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]

Mobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8] 192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer

More information

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.

More information

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer

More information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,

More information

Routing Protocols in MANETs

Routing Protocols in MANETs Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an

More information

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes

Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Sudheer Kumar 1, Akhilesh Yadav 2 Department of Computer Science and Engineering Kanpur Institute of Technology, Kanpur sudheerkr21@gmail.co

More information

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE

A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE

More information

Wireless Mul*hop Ad Hoc Networks

Wireless Mul*hop Ad Hoc Networks Wireless Mul*hop Guevara Noubir noubir@ccs.neu.edu Some slides are from Nitin Vaidya s tutorial. Infrastructure vs. Ad Hoc Wireless Networks Infrastructure networks: One or several Access- Points (AP)

More information

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:

Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords: Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav

More information

Estimate the Routing Protocols for Internet of Things

Estimate the Routing Protocols for Internet of Things Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of

More information

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121

More information

Expanding Ring Search for Route Discovery in LOADng Routing Protocol

Expanding Ring Search for Route Discovery in LOADng Routing Protocol Expanding Ring Search for Route Discovery in LOADng Routing Protocol Antonin Bas, Jiazi Yi, Thomas Clausen Laboratoire d Informatique (LIX) Ecole Polytechnique, France) antonin@antonin-bas.fr, jiazi@jiaziyi.com,

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

Performance Analysis of MANET Routing Protocols OLSR and AODV

Performance Analysis of MANET Routing Protocols OLSR and AODV VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz

More information

Mobile Ad Hoc Networks

Mobile Ad Hoc Networks Mobile Ad Hoc Networks Tutorial at CIT 2000 Bhubaneshwar, Dec 20 23 Sridhar Iyer IIT Bombay http://www.it.iitb.ernet.in.in/~sri sri@it.iitb.ernet.in Acknowledgements Many figures, slides and reference

More information

Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks

Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks Mounir FRIKHA, Manel MAAMER Higher School of Communication of Tunis (SUP COM), Network Department, m.frikha@supcom.rnu.tn ABSTRACT

More information

CHAPTER 2 LITERATURE REVIEW

CHAPTER 2 LITERATURE REVIEW 39 CHAPTER 2 LITERATURE REVIEW This chapter gives a brief summary of the MANET routing protocol types and their details. 2.1 ROUTING IN AD-HOC NETWORKS Routing is the act of moving information from source

More information

Banwari, Deepanshu Sharma, Deepak Upadhyay

Banwari, Deepanshu Sharma, Deepak Upadhyay Routing Algorithms for MANET: A Comparative Study Banwari, Deepanshu Sharma, Deepak Upadhyay Abstract this paper presents a comparative study of existing routing algorithms for MANET. A mobile ad-hoc network

More information

Routing Protocols in Mobile Ad-Hoc Network

Routing Protocols in Mobile Ad-Hoc Network International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana

More information

Advanced Network Approaches for Wireless Environment

Advanced Network Approaches for Wireless Environment Advanced Network Approaches for Wireless Environment Branislav JARÁBEK Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia beejay@orangemail.sk

More information

Power aware Multi-path Routing Protocol for MANETS

Power aware Multi-path Routing Protocol for MANETS Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

Wireless Mesh Networks

Wireless Mesh Networks Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate

More information

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer

More information

Ad Hoc Wireless Routing CS 218- Fall 2003

Ad Hoc Wireless Routing CS 218- Fall 2003 Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of conventional routing schemes Proactive wireless routing Hierarchical routing Reactive (on demand) wireless routing

More information

Performance Evaluation of AODV and DSR routing protocols in MANET

Performance Evaluation of AODV and DSR routing protocols in MANET Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and

More information

Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols

Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Akshay Shankar, Lavanya Chelle Information Science Engineering RNS Institute of Technology Bangalore, India Abstract- A Mobile

More information

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,

More information

Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network

Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network www.ijcsi.org 7 Performance Analysis of Various Routing Protocols for Motorway Surveillance System Cameras Network L. A. Hassnawi 1, R.B Ahmad 2, Abid Yahya 3, S. A. Aljunid 4, M. Elshaikh 5 School of

More information

CLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing

CLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing Volume 5, Issue 5, MAY 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on Unicast

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

Figure 1: Ad-Hoc routing protocols.

Figure 1: Ad-Hoc routing protocols. Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca

More information

Chapter-2 Routing Protocols of MANET

Chapter-2 Routing Protocols of MANET Chapter-2 Routing Protocols of MANET Chapter 2 Routing Protocols of MANET Routing is an important function for any network, whether it is for wired or wireless. The protocols designed for routing in these

More information

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET 2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar

More information

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar

More information

Investigation on OLSR Routing Protocol Efficiency

Investigation on OLSR Routing Protocol Efficiency Investigation on OLSR Routing Protocol Efficiency JIRI HOSEK 1, KAROL MOLNAR 2 Department of Telecommunications Faculty of Electrical Engineering and Communication, Brno University of Technology Purkynova

More information

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols. MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology

More information

Page 1 EEC173B/ECS152C. Link State Routing [Huitema95] Optimized Link State Routing (OLSR) MANET Unicast Routing. Proactive Protocols

Page 1 EEC173B/ECS152C. Link State Routing [Huitema95] Optimized Link State Routing (OLSR) MANET Unicast Routing. Proactive Protocols 173/S152 Proactive Protocols MNT Unicast Routing Proactive Protocols OLSR SV ybrid Protocols Most of the schemes discussed so far are reactive Proactive schemes based on distance vector and link state

More information

ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW

ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW Kirandeep Kaur 1, Mr.Pawan Luthra 2, Er.Gagandeep 3 1 Department of Computer Science and Engineering, Shaheed Bhagat Singh

More information

Routing protocols in Mobile Ad Hoc Network

Routing protocols in Mobile Ad Hoc Network Routing protocols in Mobile Ad Hoc Network Presented By :- Nitesh Jain Date:-26/10/2005 SCHOOL OF INFORMATION TECHNOLOGY INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR KHARAGPUR Types of Wireless Networks Infrastructure

More information

Performance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET

Performance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET Performance Evaluation of AODV DSDV and OLSR Protocols with Varying FTP Connections in MANET Alok Upadhyay, Rupali Phatak Research Scholar, Asst. Professor -Department of Electronics & Communication Engineering

More information

Chapter 7 Routing Protocols for Ad Hoc Wireless Networks. Jang-Ping Sheu

Chapter 7 Routing Protocols for Ad Hoc Wireless Networks. Jang-Ping Sheu Chapter 7 Routing Protocols for Ad Hoc Wireless Networks Jang-Ping Sheu Introduction Routing protocols used in wired networks cannot be directly applied to ad hoc wireless networks Highly dynamic topology

More information

EZR: Enhanced Zone Based Routing In Manet

EZR: Enhanced Zone Based Routing In Manet EZR: Enhanced Zone Based Routing In Manet Bency Wilson 1, Geethu Bastian 2, Vinitha Ann Regi 3, Arun Soman 4 Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri

More information

A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes

A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes Ruchi Khandelwal 1 & Akhilesh Kosta 2 Department of Computer Science and Engineering

More information

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan

More information

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV MIT International Journal of Electrical and Instrumentation Engineering, Vol. 3, No. 2, August 2013, pp. 57 61 57 Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through

More information

A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks

A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks A Review of On-Demand Routing Protocols for Mobile Ad-Hoc Networks *Vivek Sharma, *Sujit Jhare, **Divakar Singh *School of Computer Science, BUIT, Bhopal **HOD, School of Computer Science, BUIT, Bhopal

More information

Ad Hoc Routing Protocols and Issues

Ad Hoc Routing Protocols and Issues Ad Hoc Routing Protocols and Issues Stefano Basagni ECE Dept Northeastern University Boston, Jan 2003 Ad hoc (AD-HAHK or AD-HOKE)-Adjective a) Concerned with a particular end or purpose, and b) formed

More information

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks 2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath

More information

3. Evaluation of Selected Tree and Mesh based Routing Protocols

3. Evaluation of Selected Tree and Mesh based Routing Protocols 33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in

More information

A Comparative Study between AODV and DSDV Routing Protocols in Mobile Ad Hoc Networks using Network Simulator NS2

A Comparative Study between AODV and DSDV Routing Protocols in Mobile Ad Hoc Networks using Network Simulator NS2 A Comparative Study between AODV and DSDV Routing Protocols in Mobile Ad Hoc Networks using Network Simulator NS2 Marwan Aziz Mohammed Dept. of Software Engineering Faculty of Engineering, Koya University,

More information

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,

More information

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks Comparison of proposed path selection protocols for IEEE 802.11s WLAN mesh networks Sana Ghannay, Sonia Mettali Gammar and Farouk Kamoun CRISTAL lab, National School of Computer Sciences, ENSI, 2010, Manouba

More information

Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks

Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Xin Zhang, George F. Riley Department of ECE Georgia Institute of Technology Atlanta, GA 3332-25 xinzhang, riley@ece.gatech.edu

More information

A Performance Comparison of Routing Protocols for Ad Hoc Networks

A Performance Comparison of Routing Protocols for Ad Hoc Networks RESEARCH ARTICLE OPEN ACCESS A Performance Comparison of Routing Protocols for Ad Hoc Networks Hicham Zougagh *, Ahmed Toumanari *, Rachid Latif *, Noureddine. Idboufker **, Youssef. Elmourabit * Laboratory

More information

A Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks

A Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 11, November 2014,

More information

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Journal homepage: www.mjret.in ISSN:2348-6953 A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Ms. Amruta Kodole 1, Prof. P. M. Agarkar 2 Computer Engineering Dr. D. Y. Patil School Of Engineering

More information

Performance Evaluation of Various Routing Protocols in MANET

Performance Evaluation of Various Routing Protocols in MANET 208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri

More information

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication

More information

Energy Efficient Routing Protocols in Mobile Ad hoc Networks

Energy Efficient Routing Protocols in Mobile Ad hoc Networks International Journal of Engineering Research and Development e-issn : 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 2, Issue 7 (August 2012), PP. 45-51 Energy Efficient Routing Protocols in Mobile

More information

Recent Researches in Communications, Information Science and Education

Recent Researches in Communications, Information Science and Education AODV Based Multi-path Local Repairing Scheme for Mobile Ad Hoc Networks Eman Shaaban, PhD Computer Systems Dept. Faculty of computer and information science Ain-Shams university, Cairo, Egypt Eman.shaaban@cis.asu.edu.eg

More information

To enhance Routing in ZigBee Wireless Networks

To enhance Routing in ZigBee Wireless Networks To enhance Routing in ZigBee Wireless Networks P.Chanthiya Assistant Professor Department of Computer Science & Engineering, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur, India Abstract The

More information

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET) INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,

More information

PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks

PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks Hossein Ashtiani, Shahpour Alirezaee, seyed mohsen mir hosseini, HamidKhosravi Abstract An ad hoc network (MANET) has no fixed networking

More information

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Dr. S. K. Singh Professor, Department of EC, India Dr. R. Gupta Asst. Prof. Department of EC, India Abstract: The

More information

Optimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol Prerana A. Chaudhari 1 Vanaraj B.

Optimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol Prerana A. Chaudhari 1 Vanaraj B. IJSRD - International Journal for Scientific Research & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Optimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol

More information

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver 1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois

More information

Impact of Hello Interval on Performance of AODV Protocol

Impact of Hello Interval on Performance of AODV Protocol Impact of Hello Interval on Performance of AODV Nisha Bhanushali Priyanka Thakkar Prasanna Shete ABSTRACT The multi-hop ad hoc networks are self organizing networks with dynamic topology. The reactive

More information

Performance Analysis of Aodv Protocol under Black Hole Attack

Performance Analysis of Aodv Protocol under Black Hole Attack International Journal of Scientific & Engineering Research Volume 2, Issue 8,August-2011 1 Performance Analysis of Aodv Protocol under Black Hole Attack Monika Roopak, Dr. Bvr Reddy ABSTRACT- Mobile Ad-hoc

More information

CS5984 Mobile Computing

CS5984 Mobile Computing CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part II 1 Outline Routing Protocols for Ad hoc Networks DSDV: Highly Dynamic Destination-Sequenced Distance- Vector

More information

Maharishi Markandeshwar University

Maharishi Markandeshwar University RESEARCH ARTICLE OPEN ACCESS Simulation Based Performance Comparison of Adhoc Routing Protocols Kushagra Agrawal*, Shaveta Jain** *Department of Computer Science,, Mullana, Ambala agrawal_kushagra@rediffmail.com

More information

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0 White Paper Mobile Ad hoc Networking (MANET) with AODV Revision 1.0 This page is intentionally blank, or rather nearly blank. Table of Contents TABLE OF CONTENTS...3 TABLE OF FIGURES...4 WHAT IS MANET?...5

More information

Backward Aodv: An Answer To Connection Loss In Mobile Adhoc Network (Manet)

Backward Aodv: An Answer To Connection Loss In Mobile Adhoc Network (Manet) Backward Aodv: An Answer To Connection Loss In Mobile Adhoc Network (Manet) Dr. Naveen Kr. Singh Ms. Neetu Sharma Ms. Shweta Agarwal Asso. Prof. Asstt. Prof. Asstt. Prof. ABES Engineering College ABES

More information

SUMMARY OF ROUTING PROTOCOL MOBILE AD HOC NETWORKS. YI Jiazi. Polytechnic School of University of Nantes. Feb.

SUMMARY OF ROUTING PROTOCOL MOBILE AD HOC NETWORKS. YI Jiazi. Polytechnic School of University of Nantes. Feb. SUMMARY OF ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS YI Jiazi Polytechnic School of University of Nantes yi.jiazi@gmail.com Feb. 2007 CONTENTS ABSTRACT...2 1. INTRODUCTION...2 2. UNI-PATH ROUTING PROTOCOL...2

More information

Gurleen Kaur Walia 1, Charanjit Singh 2

Gurleen Kaur Walia 1, Charanjit Singh 2 Simulation based Performance Evaluation and Comparison of Proactive and Reactive Routing Protocols in Mobile Ad-hoc Networks Gurleen Kaur Walia 1, Charanjit Singh 2 1,2 UCoE Department, Punjabi University,

More information

Exploring Performance of Different Adhoc Routing Protocols in Mobile Adhoc Networks

Exploring Performance of Different Adhoc Routing Protocols in Mobile Adhoc Networks Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 6, June 2015, pg.307

More information

Mitigating Superfluous Flooding of Control Packets MANET

Mitigating Superfluous Flooding of Control Packets MANET Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:

More information

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing

More information

The Performance of MANET Routing Protocols for Scalable Video Communication

The Performance of MANET Routing Protocols for Scalable Video Communication Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication

More information

Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model

Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model Comparative Performance Analysis of AODV,DSR,DYMO,OLSR and ZRP Routing Protocols in MANET using Random Waypoint Mobility Model ISSN: 2349-6363 Jogendra Kumar Department of computer science and engineering

More information

Performance Evaluation of Routing Protocols for MAC Layer Models

Performance Evaluation of Routing Protocols for MAC Layer Models IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 10, Issue 4 (Mar. - Apr. 2013), PP 71-77 Performance Evaluation of Routing Protocols for MAC Layer Models Somya

More information