WiFi seamless switching method based on neighbor graph algorithm

Abstract

The invention discloses a WiFi seamless switching method based on a neighbor graph algorithm. The method comprises the steps of building a neighbor graph, selecting a target AP through two-stage decision making, and switching to the target AP, wherein information in the neighbor graph mainly comprises an AP mark, the AP position, a working channel, BSSID, a load, the maximum flow and the Qos level, the first-stage decision making greatly shortens time needed by scanning, and the second-stage decision making is used for selecting the target AP; after the AP is selected, adopting a resource restoring mode for rapid switching. Due to the fact that existing information in the neighbor graph is utilized in the scanning process, the number of scanning channels is decreased, the time for scanning each channel is shortened, and the scanning speed is greatly increased; meanwhile, due to the fact that the number of detection response frames is decreased, the bandwidth needed by scanning is decreased, and the method has a great help to improve the network performance; in addition, the method is tightly combined with an existing 802.11r protocol, and the method is easy to deploy and implement.

Description

technical field [0001] The invention belongs to the technical field of communication, and more specifically relates to a WiFi seamless switching method based on a neighbor graph algorithm. Background technique [0002] Recently, the demand for WiFi (Wireless Fidelity) has increased significantly, and Internet giants have entered the commercial WiFi field in the form of WiFi application platforms. Commercial WiFi is usually deployed by a company, and all related APs (AccessPoints) have the same SSID (ServiceSetIdentifier), that is, they all belong to the same ESS (ExtendedService), and they can all switch WiFi, and the switching speed is closely related to user experience. [0003] The seamless switching of WiFi includes three processes of scanning, authentication, and reconnection; the speed of scanning and authentication determines the speed of WiFi switching. For now, scanning accounts for more than 90% of the time of WiFi switching, which has become an influence on user r...

AI Technical Summary

Problems solved by technology

[0006] The selective neighbor caching mechanism is an improvement on the above neighbor graph algorithm. This mechanism specifies the forwarding threshold in advance. When the STA needs to forward the context to the neighbor AP, it only forwards the context to the AP whose handover probability is higher than the forwarding threshold. Under this mechanism, When a STA moves to an AP whose handover probability is lower than the forwarding threshold, the buffer miss problem will occur and the scanning delay will be increased.

[0007] Scanning methods in the prior art include Tunning, ChannelMask, SyncScan, MultiScan, AFHA (Adaptive Fast Handoff Algorithm); information, there will always be redundant processing, which increases the scanning delay

Images