Dynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5

Size: px
Start display at page:

Download "Dynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5"

Transcription

1 ynamic Source Routing (SR) [Johnson96] S 6811 : Lecture 5

2 d Hoc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation Loop freedom emand-based operation Security Sleep period operation Unidirectional link support

3 Links are virtual Transmission range (a) Physical wireless links (b) Network topology

4 Network Layer Notation vs. Link Layer Transmissions (1) packet packet

5 Network Layer Notation vs. Link Layer Transmissions (2) Network layer (t) packet packet Network layer Link layer Link layer (t 1 ) Link layer (t 2 )

6 Routing task S Routing is the act of moving information across an internetwork from a source to a destination. Routing involves two basic activities: determining optimal routing paths transporting information groups (typically called packets) through an internetwork.

7 Routing task S Nodes that want to route messages must: ind out about the topology of the network Use that topology to do something with the message ontrol Plane ata Plane

8 Routing Protocol ategories Proactive: ontrol Plane Nodes actively maintain and share topology information, regardless whether there is data to be sent Generally timer- or event-based Reactive (On-demand): Lazy approach: on t do more work then you have to Only discover topology/routes when there is data to send

9 Path discovery in reactive protocols query(0) query(0) reply(0) reply(0) query(0) query(0) 3 query-reply mechanism query is broadcast reply is unicast query(0) query(0) reply(0) 5 4 query(0)

10 Routing Protocol ategories ata Plane Local next-hop forwarding: Source routing:

11 Routing Protocol ategories ata Plane Local next-hop forwarding: onsult forwarding table for a next hop ompletely local decision Routing tables G I H K L J orwarding table based

12 Routing Protocol ategories ata Plane Local next-hop forwarding: onsult forwarding table for a next hop ompletely local decision Source routing: Source node places complete path in packet header Intermediate nodes don t have to consult their forwarding tables

13 Source routing explained G ata. Header

14 Reactive Protocols Names are useful hints at understanding the protocol properties: ynamic Source Routing (SR) MNT Source Routing d-hoc On-demand istance Vector (OV) MNT Reactive istance Vector Next-hop orwarding

15 Reactive Routing Protocols ynamic Source Routing (SR)

16 The Routing Problem in Mobile d hoc wirless networks S S The routing problem is to find a route from S to when some or all of the nodes are mobile.

17 SR: Properties How many desirable properties does SR support? istributed operation Loop freedom emand-based operation Security Sleep period operation Unidirectional link support YS YS YS NO YS YS

18 SR: ssumptions ooperative environment Links symmetric / Symmetric both Network diameter small but larger than 1 Nodes may work in promiscuous mode (explained in the next slide)

19 Non Promiscuous mode packet packet packet d = my address? NI Y N To upper layer rop

20 Promiscuous mode explained packet packet NI filtering turned off packet NI To upper layer irpcap Nx: US a/b/g/n dapter has this capability

21 What SR does? Path discovery Route Request (RRQ) Route Reply (RRPLY) Path maintenance Route rror (RRR) ata delivery Performance tuning

22 SR: Path iscovery When node S wants to send a packet to node, but does not know a route to, node S initiates a route discovery. Source node S floods the network with route request (RRQ) packets (also called query packets). ach node appends its own address in the packet header when forwarding RRQ. 22

23 Route iscovery in SR (1) G Y I Z H K L J

24 Route iscovery in SR (2) Source I Source seq# RRQ[] Target I RRQ[] G I Y Z Partial route H K L J roadcast RRQ[] Represents a node that has received RRQ for H from

25 Route iscovery in SR (3) RRQ[, ] G I Y Z RRQ[, ] H K L J

26 Route iscovery in SR (4) G RRQ[,, G] I Y Z RRQ[,, ] H RRQ[,, ] K L J

27 Route iscovery in SR (5) G RRP[,, G, H] Y I Z H K RRQ[,,, K] L J Unicast RRP[,, G, H] ssumption: Links are symmetric

28 G H K J I L G H K J I L G H K J I L RRQ[] RRQ[] G H K J I L RRQ[] RRQ[] Route iscovery in SR (a) (d) (c) (b) K L K L K L K L G H K J I L RRQ[,, G] RRQ[,, ] RRQ[,, ] G H K J I L RRQ[,, G] RRQ[,, ] RRQ[,, ] G H K J I RRP[,, G, H] RRQ[,,, K] L

