cs 294-7: handoff strategiesbnrg.cs.berkeley.edu/~randy/courses/cs294.s96/handoff.pdfissues for...
TRANSCRIPT
![Page 1: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/1.jpg)
1
CS 294-7: Handoff Strategies
Prof. Randy H. KatzCS Division
University of California, BerkeleyBerkeley, CA 94720-1776
© 1996
![Page 2: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/2.jpg)
2
Technology Trends
• Fastest way to increase network capacity is to decrease cell size
– Increased cell crossings per unit time– Greater demands on switching infrastructure
• Quality of Service (QoS) Considerations– Rerouting connections with low latency– Minimizes co-channel interference– Rapid reallocation of network resources
• Multitier PCS Systems– Macrocells overlain on top of microcells– Rapidly moving mobiles assigned to the former,
stationary mobiles to the latter
![Page 3: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/3.jpg)
3
Issues for Handoff
• Making handoffs “seamless”– Minimize handoff latency– Minimize frequency of handoff and its effects on QoS– Minimize probability of dropping connections across handoffs– Minimize “call blocking”/effects of admission control
• Strategies– Channel allocation– Virtual connection trees– Multicast routing– User tracking
![Page 4: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/4.jpg)
4
Performance Metrics
• Call blocking probability—new call attempt is blocked• Handover blocking probability—handoff attempt is
blocked• Call dropping probability—call terminated due to
failed handoff• Probability of unnecessary handoff—handoff initiated
when radio link still acceptable• Rate of handoff—# of handoffs/unit time• Duration of interruption—loss of communication with
any base station• Delay—distance moved before handoff occurs
![Page 5: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/5.jpg)
5
Handoff InitiationBS1 BS2
RSS from BS1 RSS from BS2
h
T1
T2
T3
Handoff based on:A: Relative SSB: Relative SS + ThresholdC: Relative SS + HysteresisD: Relative SS + Hysteresis & ThresholdPredictive Tech-niques
AB
C
D
MotionIncreasing delay impliesdecreasing link qualityand increasing dropping probability
Hysteresis+ Timers
![Page 6: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/6.jpg)
6
Handoff Initiation
0.5 0.75Fraction of distance betweentwo identical base stations
Increasing hDecreasing T
Delay
Mean # ofHandoffs
6
1
3
2
5
4
Trade h/o delayfor decreasednumber of handoffs
![Page 7: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/7.jpg)
7
Macro/Micro Cell Handoffs
• Use cell dwell times to perform cell assignment:
– Move to bigger cell if user does not spend enough time in the current cell
– Move to a smaller cell if the user stays there too longMacrocells for fast movers
Microcells for slow moversEstimate speed via doppler frequencyDirection-based algorithms
Access Schemes:— CDMA in macrocells, TDMA in microcells— TDMA in macrocells, CDMA in microcells— TDMA timeslot sharing— Frequency splitting
CDMA/CDMAdoesn’t work
well because ofdiffering power
levels for macro/microcells
![Page 8: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/8.jpg)
8
Channel Assignment
• Channel Assignment Strategies– Fixed
» Basic Fixed» Simple Borrowing» Hybrid» Borrowing with Ordering
– Dynamic» Call-by-Call Optimized
– Flexible» Scheduled» Predictive
![Page 9: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/9.jpg)
9
Fixed Channel Assignment
• Fixed Assignment– Permanent assignment to all cells– Simple, but what happens when there are local demand
hotspots?
• Simple Borrowing– MSC “borrows” unused channel from adjacent cell– Select cell with lowest number of in-use channels
• Hybrid– Partition channels into those that are “reserved for local
use only” and those that may be borrowed on demand– Choose fixed partitioning based on expected traffic load
• Borrowing with Ordering– Adjust reserved/borrowable ratio based on dynamic
traffic conditions
![Page 10: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/10.jpg)
10
Dynamic Channel Assignment
• Call-by-Call Optimized– MSC assigns channels on demand to BSs under its
control– Cost function depends on:
» Future blocking probability» Usage frequency of channel» Reuse distance of channel» …
– Other inputs to the decision process:» Channel occupancy distributions» Current traffic measurements» Radio channel measurements
![Page 11: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/11.jpg)
11
Flexible Channel Assignment
• MSC holds “flexible” channels in reserve in addition to channels assigned to specific cells
• MSC assigns reserve channels to cells to meet demand
– Scheduled» MSC knows in advance when peak traffic periods will
arise for different cells– Predictive
» Continuous measurement of traffic intensity» MSC predicts traffic changes over time and space,
and makes necessary assignments of reserve channels
![Page 12: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/12.jpg)
12
Handoff Scenarios
• Prioritize handoff requests to protect against dropped calls
• Radio channel measurements– Fading channel implies that loss of signal strength must
persist for some threshold time before a handoff is requested– But perform with low latency to insure reduced probability of
dropping– MSC must identify channel in new cell to assign to MS as it
approaches the cell boundary
• Guard channels: small number of channels reserved for handoff to MS with calls in progress
– Increases blocking probability but decreases dropping probability
– Worse spectrum utilization
![Page 13: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/13.jpg)
13
Handoff Scenarios
• Queuing of Originating Calls– Make new calls wait while giving priority to handoff
connections– Can also queue handoffs, since there is a time interval
during which the existing call connection can be retained before a new one is assigned
» Position in queue depends on how close the MS is to the edge of the cell
» Higher priority for MSs close to edge and/or moving fast
» Lower priority for MSs further from edge and/or moving slow
![Page 14: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/14.jpg)
14
Handoffs and Connections
Switch
Base Station
OriginatingCell
New Cell
Forwarding
1. Connection established to originating cell2. As mobile moves, BS in original cell forwards to new cell—latency and load on original BS and network3. Tear up and reestablish connection tails
1
2
3
Beware of forwarding loops!
![Page 15: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/15.jpg)
15
Virtual Connection TreesSwitch
Switch
Base Station
WirelineNetwork
Virtual Connection Numbers: Assigned to path from root of tree to leaves of tree;One for each possible path and each MS(!!)
Connection consists of two parts:(1) Path from BS to root of tree(2) Fixed virtual connection to other party in connection
Admission Control on entry to a new VCT
Unit of admissioncontrol
![Page 16: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/16.jpg)
16
Virtual Connection Trees
VC -> VCNpath translation
New VCN for returnpath VC is detectedat root; root updatesits VC to VCN mapping
Mobile Initiated Handoff:Access points chosen by mobile
NOTE: No discussion of forwarding!
Single root per region: scaling problem?
![Page 17: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/17.jpg)
17
User Tracking
• Picocellular systems– Cell sizes on the order of 10 m diameter (pedestrian
speeds are 2-3 m/second)– Faster inter-node mobility, greater frequency of handoffs– Proposed solution: local area multicast
SH Supervisor Host: manages region and inter-region routing
BSBS BS BS BS BS Base Station (aka MSS)
Multicast group
Exploit geographic infoabout cells to predictformation of groups
![Page 18: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/18.jpg)
18
Mobility Protocol(Ghai and Singh)
SH
MSS
MH
SH
MSS
MH
Cloud
Active Remote Connection
MSS
MHActive LocalConnection—Local Multicast
MulticastAddress
21
i 3
Direction of MotionRed is forwardingGray is buffering
VCEstablishment
How easy to predict?
![Page 19: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/19.jpg)
19
Mobility Protocol• Connection Establishment
– MHS to communicate with MHD; Reflect request to MSSS and SHS – Assigns local VCN, connection is NASCENT– SHS locates MHD (VCN, ID of MHS, ID of MHD)
» Looks for MHD within local subnet first (ACTIVE LOCAL)» If no response, broadcast locate request to other SHs;
When located, assign local VCN, respond to SHS Connection status becomes ACTIVE REMOTE
– Connection is now established
• Connection Maintenance– MSS beacon signaling: MH responds with GREET (includes ID of
old MSS and SH); MSS responds with GREET_ACK– Same subnet: SH changes membership in MH’s group– New subnet: new SH must inherit MH’s existing connections
ACTIVE_LOCAL connections become ACTIVE_REMOTESome ACTIVE_REMOTE connections become ACTIVE_LOCAL
![Page 20: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/20.jpg)
20
Mobility Protocol
• Communications between MHs– Same subnet: local multicast from source MSS to group
members of destination MH– Different subnets: source SH sends packet to destination
SH with appropriate local VCN» At Destination SH, if connection is ACTIVE_REMOTE:
Multicast the packet to the group in the local subnet» If POINT, “Destination” SH forwards the packet to the
current SH of the destination MH;
Status is POINT if MH moves out of subnet after connection has been established
Note that scheme does NOT propose how to prune these forwarding pointers
![Page 21: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/21.jpg)
21
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Use hints about terminaltrajectory to form MC groups
Multicast packets to “regional” base stations to smooth hand-offs for R/Tstreams
Minimize location updatetraffic to home agent andmobility aware CHs
Local Multicast Group
Packet Video Steam
ForeignAgent
Multicast Tunnel
![Page 22: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/22.jpg)
22
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Forwarding Base Station ForeignAgent
![Page 23: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/23.jpg)
23
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Forwarding Base Station
Buffering Base Station
ForeignAgent
![Page 24: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/24.jpg)
24
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Forwarding Base Station
Buffering Base Station
Extending Multicast Group
Local Multicast Group
ForeignAgent
![Page 25: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/25.jpg)
25
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Forwarding Base Station
Buffering Base Station
Extending Multicast Group
Horizontal Hand Off
Local Multicast Group
ForeignAgent
![Page 26: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/26.jpg)
26
Low Latency Handoff
HomeAgent
BaseStation
BaseStation
Forwarding Base Station
Buffering Base Station
Extending Multicast Group
Horizontal Hand Off
Pruning Multicast Group
ForeignAgent
![Page 27: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/27.jpg)
27
Typical Handoff MessagingBS1 BS2MH
Packet1
Beacon
Packet2
Packet3
Packet4
BufferRequest
StrongerBeacon
ForwardRequest
Packet5
HandoffLatency
![Page 28: CS 294-7: Handoff Strategiesbnrg.cs.berkeley.edu/~randy/Courses/CS294.S96/Handoff.pdfIssues for Handoff • Making handoffs “seamless” – Minimize handoff latency – Minimize](https://reader035.vdocuments.site/reader035/viewer/2022081410/60917f62b007ad57a004ebf1/html5/thumbnails/28.jpg)
28
Measured Handoff Latency
5 - 25 ms 0 - 40 ms 3 - 20 ms2 - 10 ms
BeaconArrives
Disableold BS
msg sent
Enablenew BS
msg sent
Last pktfrom old
BS
First pktfrom new
BS
95 ms worse case10 ms best case