Wireless Mesh Networks
|
|
- Kathlyn Perry
- 5 years ago
- Views:
Transcription
1 Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp]
2 Wireless Mesh Networks Describes wireless networks in which each node can communicate directly with any other node Traditional wireless network traffic goes through APs Mesh networks: Remove this restriction Multiple paths: Mesh client router Client serves as a router 2
3 Distance Vector & Link State Routing Both assume each router knows single-hop routing information: Address of each neighbor Cost of reaching each neighbor (metric) Distance Vector: Router knows just the metric to each destination Link State: Router knows entire network topology, computes shortest path to each destination 3
4 Today 1. Distance Vector Routing New node join Broken link Route changes 1. Destination Sequenced Distance-Vector Routing (DSDV) 2. Dynamic Source Routing (DSR) 3. Roofnet 4
5 Distance Vector Routing Every node maintains a routing table For each destination in the mesh: The number of hops to reach the destination (metric) The next node on the path towards the destination All nodes periodically, locally broadcast their routing table Traffic overhead due to broadcasting A A A 0 B B 1 C B 2 B A A 1 B B 0 C C 1 C A B 2 B B 1 C C 0 5
6 Distance Vector New Node Join D joins the network A B C D A A 0 B B 1 C B 2 A A 1 B B 0 C C 1 A B 2 B B 1 C C 0 6
7 Distance Vector New Node Join D joins the network D s broadcast first updates C s table with new entry for D D s routing table (D, D, 0) A B C D A A 0 B B 1 C B 2 A A 1 B B 0 C C 1 A B 2 B B 1 C C 0 D D 1 7
8 Distance Vector New Node Join Now C broadcasts its routing table B and D hear and add new entries, incrementing metric (hops) C s routing table (A, B, 2) (B, B, 1) (C, C, 0) (D, D, 1) (A, B, 2) (B, B, 1) (C, C, 0) (D, D, 1) A A A 0 B B 1 C B 2 B A A 1 B B 0 C C 1 D C 2 C A B 2 B B 1 C C 0 D D 1 D A C 3 B C 2 C C 1 D D 0 8
9 Distance Vector New Node Join Now B broadcasts its routing table A and C hear and add new entries, incrementing metric (hops) (A, A, 1) (B, B, 0) (C, C, 1) (D, C, 2) B s routing table (A, A, 1) (B, B, 0) (C, C, 1) (D, C, 2) A A A 0 B B 1 C B 2 D B 3 B A A 1 B B 0 C C 1 D C 2 C A B 2 B B 1 C C 0 D D 1 D A C 3 B C 2 C C 1 D D 0 9
10 Today 1. Distance Vector Routing New node join Broken link Route changes 1. Destination Sequenced Distance-Vector Routing (DSDV) 2. Dynamic Source Routing (DSR) 3. Roofnet 10
11 Distance Vector Broken Link Suppose link C ßà D breaks A D B 3 B D C 2 C D D 1 D 11
12 Distance Vector Broken Link 1. C hears no advertisement from D for a timeout period C sets D s metric to A D B 3 B D C 2 C D D D 12
13 Distance Vector Broken Link 1. C sets D s metric to 2. B broadcasts its routing table C now accepts B s entry for D (3 < ) (D, C, 2) (D, C, 2) A D B 3 B D C 2 C D B 3 D 13
14 Broken Link: Counting to Infinity 1. C sets D s metric to 2. B broadcasts its routing table 3. C broadcasts its routing table B accepts C s new metric (previous next-hop: C) (D, C, 2) (D, B, 3) (D, C, 2) A D B 3 B D C 4 C D B 3 D 14
15 Broken Link: Counting to Infinity 1. C sets D s metric to 2. B broadcasts its routing table 3. C broadcasts its routing table 4. B broadcasts its routing table A, C accept B s new metric (previous next-hops: B) (D, C, 4) (D, C, 2) (D, C, 4) (D,3) (D, C, 2) A D B 5 B D C 4 C D B 5 D 15
16 Today 1. Distance Vector Routing New node join Broken link Route changes 1. Destination Sequenced Distance-Vector Routing (DSDV) 2. Dynamic Source Routing (DSR) 3. Roofnet 16
17 Distance Vector Route Change D moves to another place and broadcast its routing table D A C 3 B C 2 C C 1 D D 0 A B C A A 0 B B 1 C B 2 D B 3 A A 1 B B 0 C C 1 D C 2 A B 2 B B 1 C C 0 D D 1 17
18 Distance Vector Route Change D moves to another place and broadcast its routing table (D, D, 0) D A C 3 B C 2 C C 1 D D 0 (D, D, 0) A B C A A 0 B B 1 C B 2 D B 3 A A 1 B B 0 C C 1 D D 1 A B 2 B B 1 C C 0 D D 1 18
19 Distance Vector Route Change D moves to another place and broadcast its routing table B broadcast its routing table (D, D, 1) (D, D, 1) D (D, D, 1) A B 2 B B 1 C C 1 D D 0 A A A 0 B B 1 C B 2 D B 2 B A A 1 B B 0 C C 1 D D 1 C A B 2 B B 1 C C 0 D D 1 19
20 Today 1. Distance Vector Routing 2. Destination Sequenced Distance-Vector Routing (DSDV) New node join Broken link Route advertisement 3. Dynamic Source Routing (DSR) 4. Roofnet 20
21 Destination Sequenced Distance-Vector (DSDV) Routing Guarantees loop freeness New routing table information: Sequence number 1. Per-destination information 2. Originated by destination 3. Included in routing advertisements Destination Next Metric Seq. Nr A A B B C B D B
22 DSDV: Route Advertisement Rule Rules to set sequence number: Just before node N s broadcast advertisement: Node N sets: Seq(N) ß Seq(N) + 2 Node N thinks neighbor P is no longer directly reachable Node N sets: Seq(P) ß Seq(P) + 1 Metric(P) ß 22
23 DSDV New Node D joins the network D s broadcast first updates C s table with new entry for D 1. D broadcast for first time Send Sequence number 000 (D, D, 0, 000) A B C D Seq. A A B B C B Seq. A A B B C C Seq. A B B B C C
24 DSDV New Node 2.1: Insert entry for D with same sequence number : Triggered broadcast of its own table 1. D broadcast for first time Send Sequence number 000 (D, D, 0, 000) A B C D Seq. A A B B C B Seq. A A B B C C Seq. A B B B C C D D
25 DSDV New Node 4. B gets C s update and updates its table 3. C increases its sequence number to 592 then broadcasts its new table. (A, B, 2, 550) (B, B, 1, 104) (C, C, 0, 592) (D, D, 1, 000) (A, B, 2, 550) (B, B, 1, 104) (C, C, 0, 592) (D, D, 1, 000) A B C D Seq. A A B B C B Seq. A A B B C C D C Seq. A B B B C C D D
26 DSDV New Node 4. B increases its own seqno and broadcasts its new table (A, B, 1, 550) (B, B, 0, 106) (C, C, 1, 592) (D, C, 2, 000) (A, B, 1, 550) (B, B, 0, 106) (C, C, 1, 592) (D, C, 2, 000) A B C D Seq. A A B B C B D B Seq. A A B B C C D C Seq. A B B B C C D D
27 Today 1. Distance Vector Routing 2. Destination Sequenced Distance-Vector Routing (DSDV) New node join Broken link Route advertisement 3. Dynamic Source Routing (DSR) 4. Roofnet 27
28 DSDV Broken Link Suppose link C ßà D breaks A B C D Seq. A A B B C B D B Seq. A A B B C C D C Seq. A B B B C C D D
29 DSDV Broken Link 1. Node C detects broken Link: à Increase Seq. No. by 1 (only case where not the destination sets the sequence number à odd number) A B C D Seq. A A B B C B D B Seq. A A B B C C D C Seq. A B B B C C D D
30 DSDV: Routing Table Update Rule Rules to update routing table entry: Node N gets routing advertisement from neighbor Node P: Update routing table entry for node E when: Seq(E) in P s advertisement > Seq(E) in N s table 30
31 DSDV Broken Link B next broadcasts its routing table No affect on C s entry for D (because 001 > 000) No loop à no count to infinity (A, A, 1, 550) (B, B, 0, 108) (C, C, 1, 592) (D, C, 2, 000) (A, A, 1, 550) (B, B, 0, 108) (C, C, 1, 592) (D, C, 2, 000) A B C D Seq. A A B B C B D B Seq. A A B B C C D C Seq. A B B B C C D D
32 Today 1. Distance Vector Routing 2. Destination Sequenced Distance-Vector Routing (DSDV) New node join Broken link Route advertisement 3. Dynamic Source Routing (DSR) 4. Roofnet 32
33 Distance Vector Route Advertisement D moves to another place and broadcasts its routing table D Seq. A C B C C C D D (D, D, 0, 002) (D, D, 0, 002) A B C Seq. A A B B C B D B Seq. A A B B C C D D Seq. A B B B C C D D
34 Distance Vector Route Advertisement D moves to another place and broadcasts its routing table B broadcasts its routing table (B, B, 0, 110) (B, B, 0, 110) D (B, B, 0, 110) Seq. A B B B C C D D A Seq. A A B B C B D B B Seq. A A B B C C D D C Seq. A B B B C C D D
35 Today 1. Distance Vector Routing 2. Destination Sequenced Distance-Vector Routing (DSDV) 3. Dynamic Source Routing (DSR) 4. Roofnet 35
36 Dynamic Source Routing (DSR) No periodic beaconing from all nodes When node S wants to send a packet to node D (but doesn t know a route to D), S initiates a route discovery S network-floods a Route Request (RREQ) Each node appends its own id when forwarding RREQ 36
37 Route Discovery in DSR S E A B H C I G F K J D M N L Represents a node that has received RREQ for D from S 37
38 Route Discovery in DSR Broadcast transmission [S] S E A B H C I G F K J D M N L [X,Y] Represents transmission of RREQ Represents list of identifiers appended to RREQ 38
39 Route Discovery in DSR S E [S,E] A B H C [S,C] I G F K J D M N L [X,Y] Represents transmission of RREQ Represents list of identifiers appended to RREQ 39
40 Route Discovery in DSR S E A B H C I G F [S,C,G] K [S,E,F] J D M N L Represents transmission of RREQ Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once 40
41 Route Discovery in DSR A B H S C I E G F K [S,E,F,J] M J D [S,C,G,K] N L Represents transmission of RREQ Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide 41
42 Route Discovery in DSR A B H S C I E G F K J [S,E,F,J,M] M L D N Represents transmission of RREQ Node D does not forward RREQ, because node D is the intended target of the route discovery 42
43 Route Reply in DSR On receiving first RREQ, D sends a Route Reply (RREP) RREP sent on route obtained by reversing the route in the received RREQ RREP includes the route from S to D over which D received the RREQ S E RREP [S,E,F,J,D] A B H C I G F K J M D N L Represents RREP control message 43
44 Dynamic Source Routing (DSR) On receiving RREP, S caches route included therein When S sends a data packet to D, includes entire route in packet header Intermediate nodes use the source route included in packet to determine to whom packet should be forwarded DATA [S,E,F,J,D] S E A B H C I G F K J D M N L 44
45 Today 1. Distance Vector Routing 2. Destination Sequenced Distance-Vector Routing (DSDV) 3. Dynamic Source Routing (DSR) 4. Roofnet Wireless mesh link measurements Routing and bit rate selection End-to-end performance evaluation 45
46 Context, ca Mobile ad hoc networking research Mobile, hence highly dynamic topologies Chief metrics: routing protocol overhead, packet delivery success rate, hop count Largely evaluated in simulation Roofnet, a real mesh network deployment Fixed, PC-class nodes Motivation: shared Internet access in community Chief metric: TCP throughput Test of time system, led to Cisco Meraki 46
47 Roofnet: Design Choices 1. Volunteer users host nodes at home Open participation without central planning No central control over topology 2. Omnidirectional rather than directional antennas Ease of installation: no choice of neighbors/aiming Links interfere, likely low quality 3. Multi-hop routing (not single-hop hot spots) Improved coverage (path diversity) Must build a routing protocol 4. Goal: high TCP throughput 47
48 Roofnet: Goals and non-goals Each part of the mesh architecture had been previously examined in isolation Paper contribution: A systematic evaluation of whether architecture can achieve goal of providing Internet access Stated non-goals for paper: Throughput of multiple concurrent flows Scalability in number of nodes Design of routing protocols 48
49 aki s pre-history: Roofnet Roofnet deployment Each node: PC, b card, roof-mounted omni antenna Self-configuring and self-healing mesh network: 49
50 Hardware design PC Ethernet interface provides wired Internet for user Omnidirectional antenna in azimuthal direction 3 db vertical beam width of 20 degrees Wide beam sacrifices gain but removes the need for perfect vertical antenna orientation b radios (Intersil Prism 2.5 chipset) 200 mw transmit power All share same channel (frequency) 50
51 Internet gateways Node sends DHCP request on Ethernet then tests reachability to Internet hosts Success indicates node is an Internet gateway Gateways translate between Roofnet and Internet IP address spaces Roofnet nodes track gateway used for each open TCP connection they originate If best gateway changes, open connections continue to use gateway they already do If a Roofnet gateway fails, existing TCP connections through that gateway will fail 51
52 Example: Varying link loss rates 90% loss A B C 10% loss 10% loss A à C: 1 hop; high loss A à B à C: 2 hops; lower loss But does this happen in practice? 52
53 Hop count and throughput (1) 1 Max 4-hop throughput 3-hop 2-hop Cumulative fraction of node pairs 0.8 Minimum-hop-count routes are significantly throughput-suboptimal Best static route DSDV hopcount Packets per second delivered 53
54 Hop count and throughput Packets per second delivered Max 3-hop throughput Max 4-hop Two-hop path is suboptimal Some 3-hop paths better, some worse than 2-hop 54
55 Link loss is high and asymmetric Delivery Ratio Link number Vertical bar ends = loss rate on 1 link in each direction Many links asymmetric and very lossy in 1 way Wide range of loss rates 55
56 Routing protocol: Srcr Each link has an associated metric (not necessarily 1!) Data packets contain source routes Nodes keep database of link metrics Nodes write current metric into source route of all forwarded packets DSR-like: Nodes flood route queries when they can t find a route; queries accumulate link metrics Route queries contain route from requesting node Nodes cache overheard link metrics Dijkstra s algorithm computes source routes 56
57 Link metric: Strawmen Discard links with loss rate above a threshold? Risks unnecessarily disconnecting nodes Product of link delivery rates à prob. of e2e delivery? Ignores inter-hop interference Prefers 2-hop, 0% loss route over 1-hop, 10% loss route (but latter is double throughput) Throughput of highest-loss link on path? Also ignores inter-hop interference 57
58 ETX: Expected Transmission Count Link ETX: predicted number of transmissions Calculate link ETX using forward, reverse delivery rates To avoid retry, data packet and ACK must succeed Link ETX = 1 / (d f d r ) d f = forward link delivery ratio (data packet) d r = reverse link delivery ratio (ack packet) Path ETX: sum of the link ETX values on a path 58
59 Measuring link delivery ratios Nodes periodically send broadcast probe packets All nodes know the sending period of probes All nodes compute loss rate based on how many probes arrive, per measurement interval Nodes enclose these loss measurements in their transmitted probes e.g. B tells node A the link delivery rate from A to B 59
60 Multi-bitrate radios ETX assumes all radios run at same bit-rate But b rates: {1, 2, 5.5, 11} Mbit/s Can t compare two transmissions at 1 Mbit/s with two at 2 Mbit/s Solution: Use expected time spent on a packet, rather than transmission count 60
61 ETT: Expected Transmission Time ACKs always sent at 1 Mbps, data packets 1500 bytes Nodes send 1500-byte broadcast probes at every bit rate b to compute forward link delivery rates d f (b) Send 60-byte (min size) probes at 1 Mbps à d r At each bit-rate b, ETX b = 1 / (d f (b) d r ) For packet of length S, ETT b = (S / b) ETX b Link ETT = min b (ETT b ) 61
62 ETT: Assumptions Path throughput estimate t is given by t i = throughput of hop i t = 1 hop i path 1 t i Does ETT maximize throughput? No! 1. Underestimates throughput for long ( 4-hop) paths Distant nodes can send simultaneously 2. Overestimates throughput when transmissions on different hops collide and are lost 62
63 Roofnet evaluation TCP bulk transfers between all node pairs but always a single flow at a time But background traffic present: users always active Results: 1. Wide spread of end-to-end throughput across pairs 2. Chain forwarding indeed creates interference 3. Lossy links indeed useful in practice 63
64 Wireless Mesh Networks: Evolving Routing DSDV took DV out of wired (more static) networks Better coped with dynamism DSR addressed protocol overheads of routing ETX and ETT abolished hop-count as a viable metric Replaced it with throughput as the metric 64
Architecture and Evaluation of an Unplanned b Mesh Network
Architecture and Evaluation of an Unplanned 802.11b Mesh Network John Bicket, Daniel Aguayo, Sanjit Biswas, and Robert Morris MIT CSAIL (MobiCom 05) slides by Jong-Kwon Lee, presented by Fallon Chen May
More informationWireless Internet Routing. Learning from Deployments Link Metrics
Wireless Internet Routing Learning from Deployments Link Metrics 1 Learning From Deployments Early worked focused traditional routing issues o Control plane: topology management, neighbor discovery o Data
More informationRouting 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 informationUCS-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 informationLecture 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 informationLECTURE 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 informationMobile 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 informationTypical rooftop view
Roofnet map Typical rooftop view Roofnet Goals and Design Ideas Goals Operate without extensive planning or central management Provide wide coverage and acceptable performance Design decisions Unconstrained
More informationCMPE 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 informationMobile 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 informationECS-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 informationA 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 informationCMPE 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 informationECE 598HH: Special Topics in Wireless Networks and Mobile Systems
ECE 598HH: Special Topics in Wireless Networks and Mobile Systems Lecture 21: Opportunistic Routing Haitham Hassanieh *These slides are courtesy of Dina Katabi 1 Lecture Outline Single Path Routing Opportunistic
More information15-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 informationWireless 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 informationMobile 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 informationWireless 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 information15-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 informationA 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 informationRouting 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 informationOutline. Lecture 16: Wireless Networking. Physical Layer (Layer 1) Ethernet: Wireless is Different. Attenuation Over Space
Outline Lecture 16: Wireless Networking Wireless physical layer challenges - Signal, noise, modulation - A little bit of EE goes a long way Wireless link layers - Hidden terminals, exposed terminals -
More informationContent. 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 informationA High-Throughput Path Metric for Multi-Hop Wireless Routing
Wireless Networks, 49 434, 25 C 25 Springer Science + Business Media, Inc. Manufactured in The Netherlands. A High-Throughput Path Metric for Multi-Hop Wireless Routing DOUGLAS S. J. DE COUTO, DANIEL AGUAYO,
More information6. 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 informationWireless 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 informationLink Estimation and Tree Routing
Network Embedded Systems Sensor Networks Link Estimation and Tree Routing 1 Marcus Chang, mchang@cs.jhu.edu Slides: Andreas Terzis Outline Link quality estimation Examples of link metrics Four-Bit Wireless
More informationPolitecnico 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 information3. 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 informationCS 268: Computer Networking. Taking Advantage of Broadcast
CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic
More informationMobile 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 informationGeographic and Diversity Routing in Mesh Networks
Geographic and Diversity Routing in Mesh Networks COS 463: Wireless Networks Lecture 7 Kyle Jamieson [Parts adapted from B. Karp, S. Biswas, S. Katti] Course Contents 1. Wireless From the Transport Layer
More informationLecture 16: Wireless Networks
&6( *UDGXDWH1HWZRUNLQJ :LQWHU Lecture 16: Wireless Networks Geoffrey M. Voelker :LUHOHVV1HWZRUNLQJ Many topics in wireless networking Transport optimizations, ad hoc routing, MAC algorithms, QoS, mobility,
More informationECSE 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 informationCS 268: Computer Networking
CS 268: Computer Networking L-10 Wireless in the Real World Wireless in the Real World Real world deployment patterns Mesh networks and deployments Assigned reading Modeling Wireless Links Architecture
More informationCS551 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 informationCE693: 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 informationComputation 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 informationSimulation & 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 information2013, 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 informationWireless in the Real World : Computer Networking. Wireless Challenges. Overview
Wireless in the Real World 15-744: Computer Networking L-9 Wireless in the Real World Real world deployment patterns Mesh networks and deployments Assigned reading White Space Networking with Wi-Fi like
More informationKapitel 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 informationWhite 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 informationHomework 3 Discussion
Homework 3 Discussion Address Resolution Protocol (ARP) Data Link Layer Network Layer Data Link Layer Network Layer Protocol Data Unit(PDU) Frames Packets Typical Device Switch/Bridge Router Range Local
More informationArvind 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 informationMobile & 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 informationUnicast 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 informationExpected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network
Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)
More informationAODV-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 informationMobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Journal of Computer Science 8 (1): 13-17, 2012 ISSN 1549-3636 2011 Science Publications Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV 1 S. Deepa and 2 G.M. Kadhar
More informationRouting in Wireless Mesh Networks. Feb. 22, 2006
Routing in Wireless Mesh Networks Feb. 22, 2006 Wireless Mesh Networks Multi-hop Wireless Networks Stationary Nodes Mobile Nodes Motivating scenario Community wireless networks (Mesh Networks) Battlefield
More information6367(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 informationLecture 16: Wireless Networking
Lecture 16: Wireless Networking Outline Wireless physical layer challenges - Signal, noise, modulation - A little bit of EE goes a long way Wireless link layers - Hidden terminals, exposed terminals -
More informationA Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver
1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois
More informationPerformance Comparison of DSDV, AODV, DSR, Routing protocols for MANETs
2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT vol.35(2012) (2012) IACSIT Press, Singapore Performance Comparison of DSDV, AODV, DSR, Routing protocols
More informationA Survey on Path Weight Based routing Over Wireless Mesh Networks
A Survey on Path Weight Based routing Over Wireless Mesh Networks Ankush Sharma Assistant Professor, Dept. Of C.S.E, Chandigarh University Gharuan, India Anuj Gupta Head C.S.E and M.C.A Dept, RIMT Mandi
More informationCS5984 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 informationReview. Error Detection: CRC Multiple access protocols. LAN addresses and ARP Ethernet. Slotted ALOHA CSMA/CD
Review Error Detection: CRC Multiple access protocols Slotted ALOHA CSMA/CD LAN addresses and ARP Ethernet Some slides are in courtesy of J. Kurose and K. Ross Overview Ethernet Hubs, bridges, and switches
More informationMaking Friends with Broadcast. Administrivia
Making Friends with Broadcast CMU 15-744 David Andersen Administrivia Midterm Mean 66.5, Median 70, Stddev 13.7 Histo: 35-39 37 38 40-44 45-49 50-54 54 54 54 55-59 56 57 60-64 61 64 64 65-69 69 70-74 71
More informationA 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 informationRedes 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 informationPERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS Natarajan Meghanathan Jackson State University, 1400
More informationMeasurement and Analysis of Real-World Mesh Networks
Measurement and Analysis of Real-World 82. Mesh Networks Katrina LaCurts and Hari Balakrishnan MIT Computer Science and Artificial Intelligence Lab Cambridge, Massachusetts, U.S.A. {katrina, hari}@csail.mit.edu
More informationENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK
ENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK Yousif Ali Saadi, Rosilah Hassan and Dahlila Putri Dahnil Network Communication Lab Research, Centre for Software Technology and Management
More informationNETWORK coding [1] [3] has attracted much interest in
1714 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 60, NO. 4, MAY 2011 Analysis of General Network Coding Conditions and Design of a Free-Ride-Oriented Routing Metric Bin Guo, Student Member, IEEE, Hongkun
More informationPerformance Evaluation of MANET through NS2 Simulation
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation
More informationFinal Exam: Mobile Networking (Part II of the course Réseaux et mobilité )
Final Exam: Mobile Networking (Part II of the course Réseaux et mobilité ) Prof. J.-P. Hubaux February 12, 2004 Duration: 2 hours, all documents allowed Please write your answers on these sheets, at the
More informationIN 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 informationMobile 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 informationExperiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol
Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121
More informationLink Layer II: MACA and MACAW
Link Layer II: MACA and MACAW COS 463: Wireless Networks Lecture 5 Kyle Jamieson [Parts adapted from J. Kurose, K. Ross, D. Holmar] Medium access: Timeline Packet radio Wireless LAN Wired LAN ALOHAnet
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 3, March ISSN
International Journal of Scientific & Engineering Research, Volume 6, Issue 3, March-2015 1464 Performance Evaluation of AODV and DSDV Routing Protocols through Clustering in MANETS Prof. A Rama Rao, M
More informationAD HOC NETWORKS. RAJINI M 2 ND SEM M.Tech DECS PESIT
AD HOC NETWORKS RAJINI M 2 ND SEM M.Tech DECS PESIT OUTLINE Introduction Features of Ad hoc network Types of ad hoc network MANETs Network architecture MAC protocols Routing protocols Denial of service
More informationOutdoor Wi Fi Mesh Routing Protocol. Akshata Danivasa Alphonse Hansel Anthony Mani Pandian Vikas Iyer Vinesh Pallen
OutdoorWi FiMeshRoutingProtocol AkshataDanivasa AlphonseHanselAnthony ManiPandian VikasIyer VineshPallen 1 Contents 1. Abstract 3 2. Introduction. 4 3. Related Work 5 4. Problem Formulation 6 5. MODEL
More informationWireless Sensor Networks
Wireless Sensor Networks c.buratti@unibo.it +9 051 20 9147 Office Hours: Tuesday 5 pm @ Main Building, third fllor Credits: 6 Protocol Stack Time Synchronization Energy Efficiency Distributed Processing
More informationAnalysis of Routing Protocols in MANETs
Analysis of Routing Protocols in MANETs Musica Supriya, Rashmi, Nishchitha, Ashwini C Shetty, Sharath Kumar Student, Dept. of CSE, SMVITM Bantakal, Karnataka, India Student, Dept. of CSE, SMVITM Bantakal,
More informationWireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking
Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More informationA COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS
A COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS M.S.R.S Prasad 1, S.S. Panda 2, MNM Prasad 3, S.T.V.S.Kumar 4 1 Assistant Professor (SG), Dept. of CSE., Regency Institute
More informationGeographic 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 informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK COMPARISON OF MANET REACTIVE ROUTING PROTOCOLS USING OPNET SIMULATOR SANGEETA MONGA
More informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationEvaluating the Performance of Modified DSR in Presence of Noisy Links using QUALNET Network Simulator in MANET
Evaluating the Performance of Modified DSR in Presence of Noisy Links using QUALNET Network Simulator in MANET Saurav Ghosh & Chinmoy Ghorai A.K Choudhury School of Information Technology, University of
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationAd 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 informationOverview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load
Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C
More informationMobile Ad Hoc Networks
Mobile Ad Hoc Networks Tutorial at CIT 2000 Bhubaneshwar, Dec 20 23 Sridhar Iyer IIT Bombay http://www.it.iitb.ernet.in.in/~sri sri@it.iitb.ernet.in Acknowledgements Many figures, slides and reference
More informationChapter-2 Routing Protocols of MANET
Chapter-2 Routing Protocols of MANET Chapter 2 Routing Protocols of MANET Routing is an important function for any network, whether it is for wired or wireless. The protocols designed for routing in these
More informationMitigating 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 informationA 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 informationWireless LANs. ITS 413 Internet Technologies and Applications
Wireless LANs ITS 413 Internet Technologies and Applications Aim: Aim and Contents Understand how IEEE 802.11 wireless LANs work Understand what influences the performance of wireless LANs Contents: IEEE
More informationPerformance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela
Performance Evaluation of Routing Protocols in Wireless Mesh Networks Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Department of Computer Science, North West University, Mafikeng Campus,
More informationAn Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks
An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks December 1. 2006 Jong Oh Choi Department of Computer Science Yonsei University jochoi@emerald.yonsei.ac.kr Contents Motivation
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationA 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 informationChapter 7. Wireless Ad Hoc Networks. 7: Wireless Ad Hoc Networks 7-1
Chapter 7 Wireless Ad Hoc Networks 7: Wireless Ad Hoc Networks 7-1 What is an Ad Hoc Network? Definitions: An ad-hoc network is one that comes together as needed, not necessarily with any assistance from
More informationMANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014
Throughput Analysis of Proactive and Reactive MANET Routing Protocols Kiranveer Kaur 1 Surinderjit Kaur 2 Vikramjit Singh 3 Department of Computer Science, University College of Engineering, Department
More informationPerformance 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 informationOutline. 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