Wireless Sensor Networks Module 2: Routing

Size: px
Start display at page:

Download "Wireless Sensor Networks Module 2: Routing"

Transcription

1 Wireless Sensor Networks Module 2: Routing Dr.-Ing. Koojana Kuladinithi, TZI, University of Bremen

2 Contents Module 2: Routing in WSNs Introduction L2 Forwarding (Mesh-Under) vs L3 Routing (Routing Over) IP Routing ROLL (Routing Over Low power and Lossy networks) Ripple (RPL) Routing Protocol for WSNs RPL Operations Routing Metric Objective Functions Trickle Algorithm Mobility 2

3 L2 Forwarding vs L3 Routing 3

4 Two Types of Routes in WSNs Layer 2 Forwarding ( Mesh-Under ) All nodes are on the same link: Single hop One router: 6LBR acts as the IPv6 router Performs based on L2 addresses (64 bit EUI-64 or 6 bit short addresses) Invisible to 6LoWPAN layer (e.g. ISA 00 defines a mesh routing protocol) Layer 3 Routing ( Route-Over ) Multiple links in an 6LoWPAN: Multiple hop Two types of routers: 6LBR and 6LR Allows routing across multiple link types 4

5 L3 Routing Image Source: 5

6 IP Routing 6

7 Routing Routing Forwarding data from one node to another node Who takes the forwarding decisions? - Source, Destination or Intermediate nodes Forwarding objective to optimize Number of hops - Shortest path (fewest hops) Time taken Path with shortest time (lowest latency) Available bandwidth Etc.. 7

8 Who sets the route? Source routing Source sets entire route: places complete path to destination in message header: A B C D Intermediate nodes just forward to a specified next hop: B would look at header, forward to C - Like airline travel get complete set of tickets to final destination before departing Destination ( hop-by-hop ) routing Source sets only destination in message header: D Intermediate nodes look at destination in header, consult internal routing tables to determine an appropriate next hop - Like postal service specify only the final destination on an envelope, and intermediate post offices select where to forward next 8

9 IP Routing Algorithms Link State Routing (wired Internet routing) Each node gathers information about state of the link of other nodes Find the route based on different criteria E.g OSPF (Open Shortest Path First), Dijkstra s Shortest Path First algorithm Problem for wireless networks Waste of bandwidth Distance Vector Routing, known as DBF (Distributed Bellmann- Ford): Routing in multi-hop packet radio Keeps little information (Only next-hop towards the destination) Route table entry for the Destination contains a vector (distance ~ hops) e.g. RIP (Routing Information Protocol), DSDV (Destination Sequenced Distance Vector) 9

10 LSR: Link State Routing Each node maintains a view of the network topology with a cost for each link Periodically broadcast link costs via its outgoing links to all the other nodes, within a specified routing area (flooding of routing information) 0

11 Distance Vector Every node maintains a routing table for all available destinations the next hop to reach a destination the value of metric (e.g. number of hops) to reach the destination Periodically sends table to all neighbors to maintain topology

12 Distance Vector - Update Node B detects the change of routing metric It broadcasts new routing information to neighbors {A,} {B, 0} {C, 2} {A,} {B, 0} {C, 2} 2

13 Distance vector: Counting-to-Infinity Problem Routing Metric = Hop count Link A to B was broken 3

14 Distance vector: Counting to Infinity Problem {A,2} {B, } {C, 0} {D, } Dest NextHop HopCount A C 3 C C D C 2 {A,3} {B, 0} {C, } {D, 2} Dest NextHop HopCount B B D D A B 4 Dest NextHop HopCount A C 5 C C D C 2 {A,4} {B, } {C, 0} 4

15 Destination Sequenced Distance Vector (DSDV) Advertise to each neighbor own routing information Destination Address Metric = Number of Hops to Destination Destination Sequence Number Rules to set sequence number information On each advertisement increase own destination sequence number If a node is no more reachable (timeout) increase sequence number of this node by, set metric = 5

16 DSDV: {A,2, 00} {B,, 200} {C, 0, 300} B detects A is not reachable. Increment A s current sequence number 2. Set hop count (metric) to a higher value {A,, 0} {B, 0, 20} {C,, 300} {D, 2, 400} 6

17 Routing Protocols for MANETs MANET : Mobile Ad hoc NETworks Proactive (Table driven) - OLSR - Optimized Link-State Routing RFC 3626, published as an experimental RFC - TBRF - Topology-Based Reverse Path Forwarding RFC 3684, published as an experimental RFC Reactive (On-demand) - AODV Ad hoc On-demand Distance Vector routing RFC 356, published as an experimental RFC - DSR Dynamic Source Routing RFC 4728, published as an experimental RFC 7

18 MANET vs WSN WSN nodes have less power, computation and communication compared to MANET nodes MANET protocols require significant amount of routing data storage and computation MANETs have high degree of mobility, while sensor networks are mostly stationary Topology changes in WSNs due to nodes dying in the network (due to energy dissipation or due to lossy links) MANET protocols are not being optimized to cater for duty cycles WSNs may be considered a subset of MANET Routing in WSNs should not necessarily be complex as in MANET 8

19 IETF ROLL Working Group IETF Routing Over Low-power and Lossy networks (ROLL) focusing on several applications (Home automation - RFC 5826, Commercial building automation- RFC 5867, Industrial automation - RFC 5673, Urban environments -RFC 5548) Developed specifically for embedded applications - Solution must work over IPv6 and 6LoWPAN - Should support a variety of link layers, which could either be wireless or PLC (Power Line Communication) Routing Protocol: Ripple, RPL (IPv6 Routing Protocol for Low Power and Lossy Networks) routing protocol - Proposed as RFC Generic, can be adapted by Ofs Routing Metrics Computation of link and node properties Objective Functions Selection criteria Trickle Algorithm Efficient way of flooding routing information - Security Image Source: 9

20 6LoWPAN Routing Here we consider IP routing (at layer 3) Image Source: A Low power and Lossy Network (LLN) consists of an edge router (also called as LLN Border Router, LBR), Router (R) and Host (H) nodes H chooses only the default router R forwards traffic ROLL operates only within LoWPAN and terminates at LBR 20

