CN111954293B

CN111954293B - Data synchronization method, network connection method, device and wireless access point

Info

Publication number: CN111954293B
Application number: CN201910406513.5A
Authority: CN
Inventors: 邓高亮; 廖小猛; 李林峰; 陈源
Original assignee: Alibaba Group Holding Ltd
Current assignee: Alibaba Group Holding Ltd
Priority date: 2019-05-16
Filing date: 2019-05-16
Publication date: 2023-03-31
Anticipated expiration: 2039-05-16
Also published as: CN111954293A

Abstract

The embodiment of the application provides a data synchronization method, a network connection device and a wireless access point. If a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of a roaming group to which the AP belongs, determining that the AP has a neighbor relation with the other AP, and synchronizing roaming cache data to a first neighbor AP having the neighbor relation if any AP obtains roaming cache data of a terminal; through the synchronization of the roaming cache data of the embodiment of the application, other APs also have the roaming cache data, when the terminal requests to access, the terminal authentication is not needed to be carried out on the terminal, the connection can be quickly established, and the purpose of quick roaming is achieved.

Description

Data synchronization method, network connection method, device and wireless access point

Technical Field

The embodiment of the application relates to the technical field of networks, in particular to a data synchronization method and device, a network connection method and device, and a wireless access point.

Background

Wireless roaming refers to a process in which a Wireless terminal disconnects from one AP (Wireless Access Point) and connects to another AP to maintain uninterrupted network connection. Wireless roaming can be realized in a Wireless local area network formed by networking based on a traditional thin AP + AC (Wireless Access Point Controller) and a Wireless local area network formed by forming based on a cloud AP.

The cloud AP is a new and emerging line of sight along with the development of technologies such as cloud computing and big data analysis, and needs to be used in cooperation with a cloud management network platform (cloud platform for short). Traditional thin APs only reserve wireless access function, roaming between the thin APs needs to be scheduled through an AC, and the cloud AP can realize functions with very high timeliness requirements of small parts of the AC, such as a wireless roaming function, so that roaming between the cloud APs does not need to be processed through a cloud platform.

As can be seen from the above description, although wireless roaming between cloud APs does not need to be processed by a cloud platform, network operation efficiency can be improved, but when wireless roaming cannot be performed between thin APs, roaming cache data related to successful authentication of a terminal in an AC can be used, so that terminal authentication does not need to be performed again.

Disclosure of Invention

The embodiment of the application provides a data synchronization method, a relationship establishment method, a network connection method, a device and a wireless access point, and aims to solve the technical problem of low wireless roaming efficiency in the prior art.

In a first aspect, an embodiment of the present application provides a data synchronization method, including:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a first neighbor wireless Access Point (AP) with a level 1 neighbor relation;

if a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of the roaming group to which the AP belongs, it is determined that the AP has a level 1 neighbor relationship with the other AP.

In a second aspect, an embodiment of the present application provides a method for establishing a relationship, including:

the first AP scans broadcast information sent by the second AP;

determining whether the second AP and the second AP are in the same roaming group or not according to the roaming group identification in the broadcast information;

determining to have a level 1 neighbor relationship with the second AP if the second AP is in the same roaming group;

the APs with the level 1 neighbor relation synchronize roaming cache data stored in the APs with each other.

In a third aspect, an embodiment of the present application provides a data synchronization method, including:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation; i =1 and 2 \8230, M is a positive integer more than or equal to 2;

if a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of a roaming group to which the AP belongs, determining that the AP has a level 1 neighbor relation with the other AP, and determining that another AP having a level j neighbor relation with the other AP has a level j +1 neighbor relation; wherein j is more than or equal to 1.

In a fourth aspect, an embodiment of the present application provides a relationship establishing method, including:

the first AP scans broadcast information sent by the second AP;

judging whether the second AP and the second AP are in the same roaming group or not according to the roaming group identification in the broadcast information;

determining a third AP having a j-level neighbor relationship with the second AP;

determining that there is a j +1 level neighbor relationship with the third AP; wherein j is more than or equal to 1;

the APs with neighbor relation synchronize roaming cache data stored in each AP with each other.

In a fifth aspect, an embodiment of the present application provides a network connection method, including:

receiving a network connection request sent by a terminal;

searching whether roaming cache data of the terminal exist or not; the roaming cache data is synchronized by any neighbor AP with neighbor relation;

and responding to the search result of the roaming cache data of the terminal, determining that the terminal is successfully authenticated and establishing network connection with the terminal.

In a sixth aspect, an embodiment of the present application provides a data synchronization apparatus, including:

the first acquisition module is used for acquiring roaming cache data of the terminal;

the first synchronization module is used for synchronizing the roaming cache data to a first neighbor wireless Access Point (AP) with a level 1 neighbor relation;

In a seventh aspect, an embodiment of the present application provides a relationship establishing apparatus, including:

the first scanning module is used for scanning broadcast information sent by the second AP;

a first group determining module, configured to determine whether the AP and the second AP are in the same roaming group according to a roaming group identifier in the broadcast information;

a first relationship establishing module, configured to determine that there is a level 1 neighbor relationship with the second AP if the first AP and the second AP are in the same roaming group;

In an eighth aspect, an embodiment of the present application provides a data synchronization apparatus, including:

the second acquisition module is used for acquiring roaming cache data of the terminal;

a second synchronization module, configured to synchronize the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i =1, 2 \8230, M is a positive integer greater than or equal to 2;

In a ninth aspect, an embodiment of the present application provides an apparatus for establishing a relationship, including:

the second scanning module is used for scanning the broadcast information sent by the second AP;

a second group determining module, configured to determine whether the AP and the second AP are in the same roaming group according to a roaming group identifier in the broadcast information;

a second relationship establishing module, configured to determine that there is a level 1 neighbor relationship with the second AP if the second AP is in the same roaming group;

a relationship determination module for determining a third AP having a j-level neighbor relationship with the second AP;

a third relationship establishing module, configured to determine that there is a j + 1-level neighbor relationship with the third AP; wherein j is more than or equal to 1;

In a tenth aspect, an embodiment of the present application provides a network connection apparatus, including:

the request receiving module is used for receiving a network connection request sent by a terminal;

the cache searching module is used for searching whether roaming cache data of the terminal exist or not; the roaming cache data is synchronized by any neighbor AP with neighbor relation;

and the connection establishing module is used for responding to the search result of the roaming cache data of the terminal, determining that the terminal is successfully authenticated and establishing network connection with the terminal.

In an eleventh aspect, an embodiment of the present application provides a wireless access point, including a processing component and a storage component;

the storage component stores one or more computer instructions; the one or more computer instructions to be invoked for execution by the processing component;

the processing component is to:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a first neighbor AP having a level 1 neighbor relationship;

if a roaming group identifier in broadcast information sent by scanning another AP is the same as a roaming group identifier of a roaming group to which the AP belongs, the AP determines that the AP has a level 1 neighbor relationship with the other AP.

In a twelfth aspect, an embodiment of the present application provides a wireless access point, including a processing component and a storage component;

the processing component is to:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i =1, 2 \8230, M is a positive integer greater than or equal to 2;

