Download lectures1-2

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Wake-on-LAN wikipedia , lookup

Wi-Fi wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Computer network wikipedia , lookup

Network tap wikipedia , lookup

Airborne Networking wikipedia , lookup

Cellular network wikipedia , lookup

Policies promoting wireless broadband in the United States wikipedia , lookup

Wireless security wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

Transcript
CS 372 – introduction to computer networks*
Announcements:
 Final exam on Friday



The materials after chapters 1,2
Emphasis on the material covered after Midterm
50 minutes exam in this class
 Verify your grades
* Based in part on slides by Bechir Hamdaoui and Paul D. Paulson.
Acknowledgement: slides drawn heavily from Kurose & Ross
Chapter 6 outline
 Introduction
 Wireless links,
characteristics

CDMA
 IEEE 802.11 wireless
LANs (“wi-fi”)
 Mobility
Chapter 6, slide 2
Wireless and Mobile Networks
Background:
 computer nets: laptops, palmtops, PDAs,
Internet-enabled phone

promise anytime-anywhere mobile Internet access
 two important (but different) challenges
 wireless: communication over wireless link
 mobility: handling the mobile user who changes point
of attachment to network
Chapter 6, slide 3
Elements of a wireless network
network
infrastructure
wireless hosts
 laptop, PDA, IP phone
 run applications
 may be stationary
(non-mobile) or mobile

wireless does not
always mean mobility
Chapter 6, slide 4
Elements of a wireless network
network
infrastructure
base station
 typically connected to
wired network
 relay - responsible
for sending packets
between wired
network and wireless
host(s) in its “area”
 e.g., cell towers,
802.11 access
points
Chapter 6, slide 5
Elements of a wireless network
network
infrastructure
wireless link
 typically used to
connect mobile(s) to
base station
 may also be used as
backbone link
 link access coordinated
by multiple access
protocol
 various data rates,
transmission distance,
etc.
Chapter 6, slide 6
Elements of a wireless network
network
infrastructure
infrastructure mode
 base station connects
mobiles into wired
network
 handoff: mobile
changes base station
providing connection
into wired network
Chapter 6, slide 7
Elements of a wireless network
ad hoc mode
 no base stations
 nodes can only
transmit to other
nodes within link
coverage
 nodes organize
themselves into a
network: route among
themselves
 e.g. ZigBee
Chapter 6, slide 8
Wireless network taxonomy
Infrastructure
Single
Hop
1. hosts connect
to base station
2. base station
connects to
larger Internet
E.g.: WiFi/Cellular
1. hosts may have to
Multiple
relay via multiple
hops
nodes (multi-hop)
2. connects to larger
Internet
E.g.: mesh network
Infrastructure-less
1. no base station
2. no connection to
larger Internet
E.g.: Bluetooth
1. no base station
2. no connection to
larger Internet
3. may have to relay
via others to reach
a given node
E.g.: MANET
large large
Internet
Internet
Mobile Ad-Hoc
WiFi Network
Bluetooth
Network
Network
(MANET)
Mesh Network
Chapter 6, slide 9
Wireless Link Characteristics
Differences from wired link ….
decreased signal strength: radio signal
attenuates as it propagates through matter
(path loss)
 interference from other sources: standardized
wireless network frequencies (e.g., 2.4 GHz)
shared by other devices (e.g., phone); devices
(motors) interfere as well
 multipath propagation: radio signal reflects off
objects, arriving at destination at slightly
different times

…. make communication across wireless link (even a
point to point) much more “difficult”
Chapter 6, slide 10
Wireless network characteristics
Multiple wireless senders and receivers create
additional problems (beyond multiple access):
C
A
B
A
B
Hidden terminal problem
C
C’s signal
strength
A’s signal
strength
space
 B, A hear each other
Signal attenuation:
 A, C can not hear each other
 B, C hear each other
 B, C hear each other
 B, A hear each other
means A, C unaware of their
interference at B
 A, C can not hear each other
interfering at B
Chapter 6, slide 11
IEEE 802.11: multiple access
 avoid collisions: 2+ nodes transmitting at same time
 802.11: CSMA - sense before transmitting
don’t collide with ongoing transmission by other node
 802.11: no collision detection!
 difficult to sense collisions when transmitting due to weak
received signals (fading)
 can’t sense all collisions in any case: hidden terminal, fading
 goal: avoid collisions: CSMA/CA (Collision Avoidance)

C
A
B
A
B
C
C’s signal
strength
A’s signal
strength
space
Two scenarios where collision cannot be detected
Chapter 6, slide 12
Wireless traffic control
 Wireless uses collision avoidance (CA)
rather than collision detection (CD)
Transmitting computer sends very short
"reservation" message to receiver
 Destination responds with short message
reserving slot for sender

 Response from destination is broadcast so
all potential senders are notified of the
reservation
Chapter 6, slide 13
Avoiding collisions
idea: allow sender to “reserve” channel rather than random
access of data frames: avoid collisions of long data frames
 sender first transmits small request-to-send (RTS) packets
to base station using CSMA
 RTSs may still collide with each other (but they’re short)
 Base station broadcasts clear-to-send CTS in response to
RTS
 CTS heard by all nodes
 sender transmits data frame
 other stations defer transmissions
Avoid data frame collisions completely
using small reservation packets
Chapter 6, slide 14
Wireless CSMA/CA
 Any station may receive simultaneous
requests
Results in collision at receiver
 Both requests are lost
 Neither sender gets a reservation
 Both senders use random backoff and retry

 Any station may receive closely spaced
requests
Selects one
 Sends message to selected sender
 Sender that is not selected uses backoff/retry