29 Route iscovery at source needs to send to H Lookup ache for route to H Start Route iscovery Protocol uffer packet no Route found? wait ontinue normal processing yes yes Write route in packet header Route iscovery finished Packet in buffer? no done Send packet to next-hop

30 Route iscovery: t an intermediate node ccept route request packet <src,id> in recently seen requests list? yes iscard route request no ppend myddr to partial route Store <src,id> in cache for duplicate detection no Host s address already in patrial route no mydd =target yes Send route reply packet yes iscard route request roadcast packet done

31 Route Reply in SR (symmetric case) estination on receiving the first RRQ, sends a Route Reply (RRP) RRP is sent on a route obtained by reversing the route appended to received RRQ RRP includes the route from S to on which RRQ was received by node

32 Route Reply in SR (symmetric case) G RRP[,, G, H] Y I Z H K RRQ[,,, K] L J

33 Route Reply in SR (asymmetric case) G Y I Z H K L J

34 Route Reply in SR (asymmetric case) If unidirectional (asymmetric) links are allowed, then RRP may need a route discovery for S from node Unless node already knows a route to node S If a route discovery is initiated by for a route to S potential cause of deadlock. The Route Reply is piggybacked on the Route Request from.

35 ata elivery in SR G H ata G Y I Z H K L J Packet header size grows with route length

36 Route Maintenance RRR RRR G G ---G H How to send RRR? Symmetric: Reverse the route in the packet header symmetric: Perform a route discovery

37 How to etect roken Link? (1) With the help of M layer: - ata-k handshake supported by I bsence of K retransmit - fter few retries if number exceeds U limit Link broken - Inform upper layer (cross layer interaction) - Network layer (where SR is implemented) will send RRR (2) If different M layers other than is used: - Promiscuous mode - Passive cknowledgement SR protocol (3) If Promiscuous mode not supported: - xplicit K can be incorporated in the Network layer - think about traceroute pplication layer Transport layer Network layer ata link layer Phisical layer M (4) Transport layer K can be used for crude indication of working routes

38 SR Optimization (Performance improvement) Route discovery + Route Reply + Route rror = Routing Overhead. ompetes with ata transmission How to cut down routing Overhead? No cut down possible at Route Reply (RRP) No cut down possible in Route rror (RRR) Only possibility: cut down Route iscovery (RRQ) chievable through caching

39 SR Optimization (aching) ach node caches a new route it learns by any means aching overheard routing information In presence of uni-directional link In presence of bi-directional link

40 SR Optimization (aching) ach node caches a new route it learns by any means aching overheard routing information In presence of uni-directional link In presence of bi-directional link

41 enefit of route caching: (intermediate nodes reply) Replying to Route Request using cached routes can speed up route discovery can reduce propagation of route requests The intermediate node must verify that the resulting route being returned contains no duplicate nodes listed in the route record

42 enefit of route caching: (intermediate nodes reply) Replying to Route Request using cached routes can speed up route discovery can reduce propagation of route requests The intermediate node must verify that the resulting route being returned contains no duplicate nodes listed in the route record

43 ata structure for Route aching ache at :

44 ata structure for Route aching ache at :

45 ata structure for Route aching ache at (before movement): ache at (after movement): Truncate at each entry!!

46 Tree is the best data structure ache at (before): ache at (after):

47 Some issues and solutions

48 Problem 1: Use of ache Possibility of simultaneous route reply: [,,,] [,,] Where is? Solution: (1) elay before reply H * (h-1+r) (2) Overhear while waiting (3) ancel reply if hop length is larger than any of the overheard reply s hop length

49 Problem 2: Route rror (RRR) invalidate cache: Y H S I RRR [J-] J sends a route error to S along route J---S when its attempt to forward the data packet S (with route SJ) on J- fails Nodes hearing RRR update their route cache to remove link J- G K J M Z N L

50 Problem with asymmetric links (Route rror (RRR) invalidate cache): Y H S I RRR [G-K] G K J Z M N L G sends RRR through another path Nodes on original path can not invalidate their cache. Solution: S propagates RRR through original path up to G.

51 Problem 3: Shortest path may not be discovered RRQ propagates through -- - and --? Which one reaches quicker? epends on load, congestion etc Node mobility may change path length Previous path --- New shorter path -- overhears and ultimately discovers. Sends a unsolicited route reply

52 Problem 4: Piggybacking data on route discovery not possible because of caching Short packets can be piggybacked in RRQ packet for performance improvement (TP SYN packets are most suitable) aching creates a problem!! [,,,] ata [,,] Where is?