In the embodiment of the application, if a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of the roaming group to which the AP belongs, it is determined that the AP has a neighbor relation with the other AP, so that if the AP acquires roaming cache data of a terminal, the roaming cache data is stored, and the roaming cache data is synchronized to a first neighbor AP having a neighbor relation; therefore, the AP only needs to synchronize the roaming cache data to the neighbor AP without synchronizing to all the APs in the roaming group, the synchronization operation is simplified, other APs also have the roaming cache data through the synchronization of the roaming cache data, when the terminal requests to access, the terminal does not need to be authenticated again, the connection can be quickly established, the purpose of quick roaming is realized, and therefore the wireless roaming efficiency is improved.

These and other aspects of the present application will be more readily apparent from the following description of the embodiments.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following descriptions are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.

FIG. 1 is a flow chart illustrating one embodiment of a data synchronization method provided herein;

FIG. 2 is a flow chart illustrating an embodiment of a method for establishing relationships provided herein;

fig. 3 shows a signaling flow diagram of implementing wireless roaming of a terminal in a practical application according to an embodiment of the present application;

FIG. 4 is a flow chart illustrating a further embodiment of a data synchronization method provided herein;

FIG. 5 is a flow chart illustrating a further embodiment of a method for relationship establishment as provided herein;

FIG. 6 is a flow chart illustrating one embodiment of a network connection method provided herein;

FIG. 7 is a schematic diagram illustrating an embodiment of a data synchronization apparatus provided in the present application;

fig. 8 is a schematic structural diagram illustrating an embodiment of a relationship establishing apparatus provided in the present application;

FIG. 9 is a schematic diagram illustrating a data synchronization apparatus according to another embodiment of the present application;

FIG. 10 is a schematic diagram illustrating a relationship establishing apparatus according to another embodiment of the present application;

FIG. 11 is a schematic diagram illustrating an embodiment of a network connection device provided herein;

fig. 12 is a schematic structural diagram illustrating an embodiment of a wireless access point provided in the present application;

fig. 13 is a schematic structural diagram illustrating an embodiment of a wireless access point provided in the present application.

Detailed Description

In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.

In some of the flows described in the specification and claims of this application and in the above figures, a number of operations are included that occur in a particular order, but it should be clearly understood that these operations may be performed out of order or in parallel as they occur herein, the order of the operations being 101, 102, etc. merely to distinguish between various operations, the order of which does not itself denote any order of performance. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first", "second", etc. in this document are used for distinguishing different messages, devices, modules, etc., and do not represent a sequential order, nor limit the types of "first" and "second" to be different.

The technical scheme of the embodiment of the application is mainly suitable for an application scene of Wireless roaming between cloud APs (Wireless Access points). Wireless roaming refers to the process of a wireless terminal disconnecting from one AP and connecting to another AP to maintain an uninterrupted network connection.

As is well known, an AP is a network device used in establishing a wireless local area network, and is equivalent to a bridge connecting a wired network and a wireless network, and is mainly used to connect a terminal of the wireless network to the wired network. At present, there are mainly fat APs that can work independently, thin APs controlled by an AC (Wireless Access Point Controller), and cloud APs based on a cloud management network platform.

At present, wireless roaming can be realized for both a thin AP and a wireless local area network established by a cloud AP, and in some scenarios, particularly for enterprise application scenarios, 802.1x authentication needs to be performed on an access terminal.

For the thin AP, the thin AP can not work independently, the AC carries out scheduling management, and the terminal authentication is finished by triggering of the AC, so that the AC can cache relevant information of the terminal authentication, also called roaming cache data.

For the cloud AP, the terminal authentication is performed by the cloud AP, when the terminal is switched from one AP to another AP in the wireless roaming, the other AP needs to perform the terminal authentication again to establish the connection due to the fact that the other AP does not have roaming cache data related to the terminal authentication, which may affect the wireless roaming efficiency, and the 802.1x authentication usually consumes a long time, which may also affect the network connection of the terminal.

In order to realize the fast roaming of the terminal among the cloud APs, the inventor thinks that a plurality of cloud APs capable of realizing the wireless roaming are considered as being in the same roaming group, when the terminal accesses a certain cloud AP, the roaming cache data is generated based on the relevant information of the terminal authentication and the like, and the cloud AP synchronizes the roaming cache data to other cloud APs in the same roaming group respectively, so that when the terminal switches to another AP, if the roaming cache data of the terminal is stored in another AP, the connection with the terminal can be directly established without authenticating the terminal, thereby realizing the fast roaming purpose.

In order to implement fast roaming and simplify data synchronization operations, the inventors have further studied and proposed a technical solution of an embodiment of the present application, in the embodiment of the present application, if a roaming group identifier in broadcast information sent by an AP is scanned by the AP and is the same as a roaming group identifier of a roaming group to which the AP belongs, it is determined that the AP has a neighbor relationship with the other AP, so that if the AP acquires roaming cache data of a terminal, the roaming cache data is stored, and the roaming cache data is synchronized to a first neighbor AP having a neighbor relationship; therefore, the AP only needs to synchronize the roaming cache data to the neighbor AP without synchronizing to all the APs in the roaming group, the synchronization operation is simplified, other APs also have the roaming cache data through the synchronization of the roaming cache data, and when the terminal requests to access, the terminal does not need to be authenticated again, the connection can be established quickly, and the purpose of quick roaming is achieved.

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

Fig. 1 is a flowchart of an embodiment of a relationship establishing method provided in an embodiment of the present application, where the method may include the following steps:

101: the first AP scans for broadcast information sent by the second AP.

In the embodiment of the present application, the referred AP may specifically refer to a cloud AP.

The first AP and the second AP may refer to any one AP, and the "first" and the "second" are only for convenience of description, and any two APs are named as the first AP and the second AP, respectively, and do not indicate that any two APs have other relationships or the like.

The broadcast information may be broadcast and transmitted carried in beacon frames.

The broadcast information may carry a roaming group identifier of the roaming group to which the broadcast information belongs, and may also carry a network address, such as an IP address, of the second AP.

Based on the 802.11 protocol specification, the broadcast information may specifically be vendor information, and the roaming group identifier and the IP address are carried in the vendor information.

102: determining whether the second AP and the second AP are in the same roaming group or not according to the roaming group identification in the broadcast information; if yes, go to step 103, otherwise end the process.

In the embodiment of the present application, a roaming group identifier may be set for each roaming group, so that it may be determined that the first AP and the second AP are in the same roaming group by comparing whether the roaming group identifier in the broadcast information is the same as the roaming group identifier of the roaming group to which the first AP belongs.

103: determining to have a level 1 neighbor relationship with the second AP.

If the first AP and the second AP are in the same roaming group, it may be determined that the first AP and the second AP have a level 1 neighbor relationship. The first AP may record the second AP as a level 1 neighbor relationship.

Accordingly, each AP may determine each AP having a level 1 neighbor relationship with the AP according to the technical scheme shown in fig. 1.

Since the respective network coverage ranges of any two APs capable of implementing wireless roaming are at least partially overlapped, if the first AP can scan the broadcast information of the second AP, it indicates that the signal strength of the second AP is strong enough, and the network coverage range of the second AP may overlap with the network coverage range of the first AP. The terminal located in the network coverage area of the first AP also considers that the signal strength of the second AP is strong through signal scanning, and thus the terminal roams to the second AP.

