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 |
|---|---|
| Pages (from-to) | 194-203 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3260 |
| Publication status | Published - 2004 Dec 1 |
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3260, 194-203.