Fast handoff mechanism in WLANs based on neighbor graph information

Author

Sarddar, Debabrata ; Jana, Tapas ; Patra, Tarasankar ; Biswas, Utpal ; Naskar, M.K.

Author_Institution

Dept. of Electron. & Telecommun. Eng, Jadavpur Univ., Kolkata, India

fYear

2010

fDate

28-30 Oct. 2010

Firstpage

334

Lastpage

338

Abstract

According to IEEE 802.11 based WLAN standard, handoff at link layer (L2) consists of three distinct phases scanning, authentication and re-association. Scanning process takes 90% of the total handoff execution time [7] which is known as handoff delay or handoff latency. So in this paper our main goal is to reduce scanning delay, as a small handoff delay results a seamless and successful handoff. And a successful handoff ensures an uninterrupted flawless connectivity when the mobile station (STA) moves out of its old base station´s (BS) coverage area. In this paper we proposed selective scanning based on position, speed and direction of motion of the Mobile station using the neighbor graph to reduce the scanning delay.

Keywords

cellular radio; wireless LAN; IEEE 802.11; Scanning process; WLAN; base station; fast handoff mechanism; mobile station; neighbor graph information; Authentication; Delay; Grid computing; IEEE 802.11 Standards; Mobile communication; Probes; Wireless networks; Access Point (AP); Handoff; Handoff latency; IEEE802.11 WLANs; neighbor graph (NG); selective scanning;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Conference_Location

Solan

Print_ISBN

978-1-4244-7675-6

Type

conf

DOI

10.1109/PDGC.2010.5679972

Filename

5679972