Therefore, when a terminal connected to any AP performs wireless roaming, it is most likely to roam into the network coverage of any neighbor AP having a level 1 neighbor relationship with the any AP.

Therefore, in the embodiment of the present application, the APs having the level-1 neighbor relationship may mutually synchronize the respective roaming cache data stored therein, so that when the terminal roams from one AP to another AP, that is, requests another AP to establish a connection, the another AP is usually a neighbor AP of the AP, and since the roaming cache data of the terminal is stored, the connection may be established with the terminal without performing terminal authentication, thereby achieving the purpose of fast roaming.

In some embodiments, the broadcast information may further include a network address of the second AP;

after determining that the second AP has a neighbor relationship if the second AP is in the same roaming group, the method further includes:

saving the network address of the second AP;

wherein the network address of the second AP is used to send roaming cache data. That is, the first AP synchronizes the roaming cache data to the second AP based on the network address of the second AP.

Corresponding to the relationship establishing method shown in fig. 1, as shown in fig. 2, the method is a flowchart of an embodiment of a data synchronization method provided in the embodiment of the present application, where the embodiment is executed by any AP, and the method may include the following steps:

201: and acquiring roaming cache data of the terminal.

The terminal may refer to any terminal accessing a wireless local area network.

The roaming cache data may be generated based on terminal authentication related information of the terminal, and the roaming cache data may include a terminal identifier, authentication success time, an authentication session identifier, a key generated by authentication, and the like, where the terminal identifier may refer to an MAC address and may be used to uniquely identify the terminal, each time a terminal authentication process may be regarded as a session process, and the authentication session identifier is used to uniquely identify the terminal authentication process, and the like.

In addition, the roaming cache data can also comprise user information, and the wireless roaming is realized under the condition that the terminals are the same and the users are the same, so that the wireless roaming is realized under the condition that the users allow.

Optionally, after obtaining the roaming cache data, the AP stores the roaming cache data, so that after obtaining the roaming cache data of the terminal, the method may further include:

and storing the roaming cache data.

203: synchronizing the roaming cache data to a first neighbor AP having a level 1 neighbor relationship.

It should be noted that the first neighbor AP may refer to any AP having a level 1 neighbor relationship with the AP, and this application is only named as such for convenience of description.

That is, after each AP obtains roaming cache data, the roaming cache data may be synchronized to each neighbor AP having a level 1 neighbor relationship

The establishment of the level 1 neighbor relationship between APs may specifically refer to the embodiment shown in fig. 1, which will not be described herein again.

In this embodiment, after obtaining the roaming cache data of the terminal, the AP synchronizes the roaming cache data to only the first neighboring AP having the level 1 neighbor relationship, so that the data synchronization operation is simplified.

When the terminal performs wireless roaming, the terminal only roams to other APs around the current AP, and the neighbor AP in the level 1 neighbor relationship is the nearest AP, and may also roam to the neighbor AP of the neighbor AP, but not roam to the distant AP. Therefore, to further simplify the data synchronization operation, a survival coefficient may be set for the roaming cache data, and in some embodiments, the method may further include:

determining a survival coefficient of the roaming cache data; the initial value of the survival coefficient may be set to N, and when the terminal accesses a certain AP, the AP sets the survival coefficient value of the roaming buffer data of the terminal to N.

While synchronizing the roaming cache data to a first neighbor AP having a level 1 neighbor relationship, the method further comprises:

and sending the survival coefficient value obtained by subtracting 1 from the current value to the first neighbor AP.

As an optional manner, the obtaining roaming cache data of the terminal may include:

and under the condition that the terminal is successfully accessed, generating roaming cache data of the terminal according to the authentication information of the terminal.

That is, the roaming cache data may be generated when the terminal first accesses the AP.

After obtaining the roaming cache data, the first neighbor AP may also perform the method according to the technical scheme shown in fig. 2, and synchronize the roaming cache data to the neighbor AP of the first neighbor AP having the level 1 neighbor relationship.

As can be seen from the foregoing description, in order to further simplify the data synchronization operation, a cache coefficient may be set for the roaming cache data, and therefore, in some embodiments, the method may further include:

setting the survival coefficient initial value of the roaming cache data as N; wherein N is more than or equal to 1 and is a positive integer;

wherein, while synchronizing the roaming cache data to the first neighbor AP having a neighbor relation, the method may further include:

and the survival coefficient value obtained after subtracting 1 from the current value is sent to the first neighbor AP.

Or sending the current numerical value of the survival coefficient to a first neighbor AP, and informing the first neighbor AP to subtract 1 from the current numerical value to obtain the survival coefficient value and then storing the survival coefficient value, and the like.

If the survivability coefficient value stored by the first neighbor AP is equal to 0, the synchronized roaming cache data may be terminated.

Thus, in some embodiments, synchronizing the roaming cache data to the first neighbor AP having a level 1 neighbor relationship comprises:

and detecting that the survival coefficient value of the roaming cache data is greater than 0, and synchronizing the roaming cache data to a first neighbor AP with a level 1 neighbor relation.

In one implementation, N may be specifically equal to 2. The survival coefficient may be represented by TTL (Time To Live), where TTL = N is set when the terminal first goes online in the wireless lan.

In some embodiments, synchronizing the roaming cache data to the first neighbor AP having a level 1 neighbor relationship comprises:

judging whether the first neighbor AP is a newly-added neighbor AP or not;

if yes, synchronizing roaming cache data corresponding to different terminals with survival coefficient values larger than 0 to the first neighbor AP;

if not, synchronizing the roaming cache data of the terminal to the first neighbor AP.

That is, if the first neighbor AP is a new neighbor AP, that is, a level 1 neighbor relationship is newly established with the AP, and roaming cache data of any terminal is not synchronized, roaming cache data corresponding to different terminals having a survival coefficient value greater than 0 are all synchronized to the first neighbor AP at this time; otherwise, only the obtained roaming cache data of the terminal is synchronized to the first neighbor AP.

As another optional manner, the obtaining roaming cache data of the terminal includes:

and receiving roaming cache data of the terminal, which is transmitted by the second neighbor AP with the level 1 neighbor relation. That is, the roaming cache data may be synchronized by a second neighbor AP of the AP, and since the second neighbor AP already stores the roaming cache data, the first neighbor AP may be different from the second neighbor AP, so as to reduce the number of synchronization times, and the like. Wherein the first neighbor AP and the second neighbor AP do not necessarily have a level 1 neighbor relationship.

The roaming cache data may then be saved.

It should be noted that the second neighbor AP may refer to any AP having a level 1 neighbor relationship with the AP, and this application is only so named for convenience of description.

As can be seen from the above description, the roaming cache data may have a survival coefficient.

Thus, in certain embodiments, the method may further comprise:

receiving a survival coefficient value of the roaming cache data sent by the second neighbor AP;

the storing the roaming cache data comprises:

judging whether roaming cache data of the terminal and a corresponding survival coefficient value are stored or not;

if so, updating the stored survival coefficient value with the received survival coefficient value if the received obtained survival coefficient value is greater than the stored survival coefficient value; otherwise, discarding the received survival coefficient value;

