Overview : Computer Networking. IEEE MAC Protocol: CSMA/CA. TCP over noisy links. Link layer challenges. Wireless deployments
|
|
- Philippa Boone
- 6 years ago
- Views:
Transcription
1 Overview : omputer Networking Lecture 25: Wireless Peter Steenkiste Fall Internet t mobility TP over noisy links Link layer challenges Wireless deployments 2 IEEE M Protocol: SM/ ut SM oes Not (lways) Work SM: sender - If sense channel idle for ISF (istributed Inter Frame Space) then transmit entire frame (no collision detection) - If sense channel busy then binary backoff SM receiver: - If received OK return K after SIFS (Short IFS) - K is needed due to lack of collision detection - SIFS < IFS: priority 3 arrier Sense problems Relevant contention at the receiver, not sender Hidden terminal Exposed terminal Hidden Exposed 4 1
2 Hidden Terminal Effect ollision voidance Mechanisms Hidden terminals:, cannot hear each other Obstacles, signal attenuation ollisions at ollision if 2 or more nodes transmit at same time ut SM still makes sense: Get all the bandwidth if you re the only one transmitting Shouldn t cause a collision if you sense another transmission ollision detection does not work either SM/: SM with ollision voidance Problem: Two nodes, hidden from each other, transmit complete frames to base station Wasted bandwidth for long duration! Solution: Small reservation packets Nodes track reservation interval with internal network allocation vector (NV) 5 6 RTS/TS pproach efore sending data, send Ready-to-Send (RTS) Target responds with lear-to-send (TS) Others who hear TS defer transmission Packet length in RTS and TS messages Why not defer on RTS alone? If TS is not heard, or RTS collides Retransmit RTS after binary exponential backoff (There are lots of cool details embedded in this last part that went into the design of if you re curious, look up the MW protocol). ollision voidance: RTS-TS Exchange Explicit channel reservation Sender: send short RTS: request to send Receiver: reply with short TS: clear to send TS reserves channel for sender, notifying (possibly hidden) stations RTS and TS short: collisions less likely, of shorter duration end result similar to collision detection void hidden station collisions Not widely used Overhead is too high Not a serious problem in typical deployments 8 2
3 IEEE M Protocol How bout Exposed Terminal? RTS/TS implemented using NV: Network llocation Vector lso used with data packets frame has transmission time field Others (hearing data) defer access for NV time units an increase the carriersense threshold Signal needs to be stronger before node defers ould this create other problems? Exposed terminals are difficult to deal with Even hard to detect them! Exposed 9 10 Some IEEE Standards IEEE Family IEEE a PHY Standard : 8 channels : up to 54 Mbps : some deployment IEEE b PHY Standard : 3 channels : up to 11 Mbps : widely deployed. IEEE d M Standard : support for multiple regulatory domains (countries) IEEE e M Standard : QoS support : supported by many vendors IEEE f Inter-ccess Point Protocol : deployed IEEE g PHY Standard: 3 channels : OFM and P : widely deployed (as b/g) IEEE h Suppl. M Standard: spectrum managed a (TP, FS): standard IEEE i Suppl. M Standard: lternative WEP : standard IEEE n M Standard: MIMO : standardization expected late 2008 Protocol Release ata Freq. Rate (typical) Rate (max) Range (indoor) Legacy GHz 1 Mbps 2Mbps? a GHz 25 Mbps 54 Mbps b GHz 6.5 Mbps 11 Mbps g GHz 25 Mbps 54 Mbps n /5 GHz 200 Mbps 600 Mbps ~30 m ~30 m ~30 m ~50 m 3
4 802.11b hannels Going Faster: g In the UK and most of EU: 13 channels, 5MHz apart, GHz In the US: only 11 channels Each channel is 22MHz Significant overlap Non-overlapping channels are 1, 6 and 11 1, 2, 5.5 and 11 Mbps rates using SSS technology g basically extends of b Use the same technology SSS for old rates (1,2, 5.5, 11) Uses OFM technology for new rates (6 Mbs and up) Using OFM makes it easier to build a/g cards Since a uses OFM ut it creates an interoperability problem since b cards cannot interpret OFM signals Solutions: send TS using K before OFM packets in hybrid environments, or use (optional) hybrid packet format K Preamble Header K OFM K Payload K OFM OFM a Physical hannels a iscussion channel# [MHz] channel# [MHz] Point-Point Indoor center frequency = *channel number [MHz] Uses OFM in the 5.2 and 5.7 GHz bands What are the benefits of a compared with b? Greater bandwidth (up to 54Mb) 54, 48, 36, 24, 18, 12, 9 and 6 Mbs Less potential interference (5GHz) More non-overlapping channels Less contention due to competition ut does not provide interoperability with b, as g does 4
5 Scenarios and Roadmap d Hoc Networks Point to point wireless networks Example: Your laptop to MU wireless hallenges: Poor and variable link quality (makes TP unhappy) Many people can hear when you talk Pretty well defined. d hoc networks (wireless++) Rooftop networks (multi-hop, fixed position) Mobile ad hoc networks dds challenges: routing, mobility Some deployment + some research Sensor networks (ad hoc++) Scatter 100s of nodes in a field / bridge / etc. dds challenge: Serious resource constraints urrent, popular, research. 17 ll the challenges of wireless, plus some of: No fixed infrastructure Mobility (on short time scales) haotically decentralized (:-) Multi-hop! an be arbitrarily bad: limited batteries, malicious nodes, high mobility, low density,.. Nodes are both traffic sources/sinks and forwarders The big challenge: Routing 18 d Hoc Routing Traditional Routing vs d Hoc Find multi-hop paths through network dapt to new routes and movement / environment changes eal with interference and power issues Scale well with # of nodes Localize effects of link changes Traditional network: Well-structured t ~O(N) nodes & links ll links work ~= well d Hoc network N^2 N2 links - but many stink! Topology may be really weird Reflections & multipath cause strange interference hange is frequent
6 Forwarding Packets is expensive Throughput of b =~ 11Mbits/s In reality, you can get about 6 What is throughput of a chain? -> ->? -> -> ->? ssume minimum power for radios. Routing metric should take this into account Problems using V or LS V loops are very expensive Wireless bandwidth << fiber bandwidth LS protocols have high overhead roadcast nature of wireless makes communication expensive Periodic updates waste power Need fast, frequent convergence Many Proposed Protocols SR Variants of existing wired protocols Exploiting broadcast nature of wireless Fast recovery from link breaks Improve scalability, e.g. hierarchy On-demand protocols ynamic Source Routing (SR) d Hoc On-emand istance Vector (OV) Geographic routing protocols GPSR Source routing Intermediate t nodes can be out of date On-demand route discovery Only discover a route when you need it void periodic route advertisements esign point: on-demand may be better or worse depending on traffic patterns Examples?
7 SR omponents Route discovery The mechanism by which a sending node obtains a route to destination Route maintenance The mechanism by which a sending node detects that the network topology has changed and its route to destination is no longer valid SR Route iscovery Route discovery - basic idea Source broadcasts route-request request to estination Each node forwards request by adding own address and re-broadcasting Requests propagate outward until: Target is found, or node that has a route to estination is found roadcasts Route Request to F roadcasts Route Request to F Route Request Source E estination F Route Request Source E estination F G H G H
8 H Responds to Route Request Transmits a Packet to F Source E estination F Source G,H,F E estination F G H G,H,F G H,F H F Forwarding Route Requests request is forwarded if: Node is not the destination Node not already listed in recorded source route Node has not seen request with same sequence number IP TTL field may be used to limit scope estination copies route into a Route-reply packet and sends it back to Source Route ache ll source routes learned by a node are kept in Route ache Reduces cost of route discovery If intermediate node receives RR for destination and has entry for destination in route cache, it responds to RR and does not propagate RR further Nodes overhearing RR/RP may insert routes in cache
9 Sending ata heck cache for route to destination If route exists then If reachable in one hop Send packet Else insert routing header to destination and send If route does not exist, buffer packet and initiate route discovery iscussion Source routing is good for on demand routes instead of a priori distribution Route discovery protocol used to obtain routes on demand aching used to minimize use of discovery Periodic messages avoided ut need to buffer packets How do you decide between links? Greedy Perimeter Stateless Routing (GPSR) Use positions of neighboring nodes and packet destination to forward packets No connectivity or global topology is assumed Nodes are assumed to know their location Need some address-to-location look up Two forwarding techniques is used Greedy forwarding, if possible Perimeter forwarding, otherwise GPSR Greedy forwarding sender/forwarder x chooses to forward to a neighbor y such that {d xy + d y } is minimum Xx y 9
10 GPSR Perimeter forwarding Right Hand Rule traverse an interior i region in clockwise edge order traverse an exterior region in counter-clockwise edge order. w v VOI x z y These sequence of edges traversed is termed as PERIMETER Sensor Networks - smart devices First introduced in late 90 s by groups at U/UL/US Small, resource limited devices PU, disk, power, bandwidth, etc. Simple scalar sensors temperature, motion Single domain of deployment farm, battlefield, bridge, rain forest for a targeted task find the tanks, count the birds, monitor the bridge Example of an ad-hoc wireless network Nodes typically not mobile helps a lot! 38 Sensor System Types Smart- ust/motes Hardware U motes 4 MHz PU 4 k data RM 128 k code 50 kb/sec 917 Mhz radio Sensors: light, temp., Sound, etc., nd a battery. Sensors and power and radios Limited battery life drives most goals Radio is most energy-expensive part. 800 instructions per bit. 200,000 instructions per packet. (!) That s about one message per second for ~2 months if no PU. Listening is expensive too. :(
11 Sensor nets goals Replace communication with computation Turn off radio receiver as often as possible Keep little state (4 K isn t your pentium 4 ten bazillion gigahertz with five ottabytes of RM). Power Which uses less power? irect sensor -> base station Tx Total Tx power: distance^2 Sensor -> sensor -> sensor -> base station? Total Tx power: n * (distance/n) ^2 =~ d^2 / n Why? Radios are omnidirectional, but only one direction matters. Multi-hop approximates directionality. Power savings often makes up for multi-hop capacity These devices are *very* power constrained! Reality: Many systems don t use adaptive power control. This is active research, and fun stuff Example: ggregation Important Lessons Find avg temp in 8th floor of Wean. Strawman: Flood query, let a collection point compute avg. Huge overload near the P. Lots of loss, and local nodes use lots of energy! etter: in network aggregation key to scaling Take local avg. first, & forward that. Send average temp + # of samples The challenge: How to aggregate. How long to wait? How to aggregate complex queries? How to program? 43 Many assumptions built into Internet design Wireless forces reconsideration of issues Wireless link-layer l Spatial reuse (cellular) vs wires Hidden/exposed terminal SM/ (why?) and RTS/TS d hoc wireless networks Key is routing protocols may proposals exist Mobility, limited capacity are problems On demand can reduce load; broadcast reduces overhead Sensor networks are special purpose ad hoc networks Energy is a key concern: run unattended for long periods of time an trade between computation for communication 44 11
12 Extra slides ETX Measure each link s delivery probability with broadcast probes (& measure reverse) P(delivery) = 1 / ( df * dr ) (K must be delivered too) Link ETX = 1 / P(delivery) Route ETX = sum of link ETX (ssumes all hops interfere - not true, but seems to work okay so far) Lecture 25: apacity of multi-hop network ssume N nodes, each wants to talk to everyone else. What total throughput (g (ignore previous slide to simplify things) O(n) concurrent transmissions. Great! ut: Each has length O(sqrt(n)) (network diameter) So each Tx uses up sqrt(n) of the O(n) capacity. Per-node capacity scales as 1/sqrt(n) Yes - it goes down! More time spent Tx ing other peoples packets ut: If communication is local, can do much better, and use cool tricks to optimize Like multicast, or multicast in reverse (data fusion) Hey, that sounds like a sensor network! 47 12
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 information15-441: Computer Networking
15-441: Computer Networking Lecture 22: Sensors and Ad-Hoc Networks Scenarios and Roadmap Point to point wireless networks Example: Your laptop to CMU wireless Challenges: Poor and variable link quality
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 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 informationAd 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 informationOverview : Computer Networking. Spectrum Use Comments. Spectrum Allocation in US Link layer challenges and WiFi WiFi
Overview 15-441 15-441: Computer Networking 15-641 Lecture 21: Wireless Justine Sherry Peter Steenkiste Fall 2017 www.cs.cmu.edu/~prs/15-441-f17 Link layer challenges and WiFi WiFi Basic WiFi design Some
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 informationThe 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 informationAnnouncements : Wireless Networks Lecture 11: * Outline. Power Management. Page 1
Announcements 18-759: Wireless Networks Lecture 11: 802.11* Please mail survey team information» Can include topic preferences now if you have them Submit project designs through blackboard Homework 2
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 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 informationOutline. MAC (Medium Access Control) General MAC Requirements. Typical MAC protocols. Typical MAC protocols
Outline Medium ccess ontrol With oordinated daptive Sleeping for Wireless Sensor Networks Presented by: rik rooks Introduction to M S-M Overview S-M Evaluation ritique omparison to MW Washington University
More informationLecture 16: QoS and "
Lecture 16: QoS and 802.11" CSE 123: Computer Networks Alex C. Snoeren HW 4 due now! Lecture 16 Overview" Network-wide QoS IntServ DifServ 802.11 Wireless CSMA/CA Hidden Terminals RTS/CTS CSE 123 Lecture
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 informationCSE/EE 461 Section 2
CSE/EE 461 Section 2 Latency in a store-and-forward network 4ms, 10MB/s B How long does it take to send a 2kB packet from to B? 2ms, 10MB/s C 2ms, 10MB/s B What if it has to pass through a node C? Plan
More informationAnnouncements / Wireless Networks and Applications Lecture 9: Wireless LANs Wireless. Regular Ethernet CSMA/CD.
Announcements 18-452/18-750 Wireless Networks and Applications Lecture 9: Wireless LANs 802.11 Wireless Peter Steenkiste Homework 1 should be out by tomorrow Project 1 by Friday Schedule:» Thursday lecture
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 3 CMPE 257 Winter'11 1 Announcements Accessing secure part of the class Web page: User id: cmpe257.
More informationWireless MACs: MACAW/802.11
Wireless MACs: MACAW/802.11 Mark Handley UCL Computer Science CS 3035/GZ01 Fundamentals: Spectrum and Capacity A particular radio transmits over some range of frequencies; its bandwidth, in the physical
More informationDynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5
ynamic Source Routing (SR) [Johnson96] S 6811 : Lecture 5 d Hoc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation Loop freedom
More informationMultiple Access in Cellular and Systems
Multiple Access in Cellular and 802.11 Systems 1 GSM The total bandwidth is divided into many narrowband channels. (200 khz in GSM) Users are given time slots in a narrowband channel (8 users) A channel
More informationLast Lecture: Data Link Layer
Last Lecture: Data Link Layer 1. Design goals and issues 2. (More on) Error Control and Detection 3. Multiple Access Control (MAC) 4. Ethernet, LAN Addresses and ARP 5. Hubs, Bridges, Switches 6. Wireless
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 informationCSE 461: Wireless Networks
CSE 461: Wireless Networks Wireless IEEE 802.11 A physical and multiple access layer standard for wireless local area networks (WLAN) Ad Hoc Network: no servers or access points Infrastructure Network
More informationGetting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg
Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg Five Problems Encoding/decoding Framing Error Detection Error Correction Media Access Five Problems Encoding/decoding Framing
More informationName Student ID Department/Year. Final Examination. Introduction to Computer Networks Class#: Fall :50-11:30 Tuesday January 10, 2006
Name Student I epartment/year inal xamination Introduction to omputer Networks lass#: 901 31110 all 2005 9:50-11:30 Tuesday January 10, 2006 Prohibited 1. You are not allowed to write down the answers
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 informationLocal Area Networks NETW 901
Local Area Networks NETW 901 Lecture 4 Wireless LAN Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Contents What is a Wireless LAN? Applications and Requirements Transmission
More informationstandard. Acknowledgement: Slides borrowed from Richard Y. Yale
802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale IEEE 802.11 Requirements Design for small coverage (e.g. office, home) Low/no mobility High data rate applications Ability to
More informationECE 4450:427/527 - Computer Networks Spring 2017
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.6: Wireless Networks - MAC Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationLecture 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 informationData Communication & Networks G Session 5 - Main Theme Wireless Networks. Dr. Jean-Claude Franchitti
Data Communication & Networks G22.2262-001 Session 5 - Main Theme Wireless Networks Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences
More informationWireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 24: Mobile and Wireless
Wireless Challenges 15-441: Computer Networking Lecture 24: Mobile and Wireless Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 Force us to rethink many assumptions Need to share airwaves rather
More information04/11/2011. Wireless LANs. CSE 3213 Fall November Overview
Wireless LANs CSE 3213 Fall 2011 4 November 2011 Overview 2 1 Infrastructure Wireless LAN 3 Applications of Wireless LANs Key application areas: LAN extension cross-building interconnect nomadic access
More informationDynamic 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 informationChapter 6 Wireless and Mobile Networks. Chapter 6 outline. Chapter 6: Wireless and Mobile Networks. Elements of a wireless network
Chapter 6 Wireless and Mobile Networks Computer Networking: Top Down pproach 5 th edition. Jim Kurose, Keith Ross ddison-wesley, pril 009. Chapter 6: Wireless and Mobile Networks ackground: # wireless
More informationMultiple Access Links and Protocols
Multiple Access Links and Protocols Two types of links : point-to-point PPP for dial-up access point-to-point link between Ethernet switch and host broadcast (shared wire or medium) old-fashioned Ethernet
More informationComputer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis
Computer Network Fundamentals Spring 2008 Week 3 MAC Layer Andreas Terzis Outline MAC Protocols MAC Protocol Examples Channel Partitioning TDMA/FDMA Token Ring Random Access Protocols Aloha and Slotted
More information6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point
Chapter 6 outline 6.1 Introduction Wireless 6.2 Wireless links, characteristics CDMA 6.3 IEEE 802.11 wireless LANs ( wi-fi ) 6.4 Cellular Internet Access architecture standards (e.g., GSM) Mobility 6.5
More informationCSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless
CSCD 433 Network Programming Fall 2016 Lecture 7 Ethernet and Wireless 802.11 1 Topics 802 Standard MAC and LLC Sublayers Review of MAC in Ethernet MAC in 802.11 Wireless 2 IEEE Standards In 1985, Computer
More informationReminder: Datalink Functions Computer Networking. Datalink Architectures
Reminder: Datalink Functions 15-441 15 441 15-641 Computer Networking Lecture 5 Media Access Control Peter Steenkiste Fall 2015 www.cs.cmu.edu/~prs/15-441-f15 Framing: encapsulating a network layer datagram
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 informationWireless and Mobile Networks 7-2
Wireless and Mobile Networks EECS3214 2018-03-26 7-1 Ch. 6: Wireless and Mobile Networks Background: # wireless (mobile) phone subscribers now exceeds # wired phone subscribers (5-to-1)! # wireless Internet-connected
More informationOverview : Computer Networking. IEEE MAC Protocol: CSMA/CA Internet mobility TCP over noisy links
Overview 15-441 15-441: Computer Networking 15-641 Lecture 24: Wireless Eric Anerson Fall 2014 www.cs.cmu.eu/~prs/15-441-f14 Internet mobility TCP over noisy links Link layer challenges an WiFi Cellular
More informationLink Layer: Retransmissions
Link Layer: Retransmissions Context on Reliability Where in the stack should we place reliability functions? Application Transport Network Link Physical CSE 461 University of Washington 2 Context on Reliability
More informationCS 43: Computer Networks. 27: Media Access Contd. December 3, 2018
CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently
More informationUnicast 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 informationHigh Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols
High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:
More informationWireless LAN -Architecture
Wireless LAN -Architecture IEEE has defined the specifications for a wireless LAN, called IEEE 802.11, which covers the physical and data link layers. Basic Service Set (BSS) Access Point (AP) Distribution
More informationHubs, Bridges, and Switches (oh my) Hubs
Hubs, Bridges, and Switches (oh my) Used for extending LANs in terms of geographical coverage, number of nodes, administration capabilities, etc. Differ in regards to: collision domain isolation layer
More information4/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 informationWireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1
Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1 Wireless Local Area Networks The proliferation of laptop computers and other mobile devices
More informationData and Computer Communications. Chapter 13 Wireless LANs
Data and Computer Communications Chapter 13 Wireless LANs Wireless LAN Topology Infrastructure LAN Connect to stations on wired LAN and in other cells May do automatic handoff Ad hoc LAN No hub Peer-to-peer
More informationWireless 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 informationMohamed Khedr.
Mohamed Khedr http://webmail.aast.edu/~khedr Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12 Week 13 Week 14 Week 15 Overview Packet Switching IP addressing
More informationEE 122: Ethernet and
EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts
More informationIntelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang
Intelligent Transportation Systems Medium Access Control Prof. Dr. Thomas Strang Recap: Wireless Interconnections Networking types + Scalability + Range Delay Individuality Broadcast o Scalability o Range
More informationAd Hoc Networks: Introduction
Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2
More informationWireless Communication and Networking CMPT 371
Wireless Communication and Networking CMPT 371 Wireless Systems: AM, FM Radio TV Broadcast Satellite Broadcast 2-way Radios Cordless Phones Satellite Links Mobile Telephony Systems Wireless Local Loop
More informationSensor Network Protocols
EE360: Lecture 15 Outline Sensor Network Protocols Announcements 2nd paper summary due March 7 Reschedule Wed lecture: 11-12:15? 12-1:15? 5-6:15? Project poster session March 15 5:30pm? Next HW posted
More informationCS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 19: Networks and Distributed Systems
S 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2004 Lecture 19: Networks and Distributed Systems 19.0 Main Points Motivation for distributed vs. centralized systems
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 informationEthernet Switches Bridges on Steroids. Ethernet Switches. IEEE Wireless LAN. Ad Hoc Networks
Ethernet Switches Bridges on Steroids layer 2 (frame) forwarding, filtering using LAN addresses Switching: A-to-B and A - to-b simultaneously, no collisions large number of interfaces often: individual
More informationWireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer. Computer Networks: Wireless LANs
Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer 1 Wireless Local Area Networks (WLANs) The proliferation of laptop computers and other mobile devices (PDAs and cell phones)
More informationWireless and WiFi. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Wireless and WiFi Daniel Zappala CS 460 Computer Networking Brigham Young University Wireless Networks 2/28 mobile phone subscribers now outnumber wired phone subscribers similar trend likely with Internet
More informationShared Access Networks Wireless. 1/27/14 CS mywireless 1
Shared Access Networks Wireless 1 Wireless and Mobile Networks Background: # wireless (mobile) phone subscribers now exceeds # wired phone subscribers (5-to-1)! # wireless Internet-connected devices equals
More informationChapter 6 Wireless and Mobile Networks
Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. 6: Wireless and Mobile Networks 6
More informationCSE 461: Multiple Access Networks. This Lecture
CSE 461: Multiple Access Networks This Lecture Key Focus: How do multiple parties share a wire? This is the Medium Access Control (MAC) portion of the Link Layer Randomized access protocols: 1. Aloha 2.
More informationIEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall
IEEE 802.11, Token Rings 10/11/06 CS/ECE 438 - UIUC, Fall 2006 1 Medium Access Control Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 10/11/06
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationWireless Networks. CSE 3461: Introduction to Computer Networking Reading: , Kurose and Ross
Wireless Networks CSE 3461: Introduction to Computer Networking Reading: 6.1 6.3, Kurose and Ross 1 Wireless Networks Background: Number of wireless (mobile) phone subscribers now exceeds number of wired
More informationExtending or Interconnecting LANS. Physical LAN segment. Virtual LAN. Forwarding Algorithm 11/9/15. segments. VLAN2, Port3. VLAN1, Port1.
Physical LAN segment q Hosts connected on the same physical LAN segment q Same subnet; L2 forwarding q ARP (IPè MAC) L2 frame (S, D), send q Scale? Extending or Interconnecting LANS q q q Why not just
More informationCIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 8
CIS 551 / TCOM 401 Computer and Network Security Spring 2007 Lecture 8 Announcements Reminder: Project 1 is due on tonight by midnight. Midterm 1 will be held next Thursday, Feb. 8th. Example midterms
More informationOutline / Wireless Networks and Applications Lecture 9: Wireless LANs Aloha and 802 Wireless. Regular Ethernet CSMA/CD
Page 1 Outline 18-452/18-750 Wireless Networks and Applications Lecture 9: Wireless LANs Aloha and 802 Wireless Peter Steenkiste Data link fundamentals» And what changes in wireless Aloha Ethernet Wireless-specific
More informationLecture 23 Overview. Last Lecture. This Lecture. Next Lecture ADSL, ATM. Wireless Technologies (1) Source: chapters 6.2, 15
Lecture 23 Overview Last Lecture ADSL, ATM This Lecture Wireless Technologies (1) Wireless LAN, CSMA/CA, Bluetooth Source: chapters 6.2, 15 Next Lecture Wireless Technologies (2) Source: chapter 16, 19.3
More informationLecture 9. Quality of Service in ad hoc wireless networks
Lecture 9 Quality of Service in ad hoc wireless networks Yevgeni Koucheryavy Department of Communications Engineering Tampere University of Technology yk@cs.tut.fi Lectured by Jakub Jakubiak QoS statement
More informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?
More informationPage 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 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 informationCS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 20: Networks and Distributed Systems
S 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2003 Lecture 20: Networks and Distributed Systems 20.0 Main Points Motivation for distributed vs. centralized systems
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 informationElements of a wireless network. Elements of a wireless network. Characteristics of selected wireless link standards. Elements of a wireless network
wireless hosts laptop, D, I phone run applications may be stationary (non-mobile) or mobile wireless does not always mean mobility base station typically connected to wired relay - responsible for sending
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 informationCS263: Wireless Communications and Sensor Networks
CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 5: The 802.11 Standard October 7, 2004 2004 Matt Welsh Harvard University 1 All about 802.11 Today's Lecture CSMA/CD MAC and DCF WEP
More informationMedium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem
Medium Access Control IEEE 802.11, Token Rings Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 9/15/06 CS/ECE 438 - UIUC, Fall 2006 1 9/15/06 CS/ECE
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 informationWireless Network Security Spring 2013
Wireless Network Security 14-814 Spring 2013 Patrick Tague Class #10 MAC Layer Misbehavior MAC Misbehavior Agenda Analysis of the 802.11 MAC protocol Selfish / greedy 802.11 MAC misbehavior Malicious 802.11
More informationLecture 5 The Data Link Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 5 The Data Link Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Link Layer: setting the context two physically connected devices: host-router, router-router, host-host,
More informationCSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology
CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Local Area Networks (WLANs) Part I Almost all wireless LANs now are IEEE 802.11
More informationLecture 6 The Data Link Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 6 The Data Link Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Link Layer: setting the context two physically connected devices: host-router, router-router, host-host,
More informationMedium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV
Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins University
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 4 1 Announcements Project proposals. Due April 17 th. Submit by e-mail to katia@soe.ucsc.edu.
More informationWireless Local Area Networks. Networks: Wireless LANs 1
Wireless Local Area Networks Networks: Wireless LANs 1 Wireless Local Area Networks The proliferation of laptop computers and other mobile devices (PDAs and cell phones) created an obvious application
More informationLecture 6. Data Link Layer (cont d) Data Link Layer 1-1
Lecture 6 Data Link Layer (cont d) Data Link Layer 1-1 Agenda Continue the Data Link Layer Multiple Access Links and Protocols Addressing Data Link Layer 1-2 Multiple Access Links and Protocols Two types
More informationLecture 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 informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a time/space problem Who transmits when?
More informationAdaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols
Link Layer: Introduction daptors ommunicating Terminology: hosts and routers are nodes communication channels that connect adjacent nodes along communication path are links wired links wireless links LNs
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 informationMAC protocols. Lecturer: Dmitri A. Moltchanov
MAC protocols Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2616/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of MAC protocols Contention-based
More informationLecture 15 Networking Fundamentals. Today s Plan
Lecture 15 Networking Fundamentals Slides attributed to Neil Spring Today s Plan Talk about networking in general Layers, Routing Specifically about IP and TCP Service model, what TCP provides Work our
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 information