On the fast BSS transition algorithms in the IEEE 802.11r local area wireless networks

8Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Handover performance is critical to support multimedia services that are becoming increasingly available over the wireless devices. The high transition delay can be unaccepted for such services or can be a source of disruption on the session. On the other side, IEEE 802.11 standard is being extended with new functionalities. Security and QoS features, included in recent IEEE 802.11-2007 standard, add management frames that are exchanged during the transition process. In consequence the handover delay is increased. IEEE 802.11r-2008 amendment introduces Fast BSS Transition (FT) that simplifies the handover process. The authors propose the new handover algorithms based on FT protocol and compare them with existing solution. Additionally, simulation experiments are conducted to answer the question if multimedia services can be properly supported in IEEE 802.11r networks. The authors prove that handover delay can be reduced to 13 ms in the average case. © 2011 The Author(s).

Cite

CITATION STYLE

APA

Machań, P., & Wozniak, J. (2013). On the fast BSS transition algorithms in the IEEE 802.11r local area wireless networks. In Telecommunication Systems (Vol. 52, pp. 2713–2720). https://doi.org/10.1007/s11235-011-9590-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free