53 Problem 5: Network Partition Y H S I G K J Z M N L Source S - estination Y ata rates 50 pkt/seconds t least 50 RRQ broadcasts per second!!

54 Problem 5: Network Partition Y H S I G K J Z M N L Solution: xponential backoff to limit the rate The interval between each successive new route discovery for the same host is exponentially deferred

55 Problem 6: aching results many route reply from intermediate nodes H S I G K J M N L Suppose S sends packet to through the route S J S,,, J, has the routing info to (from RRP),, G, K, N, M also has the routing info to (from overhearing) 11 nodes know about!! Only 5 nodes left!! Suppose node H floods a RRQ asking for how many reply he gets?

56 Problem 6: aching results many route reply from intermediate nodes H S I G K J M N L Solution: xpanding Ring: H sends RRQ with TTL 1 if RRP received done otherwise send RRQ with TTL 2... Gradually increase up to a max

57 ynamic Source Routing: dvantages Reactive: Routes maintained only between nodes who need to communicate reduces overhead of route maintenance aching: Route caching can further reduce route discovery overhead Multipath: single route discovery may yield many routes to the destination, due to intermediate nodes replying from local caches

58 ynamic Source Routing: isadvantages Non-scalable: Packet header size grows with route length due to source routing are must be taken to avoid collisions between route requests propagated by neighboring nodes insertion of random delays before forwarding RRQ

59 ynamic Source Routing: isadvantages Too much caching: Increases contention if too many route replies come back due to nodes replying using their local cache Route Reply Storm problem 59

60 ynamic Source Routing: isadvantages n intermediate node may send Route Reply using a stale cached route, thus polluting other caches This problem can be eased if some mechanism to purge (potentially) invalid cached routes is incorporated. or some proposals for cache invalidation, see [Hu00Mobicom] Static timeouts daptive timeouts based on link stability 60

61

Dynamic Source Routing (DSR) [Johnson96]

Dynamic Source Routing (DSR) [Johnson96] ynamic Source Routing (SR) [ohnson96] S 6811 : ecture 5 d oc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation oop freedom

More information

Ad hoc On-demand Distance Vector Routing (AODV) [Perkins99] CSE 6811 : Lecture 7

Ad hoc On-demand Distance Vector Routing (AODV) [Perkins99] CSE 6811 : Lecture 7 d hoc On-demand istance Vector Routing (OV) [Perkins99] 6811 : Lecture 7 d Hoc On-emand istance Vector Routing (OV) R includes source routes in packet headers G ata. Header Large headers can sometimes

More information

Page 1. Mobile Ad Hoc Networks. EEC173B/ECS152C, Winter Mobile Ad Hoc Networks (MANET)

Page 1. Mobile Ad Hoc Networks. EEC173B/ECS152C, Winter Mobile Ad Hoc Networks (MANET) 173/152, Winter 2006 obile d oc etworks (T) obile d oc etworks (T) ntroduction Unicast Routing Properties ormed by wireless hosts which may be mobile Without (necessarily) using a pre existing infrastructure

More information

Page 1. Mobile Ad Hoc Networks EEC173B/ECS152C. Mobile Ad Hoc Networks (MANET)

Page 1. Mobile Ad Hoc Networks EEC173B/ECS152C. Mobile Ad Hoc Networks (MANET) 173/152 obile d oc etworks (T) obile d oc etworks (T) ntroduction Unicast Routing Reactive Protocols: R, R, OV Proactive Protocols Properties ormed by wireless hosts which may be mobile Without (necessarily)

More information

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR d oc On-emand istance Vector (OV) R includes source routes in packet headers Resulting large headers can sometimes degrade performance particularly when data contents of a packet are small OV attempts

More information

4/11/2012. Outline. Routing Protocols for Ad Hoc Networks. Classification of Unicast Ad-Hoc Routing Protocols. Ad Hoc Networks.

4/11/2012. Outline. Routing Protocols for Ad Hoc Networks. Classification of Unicast Ad-Hoc Routing Protocols. Ad Hoc Networks. 18759 Wireless Networks (2012-pring) urvey Routing Protocols for d Hoc Networks Jiun-RenLin and Yi-hun hou lectrical and omputer ngineering arnegie Mellon University Outline d-hoc networks Unicast d-hoc

More information

