Abstract
Previous work on estimating the performance of hard handoff algorithms has been based on Monte-Carlo simulations or asymptotic approximations. A new analysis technique for evaluating the performance of handoff algorithms is introduced. This technique may be used to accurately estimate the performance of both optimal and suboptimal handoff algorithms. Specifically, the technique allows for the calculation of an upper bound on handoff performance without the need for storing or simulating the complicated optimal solution.
Original language | English (US) |
---|---|
Pages | 360-364 |
Number of pages | 5 |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 9th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. Part 3 (of 3) - Boston, MA, USA Duration: Sep 8 1998 → Sep 11 1998 |
Other
Other | Proceedings of the 1998 9th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. Part 3 (of 3) |
---|---|
City | Boston, MA, USA |
Period | 9/8/98 → 9/11/98 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering