Escolar Documentos
Profissional Documentos
Cultura Documentos
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 9
Abstract—The IEEE 802.11 wireless network adapters have one big weakness. They can just operate on one channel
respectively on one frequency at the same time. Therefore a IEEE 802.11 station is not able to scan and communicate
simultaneously. If a station scans its environment to e.g. prepare the roaming to another access point, it can’t receive frames
from its associated access point. This paper presents a special scan method for IEEE 802.11 stations. The Sleep Scan
improves the scan in a manner, that no packets get lost during the scan. It uses the IEEE 802.11 power save facility to signal
the access point to buffer every frame for the scanning station some time. Consequently no packets get lost during scanning. A
second variant of the Sleep Scan can not only prevent packet loss it also supports scanning during realtime communications.
—————————— ——————————
1 INTRODUCTION
rameters MinChannelTime, MaxChannelTime, ProbeDe- 3. Send and receive the bursts of buffered data.
lay or the Listen Interval itself can be tuned like the fol- 4. If not finished the full channel scan goto step
lowing (un)equations shows: 1, else the scan is finished.
t ListenInterval x t BeaconInterval , x N \ {0} (9) This procedure is the fastest scan method, but to guar-
antee short scan delays the parameters ProbeDelay, Min-
ChannelTime and MaxChannelTime have to be tuned.
t Scan t Backoff t Pr obeDelay t Pr obe Re quest The time to scan one dedicated channel is
(10)
t MinChannelTime t MaxChannelTime
t Scan t Pr obeDelay t Access
t ListenInterval n t Scan (11) (12)
t MinChannelTime t MaxChannelTime
6 FAST SLEEP SCAN Remember, MaxChannelTime is only used if in the pe-
The Sleep Scan discussed in the above section can im- riod of MinChannelTime frames where received on the
prove the IEEE 802.11 scan to avoid packet loss during channel. If we assume to use the following values:
the scan. So it can be used for a permanent scanning dur-
ing low data exchange to keep track of neighboured APs. t Pr obeDelay 1ms (13)
But the Sleep Scan is no good choice for scanning during
realtime communication (e.g. Voice over IP) because of t MinChannelTime 10ms (14)
the short transmit and receive interval that the realtime
t MaxChannelTime 18ms (15)
traffic needs. The maximum delay for voice traffic should
not be larger than 50ms to guarantee good quality. t Access 1ms (16)
Therefore the Sleep Scan that possibly scans a whole
beacon interval could interrupt such a realtime communi-
The scan consumes about 30ms to scan one channel.
cation and so decrease its quality. A solution for this
problem is the ’Fast Sleep Scan’.
The Fast Sleep Scan procedure is shown in figure 2 and t Scan 1ms 1ms 10ms 18ms 30ms (17)
is similarly to the Sleep Scan.
That means the scan delays the realtime traffic only 30ms
and there is a 20ms reserve to send the realtime data in
time.
7 MEASUREMENT
To evaluate that the Sleep Scan idea works, we imple-
mented the Fast Sleep Scan into the open source WLAN
device driver for Atheros chips MadWifi [8]. First we dis-
abled the scan cancel behavior during data transmission.
So we could see the interrupts in data transmission raised
by full channel scans. A scan, if it is not canceled during
data transmission, will lead to massive packet loss and a
VoIP call will be interrupted up to one second and the
jitter buffer will rise up to its maximum size.
Our Fast Sleep Scan implementation buffers all data
frames to send in a queue during the scan. If the scan of
one dedicated channel is done, all data frames will be
send immediately. By sending all buffered frames the AP
is informed about the wakeup and sends also all its buf-
fered frames. With this implementation we can scan dur-
ing a data transmission without packet loss. With well
tuned parameters for MinChannelTime and MaxChan-
nelTime scans during VoIP calls are possible without loss
Fig.2. Fast Sleep Scan procedure of quality.
To evaluate good parameters for fast and efficient
scans, we setup a testbed with 10 APs which are confi-
The Fast Sleep Scan procedure is defined as follows:
gured to use the same channel. At first we want to inves-
1. Switch to PS-mode and scan one channel.
tigate a good value for MinChannelTime. A too small
2. Immediately after the scan awake from PS-
value would result in bad scan results, because probe re-
mode.
sponse frames will be missed. Too big values will extend
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 12, DECEMBER 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 13
the scan time per channel too much. So we set MaxChan- Based on this measurement results we can suggest (for
nelTime to a high value (50ms) and scanned one dedicat- this hardware and driver) to use 10ms for MinChannel-
ed channel with different values for MinChannelTime. If Time and 15ms to 20ms for MaxChannelTime to gain
we get at least one scan result we count the scan as suc- good and fast scan results.
cessful. Table 2 shows our measurement results for differ-
ent values of MinChannelTime. The results show that a
value of at least 7ms is needed for good scan results. Fig. 4. Measurement results for MaxChannelTime with high local
traffic load
Secondly we investigated good values for MaxChan-
nelTime. Here the same effect occurs as for MinChannel-
Time. Too small values would result in bad scan results
and too big values will extend the scan time per channel.
8 CONCLUSION
So we set MinChannelTime to 10ms and scanned with
variable values from 1ms to 50ms for MaxChannelTime. We determined that scanning and data transmission is
We made 100 scans on one dedicated channel for each
value of MaxChannelTime. At the same time we trans-
fered data with realtime characteristics on another chan-
nel. On the measurement channel with the 10 APs was no
traffic. Figure 3 shows the measurement results.
TABLE 2
Measurement results for MinChannelTime
Fig.3. Fast Sleep Scan procedure
tion just for a short time but does not break the realtime puter Science at the University of Telecommunication for the areas
of teaching foundations of computer science and communication
conditions. So the traffic gets just a short delay. The delay
networks.
can be influenced by the parameters MinChannelTime
and MaxChannelTime. M.Eng. Michael Finsterbusch studied computer science in Leipzig
Our measurements showed that 10ms is a good value at Telekom University of Applied Sciences (HfTL) and received his
Diploma in 2006 for implementing a Diameter server and client to
for MinChannelTime to steadily detect activity on the
gain a AAA-infrastructure for a secure and mobile architecture for
channel and to observe the channel for the additional mobile vehicles. His Master of Engineering at Telekom University of
time MaxChannelTime. To get good scan results also on Applied Sciences in Leipzig in 2009 was on research for WLAN mo-
channels with high traffic load, the value for MaxChan- bility. His current projects cover WLAN optimization, WLAN mobility,
network traffic management, deep packet inspection and high avail-
nelTime should be between 15ms and 20ms. With these
ability.
parameters the scan takes about 30ms which is short
enough for e.g. VoIP communication. M.Eng. Patrick Schmidt studied computer science in Leipzig at
To have up to date scan results at any time, the Sleep Telekom University of Applied Sciences (HfTL) and received his
Scan should be used periodically during less or no data Diploma in 2006 for inventing a secure and mobile architecture for
mobile vehicles. His Master of Engineering at Telekom University of
transmissions, because the Sleep Scan does not interrupt Applied Sciences in Leipzig in 2009 was on research for WLAN
after every single channel scan. Therefore the full channel backbone optimization. His current projects cover WLAN and WLAN
scan time is lower than using the Fast Sleep Scan. On high backbone optimization, network traffic management, deep packet
traffic load or during realtime communication the Fast inspection and high availability.
Sleep Scan should be used.
REFERENCES
[1] IEEE Standard for Information technology – Telecommunications and
information exchange between systems – Local and metropolitan area
networks – Specific requirements — Part 11: Wireless LAN Medium
Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE
Std 802.11™- 2007
[2] IEEE Standard for Information technology – Telecommunica-
tions and information exchange between systems – Local and
metropolitan area networks – Specific requirements — Part 11:
Wireless LAN Medium Access Control (MAC) and Physical
Layer (PHY) specifications Amendment 6: Medium Access
Control (MAC) Security Enhancements. IEEE Std 802.11i™-
2004.
[3] IEEE Standard for Information technology– Telecommunica-
tions and information exchange between systems– Local and
metropolitan area networks– Specific requirements — Part 11:
Wireless LAN Medium Access Control (MAC) and Physical
Layer (PHY) Specifications—Amendment 2: Fast Basic Service
Set (BSS) Transition. IEEE Std 802.11r™-2008.
[4] IEEE Standard for Local and metropolitan area networks –Port-
Based Network Access Control. IEEE Std 802.1X™-2004.
[5] linux-2.6.19/drivers/net/wireless/atmel.c, Linux Kernel 2.6.19.
line 2722 to 2722.
[6] linux/drivers/net/wireless/ipw2200.c, Linux Kernel 2.6.19.
line 2722 to 2722.
[7] linux/drivers/net/wireless/wl3501 cs.c, Linux Kernel 2.6.19.
line 601 to 614 an line 739.
[8] Madwifi 0.9.4, http://madwifi.org. net80211/ieee80211 node.h
line 55 to 59 and net80211/ieee80211 scan sta.c line 526 to 527.
[9] H. Velayos and G. Karlsson. Techniques to reduce the IEEE
802.11b handoff time. Communications, 2004 IEEE International
Conference on, 7:3844 – 3848, June 2004.
Prof. Dr. rer. nat. Thomas Möbert studied Mathematics (with spe-
cialization operations research/mathematical optimization) at the
Leipzig University (Germany) in 1975 - 1980 . He gained his doctor's
degree (Dr. rer. nat.) in Nonlinear Dynamic Programming (optimiza-
tion) in 1986. In 1986-96 he was a assistant professor engaged in
implementation of algorithms in integer and network optimization
among other things. Since 1999 he has been a professor for Com-