Location Assisted Handover Optimization for Heterogeneous Wireless Networks

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

3 Citations (Scopus)
426 Downloads (Pure)

Abstract

Mobile users typically experience better connectivity if their mobile device performs handover to an available WiFi network rather than using a cellular network. For a moving user the window of opportunity is limited and the timing of the handover is therefore crucial.
In this work we propose two location-based look-ahead handover prediction algorithms that are based on the assumption that a database of expected throughput for a given location of all networks is available. The first algorithm uses an analytical formulation of the handover problem to determine the optimal sequence of handovers within a time window, which is computationally feasible for up to 3-4 handovers within the window. The second algorithm is a heuristic algorithm, which is computationally feasible for any reasonable number of handovers within the window. We have used simulations to obtain the achieved throughput of these algorithms for a mobile user in an urban scenario with ubiquitous cellular coverage and 250 WiFi APs/km2, and compared the results to a hysteresis-based greedy algorithm and the case of ”always cellular-connected”.
Our results show that the proposed look-ahead algorithms outperform the hysteresis-based and ”always cellular-connected”, but also show that the look-ahead algorithms are highly dependent on accurate movement tracking and movement prediction systems. The heuristic algorithm is also shown to achieve the highest throughput for large look-ahead windows.
Original languageEnglish
Title of host publicationProceedings of European Wireless 2011
PublisherIEEE Press
Publication date29 Apr 2011
ISBN (Electronic)978-3-8007-3343-9
Publication statusPublished - 29 Apr 2011

Fingerprint

Heterogeneous networks
Wireless networks
Throughput
Heuristic algorithms
Hysteresis
Mobile devices

Cite this

@inproceedings{f1d6049fc5c04f4c91bf398bdfe8f3db,
title = "Location Assisted Handover Optimization for Heterogeneous Wireless Networks",
abstract = "Mobile users typically experience better connectivity if their mobile device performs handover to an available WiFi network rather than using a cellular network. For a moving user the window of opportunity is limited and the timing of the handover is therefore crucial.In this work we propose two location-based look-ahead handover prediction algorithms that are based on the assumption that a database of expected throughput for a given location of all networks is available. The first algorithm uses an analytical formulation of the handover problem to determine the optimal sequence of handovers within a time window, which is computationally feasible for up to 3-4 handovers within the window. The second algorithm is a heuristic algorithm, which is computationally feasible for any reasonable number of handovers within the window. We have used simulations to obtain the achieved throughput of these algorithms for a mobile user in an urban scenario with ubiquitous cellular coverage and 250 WiFi APs/km2, and compared the results to a hysteresis-based greedy algorithm and the case of ”always cellular-connected”.Our results show that the proposed look-ahead algorithms outperform the hysteresis-based and ”always cellular-connected”, but also show that the look-ahead algorithms are highly dependent on accurate movement tracking and movement prediction systems. The heuristic algorithm is also shown to achieve the highest throughput for large look-ahead windows.",
author = "Nielsen, {Jimmy Jessen} and Madsen, {Tatiana Kozlova} and Hans-Peter Schwefel",
year = "2011",
month = "4",
day = "29",
language = "English",
booktitle = "Proceedings of European Wireless 2011",
publisher = "IEEE Press",

}

Location Assisted Handover Optimization for Heterogeneous Wireless Networks. / Nielsen, Jimmy Jessen; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter.

Proceedings of European Wireless 2011. IEEE Press, 2011.

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Location Assisted Handover Optimization for Heterogeneous Wireless Networks

AU - Nielsen, Jimmy Jessen

AU - Madsen, Tatiana Kozlova

AU - Schwefel, Hans-Peter

PY - 2011/4/29

Y1 - 2011/4/29

N2 - Mobile users typically experience better connectivity if their mobile device performs handover to an available WiFi network rather than using a cellular network. For a moving user the window of opportunity is limited and the timing of the handover is therefore crucial.In this work we propose two location-based look-ahead handover prediction algorithms that are based on the assumption that a database of expected throughput for a given location of all networks is available. The first algorithm uses an analytical formulation of the handover problem to determine the optimal sequence of handovers within a time window, which is computationally feasible for up to 3-4 handovers within the window. The second algorithm is a heuristic algorithm, which is computationally feasible for any reasonable number of handovers within the window. We have used simulations to obtain the achieved throughput of these algorithms for a mobile user in an urban scenario with ubiquitous cellular coverage and 250 WiFi APs/km2, and compared the results to a hysteresis-based greedy algorithm and the case of ”always cellular-connected”.Our results show that the proposed look-ahead algorithms outperform the hysteresis-based and ”always cellular-connected”, but also show that the look-ahead algorithms are highly dependent on accurate movement tracking and movement prediction systems. The heuristic algorithm is also shown to achieve the highest throughput for large look-ahead windows.

AB - Mobile users typically experience better connectivity if their mobile device performs handover to an available WiFi network rather than using a cellular network. For a moving user the window of opportunity is limited and the timing of the handover is therefore crucial.In this work we propose two location-based look-ahead handover prediction algorithms that are based on the assumption that a database of expected throughput for a given location of all networks is available. The first algorithm uses an analytical formulation of the handover problem to determine the optimal sequence of handovers within a time window, which is computationally feasible for up to 3-4 handovers within the window. The second algorithm is a heuristic algorithm, which is computationally feasible for any reasonable number of handovers within the window. We have used simulations to obtain the achieved throughput of these algorithms for a mobile user in an urban scenario with ubiquitous cellular coverage and 250 WiFi APs/km2, and compared the results to a hysteresis-based greedy algorithm and the case of ”always cellular-connected”.Our results show that the proposed look-ahead algorithms outperform the hysteresis-based and ”always cellular-connected”, but also show that the look-ahead algorithms are highly dependent on accurate movement tracking and movement prediction systems. The heuristic algorithm is also shown to achieve the highest throughput for large look-ahead windows.

M3 - Article in proceeding

BT - Proceedings of European Wireless 2011

PB - IEEE Press

ER -