21 6LOWPAN Routing: Requirements Special consideration for routing over LoWPANs Low-power and lossy wireless technologies Most LLNs must be optimized for energy consumption Single interface routing, flat topology LLNs have a very limited memory and should work on low power Specific data flows for embedded applications Traffic patterns are not only peer-to-peer (P2P) unicast flows, more often point to multi-point (P2MP) or multipoint to point (MP2P) flows Support for low data rate Contrasting the high data rates in traditional networks, LLNs have low data rates. It is recommended to underreact, as the conditions leading to loops could be transient. Also, over-reacting to such conditions in LLNs could lead to further routing oscillations and energy consumption in nodes to process the control packets Image Source: 2

22 Ripple, RPL Routing Protocol for LLN 22

23 DAG and DODAG DAG: Directed Acyclic Graph (Fig. B) DAG root: a node within the DAG that has no outgoing edge All paths terminated at a DAG root All edges are oriented in such a way that no cycles exist (Fig. A is not a DAG) DODAG: Destination Oriented DAG (Fig. C) Defines a DAG that forms paths to a single logical root 23

24 Why DODAG for RPL? Traffic in LLN Mainly for P2MP and MP2P traffic flows As opposed to a tree topology, DODAG enables (re)route around loss/interference and easily adapts transient changes RPL organizes a topology as a Directed Acyclic Graph (DAG) that is partitioned into one or more Destination Oriented DAGs (DODAGs) The root in DAG acts as a sink P2MP and MP2P traffic - DODAG root -> LBR - Information stored and processing at other nodes can be reduced 24

25 Upward vs Downward Routes Upward route Downward route Up: the direction from leaf nodes towards the DODAG root Data flow towards the DAG root - MP2P traffic flows Down: the direction from the DODAG root towards leaf nodes Data flow away from the DAG root P2MP traffic flows Point-to-point data flow via up and down routes 25

26 Definitions: Rank vs OF Rank: node's individual position relative to other nodes with respect to a DODAG root increases in the Down direction and decreases in the Up direction Rank computed depends on the Objective Function (OF) - e.g. calculated as a simple topological distance (hop counts) or may also be calculated as a function of link metrics Objective Function (OF): Defines the optimization objectives to compute the Rank Optimization objectives : minimizing energy, minimizing latency, or satisfying some constraints, etc dictates how routers (parents) inside the DODAG are selected 26

27 Definitions: RPL Instance RPL Instance: Composed of one or more disjoint DODAGs, each of which has an unique DODAGID All DODAGs in the same RPL Instance use the same OF (Objective Function) RPLInstanceID: identifies a set of one or more Destination Oriented DAGs (DODAGs) RPL instanceid can be used to identify different OFs RPLInstanceID and DODAGID uniquely identifies a single DODAG in the network different DODAGID = different root node 27

28 DAG Construction Distance-Vector advertise path cost (routing metric) choose a parent (default router/ next hop) that minimize path cost Avoids loops & count-to-infinity Assign every node a rank Node Rank: Relative position within a DODAG Rank strictly decreasing towards the root Parents & Siblings Parents nodes with lower ranks Siblings nodes with same ranks 28

29 Data Path Validation & Loop Detection RPL packet information (Up/Down route) is transported with a data packet On- demand loop detection using data packets maintaining a up to date routing topology can waste energy for LLNs with infrequent data An inconsistency between the routing decision for a packet (upward or downward) and the Rank relationship between the two nodes indicates a possible loop E.g. if S3 receives a packet flagged as moving in the upward direction, and if that packet records that the transmitter (S2) is of a lower Rank than the receiving node (S3) S3 should initiate a local repair RPL does not guarantee the absence of loops but rather tries to avoid them and specifies mechanisms to detect loops via data path validation 29

30 Creation of Upward routes DIO messages Some nodes are configured to be DODAG roots DODAG roots advertise their presence (affiliation with a DODAG, routing cost, and related metrics) by sending link-local multicast DIO messages to all-rpl-nodes Nodes listen for DIOs to join a new DODAG (thus selecting DODAG parents), or to maintain an existing DODAG, according to the specified Objective Function Nodes update routing table entries, for the destinations specified by the DIO message Nodes can decide to join one or more DODAG parents as the nexthop for the default route 30

31 Creation of Downward Routes: DAO Messages RPL uses Destination Advertisement Object (DAO) messages to establish downward routes DAO messages are an optional feature for applications that require P2MP or P2P traffic RPL supports two modes of downward traffic Storing (fully stateful) Non-storing (fully source routed) 3

32 Creation of Downward Routes: Storing Mode Storing mode Creation of routes - DAO propagates towards the root via the routers - Each router maintains routes to each router in WSNs Data goes hop by hop (each router forwards the packet to the right next hop) 32

33 Creation of Downward Routes: Non-Storing Mode Non storing mode Only the root stores routes to the all routers in WSNs Calculates routes to all destination by piecing together the info (address of the routers) collected from DAO messages Data forwards using source routing 33

34 Storing vs Non-Storing modes Storing mode: Requires more storage capacities and memory on each router Efficient communications Extra mechanism to avoid loops (e.g. use of RPL packet information) Non-storing mode: Does not require additional state on the routers, but increases the message overhead Traffic through the root node increases for internal traffic (e.g. P2P traffic within a 6LoWPAN) Loop can be avoided by checking headers??? 34

35 Storing vs Non-Storing modes P2P Traffic the data packet travels up to a common ancestor at which point it is forwarded in the down direction to the destination 35

36 Route Construction and Forwarding Up routes towards nodes of decreasing rank Via DAG parents (always forward to lower rank when possible) may forward to sibling if no lower rank exists Down routes towards nodes of increasing rank Nodes inform parents of their presence and reachability Forward hop by hop (storing mode) or using source routing (non-storing mode) 36