Chapter 6, slide 15
Collision Avoidance: RTS-CTS exchange
A
AP
B
reservation
collision
DATA (A)
defer
time
Chapter 6, slide 16
IEEE 802.11 Wireless LAN
802.11b
 2.4-5 GHz
 Rate: up to 11 Mbps
 802.11a
 5-6 GHz range
 up to 54 Mbps
 802.11g
 2.4-5 GHz range
 up to 54 Mbps
 802.11n: multiple antennae
 2.4-5 GHz range
 up to 200 Mbps

 all use CSMA/CA for multiple access
 all have base-station and ad-hoc network versions
Chapter 6, slide 17
802.11 LAN architecture
 wireless host communicates
with base station
 base station = access
point (AP)
 Basic Service Set (BSS)
(aka “cell”) in infrastructure
hub, switch mode contains:
or router
 wireless hosts
 access point (AP): base
station
AP
 ad hoc mode: hosts only
Internet
AP
BSS 1
BSS 2
Chapter 6, slide 18
802.11: Channels, association
 802.11b/g LAN: 2.4GHz-2.485GHz spectrum divided
into 11 channels at different frequencies


AP admin chooses frequency/channel for AP
interference possible: same channel can be chosen by two
neighboring APs
 host/laptop: must associate with an AP




scans channels, listening for beacon frames containing AP’s
name (SSID) and MAC address
selects AP to associate with
may perform authentication
typically runs DHCP to get IP address in AP’s subnet
Chapter 6, slide 19
802.11: passive/active scanning
BBS 1
AP 1
BBS 2
1
1
2
AP 2
BBS 1
BBS 2
AP 1
2
3
2
3
H1
Passive Scanning:
(1) beacon frames sent from APs
(2) association Request frame
sent: H1 to selected AP
(3) association Response frame
sent: H1 to selected AP
AP 2
1
4
H1
Active Scanning:
(1) Probe Request frame broadcast from
H1
(2) Probes response frame sent from
APs
(3) Association Request frame sent: H1
to selected AP
(4) Association Response frame sent: H1
to selected AP
Chapter 6, slide 20
ZigBee
 wireless (ad-hoc) mesh networking
standard

mesh networking provides high reliability and
larger range.
 based on the IEEE 802.15.4 standard for
wireless personal area networks
low cost allows the technology to be widely
deployed in wireless control and monitoring
applications
 low power-usage allows longer life with smaller
batteries

Chapter 6, slide 21
What is mobility?
 spectrum of mobility, from the network perspective:
no mobility
mobile wireless user, mobile user,
using same access
connecting/
point
disconnecting
from network
using DHCP.
high mobility
mobile user, passing
through multiple
access points while
maintaining ongoing
connections (like cell
phone)
Chapter 6, slide 22
802.11: mobility within same subnet
 H1 remains in same IP
subnet: IP address
can remain same
 switch: which AP is
associated with H1?

self-learning (Ch. 5):
switch will see frame
from H1 and
“remember” which
switch port can be
used to reach H1
router
hub or
switch
BBS 1
AP 1
AP 2
H1
BBS 2
Chapter 6, slide 23
Mobility terminology
home network: permanent
“home” of mobile
(e.g., 128.119.40/24)
Permanent address:
address in home network,
can always be used to
reach mobile
e.g., 128.119.40.186
24
home agent: entity that will
perform mobility functions on
behalf of mobile, when mobile is
remote
wide
area
network
correspondent
correspondent: wants
to communicate with
mobile
Mobility terminology
Permanent address: remains
constant (e.g., 128.119.40.186)
visited (or foreign) network:
network in which mobile
currently resides (e.g.,
79.129.13/24)
Care-of-address: address in
visited network.
(e.g., 79,129.13.2)
wide
area
network
25
foreign agent: entity in
visited network that
performs mobility
functions on behalf of
mobile.
Mobile Addressing
Consider friend frequently changing
addresses, how do you find her?
I wonder where
Alice moved to?
 search all phone
books?
 call her parents?
 expect her to let you
know where he/she is?
26
Routing approaches
 Let routing handle it: routers advertise permanent
address of mobile-nodes-in-residence via usual
routing table exchange.
 routing tables indicate where each mobile located
 no changes to end-systems
27
Routing approaches
 Let routing handle it: routers advertise permanent
not
address of mobile-nodes-in-residence
via usual
scalable
routing table exchange.
to millions of
 routing tables indicate
mobiles where each mobile located

no changes to end-systems
 Let end-systems handle it:
indirect routing: communication from
correspondent to mobile goes through home
agent, then forwarded to remote
 direct routing: correspondent gets foreign
address of mobile, sends directly to mobile

28
Mobility via Indirect Routing
foreign agent
receives packets,
forwards to mobile
home agent intercepts
packets, forwards to
foreign agent
home
network
3
wide area
network
correspondent
addresses packets
using home address
of mobile
1
2
visited
network
4
mobile replies
directly to
correspondent
Chapter 6, slide 29
Mobility via Direct Routing
correspondent forwards
to foreign agent
foreign agent
receives packets,
forwards to mobile
home
network
4
wide area
network
2
correspondent
requests, receives
foreign address of
mobile
visited
network
1
3
4
mobile replies
directly to
correspondent
Chapter 6, slide 30
Wireless, mobility: impact on higher layer protocols
 logically, impact should be minimal …
best effort service model remains unchanged
 TCP and UDP currently run over wireless, mobile
 … but performance-wise:
 packet loss/delay due to bit-errors (discarded packets, delays
for link-layer retransmissions), and handoff
 TCP interprets loss as congestion, will decrease congestion
window un-necessarily
 limited bandwidth of wireless links

 Many unsolved problems
 Research
areas !
Chapter 6, slide 31