Selective hannel scanning for fast handoff in wireless LAN using neighbor graph

Sang Hee Park; Hye Soo Kim; Chun Su Park; Jae Won Kim; Sung Jea Ko

doi:10.1007/978-3-540-30199-8_16

Selective hannel scanning for fast handoff in wireless LAN using neighbor graph

Sang Hee Park, Hye Soo Kim, Chun Su Park, Jae Won Kim, Sung Jea Ko

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter

28 Citations (Scopus)

Abstract

Handoff at the link layer 2 (L2) consists of three phases: scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time delay. Thus, in this paper, we pro- . pose an improved scanning mechanism to minimize the disconnected time while the wireless station (STA) changes the associated access points (APs). According to IEEE 802.11 standard, the STA has to scan all channels in the scanning phase. In this paper, based on the neighbor graph (NG), we introduce a selective channel scanning method for fast handoff in which the STA scans only channels selected by the NG. Experimental results show that the proposed method reduces the scanning delay drastically.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Ignas Niemegeers, Sonia Heemstra de Groot
Publisher	Springer Verlag
Pages	194-203
Number of pages	10
ISBN (Print)	3540231625, 9783540231622
DOIs	https://doi.org/10.1007/978-3-540-30199-8_16
Publication status	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3260
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-30199-8_16

Fingerprint Dive into the research topics of 'Selective hannel scanning for fast handoff in wireless LAN using neighbor graph'. Together they form a unique fingerprint.

Cite this

Park, S. H., Kim, H. S., Park, C. S., Kim, J. W., & Ko, S. J. (2004). Selective hannel scanning for fast handoff in wireless LAN using neighbor graph. In I. Niemegeers, & S. H. de Groot (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 194-203). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3260). Springer Verlag. https://doi.org/10.1007/978-3-540-30199-8_16

Selective hannel scanning for fast handoff in wireless LAN using neighbor graph. / Park, Sang Hee; Kim, Hye Soo; Park, Chun Su; Kim, Jae Won; Ko, Sung Jea.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Ignas Niemegeers; Sonia Heemstra de Groot. Springer Verlag, 2004. p. 194-203 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3260).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Park, SH, Kim, HS, Park, CS, Kim, JW & Ko, SJ 2004, Selective hannel scanning for fast handoff in wireless LAN using neighbor graph. in I Niemegeers & SH de Groot (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3260, Springer Verlag, pp. 194-203. https://doi.org/10.1007/978-3-540-30199-8_16

Park SH, Kim HS, Park CS, Kim JW, Ko SJ. Selective hannel scanning for fast handoff in wireless LAN using neighbor graph. In Niemegeers I, de Groot SH, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 194-203. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-30199-8_16

Park, Sang Hee ; Kim, Hye Soo ; Park, Chun Su ; Kim, Jae Won ; Ko, Sung Jea. / Selective hannel scanning for fast handoff in wireless LAN using neighbor graph. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Ignas Niemegeers ; Sonia Heemstra de Groot. Springer Verlag, 2004. pp. 194-203 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{283fae73e1784f718939e0cb3c2d2c7f,

title = "Selective hannel scanning for fast handoff in wireless LAN using neighbor graph",

abstract = "Handoff at the link layer 2 (L2) consists of three phases: scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time delay. Thus, in this paper, we pro- . pose an improved scanning mechanism to minimize the disconnected time while the wireless station (STA) changes the associated access points (APs). According to IEEE 802.11 standard, the STA has to scan all channels in the scanning phase. In this paper, based on the neighbor graph (NG), we introduce a selective channel scanning method for fast handoff in which the STA scans only channels selected by the NG. Experimental results show that the proposed method reduces the scanning delay drastically.",

author = "Park, {Sang Hee} and Kim, {Hye Soo} and Park, {Chun Su} and Kim, {Jae Won} and Ko, {Sung Jea}",

year = "2004",

doi = "10.1007/978-3-540-30199-8_16",

language = "English",

isbn = "3540231625",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "194--203",

editor = "Ignas Niemegeers and {de Groot}, {Sonia Heemstra}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - Selective hannel scanning for fast handoff in wireless LAN using neighbor graph

AU - Park, Sang Hee

AU - Kim, Hye Soo

AU - Park, Chun Su

AU - Kim, Jae Won

AU - Ko, Sung Jea

PY - 2004

Y1 - 2004

N2 - Handoff at the link layer 2 (L2) consists of three phases: scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time delay. Thus, in this paper, we pro- . pose an improved scanning mechanism to minimize the disconnected time while the wireless station (STA) changes the associated access points (APs). According to IEEE 802.11 standard, the STA has to scan all channels in the scanning phase. In this paper, based on the neighbor graph (NG), we introduce a selective channel scanning method for fast handoff in which the STA scans only channels selected by the NG. Experimental results show that the proposed method reduces the scanning delay drastically.

AB - Handoff at the link layer 2 (L2) consists of three phases: scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time delay. Thus, in this paper, we pro- . pose an improved scanning mechanism to minimize the disconnected time while the wireless station (STA) changes the associated access points (APs). According to IEEE 802.11 standard, the STA has to scan all channels in the scanning phase. In this paper, based on the neighbor graph (NG), we introduce a selective channel scanning method for fast handoff in which the STA scans only channels selected by the NG. Experimental results show that the proposed method reduces the scanning delay drastically.

UR - http://www.scopus.com/inward/record.url?scp=35048827988&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048827988&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30199-8_16

DO - 10.1007/978-3-540-30199-8_16

M3 - Chapter

AN - SCOPUS:35048827988

SN - 3540231625

SN - 9783540231622

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 194

EP - 203

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Niemegeers, Ignas

A2 - de Groot, Sonia Heemstra

PB - Springer Verlag

ER -