37 Summary: Building DODAG Routers sends DIO (DODAG Information Object) messages Uses link local multicasting Indicates a respective rank (= position), according to a metric (e.g. hop count) w.r.t. the root Upward routes (paths towards the root) are created Defines the optimization objective when forming upward route - Link properties: (Reliability, Latency), Node properties: (Powered or not) - Objective: optimize paths based on one or more metrics Node issues DAO (Destination Advertisement Object) messages Propagates via DAO parents discovered during DIO propagation DAO can be acknowledged Downward routes are created 37

38 DAG Construction Upward Route A B C F D G H I LBR E LBR is configured by the system administrator (There could be several LBRs) Links are annotated w.r.t. ETX metric RPL uses new ICMPv6 messages DIO: DODAG Information Object DAO: Destination Advertisement Object DIS: DODAG Information Solicitation Secure DODAG Information Solicitation Etc.. Source: IETF 75 Roll WG July

39 DAG Construction Upward Route 2 3 LBR- A B C Objective Code Point - An identifier that indicates which Objective Function the DODAG uses Metric: ETX Objective: Minimize ETX Depth computation: Depth ~ ETX F D 4 E G H I Source: IETF 75 Roll WG July

40 DAG Construction Upward Route A B C F D G H I LBR E LBR- multicasts DIO Nodes A, B, C receive and process DIO Nodes A, B, C consider link metrics to LBR- and the optimization objective The optimization objective can be satisfied by joining the DAG rooted at LBR- Nodes A, B, C add LBR- as a DAG parent and join the DAG Source: IETF 75 Roll WG July

41 DAG Construction Upward Route A B C F D G H I LBR E Node A is at Depth in the DAG, as calculated by the information in the OCP (Depth ~ ETX) Node B is at Depth 3, Node C is at Depth 2 Nodes A, B, C have installed default routes (::/0) with LBR- as successor Source: IETF 75 Roll WG July

42 DAG Construction Upward Route If a node is configured to act as a router, it starts advertising the graph information to its neighbors A leaf node, it simply joins the graph and does not send any DIO message A F D B G H I LBR- 3 Source: IETF 75 Roll WG July C E The timer on Node C expires Node C multicasts DIO LBR- ignores DIO from deeper node Node B can add Node C as alternate DAG Parent, remaining at Depth 3 Node E joins the DAG at Depth 3 by adding Node C as DAG Parent 42

43 DAG Construction Upward Route A B C F D G H I LBR E DAG Parent is LBR- Node A is at Depth ::/0 via LBR- with ETX Node B is at Depth 3 ::/0 via LBR- with ETX 3 ::/0 via C with ETX 3 Node C is at Depth 2 ::/0 via LBR- with ETX 2 Node E is at Depth 3 ::/0 via C with ETX 3 Source: IETF 75 Roll WG July

44 DAG Construction Upward Route A F D B G H I LBR- 3 Source: IETF 75 Roll WG July C E The timer on Node A expires Node A multicasts DIO LBR- ignores DIO from deeper node Node B adds Node A Node B can improve to a more optimum position in the DAG Node B removes (keeps as backup) ::/0 via LBR- with ETX 3 ::/0 via C with ETX 3 Adds ::/0 via A with ETX 2 44

45 DAG Construction Upward Route A B C F D LBR E Node A is at Depth, ::/0 via LBR- with ETX Node B is at Depth 2, ::/0 via A with ETX 2 Node C is at Depth 2, ::/0 via LBR- with ETX 2 Node E is at Depth 3, ::/0 via C with ETX 3 G H I Source: IETF 75 Roll WG July

46 DAG Construction Upward Route A B C F D G H I LBR- 3 Source: IETF 75 Roll WG July E DAG construction continues.. And is continuously maintained This rippling effect builds the graph edges out from the root to the leaf nodes where the process terminates Each node of the graph has a routing entry towards its parent in a hop-by-hop fashion The leaf nodes can send a data packet all the way to root of the graph by just forwarding the packet to its immediate parent 46

47 MP2P Traffic via Upward Route LBR- 3 2 MP2P traffic flows toward DAG Root (Upward Routing) A B C F D 4 E G H I Source: IETF 75 Roll WG July

48 Destination Advertisements Object Message 2 3 LBR- A B C Destination Advertisements Object (DAO) message build up routing state in support of P2MP traffic flows from the LBR- to other nodes P2P traffic flows within the DAG F D 4 E DAO propagates within the same DAG G H I For simplicity, we will focus on a subset of DAO propagation in this example Source: IETF 75 Roll WG July

49 DAO messages Downward Route LBR- DAO is configured to be either in storing mode or non-storing mode DAO maintains a sequence number A F D B Storing mode Non-leaf nodes should keep the routing table entries for destinations learned from DAOs Non-storing mode Node should just unicast to the preferred parent Src and dest addresses of DAO should be unique local or global IPv6 addresses G H Source: IETF 75 Roll WG July

50 DAO messages Downward Route A LBR- B DAOs may be triggered by DAG root or node who detects a change F D DAO timers configured such that DAOs start at greater depth, and may aggregate as they move up G H Source: IETF 75 Roll WG July

51 DAO messages Downward Route LBR- LBR- triggers DAO mechanism in DIO A B G emits DAO indicating reachability to destination G F stores G via G F D H emits DAO to destination H F stores H via H G H Source: IETF 75 Roll WG July

52 DAO messages Downward Route LBR- F emits DAO indicating reachability to destination F, G & H A B (continued) F D G H Source: IETF 75 Roll WG July

53 DAO messages Downward Route LBR- A emits DAOs to LBR- for destination A, B, D, F,.. A B LBR- stores A:: via A, B:: via A, D:: via A, F:: via A,.. F D A stored B:: via B, D:: via B, F:: via B, G H Source: IETF 75 Roll WG July

54 DAG Maintenance Floating DAG A F D LBR- 3 B 4 2 C E Consider the case where the link B >D goes bad Node D will remove B from its DAG parent set Node D no longer has any DAG parents in the grounded DAG, so it will become the root of its own floating DAG G H I Source: IETF 75 Roll WG July

55 DAG Maintenance Floating DAG LBR- 3 2 Node D multicasts a DIO to inform its sub-dag of the change A F D B 4 C E Node I has an alternate DAG Parent, E, and does not have to leave the DAG rooted at LBR- Node I removes Node D as a DAG Parent G H I Source: IETF 75 Roll WG July