if not, the roaming cache data and the survival coefficient value thereof obtained by receiving are saved.

The second neighbor AP sends a survival coefficient value that is greater than the one that the AP already stored, indicating that the terminal has a reduced distance from the AP and is likely to roam to the AP, or other neighbor APs of the AP, that needs to update the survival coefficient value.

That is, if the AP already stores the roaming buffer data of the terminal, the AP finally stores the maximum survivability coefficient value therein according to the received survivability coefficient value and the stored survivability coefficient value.

In certain embodiments, the method may further comprise:

Of course, the current value of the survival coefficient may be sent to the first neighbor AP, and the first neighbor AP is notified to save the survival coefficient value obtained by subtracting 1 from the current value.

In some embodiments, the synchronizing the roaming cache data to the first neighbor AP having a neighbor relation comprises:

judging whether the survival coefficient value of the roaming cache data is greater than 0 or not;

if yes, synchronizing the roaming cache data to a first neighbor AP with a neighbor relation;

if not, the roaming cache data is stopped synchronizing.

To avoid the synchronization operation from being triggered to be executed all the time, the synchronization operation is simplified, if the survival coefficient value of the roaming cache data is not greater than 0, the AP stops synchronizing the roaming cache data until the survival coefficient value of the roaming cache is updated to be greater than 0.

In certain embodiments, the method may further comprise:

and when the terminal is detected to be successfully accessed, updating the survival coefficient value of the roaming cache data to be N. To ensure that the roaming cached data can continue to be synchronized to the neighbor AP.

That is, when the access of the terminal is successful, the survivability coefficient value can be updated to be N, and if the survivability coefficient value is greater than 0, the AP can continue to synchronize the roaming cache data.

As can be seen from the above description, the values of the survival coefficients of the roaming cache data in the AP may be updated, and once the values are updated, the survival coefficients of the neighboring APs should be updated.

Thus, in certain embodiments, the method may further comprise:

detecting that a survival coefficient value of the roaming cache data is updated;

synchronizing the roaming cache data and the survival coefficient value obtained by subtracting 1 from the updated value to the first neighbor AP.

Of course, optionally, as yet another optional manner, the method may further include:

detecting that the survival coefficient value of the roaming cache data is updated;

and synchronizing the survival coefficient value obtained by subtracting 1 from the updated numerical value to the first neighbor AP so that the first neighbor AP can judge whether to update the survival coefficient value of the roaming cache data.

In order to improve network security, since the roaming cache data of the terminal may be saved after being acquired, in some embodiments, the method may further include:

judging whether the roaming cache data meet a first aging condition;

and if so, deleting the roaming cache data.

Wherein, the first aging condition may mean that the storage time length is longer than the first aging time length.

Optionally, a timer with a first aging duration may be set for the roaming cache data, and the roaming cache data may be deleted if the timer expires.

To improve network security, in some embodiments, the method may further comprise:

judging whether the level 1 neighbor relation with the first neighbor AP meets a second aging condition or not;

and if so, deleting the neighbor relation with the first neighbor AP.

The second aging condition may be that the beacon frame of the first neighbor AP is not scanned within a second aging duration after the level 1 neighbor relationship is established.

After the level 1 neighbor relationship with the first neighbor AP is established, a timer with a second aging duration may be set for the level 1 neighbor relationship, if the beacon frame of the first neighbor AP is not scanned even after the timer expires, the neighbor relationship of the first neighbor AP is deleted, and if the beacon frame of the first neighbor AP is scanned within the time limit of the timer, the timer may be reset to restart countdown.

In addition, after deleting the neighbor relation with the first neighbor AP, the method may further include:

and deleting the roaming cache data synchronized with the first neighbor AP.

For convenience of understanding, the technical solution of the present application is now illustrated, and it is assumed that the survival coefficient is represented by TTL, and TTL =2 is used when a terminal first comes on line, where the terminal first comes on line refers to first accessing a wireless local area network.

Suppose that a terminal first accesses a certain wireless access point online, denoted by AP1, the neighbor AP hypothesis with level 1 neighbor relation of AP1 includes AP2 and the neighbor AP hypothesis with level 1 neighbor relation of AP0 and AP2 includes AP3, and the neighbor AP hypothesis with level 1 neighbor relation of AP3 includes AP4.

It should be noted that, each AP performs the same synchronization operation for each neighbor AP, and in the embodiment of the present application, one neighbor is often used as an example for description, so as to facilitate description.

The signaling flow diagram for implementing wireless roaming of the terminal is described with reference to fig. 3.

After receiving the beacon frame (1) carrying the broadcast information, the AP2 determines that the beacon frame and the AP1 belong to the same roaming group based on the roaming group identifier in the broadcast information, and then the AP2 records that the AP1 is a neighbor (2) having a level 1 neighbor relationship.

Similarly, AP1 receives beacon frame (3) carrying broadcast information by AP2, and records AP2 as neighbor with level 1 neighbor relation (4); the AP3 receives a beacon frame (5) carrying broadcast information by the AP2, and records that the AP2 is a neighbor with a level 1 neighbor relation (6); the AP2 receives a beacon frame (7) carrying broadcast information by the AP3, and records that the AP3 is a neighbor (8) with a level 1 neighbor relation; AP4 receives beacon frame (9) carrying broadcast information by AP3, and records AP2 as neighbor (10) with level 1 neighbor relation; and the AP3 receives a beacon frame (11) carrying broadcast information by the AP4, records that the AP4 is a neighbor (12) with a level 1 neighbor relation, and the like.

Assuming that the terminal firstly accesses to the AP1 online, the AP1 generates and stores roaming cache data, and sets TTL =2 of the roaming cache data (13).

After that, AP1 synchronizes the roaming buffer data and TTL =1 to AP2 (14); AP2 saves the roaming buffer data and determines TTL =1 (15).

AP2 synchronizes the roaming buffer data and TTL =0 to AP3 (16); AP3 saves the roaming buffer data and determines TTL =0 (17). Because the roaming cache data is sent by the AP1, the AP1 may not repeat synchronization even if it is in a level 1 neighbor relationship with the AP 2.

Since TTL =0, AP3 only holds roaming cache data and does not continue to synchronize to AP4.

At this time, if a new neighbor AP0 having a level 1 neighbor relationship exists in the AP1, that is, the AP0 powers on and transmits a beacon frame (18) carrying broadcast information, and after the AP1 determines that the AP0 and the new neighbor AP0 belong to the same roaming group, the AP0 is recorded as a neighbor having a level 1 neighbor relationship (19).

At this time, the AP1 may synchronize all roaming cache data with TTL greater than 0 to the AP0, and synchronize TTL values obtained by subtracting 1 from the current TTL values of the respective roaming cache data to the AP0 (20).

In addition, in order to improve network security, a timer may be set after establishing the level 1 neighbor relationship, if the timer is overtime, the level 1 neighbor relationship may be deleted, and if the timer of the level 1 neighbor relationship with the AP0 is overtime in fig. 3, the level 1 neighbor relationship (21) with the AP0 is deleted, at this time, the roaming cache data synchronized with the AP0 may also be deleted.

