The above and other objects, features and advantages of the present invention will be better understood from the following description, taken in conjunction with the accompanying drawings in which like reference numerals refer to like parts and in which:
The present invention provides methods, devices and systems for performing fast handoff of wireless service between access points of a wireless network.
In overview, the present invention relates to wireless communications devices or units and wireless communication systems. The former is often referred to as client stations (STAs), such as laptop, PDA, smart phone equipped with WLAN interface, and so on. The latter is often referred to as access points (APs) and the network behind them, which provides services such as video, voice and data communications to STAs. More particularly, various inventive concepts of the invention are embodied in STAs and access points as well as methods therein for providing a handoff of video, voice and data communications services between access points of a wireless network through neighbor group list assisted pre-break probing. Neighbor group list assisted pre-break probing is defined as such means by which the STA can use the information of neighbor group list to divide the time-consuming scanning process into multiple probing subphases, and probe a group of neighbor APs in a manner of active probing in each subphase while keeping the on-going communication.
The communication system and STAs of particular interest are those that may provide or facilitate short range communications capability normally referred to as WLAN capabilities, such as IEEE 802.11, Bluetooth, or HiperLAN and the like that preferably utilize orthogonal frequency division multiplex (OFDM), code division multiple access (CDMA), frequency hopping access technologies.
In such a system, for providing high user capacity within a limited spectrum, a plurality of access points are needed so as to form many low powered cells, each covering only a small portion of the service area. Due to the limited coverage of each cell, STA often moves into a different cell while a session is in progress, so a handoff process is needed to identify the next AP and transfer the on-going session. To enable STA handoff from the coverage of a serving AP to the coverage of another AP, the coverage of the two APs must be overlapped as shown in
The fundamental problem behind today's handoff mechanisms can be attributed to the fact that STA triggers a handoff event upon loss of connectivity or poor and unsustainable performance, and scanning takes most of the time of the communication disruption period.
When a STA is about to handoff, it has already been experiencing poor performance before breaking the current connection, and after breaking the current connection, it needs to scans all possible channels to collect information about neighbor APs. As illustrated in
When the RSSI of the serving AP turns lower than the threshold Thresbreak (the lowest RSSI value with which STA can maintain communication), the STA triggers handoff, breaks the on-going connection and begins to scan neighbor APs. Thresbreak also indicates the border of the AP's coverage.
In the method of the invention, it is suggested that STAs should not wait until they lose connectivity or experience poor performance to seek alternative APs. In other words, STAs should be proactive, and not reactive to poor performance. The channel scanning, the scanning result evaluation and the best candidate AP selection should be accomplished before breaking the current connection. Therefore, if there exists a neighbor AP, which can provide better link quality than the serving AP, STA can always discover and connect with it before the STA's current link quality drops into a very poor status. Thus when the STA decides to perform handoff, the handoff only consists of breaking the current connection, switching the channel, making authentication and re-association with the new AP, so the handoff can be minimized.
To achieve the above object, the invention provides a new handoff method named neighbor group list assisted pre-break probing handoff as well as a related terminal. The method replaces the time-consuming channel scanning phase with multiple pre-break probing (PBP) subphases, and performs these PBP subphases without breaking the current connection.
The impact on current data traffic caused by each PBP subphase is minimized by neighbor group list assisting, unicast probing, buffering in STA and serving AP.
The serving AP measurement unit 301 is used for measuring the signal quality of the current serving AP for the STA 300. The neighbor group list unit 303 is used for building a neighbor group list. In the neighbor group list, possible neighbor APs are grouped into one or more groups. The neighbor APs belonging to the same group work on the same channel. The neighbor group list unit 303 may set a maximum group size Max_group according to the particular situation such that the number of the neighbor APs of each group in the neighbor group list is not greater than that predetermined value.
STA may build the neighbor group list by use of information of neighbor APs derived through various ways. For example, STA may perform overlapped channel scanning to derive information of neighbor APs. In this case, the neighbor group list unit 303 may comprise means for performing overlapped channel scanning to derive information of neighbor APs (not shown). APs may record STAs' past movement and handoff history, and derive information of neighbor APs or build the neighbor group list from such history data, and then STA may receive information of neighbor APs from a serving AP. In this case, the neighbor group list unit may comprise means for receiving information of neighbor APs from the serving AP (not shown). In one embodiment, information of neighbor APs received from the serving AP may be a list including at least the working channel and BSSID of each neighbor AP.
Referring back to
Then, based on the signal qualities of the serving AP and neighbor APs obtained by the serving AP measurement unit and the pre-break probing unit, the handoff unit 304 selectively performs handoff.
It should be appreciated that, although not shown, STA may comprise any other known components, e.g., display means such as liquid crystal display for displaying information, user input means such as keypad, buttons, microphone and the like, interface meaning such as WLAN card and so on, the detailed descriptions of which are omitted herein.
First, the STA initiates a connection and associates with an AP (step S501). After associating or re-associating with the AP, the STA gets information of the possible neighbor APs of the current serving AP, and groups, according to the channels and a predetermined maximum group size, the possible neighbor APs to build a neighbor group list (step S502). Then, the STA periodically measures the signal quality (RSSI) of the serving AP (step S503) to decide when to perform PBP operation (step S504). After the RSSI of the serving AP drops below than the Thresprobe (as shown in
After the STA associates or re-associates with an AP, it continuously samples the RSSI of the serving AP, and calculates its moving average value (RSSIcurr). The STA may always search for the best neighbor AP by using PBP. However, it is preferable that only when it is necessary to prepare for handoff, that is, RSSIcurr falls below Thresprobe, STA begins to perform the PBP operation. Thresprobe indicated by the dash line in
In PBP status, because the STA has no knowledge of the exact beacon time of neighbor APs, it still uses active discovery process—probing to scan APs.
RSSI
best
−RSSI
curr>Δ (1)
the STA chooses the best neighbor AP as the candidate AP to connect. Based on the select candidate AP, STA breaks the connection with serving AP and makes the authentication and re-association with the best neighbor AP, so the total latency of handoff process just consists of three parts: channel switch and transmission (CS&T), authentication (tauth) and re-association (tassoc).
t
handoff
=CS&T+tauth+tassoc (2)
CS&T is an inherent value (about 5-7 ms) for a WLAN card. Authentication is required to validate the STA's right to use a particular access point, and with opening system, the authentication (tauth) takes about 3-5 ms to finish. tassoc is the time used by the STA to rebuild association relationship with a new AP, and costs about 3-5 ms. Therefore with PBP algorithm, the total handoff latency can be cut down to less than 20 ms.
In each PBP subphase, the STA must pause its current communication with the serving AP, switch channels, performing probing task and then switch back. The time used for a PBP subphase (PBP_delay) is:
PBP_delay=2*CS&T+Probe_time (3)
where Probe_time is the time STA use to send probe requests and wait the probe responses.
To reduce the short term fading effects of signal, multiple periodic probing must be formed for the same AP, and then by calculating the average value of RSSI samples, the best AP can be chosen. If the moving average of n RSSI samples for an AP can provide a reliable and stable estimate of the AP's signal quality, and STA needs m PBP subphases to complete a fully probing for all neighbor APs, the STA should complete at least n*m PBP subphases before calculating and selecting the best AP to connect.
PBP_time=n*m *PBP_delay (4)
The interval for data traffic between two consecutive PBP subphases is data_int, and the total time used for data traffic from tbegin to tselect is
traffice_time=n*m*data_int=(tbegin−tselect)−PBP_time (5)
As can be seen from
(1) reducing data throughput when STA is in PBP mode;
(2) adding delay jitter to data traffic arriving in PBP subphases;
(3) causing packet loss for UDP traffic arriving in PBP subphases; and
(4) increasing CPU load due to too many PBP subphases.
In view of this, the method of the invention employs a neighbor group list to reduce the number of neighbor APs to be probed, so m can be reduced. In addition, with the neighbor group list, unicast probe request may be used to shorten PBP_delay.
The simplest method to divide channel scanning phase into multiple PBP subphases is to scan one or several channels in each subphase. In each subphase, STA switches itself into a probing channel, sends broadcasting probe requests, waits probe responses for a special interval, and then switches back. However, this method presents such disadvantages:
(1) scanning all neighbor APs needs too many PBP subphases, for example 11 subphases for 802.11b/g and over 20 subphases for 802.11a;
(2) even in the case that there is no neighbor AP in a certain channel, STA still needs to employ a PBP subphase to scan the channel; and
(3) with broadcasting probe request, STA has to wait in the channel for maximum channel time (MaxChannelTime), even if there is only one neighbor AP in this channel.
In the method of the invention, a neighbor group list of serving AP is employed to reduce the number of necessary PBP subphases and the waiting time of each PBP subphase. The neighbor group list of an AP keeps the records of its neighbor APs, and each record includes at least a first field identifying a neighbor AP (usually MAC address or BSSID of the AP) and a second field identifying the neighbor AP's operation channel. Information of the neighbor APs can be built by the serving AP, the backbone infrastructure behind the serving AP (such as an Ethernet switch, a special server and so on) or even the STA itself. The methods to built neighbor group list include manual pre-configuration, recording the STAs' past movement and handoff history, scanning by STA and future protocol standard—802.11k, and so on.
With a neighbor group list, the set of channels on which neighbor APs are operated and the set of neighbor APs on each of such channels can be obtained by STA before PBP phases. According to Reference 8, using information of neighbor APs, the number of neighbors that needs to be probed can be dropped to 3.15 on average with a maximum of 6 while the average neighbor channel count is 2.25. Thereby, STA only needs to probe these channels and APs.
In order to remove the requirement of modification for APs and the network behind APs, a new method—overlapped channel detecting is used for STA to get information of neighbor APs and build neighbor group list by itself. After associating with an AP, the STA performs several neighbor AP detecting subphases. In each of these subphases, the STA chooses to a channel to broadcast a probe request. With the probe request, APs in the same channel and overlapped channels will send back probe response. Although the STA cannot tell the right signal quality of an AP in the overlapped channel, it still can get information of the AP such as the BSSID and the working channel. The information can be used by STA to build the neighbor group list of its serving AP. For example, assuming that the STA broadcasts a probe request in channel 3, it can get information of APs working in channel 1, 2, 3, 4, and 5. Thereby, the STA can get information of the BSSIDs and the working channels of all neighbor APs by using 3 subphases. The interval between two neighbor AP detecting subphases still keeps for data traffic.
After getting the information of neighbor APs, the STA groups the neighbor APs according to the working channels of the neighbor APs so as to build a neighbor group list. In addition, if there are multiple neighbor APs in the same channel, the number of neighbor APs in each group is further limited by a maximum group size—Max_group. The grouping and the maximum group size are used to make assure that every PBP subphases will not cost too much time, and enough time is preserved for data traffic.
With the neighbor group list, STA in PBP status can clearly be informed of the exact identities and channel of APs in each group, so it can use unicast probe request to scan the corresponding neighbor AP, instead of broadcast probe request. With unicast probe request, the probe response from the probed AP will not be deferred by other APs' responses, and STA has not to wait for the maximum channel time MaxChannelTime in each PBP subphase.
It should be noted that during each PBP subphase, although STA can't keep communication with its serving AP, there is still inbound traffic from the serving AP and outbound traffic from upper layer application. If no buffer in the serving AP and the STA, PBP subphase may cause packet loss. Especially, packet loss for outbound traffic during PBP subphase can cause the data rate dropped for the succeeding data interval. To avoid these situations, data buffer means is provided according one embodiment of the invention.
With these measures, PBP subphase can be that as shown in
With grouping and unicast probe request, the time occupied by a PBP subphase is
PBP_delay=2*CS&T+Max_group*Uni_Probe_time (6)
where Uni_Probe_time is the time between sending unicast probe request and receiving the probe response. In a test, Uni_Probe_time is about 5 ms and Max_group is set to 2, so a PBP subphases takes less than 20 ms. If the period of PBP subphase is set to 100 ms, data traffic will take 80 ms to be transmitted in every 100 ms, which puts less impact on throughput and latency of data packets.
According to this method of the invention, a higher threshold (denoted by Thresprob) is employed to trigger the PBP phase, to ensure that STA has enough time to accomplish the whole PBP phase before breaking the current connection due to the deteriorated signal. However, the higher threshold may lead to more PBP subphases, which will influence the performance of data traffic and increase the load for CPU. To reduce this influence, a new signal threshold Thresfast (Thresfast<Thresprobe) and an adaptive algorithm are adopted in one embodiment of the invention to dynamically adjust the probing frequency for a neighbor AP according to its signal quality. In this case, the pre-break probing unit of STA may comprises scan frequency adjusting means.
In particular, STA performs slow probing for a neighbor AP if the neighbor AP's RSSI (RSSInet) and the serving AP's RSSI (RSSIcurr) meet the following condition in PBP subphase:
RSSI
curr
−RSSI
net>Thresfast (7)
The interval between adjacent PBP subphases of slow probing is longer than that of fast probing, so unnecessary PBP subphases are reduced further.
In summary, according to the invention, the time-consuming channel scanning phase in the standard 802.11 handoff process is replaced with multiple PBP subphases, and these subphases are performed before the current connection is broken. With this method, the handoff latency of the 802.11 protocol can be reduced to less than 20 milliseconds.
In addition, the impact of PBP subphases on data traffic is minimized by adopting neighbor group list assistance, unicast probe request and buffering mechanism (PSM mode in serving AP and buffer in STA). Thereby, the packet loss in PBP subphase is eliminated, and the latency jitter added to data packets in PBP subphases is also minimized to less than 20 ms.
The elements of the invention may be implemented in hardware, software, firmware or a combination thereof and utilized in systems, subsystems, components or sub-components thereof. When implemented in software, the elements of the invention are programs or the code segments used to perform the necessary tasks. The program or code segments can be stored in a machine-readable medium or transmitted by a data signal embodied in a carrier wave over a transmission medium or communication link. The “machine-readable medium” may include any medium that can store or transfer information. Examples of a machine-readable medium include electronic circuit, semiconductor memory device, ROM, flash memory, erasable ROM (EROM), floppy diskette, CD-ROM, optical disk, hard disk, fiber optic medium, radio frequency (RF) link, etc. The code segments may be downloaded via computer networks such as the Internet, Intranet, etc.
Although the invention has been described above with reference to particular embodiments, the invention is not limited by the above particular embodiments and the specific configurations shown in the drawings. For example, some components as shown may be combined with each other as one component, or one component may be divided into several subcomponents, or any other known component may be added. The operation processes are also not limited to those shown in the examples. Those skilled in the art will appreciate that the invention may be implemented in other particular forms without departing from the spirit and substantive features of the invention. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive. The scope of the invention is indicated by the appended claims rather than by the foregoing description, and all changes that come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Number | Date | Country | Kind |
---|---|---|---|
200610126191.1 | Sep 2006 | CN | national |