56 DAG Maintenance Local Repair A LBR- 3 B 2 C Node F does not have an option to stay in the DAG rooted at LBR- (no alternate DAG Parents), so Node F follows Node D into the floating DAG F D 4 E Node F multicasts a DIO Nodes G and H follow Node F into the floating DAG G H I Source: IETF 75 Roll WG July

57 DAG Maintenance Local Repair G A F D 3 H LBR- B 4 I 2 C E The sub-dag of node D has now been frozen Nodes contained in the sub- DAG have been identified, and by following node D into the floating DAG, all old routes to LBR- have been purged The floating DAG seeks to rejoin a grounded DAG Source: IETF 75 Roll WG July

58 DAG Maintenance A LBR- 3 B 2 C Node I multicasts an DIO Node D sees a chance to rejoin grounded DAG at depth 5 through Node I Node D can join Node I at a depth of 5 F D 4 E G H I Source: IETF 75 Roll WG July

59 DAG Maintenance A F D LBR- 3 B 4 2 C E Suppose a link A > F becomes viable Node A multicasts a DIO Node F sees a chance to rejoin grounded DAG at depth 2 through Node A Node F can join Node A at a depth of 2 G H I Source: IETF 75 Roll WG July

60 DAG Maintenance A LBR- 3 B 2 C Node F joins to the grounded DAG at depth 2 by adding A as a DAG parent, and removing D F D 4 E Node F multicasts a DIO Nodes G and H follow Node F to the grounded DAG G H I Source: IETF 75 Roll WG July

61 DAG Maintenance A LBR- 3 B 2 C Node D sees a chance to rejoin DAG LBR- at depth 3 through Node F F D 4 E G H I Source: IETF 75 Roll WG July

62 DAG Maintenance - Loop Avoidance LBR- 3 2 Node D joins the grounded DAG at depth 3 by adding Node F as a DAG Parent A F D B 4 C E The breaking-off and rejoining of the broken sub- DAG is thus coordinated with loop avoidance G H I Source: IETF 75 Roll WG July

63 IETF ROLL RPL Routing, cont.. Routing Metric RFC 655: path calculations (node energy, hop count, throughput, latency, etc) Objective Functions RFC 6552: RPL Objective Function 0 The Minimum Rank Objective Function with Hysteresis (draft-ietf-rollminrank-hysteresis-of-) The Trickle Algorithm RFC 6206: to exchange information in a highly robust, energy efficient, simple, and scalable manner Image Source: 63

64 Routing Metric RFC 655: To define a mechanism for the advertisement of routing metrics and constraints Type of routing metrics Link (throughput, latency, reliability, etc) vs Node metrics (energy, hop counts, node states, etc ) Dynamic (e.g. residual energy) vs static Qualitative vs quantitative Type of constraints to avoid links that do not provide a sufficient level of residual energy, path should not exceed n hops, etc Some metrics are either aggregated or recorded Aggregated: If the metric is the number of hops, each node updates the path cost that reflects the number of traversed hops along the DAG Recorded: each node adds a sub-object reflecting the local valuation of the metric. For example, it might be desirable to record the link quality level along a path 64

65 Objective Function (OF) RPL was designed as a generic protocol, can be adapted by OFs There exists several OFs in operation on the same node and 6LoWPAN network - to carry traffic with very different requirements of path quality. For example, several DODAGs may be used with: OF: Find the best path in terms of ETX [Expected Transmissions] values (metric) and avoid non-encrypted links (constraint) or OF2: Find the best path in terms of latency (metric) while avoiding batteryoperated nodes (constraint) RPL (generic core) Parent (feasible successor) selection rules Loop avoidance based on Rank The OF Selects the parents Computes Rank 65

66 Objective Function (OF), cont.. Uses a combination of metrics (ETX, hop counts, latency, etc) and constraints (avoiding battery powered node, avoiding non-encrypted nodes) to compute the best path OF does not necessarily specify the metric/constraints but does dictate some rules to form the DODAG (for example, the number of parents, back-up parents, use of load-balancing, etc) The OF accounts for Statistical information (ETX, packet losses, etc) Boolean information (battery operated) Physical information (max bandwidth) Configuration (preference, security level, ) 66

67 Objective Functions (OF), cont. Two proposed OFs RPL Objective Function 0, OF0 (RFC 6552) The Minimum Rank Objective Function with Hysteresis, MRHOF (draft-ietf-rollminrank-hysteresis-of- RFC 679) OF0 is designed as a default OF that will allow interoperation between implementations in a wide spectrum of use cases OF0 selects a preferred parent and a backup feasible successor if one is available. should validate a router prior to selecting it as preferred 2. A router that offers connectivity to a grounded DODAG SHOULD be preferred over one that does not 3. A router that offers connectivity to a more preferable root SHOULD be preferred 4. When comparing 2 parents that belong to the same DODAG, a router that offers connectivity to the most recent DODAG Version SHOULD be preferred 5. Etc.. 67

68 Objective Functions (OF), cont. MRHOF Select routes to find the paths with the smallest path cost while preventing excessive churn in the network -. If the smallest path cost for paths through the candidate neighbors is smaller than - by less than PARENT_SWITCH_THRESHOLD, the node MAY continue to use the current preferred parent - 2. If there are multiple paths with the smallest path cost and the smallest path cost is smaller than cur_min_path_cost by at least PARENT_SWITCH_THRESHOLD, a node MAY use a different objective function to select the preferred parent among the candidate neighbors on the path with the minimum cost The Path cost represents the cost of the path, in terms of the selected metric, from a node to the root of the DODAG through the neighbor 68

69 OF0 vs MRHOF OF0 MRHOF Reference: T. Pötsch, K. Kuladinithi, M. Becker, P. Trenkamp and C. Görg: Performance Evaluation of CoAP using RPL and LPL in TinyOS. Accepted for publication in Proc of. Fifth IFIP International Conference on New Technologies, Mobility and Security (NTMS 202). Istanbul, Türkei