If the terminal roams to the AP2, since the AP2 stores the roaming cache data of the terminal, the terminal does not need to be authenticated, and the network connection can be directly established with the terminal.

Therefore, if the AP2 receives the access request of the terminal, it may inquire whether the roaming cache data exists, and if so, may directly establish a network connection with the terminal, and at this time, update TTL =2 of the roaming cache data (22).

Since the TTL of the roaming cache data is updated, data synchronization may be continued at this time, that is, the roaming cache data and TTL =1 are synchronized to AP3 (23). And synchronizing the roaming cache data and TTL =1 to AP1 (24);

because the roaming cache data of the terminal is stored, the AP1 may compare the locally stored TTL with the TTL synchronized with the AP2, and because the local TTL =2 and the TTL =1 synchronized with the AP2 are larger, the current synchronization data may be ignored at this time (25).

And the AP3 also stores the roaming cache data of the terminal, at this time, the locally stored TTL and the TTL synchronized with the AP2 can be compared, and since the local TTL =0, and the TTL =1 synchronized with the AP2, the local TTL =1 is updated (26).

At this time, in AP3, the TTl of the roaming buffer data is updated to 1, and if it is greater than 0, the roaming buffer data and TTl =0 to AP4 can be synchronized (27)

AP4 stores the roaming buffer data and TTL =0 (28), since TTL is equal to 0, synchronization of the roaming buffer data is stopped.

In order to improve data security, a timer may be set for the roaming cache data when the roaming cache data is stored, and the roaming cache data may be deleted if the timer is overtime, or the roaming cache data that is overtime may be deleted if the timer of the roaming cache data stored by AP1 is overtime as shown in fig. 3 (29).

In the embodiments shown in fig. 1 to fig. 3, an AP will synchronize roaming cache data to another AP with level 1 neighbor relation only, and then another AP will continue to synchronize roaming cache data to another AP with level 1 neighbor relation.

As another possible implementation scenario, one AP may maintain neighbor relations of multiple levels, so that one AP may send the neighbor APs of neighbor relations of each level, respectively, to further simplify the synchronization operation.

As shown in fig. 4, a flowchart of another embodiment of a method for establishing a relationship provided in the embodiment of the present application may include the following steps:

401: the first AP scans for broadcast information sent by the second AP.

Optionally, the broadcast information may include a roaming group identifier, and may further include a network address of the second AP, where the network address of the second AP is used to send roaming cache data.

402: judging whether the second AP is positioned in the same roaming group or not according to the roaming group identification in the broadcast information; if so, go to step 403, otherwise, end the process.

403: determining that there is a level 1 neighbor relationship with the second AP.

404: determining a third AP having a j-level neighbor relationship with the second AP.

405: determining that there is a j +1 level neighbor relationship with the third AP; wherein j is more than or equal to 1;

it should be noted that the first AP, the second AP, and the third AP may refer to any one AP, and the "first", "second", and "third" are merely for convenience of description and do not indicate that any three APs have other relationships or the like.

Optionally, step 404 may be to receive the j-level neighbor relationship that the second AP has with the third AP, so as to determine that the second AP has the j + 1-level neighbor relationship with the third AP. The first AP may record the network address of the second AP with level 1 neighbor relation; and the network address of the third AP with a j +1 level neighbor relationship to facilitate synchronizing roaming cache data. It is understood that the network address of the third AP is the network address sent by the second AP to the first AP.

Optionally, j =1, 2 \8230M, M is a positive integer greater than or equal to 2; in addition, M may be a value less than the total number of APs in the roaming group minus 1.

In one practical application, M may be equal to 2.

The APs with neighbor relation synchronize roaming cache data stored in them. Wherein having neighbor relations may have any level of neighbor relations.

For example, assuming that AP1 and AP2 have a level 1 neighbor relationship, AP2 and AP3 have a level 1 neighbor relationship, and AP3 and AP4 have a level 1 neighbor relationship, AP2 may confirm that AP4 has a level 1+1=2 neighbor relationship, AP1 and AP3 have a level 1+1=2 neighbor relationship, and AP1 and AP4 have a level 2+1=3 neighbor relationship.

Each AP may thus record information, such as network addresses, about the APs with which it has different levels of neighbor relations. Two APs with any level of neighbor relation can synchronize roaming cache data with each other.

Corresponding to the relationship establishing method shown in fig. 4, as shown in fig. 5, the method is a flowchart of another embodiment of the data synchronization method provided in the embodiment of the present application, where the embodiment is executed by any AP, and the method may include the following steps:

501: and acquiring roaming cache data of the terminal.

Further, the method may further include:

and storing the roaming cache data.

502: synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i =1, 2 \8230, M is a positive integer greater than or equal to 2;

it should be noted that the third neighbor AP may refer to any AP having i-level neighbor relationship with the AP, and the name is given only for convenience of description.

Wherein, M may be equal to 2 in order to further guarantee data synchronization convenience.

With this embodiment, the AP can synchronize roaming cached data to each neighbor AP with which it has a 1, 2 \ 8230a M-level neighbor relationship. M can be set by combining with actual conditions, and if M is small enough, convenience of data synchronization operation can be guaranteed.

In this embodiment, because the roaming cache data exists in the third neighboring AP, when the terminal roams to the third neighboring AP, the terminal may establish a connection with the terminal without performing terminal authentication, thereby achieving the purpose of fast roaming.

In the embodiment shown in fig. 5, the roaming cache data is synchronized not only to the neighboring AP in the level 1 neighbor relationship, but also to the neighboring AP in the non-level 1 neighbor relationship, so that the roaming cache data can be synchronized by one AP without step-by-step synchronization, thereby simplifying the data synchronization operation.

In some embodiments, synchronizing the roaming cache data to the third neighbor AP having an i-level neighbor relation may include:

determining a survival coefficient value of the roaming cache data;

detecting that the survival coefficient value is greater than 0, and synchronizing the roaming cache data to a third neighbor AP with i-level neighbor relation;

and sending the survival coefficient value obtained by subtracting the i from the current value to the third neighbor AP.

In some embodiments, the synchronizing the roaming cache data to the third neighbor AP having the i-level neighbor relation may include:

determining a survival coefficient value of the roaming cache data;

detecting that the survival coefficient value is greater than 0, and synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation;

judging the signal intensity of a third neighbor AP, and determining an attenuation value q corresponding to the signal intensity; wherein q is a positive integer greater than or equal to 1;

and sending the survival coefficient value obtained by subtracting q from the current value to the third neighbor AP.

Further, in some embodiments, the sending the survival coefficient value obtained by subtracting i from the current value to the third neighbor AP may include:

judging the signal intensity of a third neighbor AP, and determining an attenuation value x corresponding to the signal intensity; wherein x is a positive integer of 1 or more

And respectively subtracting the i and the x from the current value to obtain a survival coefficient value, and sending the survival coefficient value to the third neighbor AP.

The roaming cache data may then be saved.

In some embodiments, the method may further comprise:

setting the survival coefficient initial value of the roaming cache data as M;

while synchronizing the roaming cache data to a first neighbor AP having a neighbor relation, the method further comprises:

and sending the survival coefficient value obtained after the current value is subtracted by the i to the third neighbor AP.