Ad Hoc Routing. Ad-hoc Routing. Problems Using DV or LS. DSR Concepts. DSR Components. Proposed Protocols

Ad Hoc Routing. Ad-hoc Routing. Problems Using DV or LS. DSR Concepts. DSR Components. Proposed Protocols d oc Routing d-hoc Routing rvind Krishnamurthy all 2003 Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems

More information

The Basics of Wireless Communication Octav Chipara

The Basics of Wireless Communication Octav Chipara The asics of Wireless ommunication Octav hipara genda hannel model: the protocol model High-level media access TM, SM hidden/exposed terminal problems WLN Fundamentals of routing proactive on-demand 2

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

Wireless Internet Routing

Wireless Internet Routing Wireless nternet Routing Wireless Routing in the eginning 1 Wireless nternet Routing This course: routing in T/ad hoc networks and mesh networks o nternet? = ateway(s) wireless/wired 2 1 Outline Review

More information

Routing In Ad Hoc Networks

Routing In Ad Hoc Networks Routing n d oc Networks ontents 1. ntroduction to ad-hoc networks 2. Proactive routing protocols OLR 3. Reactive routing protocols R, OV 4. Non-uniform routing protocols ZRP, R 5. Other approaches eographical

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

Unicast Routing in Mobile Ad Hoc Networks

Unicast Routing in Mobile Ad Hoc Networks Unicast Routing in obile d oc etworks Routing problem 1 2 Responsibility of a routing protocol etermining an optimal way to find optimal routes etermining a feasible path to a destination based on a certain

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

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891

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

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

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

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

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

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

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

Arvind Krishnamurthy Fall 2003

Arvind Krishnamurthy Fall 2003 Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems

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

Dynamic Source Routing in Ad Hoc Wireless Networks

Dynamic Source Routing in Ad Hoc Wireless Networks Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract

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

Previous Lecture. Link Layer & Network Layer. Link Layer. This Lecture. Framing. Sending bits. Chapter 7.C and 7.D

Previous Lecture. Link Layer & Network Layer. Link Layer. This Lecture. Framing. Sending bits. Chapter 7.C and 7.D hapter 7. and 7. Previous Lecture Layer & Network Layer The network is organized into layers Prof. ina Katabi Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari alakrishnan,

More information

Routing in Ad-hoc Networks

Routing in Ad-hoc Networks 0/3/ COMP 635: WIRELESS & MOILE COMMUNICTIONS Routing in d-hoc Networks Jasleen Kaur Fall 0 Infrastructure-less Wireless Networks Standard Mobile IP needs an infrastructure Ø Home gent/foreign gent in

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

Nomadic Communications. Copyright. Ad-Hoc and WMN. Wireless Mesh Networks. Quest operaèprotettadallalicenza:

Nomadic Communications. Copyright. Ad-Hoc and WMN. Wireless Mesh Networks. Quest operaèprotettadallalicenza: Nomadic ommunications Wireless Mesh Networks Renato Lo igno Loigno@disi.unitn.it - Tel: 2026 Home Page: http://isi.unitn.it/locigno/index.php/teaching-duties/nomadic-communications opyright Quest operaèprotettadallalicenza:

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

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

Dynamic Source Routing in ad hoc wireless networks

Dynamic Source Routing in ad hoc wireless networks Dynamic Source Routing in ad hoc wireless networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University In Mobile Computing, vol. 353, chapter 5, T. Imielinski and H.

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

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

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob

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

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

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

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

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

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

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

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

15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks

15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks 15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable

More information

0!1. Overlaying mechanism is called tunneling. Overlay Network Nodes. ATM links can be the physical layer for IP

0!1. Overlaying mechanism is called tunneling. Overlay Network Nodes. ATM links can be the physical layer for IP epartment of lectrical ngineering and omputer Sciences University of alifornia erkeley '!$$( network defined over another set of networks The overlay addresses its own nodes Links on one layer are network

More information

On-Demand Multicast Routing in Ad Hoc Networks with Unidirectional Links

On-Demand Multicast Routing in Ad Hoc Networks with Unidirectional Links On-Demand Multicast Routing in Ad Hoc Networks with Unidirectional Links Jorjeta G. Jetcheva and David B. Johnson December 15, 2004 CMU-CS-04-175 School of Computer Science Computer Science Department

More information

IN a mobile ad hoc network, nodes move arbitrarily.

IN a mobile ad hoc network, nodes move arbitrarily. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 6, JUNE 2006 609 Distributed Cache Updating for the Dynamic Source Routing Protocol Xin Yu Abstract On-demand routing protocols use route caches to make