70 OF0 vs MRHOF, cont.. More single hop transmissions - MRHOF Lower RTT delays and variations LPL : Low Power Listening 70

71 Trickle Algorithm RFC 6206: The Trickle Algorithm Concerns Broadcast is expensive in LLNs Wireless channel is a shared, spatial resource Idea: Efficient way of broadcasting in LLNs Dynamic adjustment of transmission period Suppress transmissions that may be redundant 7

72 Trickle Algorithm, cont. Parameters: T_min: Minimum advertisement period T_max: Maximum advertisement period k: Suppression threshold Period adjustment: On receiving inconsistent route information, reset to T_min Otherwise, double up to T_max Suppression: Increment count, c when receiving similar advertisement (consistent data) When receiving inconsistent data, set c = 0 When the timer expires, transmit data if c < k 72

73 Timer Management in RPL RPL uses an adaptive timer mechanism called the trickle timer Controls the sending rate of DIO messages The algorithm treats building of graphs as a consistency problem and makes use of trickle timers to decide when to multicast DIO messages Certain events are treated as inconsistencies in the network. - For example, when a node detects a loop in the network it is considered as an inconsistency in the network, or, when a node joins the network or moves within the network is considered an inconsistency in the network The interval of the trickle timer increases as the network stabilizes which results in fewer DIO messages being sent in the network As the network becomes stable, the number of RPL messages decreases. When an inconsistency is detected (such as a loop or a change in the DODAG parameters) the timers are reset to quickly fix the issue 73

74 RPL : Security Security is critical in embedded applications But for LLNs, physically impossible to include sophisticated security provisions in a RPL implementation (memory & capacity needed, exchange of keys, etc) Many applications can utilize link-layer or upper layer security mechanisms to secure applications without requiring the use of securing RPL Security considerations for RPL : Section 9 of RFC

75 Summary : IETF ROLL RPL Routing RPL (called as Ripple) routing draft-ietf-roll-rpl-9 (RFC 6550) A generic proactive distance-vector approach, adapted to different network types by the application with specific OFs and a set of metrics/constraints A topology graph is built during neighbor discovery process Graph information: depth, path-cost, seq num and lifetime Attachment through default next-hop routers (parents/siblings) towards LBR RPL topology is maintained using periodic advertisements (e.g. ND router advertisement can be used) Reliability keeping multiple paths Image Source: 75

76 Summary : IETF ROLL RPL Routing, cont.. Use Trickle to disseminate information with minimal configuration in the nodes Require bidirectional links In some scenarios, links may have asymmetric properties - Reachability of a router is verified before the router can be used as a parent Verification of reachability and link properties that is reactive to existing traffic is preferable Neighbor Unreachability Detection (NUD) Hints from lower layers via L2 triggers Operate over a variety of different link layers 76

77 IPv4 Interconnectivity 34.02:58./24 RIP Routing Protocol 200:300a::/32 OSPF Routing Protocol 200:300a:::/48 RPL Routing Protocol 77

78 Mobility and Routing 78

79 Mobility & Routing Topology changes due to Physical movements (LoWPAN nodes are free to move throughout the LoWPAN) Within a LoWPAN Between edge routers, even between LoWPANs Wireless links Sleep schedules Node failure 79

80 Node vs Network Mobility Micro-mobility Macro-mobility Network mobility Link-layer techniques (e.g. WiFi) Application layer (SIP) NEMO [RFC3963] Mobile IPv6 [RFC3775] Image Source: 80

81 MIPv6 Image Source: 8

82 NEMO: Network Mobility Image Source: 82

83 Acknowledgement Some content and figures on these slides are taken from under the Creative Commons Attribution- Noncommercial-Share Alike 3.0 Unported License. To view a copy of this license, visit DAG construction slides are taken from RPL (ripple) Routing Protocol for Low Power and Lossy Networks Walkthrough presentation done at the 75 th IETF meeting, July 2009, 83

RPL- Routing over Low Power and Lossy Networks

RPL- Routing over Low Power and Lossy Networks RPL- Routing over Low Power and Lossy Networks Michael Richardson Ines Robles IETF 94 Questions to answers today 1. What is a low power/lossy network? How does that relate to IoT? 2. What is RPL and how

More information

Routing in the Internet of Things (IoT) Rolland Vida Convergent Networks and Services

Routing in the Internet of Things (IoT) Rolland Vida Convergent Networks and Services Routing in the Internet of Things (IoT) Rolland Vida Convergent Networks and Services Spring 05. IoT challenges IoT nodes are heterogeneous Some have important resources Smart phones, cars, coke machines

More information

ns-3 RPL module: IPv6 Routing Protocol for Low power and Lossy Networks

ns-3 RPL module: IPv6 Routing Protocol for Low power and Lossy Networks ns-3 RPL module: IPv6 Routing Protocol for Low power and Lossy Networks Lorenzo Bartolozzi Tommaso Pecorella Romano Fantacci Università degli Studi di Firenze Wns3 2012, March 23, Desenzano, Italy. This

More information

Routing over Low Power and Lossy Networks

Routing over Low Power and Lossy Networks outing over Low Power and Lossy Networks Analysis and possible enhancements of the IETF PL routing protocol Enzo Mingozzi Associate Professor @ University of Pisa e.mingozzi@iet.unipi.it outing over LLNs

More information

RPL: Routing for IoT. Bardh Prenkaj Dept. of Computer Science. Internet of Things A.A

RPL: Routing for IoT. Bardh Prenkaj Dept. of Computer Science. Internet of Things A.A RPL: Routing for IoT Bardh Prenkaj Dept. of Computer Science Internet of Things A.A. 17-18 1 Overview Protocol scenario description Design principles of the protocol Fundamental terminology to understand

More information

Study of RPL DODAG Version Attacks

Study of RPL DODAG Version Attacks Study of RPL DODAG Version Attacks Anthéa Mayzaud anthea.mayzaud@inria.fr Rémi Badonnel Isabelle Chrisment Anuj Sehgal s.anuj@jacobs-university.de Jürgen Schönwälder IFIP AIMS 2014 Brno, Czech Republik

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

Principles of Wireless Sensor Networks