In some embodiments, the synchronizing the roaming cache data to the third neighbor AP having an i-level neighbor relation comprises:

judging whether the third neighbor AP is a newly-added neighbor AP or not;

if not, synchronizing the roaming cache data of the terminal to the third neighbor AP.

As another alternative, the obtaining roaming cache data of the terminal may include:

receiving roaming cache data of the terminal, which is sent by a fourth neighbor AP with k-level neighbor relation; wherein k =1, 2 \8230andM.

The fourth neighbor AP may be different from the third neighbor AP.

The roaming cache data may then be saved.

In some embodiments, the method may further comprise:

receiving a survival coefficient value of the roaming cache data sent by the fourth neighboring AP;

the storing the roaming cache data comprises:

judging whether the roaming cache data of the terminal and the corresponding survival coefficient value are stored or not;

if yes, synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation;

if not, the roaming cache data is stopped synchronizing.

In certain embodiments, the method may further comprise:

Optionally, the signal strength of a third neighbor AP may also be judged, and an attenuation value q corresponding to the signal strength is determined; and sending the survival coefficient value obtained by subtracting q from the current value to the third neighbor AP.

In certain embodiments, the method may further comprise:

and when the terminal is detected to be successfully accessed, updating the survival coefficient value of the roaming cache data to be M.

In certain embodiments, the method may further comprise:

synchronizing the roaming cache data and the survival coefficient value obtained by subtracting i from the updated value to the third neighbor AP.

In some embodiments, the method may further comprise:

judging whether the roaming cache data meet a first aging condition;

and if so, deleting the roaming cache data.

In certain embodiments, the method may further comprise:

judging whether the i-level neighbor relation with the third neighbor AP meets a second aging condition or not;

and if so, deleting the i-level neighbor relation with the third neighbor AP.

In addition, after the i-level neighbor relation of the third neighbor AP is deleted, the roaming cache data synchronized with the third neighbor AP may also be deleted.

Corresponding to the data synchronization method shown in fig. 2 or fig. 5, as shown in fig. 6, a flowchart of an embodiment of a network connection method provided in an embodiment of the present application may include:

601: and receiving a network connection request sent by the terminal.

602: and searching whether roaming cache data of the terminal exist or not.

The roaming cache data is synchronized by any neighbor AP with a neighbor relation;

603: and responding to the search result of the roaming cache data of the terminal, determining that the terminal authentication is successful and establishing network connection with the terminal.

Therefore, when the wireless roaming is realized, if the AP stores the roaming cache data of the terminal, the terminal does not need to be authenticated, and the network connection with the terminal can be directly established, so that the aim of quick roaming is fulfilled.

In some embodiments, if there is no roaming cache data of the terminal, the method may further include:

performing terminal authentication on the terminal;

and if the terminal authentication is successful, establishing network connection with the terminal.

Optionally, in some embodiments, after the establishing the network connection with the terminal, the method further includes:

and updating the survival coefficient of the roaming cache data of the terminal as an initial value.

As described above, the initial value of the survival coefficient may be N or M

Fig. 7 is a schematic structural diagram of an embodiment of a data synchronization apparatus provided in the embodiment of the present application, where the apparatus may further include:

a first obtaining module 701, configured to obtain roaming cache data of a terminal;

a first synchronization module 702, configured to synchronize the roaming cache data to a first neighbor wireless access point AP having a level 1 neighbor relationship;

Furthermore, the apparatus may further include:

and the first storage module is used for storing the roaming cache data acquired by the first acquisition module.

In some embodiments, the first obtaining module is configured to, when the access of the terminal is successful, generate roaming cache data of the terminal according to authentication information of the terminal.

In some embodiments, the apparatus may further comprise:

a first survival coefficient value setting module, configured to set an initial value of a survival coefficient of the roaming cache data to N; wherein N is more than or equal to 1 and is a positive integer;

and the first survival coefficient value sending module is used for sending the survival coefficient value obtained by subtracting 1 from the current value to the first neighbor AP.

In some embodiments, the first synchronization module is specifically configured to detect that a survival coefficient value of the roaming cache data is greater than 0, and synchronize the roaming cache data to a first neighbor AP having a level 1 neighbor relation.

In some embodiments, the first synchronization module is specifically configured to determine whether the first neighbor AP is a newly added neighbor AP; if yes, synchronizing roaming cache data corresponding to different terminals with survival coefficient values larger than 0 to the first neighbor AP; if not, synchronizing the roaming cache data of the terminal to the first neighbor AP.

In some embodiments, the first obtaining module is specifically configured to receive roaming cache data of the terminal sent by a second neighbor AP having a level 1 neighbor relation.

In certain embodiments, further comprising:

a first survivability coefficient value determining module, configured to receive a survivability coefficient value of the roaming cache data sent by the second neighbor AP;

the first saving module may be specifically configured to determine whether roaming cache data of the terminal and a survival coefficient value corresponding to the roaming cache data have been saved; if so, updating the stored survival coefficient value with the received survival coefficient value if the received obtained survival coefficient value is greater than the stored survival coefficient value; otherwise, discarding the received survival coefficient value; if not, the roaming cache data and the survival coefficient value thereof obtained by receiving are saved.

In some embodiments, the first synchronization module is specifically configured to determine whether a survivability coefficient value of the roaming cache data is greater than 0; if yes, synchronizing the roaming cache data to a first neighbor AP with a neighbor relation; if not, the roaming cache data is stopped synchronizing.

In some embodiments, the apparatus may further comprise:

and the second survival coefficient value sending module is used for sending the survival coefficient value obtained by subtracting 1 from the current value to the first neighbor AP.

In some embodiments, the apparatus may further comprise:

and the first survival coefficient value updating module is used for updating the survival coefficient value of the roaming cache data into N when the terminal access is detected to be successful.

In some embodiments, the first synchronization module is further configured to detect that a survivability coefficient value of the roaming cache data is updated; synchronizing the roam-cache data and the survivability coefficient value after subtracting 1 from the updated value to the first neighbor AP.

In some embodiments, the apparatus may further comprise:

the first aging module is used for judging whether the roaming cache data meets a first aging condition or not; and if so, deleting the roaming cache data.

In some embodiments, the apparatus may further comprise:

the second aging module is used for judging whether the level 1 neighbor relation with the first neighbor AP meets a second aging condition or not; and if so, deleting the neighbor relation with the first neighbor AP.

The data synchronization apparatus shown in fig. 7 may execute the data synchronization method shown in the embodiment shown in fig. 1, and the implementation principle and the technical effect are not repeated. The specific manner in which each module and unit of the data synchronization apparatus in the above embodiments perform operations has been described in detail in the embodiments related to the method, and will not be described in detail here.

Fig. 8 is a schematic structural diagram of an embodiment of a relationship establishing apparatus according to the embodiment of the present application, where the apparatus may include:

a first scanning module 801, configured to scan broadcast information sent by a second AP;

a first group determining module 802, configured to determine whether the AP and the second AP are in the same roaming group according to the roaming group identifier in the broadcast information;

a first relationship establishing module 803, configured to determine that there is a level 1 neighbor relationship with the second AP if the first AP and the second AP are in the same roaming group;

the apparatus may further include:

an address saving module, configured to save a network address of the second AP;