More information

On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density

On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density On-Demand Routing in Wireless Ad-Hoc Networks with Wide Levels of Network Density Presented by Wei-Cheng Xiao Advisor: David B. Johnson 2015/03/30 Wireless Network Infrastructure Mode Internet access point

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

6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)

6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA) 103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA

More information

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate

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

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

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016 estination Sequenced istance Vector (SV) Routing [Perkins94] SV: Proactive SV is a proactive protocol means it maintains up-to-date routing information for all available nodes in the network. No extra

More information

Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies

Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com Analysis

More information

Lecture 6: Bridging & Switching. Last time. Today. CSE 123: Computer Networks Chris Kanich. How do multiple hosts share a single channel?

Lecture 6: Bridging & Switching. Last time. Today. CSE 123: Computer Networks Chris Kanich. How do multiple hosts share a single channel? Lecture 6: ridging & Switching SE 3: omputer Networks hris Kanich Project countdown: 5 days Last time How do multiple hosts share a single channel? Medium ccess ontrol (M) protocols hannel partitioning

More information

Multi-hop Technology: Ad-hoc Networks

Multi-hop Technology: Ad-hoc Networks MNT and VNT routing Multi-hop Technology d-hoc Networks ll hops are wireless ll nodes are mobile Military pplications rmy leet of warships pace pplications group of pathfinders group of satellites ommercial

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

Dynamically Adaptive Multipath Routing based on AODV

Dynamically Adaptive Multipath Routing based on AODV ynamically daptive Multipath Routing based on OV Perumal Sambasivam shwin Murthy lizabeth M. elding-royer epartment of omputer Science University of alifornia, Santa arbara peru, ashwin, ebelding @cs.ucsb.edu

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

AODV Multipath Extension using Source Route Lists with Optimized Route Establishment

AODV Multipath Extension using Source Route Lists with Optimized Route Establishment INTERNATIONAL WORKHOP ON WIRELE A-HOC NETWORK (IWWAN) AOV Multipath Extension using ource Route Lists with Optimized Route Establishment Yusuke akurai and Jiro Katto Graduate chool of cience and Engineering,

More information

Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network

Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network 1 Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network Nilima Walde, Assistant Professor, Department of Information Technology, Army Institute of Technology, Pune, India Dhananjay

More information

Lecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT

Lecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet

More information

CE693: Adv. Computer Networking

CE693: Adv. Computer Networking CE693: Adv. Computer Networking L-10 Wireless Broadcast Fall 1390 Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan at CMU. When slides are

More information

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric

More information

AODV- An Efficient MANET Routing Protocol

AODV- An Efficient MANET Routing Protocol International Journal of urrent Engineering and Technology E-IN 2277 4106, P-IN 2347-5161 2014 INPREO, ll Rights Reserved vailable at http://inpressco.com/category/ijcet Research rticle OV- n Efficient

More information

Announcements. Ethernet. Goals of Today s Lecture. Three Ways to Share the Media. Random Access Protocols. Key Ideas of Random Access

Announcements. Ethernet. Goals of Today s Lecture. Three Ways to Share the Media. Random Access Protocols. Key Ideas of Random Access Ethernet EE 1: Intro to ommunication Networks Fall 00 (WF -:0 in ory ) Vern Paxson Ts: Lisa Fowler, aniel Killebrew & Jorge Ortiz http://inst.eecs.berkeley.edu/~ee1/ nnouncements Solutions for Homework

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

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

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives Routers & Routing -44: omputer Networking High-speed router architecture Intro to routing protocols ssigned reading [McK9] Fast Switched ackplane for a Gigabit Switched Router Know RIP/OSPF L-4 Intra-omain

More information

15-441: Computer Networking. Wireless Networking

15-441: Computer Networking. Wireless Networking 15-441: Computer Networking Wireless Networking Outline Wireless Challenges 802.11 Overview Link Layer Ad-hoc Networks 2 Assumptions made in Internet Host are (mostly) stationary Address assignment, routing

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

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

A Self-Healing and Optimizing Routing Technique for Ad Hoc Networks

A Self-Healing and Optimizing Routing Technique for Ad Hoc Networks Self-Healing and Optimizing Routing Technique for d Hoc Networks hao Gui and Prasant Mohapatra 1 bstract On demand routing protocols provide scalable and cost-effective solutions for packet routing in

More information

Performance of Route Caching Strategies in Dynamic Source Routing

Performance of Route Caching Strategies in Dynamic Source Routing Performance of Route Caching Strategies in Dynamic Source Routing Mahesh K. Marina Samir R. Das Department of Electrical & Computer Engineering and Computer Science University of Cincinnati Cincinnati,

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

Geographic Routing in Simulation: GPSR

Geographic Routing in Simulation: GPSR Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops

More information

Workshops der Wissenschaftlichen Konferenz Kommunikation in Verteilten Systemen 2009 (WowKiVS 2009)

Workshops der Wissenschaftlichen Konferenz Kommunikation in Verteilten Systemen 2009 (WowKiVS 2009) Electronic Communications of the EAT Volume 17 (2009) Workshops der Wissenschaftlichen Konferenz Kommunikation in Verteilten ystemen 2009 (WowKiV 2009) Analysis of Inconsistent Routing Components in Reactive

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

Outline. Connecting to the access network: DHCP and mobile IP, LTE. Transport layer: UDP and TCP

Outline. Connecting to the access network: DHCP and mobile IP, LTE. Transport layer: UDP and TCP Outline Connecting to the access network: DHCP and mobile IP, LTE Transport layer: UDP and TCP IETF TCP/IP protocol suite User application, e.g., http with Mozilla Communication for each process on computer

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

Quiz 5 Answers. CS 441 Spring 2017

Quiz 5 Answers. CS 441 Spring 2017 Quiz 5 Answers CS 441 Spring 2017 1. How does Flooding differ from the route discovery phase used in other reactive routing protocols such as DSR and AODV? [2] Flooding involves broadcasting of data packet

More information

Overview : Computer Networking. IEEE MAC Protocol: CSMA/CA. TCP over noisy links. Link layer challenges. Wireless deployments

Overview : Computer Networking. IEEE MAC Protocol: CSMA/CA. TCP over noisy links. Link layer challenges. Wireless deployments Overview 15-441: omputer Networking Lecture 25: Wireless Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 Internet t mobility TP over noisy links Link layer challenges Wireless deployments 2 IEEE

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch David A. Maltz David B. Johnson Yih-Chun Hu Jorjeta Jetcheva Computer Science Department Carnegie Mellon University

More information

Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.

Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,

More information

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science Courant Institute of Mathematical Sciences New York University,

More information

Advanced Computer Networks

Advanced Computer Networks istance Vector dvanced omputer Networks Internal routing - distance vector protocols Prof. ndrzej uda duda@imag.fr ontents Principles of internal routing istance vector (ellman-ford) principles case of

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

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

CS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017

CS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017 CS 43: Computer Networks Switches and LANs Kevin Webb Swarthmore College December 5, 2017 Ethernet Metcalfe s Ethernet sketch Dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology

More information

PERFORMANCE EVALUATION OF DSR AND AODV OVER UDP AND TCP CONNECTIONS

PERFORMANCE EVALUATION OF DSR AND AODV OVER UDP AND TCP CONNECTIONS PERFORMANCE EVALUATION OF DSR AND AODV OVER UDP AND TCP CONNECTIONS Sunil Taneja Department of Computer Science Smt. Aruna Asaf Ali Government Post Graduate College, Kalka, India E-mail: suniltaneja.iitd@gmail.com

More information

Lecture 4: Mobile Ad Hoc and Sensor Networks (I)

Lecture 4: Mobile Ad Hoc and Sensor Networks (I) Lecture 4: Mobile Ad Hoc and Sensor Networks (I) Ing-Ray Chen CS 6204 Mobile Computing Virginia Tech Courtesy of G.G. Richard III for providing some of the slides Mobile Ad Hoc Networks May need to traverse

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

ECSE 414 Fall 2014 Final Exam Solutions

ECSE 414 Fall 2014 Final Exam Solutions ECSE 414 Fall 2014 Final Exam Solutions Question 1 a. The five main layers of the internet protocol stack, along with the service provided by each, and the place where each is implemented are as follows:

More information

Bridges. Bridge Functions. Example of No-frills Bridge. No-frills Bridges. Example of Learning Bridge. Learning Bridges

Bridges. Bridge Functions. Example of No-frills Bridge. No-frills Bridges. Example of Learning Bridge. Learning Bridges ridge Functions To extend size of LNs either geographically or in terms number of users. Protocols that include collisions can be performed in a collision domain of limited size. In ring networks the number

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