Principles of Wireless Sensor Networks Principles of Wireless Sensor Networks https://www.kth.se/social/course/el2745/ Lecture 6 Routing Carlo Fischione Associate Professor of Sensor Networks e-mail:carlofi@kth.se http://www.ee.kth.se/ carlofi/

More information

Enhancing Routing Protocol for Low Power and Lossy Networks

Enhancing Routing Protocol for Low Power and Lossy Networks Enhancing Routing Protocol for Low Power and Lossy Networks John Abied Hatem, Haidar Safa, and Wassim El-Hajj Department of Computer Science American University of Beirut Beirut, Lebanon Email: jmh8@mail.aub.edu;

More information

Politecnico di Milano Advanced Network Technologies Laboratory. 6LowPAN

Politecnico di Milano Advanced Network Technologies Laboratory. 6LowPAN Politecnico di Milano Advanced Network Technologies Laboratory 6LowPAN ACKs o Slide/Figures Sources n IPSO Alliance Webinar 6LowPAN for IP Smart Objects n 6LoWPAN: The Wireless Embedded Internet, Shelby

More information

Routing Protocol for LLN (RPL) Configuration Guide, Cisco IOS Release 15M&T

Routing Protocol for LLN (RPL) Configuration Guide, Cisco IOS Release 15M&T Routing Protocol for LLN (RPL) Configuration Guide, Cisco IOS Release 15M&T Routing Protocol for Low Power and Lossy Networks 2 Finding Feature Information 2 Restrictions for Routing Protocol for Low Power

More information

Lesson 4 RPL and 6LoWPAN Protocols. Chapter-4 L04: "Internet of Things ", Raj Kamal, Publs.: McGraw-Hill Education

Lesson 4 RPL and 6LoWPAN Protocols. Chapter-4 L04: Internet of Things , Raj Kamal, Publs.: McGraw-Hill Education Lesson 4 RPL and 6LoWPAN Protocols 1 RPL [Ipv6 Routing Protocol For Low Power Lossy Networks (LLNs)] 2 LLN A constrained nodes network Low data transfer rate Low packet delivery rate in comparison to IP

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

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

Routing Protocols in Internet of Things. Charlie Perkins December 15, 2015 with a few slides originated by Pascal

Routing Protocols in Internet of Things. Charlie Perkins December 15, 2015 with a few slides originated by Pascal Routing Protocols in Internet of Things Charlie Perkins December 15, 2015 with a few slides originated by Pascal Overview of Presentation My standardization activities Design considerations Mobile Ad Hoc

More information

Mobile Communications

Mobile Communications Mobile Communications Wireless Personal Area Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto 1 IEEE Standards 2 IEEE 802.15.4 Wireless PAN (Sensor Networks) 3 Information Current

More information

An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility

An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility sensors Article An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility Jihong Park 1, Ki-Hyung Kim 2 and Kangseok Kim 2, * 1 Department of Computer Engineering,

More information

Intended Status: Standard Track. March 12, Optimization of Parent-node Selection in RPL-based Networks draft-hou-roll-rpl-parent-selection-00

Intended Status: Standard Track. March 12, Optimization of Parent-node Selection in RPL-based Networks draft-hou-roll-rpl-parent-selection-00 ROLL Working Group INTERNET-DRAFT Intended Status: Standard Track Expires: September 13, 2017 J. Hou, Ed. R. Jadhav Z. Luo Huawei Technologies March 12, 2017 Abstract Optimization of Parent-node Selection

More information

ICS 351: Today's plan. distance-vector routing game link-state routing OSPF

ICS 351: Today's plan. distance-vector routing game link-state routing OSPF ICS 351: Today's plan distance-vector routing game link-state routing OSPF distance-vector routing game 1. prepare a list of all neighbors and the links to them, and the metric for each link 2. create

More information

INTERNATIONAL JOURNAL OF COMMUNICATIONS Volume 12, Performance comparative analysis of LOADing-CTP and RPL routing protocols for LLNs

INTERNATIONAL JOURNAL OF COMMUNICATIONS Volume 12, Performance comparative analysis of LOADing-CTP and RPL routing protocols for LLNs Performance comparative analysis of LOADing-CTP and routing protocols for LLNs Belghachi Mohammed, Feham Mohamed Abstract Low Power and Lossy Networks (LLNs) represent one of the interesting research areas

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

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

Design and Analysis of Routing Protocol for IPv6 Wireless Sensor Networks

Design and Analysis of Routing Protocol for IPv6 Wireless Sensor Networks Design and Analysis of Routing Protocol for IPv6 Wireless Sensor Networks Elias Wendm Atalay Supervisor Prof. Enzo Mingozzi Supervisor Prof. Giuseppe Anastasi Co- Supervisor Dott. Carlo Vallati A thesis

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

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

Routing in a network

Routing in a network Routing in a network Focus is small to medium size networks, not yet the Internet Overview Then Distance vector algorithm (RIP) Link state algorithm (OSPF) Talk about routing more generally E.g., cost

More information

The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments

The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments Emmanuel Baccelli, Matthias Philipp INRIA Saclay, France E-mail: name.lastname@inria.fr Mukul Goyal UWM, USA E-mail: mukul@uwm.edu

More information

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

IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE )

IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE ) Reference: 6LoWPAN: The Wireless Embedded Internet, Shelby & Bormann What is 6LoWPAN? 6LoWPAN makes this possible - Low-power RF + IPv6 = The Wireless Embedded Internet IPv6 over Low-Power wireless Area

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

Internet Engineering Task Force (IETF) Category: Standards Track. September The Minimum Rank with Hysteresis Objective Function

Internet Engineering Task Force (IETF) Category: Standards Track. September The Minimum Rank with Hysteresis Objective Function Internet Engineering Task Force (IETF) Request for Comments: 6719 Category: Standards Track ISSN: 2070-1721 O. Gnawali University of Houston P. Levis Stanford University September 2012 The Minimum Rank

More information

Analysis and Enhancement of RPL under Packet Drop Attacks