wherein the network address of the second AP is used to synchronize roaming cache data.

The data synchronization apparatus shown in fig. 8 may execute the relationship establishment method shown in the embodiment shown in fig. 2, and the implementation principle and the technical effect are not described again. The specific manner in which each module and unit of the relationship establishing apparatus in the above embodiments perform operations has been described in detail in the embodiments related to the method, and will not be described in detail herein.

Fig. 9 is a schematic structural diagram of another embodiment of a data synchronization apparatus according to an embodiment of the present application, where the apparatus may further include:

a second obtaining module 901, configured to obtain roaming cache data of the terminal;

a second synchronization module 903, configured to synchronize the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i =1, 2 \8230, M is a positive integer greater than or equal to 2;

Further, the apparatus may further include:

and the second storage module is used for storing the roaming cache data acquired by the second acquisition module.

In some embodiments, the second obtaining module is specifically configured to, under the condition that the terminal access is successful, generate roaming cache data of the terminal according to the authentication information of the terminal.

In some embodiments, the apparatus may further comprise:

a second survival coefficient value setting module, configured to set an initial value of a survival coefficient of the roaming cache data to M;

the apparatus may further include:

and the third survival coefficient value sending module is used for sending the survival coefficient value obtained by subtracting the i from the current value to the third neighbor AP.

In some embodiments, the second synchronization module is specifically configured to determine whether the third neighbor AP is a newly-added neighbor AP; if yes, synchronizing roaming cache data corresponding to different terminals with survival coefficient values larger than 0 to the first neighbor AP; if not, synchronizing the roaming cache data of the terminal to the third neighbor AP.

In some embodiments, the second obtaining module is specifically configured to receive roaming cache data of the terminal sent by a fourth neighboring AP having a k-level neighbor relation; wherein k =1, 2 \8230andM.

In some embodiments, the apparatus may further comprise:

a second survival coefficient value determining module, configured to receive a survival coefficient value of the roaming cache data sent by the fourth neighboring AP;

the second storage module is specifically configured to determine whether roaming cache data of the terminal and a survival coefficient value corresponding to the roaming cache data have been stored; if so, updating the stored survival coefficient value with the received survival coefficient value if the received obtained survival coefficient value is greater than the stored survival coefficient value; otherwise, discarding the received survival coefficient value; if not, the roaming cache data and the survival coefficient value thereof obtained by receiving are saved.

In some embodiments, the second synchronization module is specifically configured to determine whether a survivability coefficient value of the roaming cache data is greater than 0; if yes, synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation; if not, the roaming cache data is stopped synchronizing.

In some embodiments, the apparatus may further comprise:

and a fourth survival coefficient value sending module, configured to send the survival coefficient value obtained by subtracting i from the current value to the third neighbor AP.

In some embodiments, the apparatus may further comprise:

and the second survival coefficient value updating module is used for updating the survival coefficient value of the roaming cache data into M when the terminal access is detected to be successful.

In some embodiments, the apparatus may further comprise:

the third aging module is used for judging whether the roaming cache data meets a first aging condition or not; and if so, deleting the roaming cache data.

In some embodiments, the apparatus may further comprise:

the fourth aging module is used for judging whether the i-level neighbor relation with the third neighbor AP meets a second aging condition or not; and if so, deleting the i-level neighbor relation with the third neighbor AP.

The data synchronization apparatus shown in fig. 9 may perform the data synchronization method shown in the embodiment shown in fig. 4, and details of the implementation principle and the technical effect are not repeated. The specific manner in which each module and unit of the data synchronization apparatus in the above embodiments perform operations has been described in detail in the embodiments related to the method, and will not be described in detail here.

Fig. 10 is a schematic structural diagram of a relationship establishing apparatus according to another embodiment of the present application, where the apparatus may further include:

a second scanning module 1001, configured to scan broadcast information sent by a second AP;

a second group determining module 1002, configured to determine whether the AP and the second AP are located in the same roaming group according to a roaming group identifier in the broadcast information;

a second relationship establishing module 1003, configured to determine that there is a level 1 neighbor relationship with the second AP if the second AP is in the same roaming group;

a relationship determining module 1004 for determining a third AP having a j-level neighbor relationship with the second AP;

a third relationship establishing module 1005, configured to determine that there is a j + 1-level neighbor relationship with the third AP; wherein j is more than or equal to 1;

The data synchronization apparatus shown in fig. 10 may execute the relationship establishment method described in the embodiment shown in fig. 5, and details of the implementation principle and the technical effect are not repeated. The specific manner in which each module and unit of the relationship establishing apparatus in the above embodiments perform operations has been described in detail in the embodiments related to the method, and will not be described in detail herein.

Fig. 11 is a schematic structural diagram of an embodiment of a network connection device according to an embodiment of the present application, where the network connection device may include:

a request receiving module 1101, configured to receive a network connection request sent by a terminal;

a cache searching module 1102, configured to search whether roaming cache data of the terminal exists; the roaming cache data is synchronized by any neighbor AP with a neighbor relation;

a connection establishing module 1103, configured to determine that the terminal is successfully authenticated and establish a network connection with the terminal in response to a search result of the roaming cache data of the terminal.

In some embodiments, the apparatus may further comprise:

and the numerical value updating module is used for updating the survival coefficient of the roaming cache data of the terminal to be an initial value.

The data synchronization apparatus shown in fig. 11 may execute the network connection method shown in the embodiment shown in fig. 6, and the implementation principle and the technical effect are not described again. The specific manner in which each module and unit of the network connection device in the above embodiments perform operations has been described in detail in the embodiments related to the method, and will not be described in detail herein.

In addition, an embodiment of the present application further provides a wireless access point, as shown in fig. 12, the wireless access point may include a processing component 1201 and a storage component 1202;

the storage component 1202 stores one or more computer instructions; the one or more computer instructions to be invoked for execution by the processing component 1201;

the processing component 1201 is configured to:

acquiring roaming cache data of a terminal;

In some embodiments, the processing component 1201 is further configured to:

scanning broadcast information sent by a second AP;

In some embodiments, the processing component 1201 is further configured to:

receiving a network connection request sent by the terminal;

and responding to the search result of the roaming cache data of the terminal, determining that the terminal authentication is successful and establishing network connection with the terminal.

The processing component 1201 may include one or more processors to execute computer instructions to perform all or part of the steps of the methods described above. Of course, the processing elements may also be implemented as one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components configured to perform the above-described methods.

The storage component 1202 is configured to store various types of data to support operations in a wireless access point. The storage component may be implemented by any type or combination of volatile or non-volatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.

Of course, the wireless access point may also necessarily comprise other components, such as input/output interfaces, network cards, etc.

In addition, an embodiment of the present application further provides a wireless access point, as shown in fig. 13, the wireless access point may include a processing component 1301 and a storage component 1302;

the storage component 1302 stores one or more computer instructions; the one or more computer instructions are to be invoked for execution by the processing component 1301;

the processing component 1301 is configured to:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation; i =1, 2 \8230, M is a positive integer greater than or equal to 2;

In certain embodiments, the processing component 1301 is further configured to:

scanning broadcast information sent by a second AP;

determining that there is a level 1 neighbor relationship with the second AP if the second AP is in the same roaming group;

