Download presentation
Presentation is loading. Please wait.
Published byEaster Shepherd Modified over 9 years ago
1
Dynamic Guard Bandwidth Scheme for Wireless Broadband Networks IEEE INFOCOM 2001
2
INFOCOM 20012 Outline Introduction Framework Boundary approximation Estimation functionality based on GPS Dynamic guard bandwidth adaptation Simulation Results Conclusion
3
INFOCOM 20013 Introduction Guard bandwidth / guard channel scheme Fixed Dynamic Proposed Scheme: Dynamic Guard Bandwidth Adaptation.
4
INFOCOM 20014 Irregular Cell Boundary
5
INFOCOM 20015 Approximating the Cell Boundary Boundary Approximation Points (BAP). When a MT makes a handoff request, it is required to report its position and its target handoff cell to the BS. The region around each BS is divided into M sectors, and the reported handoff request positions within each sector are reduced to a single BAP, associated with a most likely target handoff cell. The BAPs and their corresponding are stored in a table located at each BS. The table could be updated based on handoff-request positions collected over a certain period.
6
INFOCOM 20016 Estimating the Remaining Time to Handoff / the Target Handoff Cell The trajectory of each MT is predicted to estimate the BAP that is likely to be closest to the actual handoff request location (Closest BAP, CBAP). Each MT obtains its own position information at a regular time interval from its GPS receiver, and keeps track of its previous positions over the last (Q-1) intervals. The current position of the MT is labeled as, and the previous (Q-1) points are labeled as …. The MT’s direction of travel is estimated using linear regression over these Q points.
7
INFOCOM 20017 Estimating the Remaining Time to Handoff / the Target Handoff Cell Method for the search of the CBAP: The M BAPs are divided into four quadrants, where points (a g, b g ), g = M(i-1)/4, M(i-1)/4 + 1, …, M(i-1)/4 – 1, lie in the i th quadrant. Once the quadrant containing the CBAP is determined, a bisection search method is performed within that quadrant recursively until we obtain two BAPs that enclose the CBAP, and then we choose the closer BAP as CBAP. O(log 2 M) complexity.
8
INFOCOM 20018 Estimating the Remaining Time to Handoff / the Target Handoff Cell
9
INFOCOM 20019 Estimating the Remaining Time to Handoff / the Target Handoff Cell
10
INFOCOM 200110 Important Points The location information obtained from the GPS receivers are only used to estimate T remain and C target. Actual handoff requests are still initiated based on received signal strength measurements, error rates, interference, and handoff protocols used. The remaining time to handoff as well as the target handoff cell estimations are to be performed by individual MTs. Distributed. The BS would not be overloaded with these computations.
11
INFOCOM 200111 Important Points This scheme has reasonable tolerance for prediction errors. While the MTs could change direction and speed as it approaches the cell boundary, the target handoff cell prediction is erroneous only if the trajectory of the MT changes so much that it enters a different cell from the one predicted. Predictions are made periodically and alternative reservations would be attempted if the previous decision has become invalid.
12
INFOCOM 200112 Dynamic Guard Bandwidth Adaptation Adaptation of wireless guard bandwidth: When a new call request arrives at a BS, the network shall classify it into one of the I traffic classes that is supported. MTs make periodic predictions of T remain and C target every. If T remain is shorter than a threshold time (the remaining time to handoff threshold, RTHT), the MT will inform the target BS about its prediction, and the BS will increase B G accordingly.
13
INFOCOM 200113 Dynamic Guard Bandwidth Adaptation
14
INFOCOM 200114 Dynamic Guard Bandwidth Adaptation B G is only increased by a fraction of the actual bandwidth requirement. Reservation ratio (RR). For a MT that belongs to traffic class i, with bandwidth requirement B i, and is anticipated to handoff to neighboring cell j within RTHT, the BG in cell j should be increased by RR(i,j) x B i. 0 < RR(i,j) < 1, and it is dynamically adjusted based on measured values of P F (i, j).
15
INFOCOM 200115 Dynamic Guard Bandwidth Adaptation When to decrease of B G : The MT has entered the cell The call ends before the handoff The MT is no longer expected to handoff into the cell. The B G for the cell is reduced if a handoff is not expected to occur within RTHT consistently over a number of prediction time intervals (the release Reservation Threshold Time, RRTT). Typically the RRTT is set to a few.
16
INFOCOM 200116 Dynamic Guard Bandwidth Adaptation Adaptation of backbone guard bandwidth While handoffs into a radio cell could only originate from its neighboring cells, handoff rerouting through a wired backbone link is dependent on network topology and the rerouting scheme used. With the ability to predict the most likely handoff cell, the links whose BG need to be increased are limited to those between the COS and the target handoff cell.
17
INFOCOM 200117 Dynamic Guard Bandwidth Adaptation Admission control of new calls A new call of traffic class i is admitted only if
18
INFOCOM 200118 Dynamic Guard Bandwidth Adaptation Admission control of handoff calls A common B G pool that is shared by different traffic classes would favor those with smaller bandwidth requirements. A handoff call of traffic class i is only admitted if it satisfies the following conditions:
19
INFOCOM 200119 Simulation Results
20
INFOCOM 200120 Simulation Results
21
INFOCOM 200121 Simulation Results
22
INFOCOM 200122 Simulation Results
23
INFOCOM 200123 Conclusion Measurement-based approach. Suitable for heterogeneous bandwidth requirements. High scalability due to the distributed operation.
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.