Analysis and Enhancement of RPL under Packet Drop Attacks Analysis and Enhancement of RPL under Packet Drop Attacks Binbin Chen, Yuan Li, Daisuke Mashima Advanced Digital Sciences Center COMSNETS 2018, Jan 3 7, Bangalore, India 1 RPL and AMI RFC6550: RPL: IPv6

More information

Optimizing Routing Protocol for Low power and Lossy Network (RPL) Objective Function for Mobile Low-Power Wireless Networks

Optimizing Routing Protocol for Low power and Lossy Network (RPL) Objective Function for Mobile Low-Power Wireless Networks Optimizing Routing Protocol for Low power and Lossy Network (RPL) Objective Function for Mobile Low-Power Wireless Networks Mälardalens Högskola Akademin för Innovation, Design och Teknik Författarnamn

More information

Wireless Sensor Networks Module 3: Application Protocol - CoAP

Wireless Sensor Networks Module 3: Application Protocol - CoAP Wireless Sensor Networks Module 3: Application Protocol - CoAP Dr.-Ing. Koojana Kuladinithi, TZI, University of Bremen koo@comnets.uni-bremen.de Contents Module 3: Application Protocols for WSNs Introduction

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

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

ICS 351: Today's plan. OSPF BGP Routing in general

ICS 351: Today's plan. OSPF BGP Routing in general ICS 351: Today's plan OSPF BGP Routing in general link-state routing in distance-vector (Bellman-Ford, Ford-Fulkerson, RIP-style) routing, each router distributes its routing table to its neighbors an

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

Course Routing Classification Properties Routing Protocols 1/39

Course Routing Classification Properties Routing Protocols 1/39 Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent

More information

RPL: The IP routing protocol designed for low power and lossy networks

RPL: The IP routing protocol designed for low power and lossy networks RPL: The IP routing protocol designed for low power and lossy networks Internet Protocol for Smart Objects (IPSO) Alliance JP Vasseur, Cisco Fellow, Cisco Systems Navneet Agarwal, Technical Leader, Cisco

More information

Internet Engineering Task Force (IETF) Request for Comments: ISSN: March 2012

Internet Engineering Task Force (IETF) Request for Comments: ISSN: March 2012 Internet Engineering Task Force (IETF) J. Hui Request for Comments: 6553 JP. Vasseur Category: Standards Track Cisco Systems ISSN: 2070-1721 March 2012 The Routing Protocol for Low-Power and Lossy Networks

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

Computation of Multiple Node Disjoint Paths

Computation of Multiple Node Disjoint Paths Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes

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

A Performance Evaluation of RPL in Contiki

A Performance Evaluation of RPL in Contiki Master s Thesis Computer Science Thesis no: MCS-2012-10 A Performance Evaluation of RPL in Contiki A Cooja Simulation based study Hazrat Ali School of Computing Blekinge Institute of Technology SE 371

More information

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP

More information

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1 Network Protocols Routing TDC375 Autumn 03/04 John Kristoff - DePaul University 1 IPv4 unicast routing All Internet hosts perform basic routing for local net destinations, forward to local host for non-local

More information

Wireless Sensor Networks

