Power Efficient Network Scanning Algorithm Based on IEEE 802.11k-Measurement Pilot 


Vol. 39,  No. 6, pp. 482-489, Jun.  2014


PDF
  Abstract

This paper suggests the new network scanning algorithm that makes use of measurement pilot of IEEE 802.11k. The purpose of suggesting this algorithm is to improve the existing network scanning schemes. After introducing new algorithm, this paper shows the difference of time property and energy property between former scanning schemes and new scheme with simulation results. Passive scan has a merit of low-power consumption but it takes too long time to fulfill whole scanning. On the contrary, an advantage of active scan is speed but it consumes more battery power than passive scan. By using measurement pilot’s smaller interval than beacon interval, the suggested algorithm can consume less power than active scan does, and also make shorter scanning delay than passive scan does.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. K. Lee, H. Kim, H. Kim, "Power Efficient Network Scanning Algorithm Based on IEEE 802.11k-Measurement Pilot," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 6, pp. 482-489, 2014. DOI: .

[ACM Style]

Hyung Kyu Lee, Hwangnam Kim, and Hyunsoon Kim. 2014. Power Efficient Network Scanning Algorithm Based on IEEE 802.11k-Measurement Pilot. The Journal of Korean Institute of Communications and Information Sciences, 39, 6, (2014), 482-489. DOI: .

[KICS Style]

Hyung Kyu Lee, Hwangnam Kim, Hyunsoon Kim, "Power Efficient Network Scanning Algorithm Based on IEEE 802.11k-Measurement Pilot," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 6, pp. 482-489, 6. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880