In certain embodiments, the processing component 1301 is further configured to:

receiving a network connection request sent by the terminal;

The processing component 1301 may include one or more processors to execute computer instructions to perform all or part of the steps of the methods described above. Of course, the processing elements may also be implemented as one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors, or other electronic components configured to perform the above-described methods.

The storage component 1302 is configured to store various types of data to support operations in a wireless access point. The memory components may be implemented by any type or combination of volatile and non-volatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.

In addition, an embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a computer, the data synchronization method of the embodiment shown in fig. 1 may be implemented.

In addition, an embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a computer, the relationship establishing method in the embodiment shown in fig. 2 may be implemented.

In addition, an embodiment of the present application further provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a computer, the data synchronization method of the embodiment shown in fig. 4 may be implemented.

In addition, an embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a computer, the relationship establishing method in the embodiment shown in fig. 5 may be implemented.

In addition, an embodiment of the present application further provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a computer, the network connection method of the embodiment shown in fig. 6 may be implemented.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment may be implemented by software plus a necessary general hardware platform, and may also be implemented by hardware. Based on the understanding, the above technical solutions substantially or otherwise contributing to the prior art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the various embodiments or some parts of the embodiments.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims

1. A method of data synchronization, comprising:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i =2 \ 8230M, M is a positive integer greater than 2;

if a roaming group identifier in broadcast information sent by scanning another AP is the same as a roaming group identifier of a roaming group to which the AP belongs, the AP determines that the AP has a level 1 neighbor relation with the other AP, and determines that another AP having a level j neighbor relation with the other AP has a level j +1 neighbor relation; wherein j is more than or equal to 1;

the synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relation comprises:

determining a survival coefficient value of the roaming cache data;

judging the signal intensity of a third neighbor AP, and determining an attenuation value q corresponding to the signal intensity;

2. The method of claim 1, wherein the synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relation comprises:

determining a survival coefficient value of the roaming cache data;

3. The method of claim 1, wherein the obtaining roaming buffer data of the terminal comprises:

4. The method of claim 3, further comprising:

setting the survival coefficient initial value of the roaming cache data as M;

5. The method of claim 4, wherein the synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relation comprises:

judging whether the third neighbor AP is a newly-added neighbor AP or not;

6. The method of claim 1, wherein the obtaining roaming cache data of the terminal comprises:

receiving roaming cache data of the terminal, which is sent by a fourth neighbor AP with k-level neighbor relation; wherein k =1, 2 \8230M;

and storing the roaming cache data.

7. The method of claim 6, further comprising:

the storing the roaming cache data comprises:

8. The method of claim 7, wherein synchronizing the roaming cache data to a third neighbor AP having an i-level neighbor relation comprises:

judging whether the survival coefficient value of the roaming cache data is greater than 0;

if not, the roaming cache data is stopped synchronizing.

9. The method of claim 7, further comprising:

and sending the survival coefficient value obtained by subtracting the current value by i to the third neighbor AP.

10. The method of claim 7, further comprising:

and when the terminal is successfully accessed, updating the survival coefficient value of the roaming cache data to M.

11. The method of claim 1, further comprising:

judging whether the roaming cache data meet a first aging condition or not;

and if so, deleting the roaming cache data.

12. The method of claim 1, further comprising:

and if so, deleting the i-level neighbor relation with the third neighbor AP.

13. A network connection method, comprising:

receiving a network connection request sent by a terminal;

searching whether roaming cache data of the terminal exist or not; the roaming cache data is synchronized by any neighbor AP with a neighbor relation, and the any neighbor AP is a neighbor AP with an i-level neighbor relation; i = 2\8230M, M is a positive integer greater than 2; the roaming cache data is synchronized by: determining a survival coefficient value of the roaming cache data; detecting that the survival coefficient value is larger than 0 by the any neighbor AP, and synchronizing the roaming cache data to the AP with i-level neighbor relation; the arbitrary neighbor AP judges the signal intensity of the AP and determines an attenuation value q corresponding to the signal intensity; the random neighbor AP sends a survival coefficient value obtained by subtracting q from the current value to the AP; if a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of a roaming group to which the AP belongs, determining that the AP has a level 1 neighbor relation with the other AP, and determining that another AP having a level j neighbor relation with the other AP has a level j +1 neighbor relation; wherein j is more than or equal to 1;

14. The method of claim 13, wherein after establishing the network connection with the terminal, the method further comprises:

and updating the survival coefficient value of the roaming cache data of the terminal as an initial value.

15. A data synchronization apparatus, comprising:

a second synchronization module, configured to synchronize the roaming cache data to a third neighbor AP having an i-level neighbor relationship; i = 2\8230M, M is a positive integer greater than 2; the second synchronization module is specifically configured to: determining a survival coefficient value of the roaming cache data; detecting that the survival coefficient value is greater than 0, and synchronizing the roaming cache data to a third neighbor AP with i-level neighbor relation; judging the signal intensity of a third neighbor AP, and determining an attenuation value q corresponding to the signal intensity; sending the survival coefficient value obtained by subtracting q from the current value to a third neighbor AP;

16. A network connection device, comprising:

the cache searching module is used for searching whether roaming cache data of the terminal exist or not; the roaming cache data is synchronized by any neighbor AP with neighbor relation; the random neighbor AP is a neighbor AP with i-level neighbor relation; i = 2\8230M, M is a positive integer greater than 2; the roaming cache data is synchronized by: determining a survival coefficient value of the roaming cache data; detecting that the survival coefficient value is larger than 0 by the any neighbor AP, and synchronizing the roaming cache data to the AP with i-level neighbor relation; the arbitrary neighbor AP judges the signal intensity of the AP and determines an attenuation value q corresponding to the signal intensity; the random neighbor AP sends the survival coefficient value obtained by subtracting q from the current value to the AP; if a roaming group identifier in broadcast information sent by another AP is scanned by one AP and is the same as the roaming group identifier of a roaming group to which the AP belongs, determining that the AP has a level 1 neighbor relation with the other AP, and determining that another AP having a level j neighbor relation with the other AP has a level j +1 neighbor relation; wherein j is more than or equal to 1;

17. A wireless access point comprising a processing component and a storage component;

the processing component is to:

acquiring roaming cache data of a terminal;

synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation; i = 2\8230M, M is a positive integer greater than 2; the processing component is specifically configured to: determining a survival coefficient value of the roaming cache data; detecting that the survival coefficient value is greater than 0, and synchronizing the roaming cache data to a third neighbor AP with an i-level neighbor relation; judging the signal intensity of a third neighbor AP, and determining an attenuation value q corresponding to the signal intensity; sending the survival coefficient value obtained by subtracting q from the current value to a third neighbor AP;

18. The wireless access point of claim 17, wherein the processing component is further configured to:

scanning broadcast information sent by a second AP;

judging whether the second AP is positioned in the same roaming group or not according to the roaming group identification in the broadcast information;

19. The wireless access point of claim 17, wherein the processing component is further configured to:

receiving a network connection request sent by the terminal;

searching whether roaming cache data of the terminal exist or not; the roaming cache data is synchronized by any neighbor AP with a neighbor relation;