Wireless Sensor Networks Wireless Sensor Networks Routing M. Schölzel Network in computer science Network is a graph G = (V,E) V set of all nodes E set of all edges: (v 1,v 2 ) E V 2 V = { A, B, C,... } E = { (A,B), (B,C), (C,F),...

More information

Quantitative Analysis and Evaluation of RPL with Various Objective Functions for 6LoWPAN

Quantitative Analysis and Evaluation of RPL with Various Objective Functions for 6LoWPAN Indian Journal of Science and Technology, Vol 8(19), DOI: 10.17485/ijst/2015/v8i19/76696, August 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Quantitative Analysis and Evaluation of RPL with

More information

arxiv: v1 [cs.ni] 8 Jun 2016

arxiv: v1 [cs.ni] 8 Jun 2016 RESEARCH ARTICLE MHCL: IPv6 Multihop Host Configuration for Low-Power Wireless Networks Bruna S. Peres and Olga Goussevskaia arxiv:66.2674v [cs.ni] 8 Jun 26 Department of Computer Science, Universidade

More information

Politecnico di Milano Advanced Network Technologies Laboratory. 6LowPAN

Politecnico di Milano Advanced Network Technologies Laboratory. 6LowPAN Politecnico di Milano Advanced Network Technologies Laboratory 6LowPAN ACKs o Slide/Figures Sources n IPSO Alliance Webinar 6LowPAN for IP Smart Objects n 6LoWPAN: The Wireless Embedded Internet, Shelby

More information

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Fairness Example: high priority for nearby stations Optimality Efficiency overhead Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency

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

IoT Roadmap in the IETF. Ines Robles

IoT Roadmap in the IETF. Ines Robles IoT Roadmap in the IETF Ines Robles 2016 Agenda IETF and IoT Definitions IETF IoT WGs Internet Area: 6lo, 6tisch, lpwan, lwig Routing Area: ROLL Application and Real Time Area: core Security Area: ace

More information

Cisco Systems, Inc. October Performance Evaluation of the Routing Protocol for Low-Power and Lossy Networks (RPL)

Cisco Systems, Inc. October Performance Evaluation of the Routing Protocol for Low-Power and Lossy Networks (RPL) Independent Submission Request for Comments: 6687 Category: Informational ISSN: 2070-1721 J. Tripathi, Ed. J. de Oliveira, Ed. Drexel University JP. Vasseur, Ed. Cisco Systems, Inc. October 2012 Abstract

More information

Proposed Node and Network Models for M2M Internet

Proposed Node and Network Models for M2M Internet 2009-2012 NTT CORPORATION. All Rights Reserved. Proposed Node and Network Models for M2M Internet Yuminobu Igarashi NTT Information Sharing Platform Laboratories 2012 NTT Information Sharing Platform Laboratories

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

Introduction to Mobile Ad hoc Networks (MANETs)

Introduction to Mobile Ad hoc Networks (MANETs) Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device

More information

Top-Down Network Design

Top-Down Network Design Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic

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

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

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting

More information

A Comparative Performance Study of the Routing Protocols RPL, LOADng and LOADng-CTP with Bidirectional Traffic for AMI Scenario

A Comparative Performance Study of the Routing Protocols RPL, LOADng and LOADng-CTP with Bidirectional Traffic for AMI Scenario A Comparative Performance Study of the Routing Protocols, and with Bidirectional Traffic for AMI Scenario Saida Elyengui, Riadh Bouhouchi, and Tahar Ezzedine Abstract With the introduction of the smart

More information

C13b: Routing Problem and Algorithms

C13b: Routing Problem and Algorithms CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in

More information

ITEC310 Computer Networks II

ITEC310 Computer Networks II ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able

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

Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks

Redes Inalámbricas Tema 4. Mobile Ad Hoc Networks 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

More information

Routing protocols in WSN

Routing protocols in WSN Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can

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

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,

More information

Performance Evaluation of Routing Protocols in Lossy Links for Smart Building Networks

Performance Evaluation of Routing Protocols in Lossy Links for Smart Building Networks Performance Evaluation of Routing Protocols in Lossy Links for Smart Building Networks Ion Emilian Radoi Master of Science Computer Science School of Informatics University of Edinburgh 2011 Abstract

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions

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

CS551 Ad-hoc Routing

CS551 Ad-hoc Routing CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor

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

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 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

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

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

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

IPv6 PIM-DM configuration example 36 IPv6 PIM-SM non-scoped zone configuration example 39 IPv6 PIM-SM admin-scoped zone configuration example 42 IPv6

IPv6 PIM-DM configuration example 36 IPv6 PIM-SM non-scoped zone configuration example 39 IPv6 PIM-SM admin-scoped zone configuration example 42 IPv6 Contents Configuring IPv6 PIM 1 Overview 1 IPv6 PIM-DM overview 1 IPv6 PIM-SM overview 3 IPv6 BIDIR-PIM overview 8 IPv6 administrative scoping overview 11 IPv6 PIM-SSM overview 13 Relationship among IPv6

More information

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput

More information

Part I. Wireless Communication

Part I. Wireless Communication 1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable

More information

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers Table of Contents RIP Configuration 1 RIP Overview 1 Operation of RIP 1 Operation of RIP 2 RIP Version 2 RIP Message Format 3 Protocols and Standards 4 Configuring RIP Basic Functions 5 Configuration Prerequisites

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

Table of Contents 1 MSDP Configuration 1-1

Table of Contents 1 MSDP Configuration 1-1 Table of Contents 1 MSDP Configuration 1-1 MSDP Overview 1-1 Introduction to MSDP 1-1 How MSDP Works 1-2 Protocols and Standards 1-7 MSDP Configuration Task List 1-7 Configuring Basic Functions of MSDP

More information

Performance Analysis and Enhancement of Routing Protocol in Manet

Performance Analysis and Enhancement of Routing Protocol in Manet Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and

More information

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features

More information

QUALITY OF SERVICE EVALUATION IN IEEE NETWORKS *Shivi Johri, **Mrs. Neelu Trivedi

QUALITY OF SERVICE EVALUATION IN IEEE NETWORKS *Shivi Johri, **Mrs. Neelu Trivedi QUALITY OF SERVICE EVALUATION IN IEEE 802.15.4 NETWORKS *Shivi Johri, **Mrs. Neelu Trivedi *M.Tech. (ECE) in Deptt. of ECE at CET,Moradabad, U.P., India **Assistant professor in Deptt. of ECE at CET, Moradabad,

More information

Internet Engineering Task Force (IETF) Request for Comments: Category: Experimental February 2014 ISSN:

Internet Engineering Task Force (IETF) Request for Comments: Category: Experimental February 2014 ISSN: Internet Engineering Task Force (IETF) A. Retana Request for Comments: 7137 S. Ratliff Updates: 5820 Cisco Systems, Inc. Category: Experimental February 2014 ISSN: 2070-1721 Use of the OSPF-MANET Interface

More information

RF and network basics. Antonio Liñán Colina

RF and network basics. Antonio Liñán Colina RF and network basics Antonio Liñán Colina Architectures: 8-bit, 16-bit, 32-bit Open Source (source code openly available) IPv4/IPv6/Rime networking Devices with < 8KB RAM Typical applications < 50KB Flash

More information

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET Bhabani Sankar Gouda Department of Computer Science & Engineering National Institute

More information

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1 Table of Contents 1 Static Routing Configuration 1-1 Introduction 1-1 Static Route 1-1 Default Route 1-1 Application Environment of Static Routing 1-1 Configuring a Static Route 1-2 Configuration Prerequisites

More information

Module 8. Routing. Version 2 ECE, IIT Kharagpur

Module 8. Routing. Version 2 ECE, IIT Kharagpur Module 8 Routing Lesson 27 Routing II Objective To explain the concept of same popular routing protocols. 8.2.1 Routing Information Protocol (RIP) This protocol is used inside our autonomous system and

More information

Internet Engineering Task Force (IETF) Category: Standards Track

Internet Engineering Task Force (IETF) Category: Standards Track Internet Engineering Task Force (IETF) Request for Comments: 6551 Category: Standards Track ISSN: 2070-1721 JP. Vasseur, Ed. Cisco Systems M. Kim, Ed. Corporate Technology Group, KT K. Pister Dust Networks

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

Study and Analysis of Routing Protocols RIP and DSR Using Qualnet V5

Study and Analysis of Routing Protocols RIP and DSR Using Qualnet V5 Study and Analysis of Routing Protocols RIP and DSR Using Qualnet V5 Nallamalla Anusha Department of Computer Science and Engineering Baba Institute of Technology and Sciences, Visakhapatnam, Andhra Pradesh-

More information

Routing. 4. Mar INF-3190: Switching and Routing

Routing. 4. Mar INF-3190: Switching and Routing Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines

More information

Wireless Sensor Networks, energy efficiency and path recovery

Wireless Sensor Networks, energy efficiency and path recovery Wireless Sensor Networks, energy efficiency and path recovery PhD dissertation Anne-Lena Kampen Trondheim 18 th of May 2017 Outline Introduction to Wireless Sensor Networks WSN Challenges investigated

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