A wireless positioning method for saving traffic, a positioning terminal, and a positioning center platform

Abstract

The present invention discloses a wireless positioning method, a positioning terminal, and a positioning center platform for saving traffic. The wireless positioning method sorts a series of wireless signals collected by the positioning terminal according to the MAC addresses of the wireless signals with a corresponding RSS value according to a predetermined sorting rule, obtains a MAC address sequence and an RSS value sequence of the wireless signals, performs multiple groups of hash operations on the MAC addresses in the MAC address sequence, and accumulates and operates through multiple hash overlapping caches to merge the hash values of the MAC addresses. In this way, by uploading several hash values with a fixed length in the hash overlapping cache and the RSS value sequence, the MAC address sequence is restored by comparing and sorting the hash values on the positioning center platform, and thus the uploaded wireless signals are restored according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence for wireless positioning, thereby realizing wireless positioning with less traffic.

Description

Technical Field

[0001] The present invention relates to the field of wireless positioning, and particularly to a wireless positioning method, a positioning terminal, and a positioning center platform that save traffic. Background Art

[0002] In existing wireless positioning methods such as WIFI and Bluetooth, a positioning terminal (such as a mobile phone) needs to upload the MAC addresses and signal strength RSS values of all wireless signals of wireless access points that can be received to a central platform. The central platform compares them in a wireless signal database corresponding to positions collected in advance and calculates the positioning result to be sent back to the positioning terminal.

[0003] For urban hotspots or concentrated areas, the density of wireless signal sources such as WIFI is very high. The MAC addresses of wireless access points that a positioning terminal can receive often reach dozens or hundreds. One MAC address occupies 6 bytes. Therefore, in the data traffic consumed by a single positioning request, just uploading the MAC addresses usually consumes hundreds of bytes. In particular, for occasions with continuous positioning requirements, since the positioning terminal initiates positioning requests at very short intervals, the consumption of data traffic is quite significant. When the positioning terminal cannot initiate a positioning request through free traffic, paid traffic needs to be consumed. Currently, wireless data traffic is still relatively expensive. Therefore, there is a need for a wireless positioning method that can save traffic to the greatest extent during the positioning request process. Summary of the Invention

[0004] In view of the above-mentioned defects of the prior art, the purpose of the present invention is to provide a wireless positioning method that saves traffic and can save traffic to the greatest extent during the positioning request process.

[0005] To achieve the above purpose, the present invention provides the following technical solutions:

[0006] 1. A wireless positioning method that saves traffic, including the following steps:

[0007] S1, establish at least 3 hash overlapping caches, each hash overlapping cache corresponding to a different hash algorithm, for caching the hash values of MAC addresses. Each bit of the hash overlapping cache corresponds to 1 bit of the hash value, and the initial elements are all 0;

[0008] S2, for a series of collected MAC addresses and RSS values of wireless signals, sort the wireless signals according to the MAC addresses according to a predetermined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals;

[0009] S3. Take a MAC address from the MAC address sequence, calculate the hash value of this MAC address one by one according to the hash algorithms of each hash overlap cache, and incorporate the hash values into their corresponding hash overlap caches through bitwise OR operations.

[0010] S4. Repeat S3 until all MAC addresses in the MAC address sequence have been used.

[0011] S5. Upload all hash overlap caches and the RSS value sequence in sequence.

[0012] S6. Take the pre-stored MAC address, calculate the hash value of this MAC address according to the hash algorithms of each hash overlap cache, establish a one-to-one relationship between the hash value and the hash overlap cache, and determine whether all hash values of this MAC meet the condition: for each group of one-to-one relationship between the hash value and the hash overlap cache, all bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlap cache; when all hash values of this MAC address meet the condition, take out this MAC address.

[0013] S7. Repeat S6 until all pre-stored MAC addresses have been used.

[0014] S8. Sort all MAC addresses that meet the conditions according to a predefined sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence.

[0015] S9. Locate based on the wireless signals in the wireless signal sequence.

[0016] 2. A wireless positioning method for saving traffic, comprising the following steps:

[0017] S1. Establish at least 1 first hash overlap cache and at least 3 second hash overlap caches, divide the MAC address into a fixed-length first half and a second half, the first hash overlap cache corresponds to the first half of the MAC address, and each first hash overlap cache corresponds to a different hash algorithm; the second hash overlap cache corresponds to the second half of the MAC address, and each second hash overlap cache corresponds to a different hash algorithm; each bit of the hash overlap cache corresponds to 1 bit of the hash value, and the initial elements are all 0.

[0018] S2. Sort the MAC addresses and the corresponding RSS values of a series of collected wireless signals according to a predefined sorting rule based on the MAC addresses to obtain the MAC address sequence and the RSS value sequence of the wireless signals.

[0019] S3. Take a MAC address from the MAC address sequence, calculate the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlap cache, and incorporate the hash value into the first hash overlap cache through bitwise OR operation; calculate the hash value of the second half of the MAC address one by one according to the hash algorithms of the respective second hash caches, and incorporate the hash values into their corresponding second hash overlap caches through bitwise OR operation.

[0020] S4. Repeat S3 until all MAC addresses in the MAC address sequence have been processed.

[0021] S5. Upload all the first hash overlap caches, second hash overlap caches, and the RSS value sequence in sequence.

[0022] S6. Take the pre-stored MAC address, divide the MAC address into the first half and the second half. Calculate the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlap cache, and calculate the hash value of the second half of the MAC address according to the hash algorithm of the second hash overlap cache. Establish a one-to-one relationship between the hash value of the MAC address and the hash overlap cache, and determine whether all hash values of the MAC satisfy the condition: for each group of one-to-one relationship between the hash value and the hash overlap cache, all bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlap cache; when all hash values of the MAC address satisfy the condition, take out the MAC address.

[0023] S7. Repeat S6 until all pre-stored MAC addresses have been processed.

[0024] S8. Sort all MAC addresses that meet the conditions according to the established sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence.

[0025] S9. Locate according to the wireless signals in the wireless signal sequence.

[0026] Further, the established sorting rule is one of LSD radix sort or MSD radix sort.

[0027] Further, the first half includes the first 3 bytes of the MAC address, and the second half includes the last 3 bytes of the MAC address.

[0028] Further, there is 1 first hash overlap cache.

[0029] Further, there are 3 second hash overlap caches.

[0030] Further, the wireless positioning method for saving traffic is applicable to WIFI positioning and Bluetooth positioning.

[0031] 3. A positioning terminal, the wireless positioning method of the positioning terminal comprising the following steps:

[0032] S1. For a series of collected wireless signals, sort the MAC addresses and the corresponding RSS values according to a predefined sorting rule based on the MAC addresses to obtain a MAC address sequence and an RSS value sequence of the wireless signals;

[0033] S2. Establish at least 3 hash overlapping caches, each hash overlapping cache corresponding to a different hash algorithm. Each bit of the hash overlapping cache corresponds to one bit of the hash value, and the initial elements are all 0;

[0034] S3. Take out a MAC address from the MAC address sequence, obtain the hash value of this MAC address one by one according to the hash algorithms of the respective hash overlapping caches, and incorporate the hash values into their respective corresponding hash overlapping caches in a bitwise OR operation manner; S4. Repeat S3 until all MAC addresses in the MAC address sequence have been taken;

[0035] S5. Upload all the hash overlapping caches and the RSS value sequence in sequence.

[0036] 4. A positioning terminal, the wireless positioning method of the positioning terminal comprising the following steps:

[0037] S1. Establish at least 1 first hash overlapping cache and at least 3 second hash overlapping caches. Divide the MAC address into a fixed-length first half and a second half. The first hash overlapping cache corresponds to the first half of the MAC address, and each first hash overlapping cache corresponds to a different hash algorithm; the second hash overlapping caches correspond to the second half of the MAC address, and each second hash overlapping cache corresponds to a different hash algorithm; each bit of the hash overlapping cache corresponds to one bit of the hash value, and the initial elements are all 0;

[0038] S2. For a series of collected wireless signals, sort the MAC addresses and the corresponding RSS values according to a predefined sorting rule based on the MAC addresses to obtain a MAC address sequence and an RSS value sequence of the wireless signals;

[0039] S3. Take out a MAC address from the MAC address sequence, obtain the hash value of the first half of this MAC address according to the hash algorithm of the first hash overlapping cache, and incorporate the hash value into the first hash overlapping cache in a bitwise OR operation manner; obtain the hash values of the second half of the MAC address one by one according to the hash algorithms of the respective second hash caches, and incorporate the hash values into their respective corresponding second hash overlapping caches in a bitwise OR operation manner;

[0040] S4. Repeat S3 until all MAC addresses in the MAC address sequence have been taken; S5. Upload all the first hash overlapping caches, the second hash overlapping caches and the RSS value sequence in sequence.

[0041] 5. A positioning center platform stores a list of MAC addresses in advance. The positioning center platform receives all hash overlap caches and RSS value sequences from a positioning terminal and performs wireless positioning, including the following steps:

[0042] S6. Take the pre-stored MAC address. This MAC address takes a hash value according to the hash algorithm of each hash overlap cache, establishes a one-to-one relationship between the hash value and the hash overlap cache, and determines whether all hash values of this MAC meet the condition: for each group of one-to-one relationship between the hash value and the hash overlap cache, all bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlap cache; when all hash values of this MAC address meet the condition, take out this MAC address;

[0043] S7. Repeat S6 until all pre-stored MAC addresses are used up;

[0044] S8. Sort all MAC addresses that meet the conditions according to a predetermined sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence;

[0045] S9. Locate the positioning terminal according to the wireless signals in the wireless signal sequence.

[0046] 6. A positioning center platform stores a list of MAC addresses in advance. The positioning center platform receives the first hash overlap cache, the second hash overlap cache and the RSS value sequence from a positioning terminal; and performs wireless positioning, including the following steps:

[0047] S6. Take the pre-stored MAC address, divide the MAC address into the first half and the second half. The first half of this MAC address takes a hash value according to the hash algorithm of the first hash overlap cache, and the second half of this MAC address takes a hash value according to the hash algorithm of the second hash overlap cache, establishes a one-to-one relationship between the hash value of this MAC address and the hash overlap cache, and determines whether all hash values of this MAC meet the condition: for each group of one-to-one relationship between the hash value and the hash overlap cache, all bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlap cache; when all hash values of this MAC address meet the condition, take out this MAC address;

[0048] S7. Repeat S6 until all pre-stored MAC addresses are used up;

[0049] S8. Sort all MAC addresses that meet the conditions according to a predetermined sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence;

[0050] S9. Locate the positioning terminal according to the wireless signals in the wireless signal sequence.

[0051] The present invention achieves the following technical effects:

[0052] The wireless positioning method for saving traffic of the present invention changes the traditional way of uploading the MAC addresses and RSS values of all wireless signals collected by the positioning terminal to the positioning center platform. For the MAC addresses and corresponding RSS values of a series of wireless signals collected by the positioning terminal, the wireless signals are sorted according to the MAC addresses according to a predefined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals. Multiple groups of hash operations are performed on the MAC addresses in the MAC address sequence, and the cumulative AND operation is performed through multiple hash overlapping caches to merge the hash values of the MAC addresses. In this way, by uploading several hash values with a fixed length in the hash overlapping cache and the RSS value sequence, the MAC address sequence is restored through the comparison and sorting of the hash values on the positioning center platform, and then the uploaded wireless signals are restored according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence for wireless positioning, thereby realizing wireless positioning with less traffic. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 is a flowchart of the wireless positioning method for saving traffic of the present invention;

[0054] Figure 2 is a schematic diagram of incorporating hash values into the hash overlapping cache. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0055] To further illustrate the embodiments, the present invention provides drawings. These drawings are part of the disclosure of the present invention, which are mainly used to illustrate the embodiments and can be used to explain the operating principles of the embodiments in conjunction with the relevant descriptions in the specification. With reference to these contents, those of ordinary skill in the art should be able to understand other possible embodiments and the advantages of the present invention. The components in the drawings are not drawn to scale, and similar component symbols are usually used to represent similar components.

[0056] The present invention will be further described below in conjunction with the drawings and specific embodiments.

[0057] As Figure 1 shown, the present invention discloses a wireless positioning method for saving traffic, and the specific steps are as follows:

[0058] (1) For a series of MAC addresses and their corresponding RSS values collected by the positioning terminal, the wireless signals are sorted according to the MAC addresses with a predetermined sorting rule S (such as using well-known LSD (Least Significant Digit first) radix sort or MSD (Most Significant Digit first) radix sort methods), obtaining the MAC address sequence and RSS value sequence of the wireless signals, and the MAC address sequence and RSS value sequence are in a one-to-one correspondence relationship.

[0059] (2) Process a certain MAC address, dividing the MAC address into two parts: the first half A1 and the second half A2; in this embodiment, the MAC address is divided into two parts of equal length; the first half A1 includes the first 3 bytes, which generally represent the manufacturer and have relatively high repeatability, so it can correspond to at least 1 hash overlapping cache; the second half A2 includes the last 3 bytes of the MAC address, which are the unique codes of different network nodes and have a large number, so it needs to correspond to at least 3 hash overlapping caches. Establish 4 hash overlapping caches: h, H1, H2, H3, each hash overlapping cache corresponds to a hash (HASH) algorithm, and each bit of the cache corresponds to 1 bit of the hash value, and the initial elements are all 0. Among them, the algorithms of the hash overlapping caches H1 to H3 cannot be the same, so at least 3 hash algorithms are required. Assume that h corresponds to the hash algorithm HASH1, and the hash algorithms corresponding to the hash overlapping caches H1, H2, H3 are HASH1, HASH2, HASH3.

[0060] (3) Take the hash value HASH1(A1) of the first half A1 of a certain MAC address, and incorporate the hash value HASH1(A1) into the hash overlapping cache h by means of bitwise OR operation; take the hash value HASH1(A2) of the second half A2, and incorporate the hash value HASH1(A2) into the hash overlapping cache H1 by means of bitwise OR operation. Similarly, take the hash values HASH2(A2) and HASH3(A2) of the second half A2, incorporate the hash value HASH2(A2) into the hash overlapping cache H2 by means of bitwise OR operation, and incorporate the hash value HASH3(A2) into the hash overlapping cache H3 by means of bitwise OR operation.

[0061] (4) Similarly, continue to perform the above processing on other MAC addresses, and continuously incorporate the hash values of all MAC addresses collected by the positioning terminal into the hash overlapping caches h, H1, H2, H3 by bitwise OR operation overlap.

[0062] Such as Figure 2In the example shown, it is assumed that there are two MAC addresses, M1 and M2, and the hash values ​​obtained by the same HASH operation are MH1 (binary expression is 1 0 1 0 0 0 1 0 0 0 0 0) and MH2 (binary expression is 0 0 0 0 1 1 1 0 01 0 0). The hash overlap cache is initially 0, so after M1 is incorporated into the hash overlap cache by bitwise OR, the cache value is 1 0 1 0 00 1 0 0 0 0; after M2 is incorporated by bitwise OR, the cache value is 1 0 1 0 1 1 1 0 0 1 0 0; subsequently, when determining whether an unknown MAC address is M1 or M2, it is only necessary to use the same hash algorithm to operate the MAC address. Assuming that the obtained hash value is MH3, it is determined whether all the 1 bits of MH3 correspond to the 1 bits in the hash overlap cache. If so, the MAC address corresponding to MH3 may be M1 or M2. Of course, this method may result in misjudgment when there is a large amount of unknown data. For example, if a MAC hash value is 1 0 00 0 0 0 0 0 0 0 0, then this MAC address will be misjudged as M1 or M2. Therefore, misjudgment may occur when only a single hash is used. Therefore, when facing a large amount of MAC second half A2 data, the present invention uses at least three hash algorithms to correspond, which can avoid misjudgment to a large extent. For the MAC first half A1 data with a small amount of data, only one hash algorithm is used, which can save the amount of data that needs to be uploaded.

[0063] (5) Upload data. Upload all hash overlapping caches h, H1, H2, H3, and RSS value sequences to the positioning center platform. Since only the hash overlapping caches h, H1, H2, H3 are uploaded, and not all the original MAC addresses, the data traffic is greatly reduced.

[0064] (6) On the positioning center platform, take a MAC address from the pre-stored MAC address list, divide the MAC address into the first half A1 and the second half A2 according to the segmentation rule in step (2), calculate the hash values ​​HASH1(A1), HASH1(A2), HASH2(A2), HASH3(A2) corresponding to the hash overlap caches h, H1, H2, H3, respectively, and determine whether the following conditions are met: all the 1 bits of the hash value HASH1(A1) of the first half A1 of the MAC address and the corresponding bits of h are 1, and all the 1 bits of the hash value HASH1(A2) of the second half A2 and the corresponding bits of H1 are 1, and all the 1 bits of the hash value HASH2(A2) and the corresponding bits of H2 are 1, and all the 1 bits of the hash value HASH3(A2) and the corresponding bits of H3 are 1. If the MAC address meets the conditions, take out the MAC address.

[0065] (7) Similarly, continue to process other MAC addresses as described above until all the MAC addresses in the MAC address list have been used up.

[0066] (8) After obtaining all the MAC addresses, sort the MAC addresses according to the sorting rule S to form a MAC address sequence. After sorting, the wireless signals uploaded by the positioning terminal can be restored according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence.

[0067] (9) When the MAC addresses and RSS values of the wireless signals required for positioning are obtained, the positioning center platform can position the positioning terminal according to the general positioning method.

[0068] It should be noted that segmenting the MAC address to take the hash value is an optimal solution. The MAC address can also not be segmented, directly take the hash value of the MAC address through the hash algorithm, and at least establish three hash overlapping caches H1, H2, and H3. Take the hash value HASH1 for a certain MAC address, and incorporate the hash value HASH1 into the hash overlapping cache H1 by means of bitwise OR operation; similarly, use different hash algorithms to take the hash values HASH2 and HASH3, incorporate the hash value HASH2 into the hash overlapping cache H2 by means of bitwise OR operation, and incorporate the hash value HASH3 into the hash overlapping cache H3 by means of bitwise OR operation. Since the MAC address is not segmented and the hash value is taken for the entire MAC address field, to a certain extent, the processing load of the positioning terminal needs to be increased.

[0069] Similarly, upload the hash values of the hash overlapping caches H1, H2, and H3 to the positioning center platform. At the positioning center platform, take the MAC address in the pre-stored MAC address list. The corresponding hash values HASH1, H2, and H3 are calculated for this MAC address according to the hash algorithms of the hash overlapping caches H1, H2, and H3, and determine whether the conditions are met: all the bits that are 1 in the hash value HASH1 of this MAC address and the corresponding bits in the hash overlapping cache H1 are all 1, and all the bits that are 1 in the hash value HASH2 and the corresponding bits in the hash overlapping cache H2 are all 1, and all the bits that are 1 in the hash value HASH3 and the corresponding bits in the hash overlapping cache H3 are all 1. If this MAC address meets the conditions, then take out this MAC address.

[0070] The wireless positioning method of this embodiment can significantly reduce the data traffic of positioning and is suitable for use in areas with dense WIFI or Bluetooth signals. The traffic-saving wireless positioning method of the present invention changes the traditional way of uploading the MAC addresses and RSS values of all wireless signals collected by the positioning terminal to the positioning center platform. For a series of MAC addresses of wireless signals collected by the positioning terminal and the corresponding RSS values, the wireless signals are sorted according to the MAC addresses according to a predetermined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals. Multiple groups of hash operations are performed on the MAC addresses in the MAC address sequence, and the cumulative AND operation is performed through multiple hash overlapping caches to merge the hash values of the MAC addresses. In this way, by uploading several hash values with a fixed length in the hash overlapping cache and the RSS value sequence, the MAC address sequence is restored through the comparison and sorting of the hash values on the positioning center platform, and then the uploaded wireless signals are restored according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence for wireless positioning, so as to achieve wireless positioning with less traffic.

[0071] Although the present invention has been specifically shown and described in conjunction with the preferred embodiments, those skilled in the art should understand that various changes can be made to the present invention in terms of form and details without departing from the spirit and scope of the present invention defined by the appended claims, and all of them are within the protection scope of the present invention.

Claims

1. A wireless positioning method for saving traffic, characterized in that: It includes the following steps: S1. Establish at least 3 hash overlapping caches, each hash overlapping cache corresponding to a different hash algorithm, for caching the hash values of MAC addresses. Each bit of the hash overlapping cache corresponds to one bit of the hash value, and the initial elements are all 0; S2. For a series of collected wireless signals' MAC addresses and RSS values, sort the wireless signals according to the MAC addresses according to a predetermined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals; S3. Take out a MAC address from the MAC address sequence, take the hash value of this MAC address one by one according to the hash algorithms of each hash overlapping cache, and incorporate the hash values into their corresponding hash overlapping caches in a bitwise OR operation manner; S4. Repeat S3 until all MAC addresses in the MAC address sequence are used up; S5. Upload all hash overlapping caches and the RSS value sequence in sequence; S6. Take out the pre-stored MAC address, take the hash value of this MAC address according to the hash algorithms of each hash overlapping cache, establish a one-to-one relationship between the hash value and the hash overlapping cache, and determine whether all hash values of this MAC address meet the condition: for each group of one-to-one relationship between the hash value and the hash overlapping cache, all bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlapping cache; when all hash values of this MAC address meet the condition, take out this MAC address; S7. Repeat S6 until all pre-stored MAC addresses are used up; S8. Sort all MAC addresses that meet the conditions according to a predetermined sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence; S9. Locate according to the wireless signals in the wireless signal sequence.

2. A wireless positioning method for saving traffic, characterized in that: It includes the following steps: S1. Establish at least 1 first hash overlapping cache and at least 3 second hash overlapping caches, divide the MAC address into a fixed-length first half and a second half. The first hash overlapping cache corresponds to the first half of the MAC address, and each first hash overlapping cache corresponds to a different hash algorithm; The second hash overlapping cache corresponds to the second half of the MAC address, and each second hash overlapping cache corresponds to a different hash algorithm; Each bit of the hash overlapping cache corresponds to one bit of the hash value, and the initial elements are all 0; S2. For the MAC addresses and the corresponding RSS values of a series of collected wireless signals, sort the wireless signals according to the MAC addresses according to a predetermined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals; S3. Take out a MAC address from the MAC address sequence, take the hash value of the first half of this MAC address according to the hash algorithm of the first hash overlapping cache, and incorporate the hash value into the first hash overlapping cache in a bitwise OR operation manner; Take the hash value of the second half of this MAC address one by one according to the hash algorithms of each second hash overlapping cache, and incorporate the hash values into their corresponding second hash overlapping caches in a bitwise OR operation manner; S4. Repeat S3 until all MAC addresses in the MAC address sequence are used up; S5, uploading all first hash overlapping caches, second hash overlapping caches and RSS value sequences in sequence; S6, take the pre-stored MAC address, divide the MAC address into the first half and the second half, take the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlap cache, take the hash value of the second half of the MAC address according to the hash algorithm of the second hash overlap cache, establish a one-to-one relationship between the hash value of the MAC address and the hash overlap cache, and judge whether all the hash values ​​of the MAC address meet the condition: for each set of hash values ​​and hash overlap caches in a one-to-one relationship, all the bits of the hash value that are 1 are 1 in the corresponding bits of the hash overlap cache; when all the hash values ​​of the MAC address meet the condition, take out the MAC address; S7, repeat S6 until all pre-stored MAC addresses are used; S8, sorting all MAC addresses that meet the conditions according to a predetermined sorting rule to form a MAC address sequence, and restoring the wireless signal sequence according to a one-to-one correspondence between the MAC address sequence and the RSS value sequence; S9, performing positioning according to the wireless signals in the wireless signal sequence.

3. The wireless positioning method for saving traffic according to claim 1 or 2, characterized in that: The predetermined sorting rule is one of LSD radix sorting and MSD radix sorting.

4. The wireless positioning method for saving traffic according to claim 2, characterized in that: The first half includes the first 3 bytes of the MAC address, and the second half includes the last 3 bytes of the MAC address.

5. The wireless positioning method for saving traffic according to claim 2, characterized in that: The number of the first hash overlapping caches is 1.

6. The wireless positioning method for saving traffic according to claim 2, characterized in that: The number of the second hash overlapping caches is 3.

7. The wireless positioning method for saving traffic according to claim 2, characterized in that: The wireless positioning method for saving traffic is applicable to WIFI positioning and Bluetooth positioning.

8. A wireless positioning method for saving traffic, applied to a positioning terminal, characterized in that: The wireless positioning method of the positioning terminal comprises the following steps: S1, sorting the wireless signals according to the MAC addresses and corresponding RSS values ​​of a series of collected wireless signals according to a predetermined sorting rule, and obtaining a MAC address sequence and an RSS value sequence of the wireless signals; S2, establish at least 3 hash overlapping caches, each hash overlapping cache corresponds to a different hash algorithm, each 1 bit of the hash overlapping cache corresponds to 1 bit of the hash value, and the initial elements are all 0; S3, taking out a MAC address from the MAC address sequence, taking hash values ​​of the MAC address one by one according to the hash algorithm of each hash overlap cache, and merging the hash values ​​into the corresponding hash overlap caches in a bitwise OR operation; S4, repeating S3 until all MAC addresses in the MAC address sequence are taken; S5, upload all hash overlapping caches and RSS value sequences in sequence.

9. A traffic-saving wireless positioning method, applied to a positioning terminal, characterized in that: The wireless positioning method of the positioning terminal comprises the following steps: S1, establish at least one first hash overlapping cache and at least three second hash overlapping caches, divide the MAC address into a first half and a second half of fixed length, the first hash overlapping cache corresponds to the first half of the MAC address, and each first hash overlapping cache corresponds to a different hash algorithm; the second hash overlapping cache corresponds to the second half of the MAC address, and each second hash overlapping cache corresponds to a different hash algorithm; each 1 bit of the hash overlapping cache corresponds to 1 bit of the hash value, and the initial elements are all 0; S2. For the MAC addresses and corresponding RSS values of a series of collected wireless signals, sort the wireless signals according to the MAC addresses based on a predefined sorting rule to obtain the MAC address sequence and RSS value sequence of the wireless signals; S3. Take out a MAC address from the MAC address sequence, take the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlapping cache, and incorporate the hash value into the first hash overlapping cache through bitwise OR operation; take the hash value of the second half of the MAC address one by one according to the hash algorithms of the respective second hash overlapping caches, and incorporate the hash values into their corresponding second hash overlapping caches through bitwise OR operation; S4. Repeat S3 until all the MAC addresses in the MAC address sequence have been used; S5. Upload all the first hash overlapping caches, second hash overlapping caches, and RSS value sequence in sequence.

10. A traffic-saving wireless positioning method, applied to a positioning center platform, characterized in that: The positioning center platform pre-stores a MAC address list. The positioning center platform receives all the hash overlapping caches and RSS value sequence from the positioning terminal and performs wireless positioning, where: the positioning terminal establishes at least 3 hash overlapping caches, and each hash overlapping cache corresponds to a different hash algorithm; the positioning terminal takes out a MAC address from the MAC address sequence of the collected wireless signals, takes the hash value of the MAC address one by one according to the hash algorithms of the respective hash overlapping caches, and incorporates the hash values into their corresponding hash overlapping caches through bitwise OR operation until all the MAC addresses in the MAC address sequence have been used; The steps include: S6. Take the pre-stored MAC address, take the hash value of the MAC address according to the hash algorithms of the respective hash overlapping caches, establish a one-to-one relationship between the hash value and the hash overlapping cache, and determine whether all the hash values of the MAC address meet the condition: for each group of one-to-one relationship between the hash value and the hash overlapping cache, all the bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlapping cache; when all the hash values of the MAC address meet the condition, take out the MAC address; S7. Repeat S6 until all the pre-stored MAC addresses have been used; S8. Sort all the MAC addresses that meet the condition according to a predefined sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence; S9. Locate the positioning terminal according to the wireless signals in the wireless signal sequence.

11. A traffic-saving wireless positioning method, applied to a positioning center platform, characterized in that: The positioning center platform pre-stores a MAC address list. The positioning center platform receives the first hash overlapping cache, second hash overlapping cache, and RSS value sequence from the positioning terminal; And perform wireless positioning; wherein: the positioning terminal establishes at least 1 first hash overlapping cache and at least 3 second hash overlapping caches, divides the MAC address into a fixed-length first half and a second half, the first hash overlapping cache corresponds to the first half of the MAC address, and each first hash overlapping cache corresponds to a different hash algorithm; the second hash overlapping cache corresponds to the second half of the MAC address, and each second hash overlapping cache corresponds to a different hash algorithm; the positioning terminal takes out a MAC address from the MAC address sequence of the collected wireless signal, takes the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlapping cache, and incorporates the hash value into the first hash overlapping cache in a bitwise OR operation manner; takes the hash value of the second half of the MAC address one by one according to the hash algorithms of the respective second hash overlapping caches, and incorporates the hash value into the respective corresponding second hash overlapping caches in a bitwise OR operation manner; until all the MAC addresses in the MAC address sequence are used up; including the following steps: S6, take the pre-stored MAC address, divide the MAC address into a first half and a second half, take the hash value of the first half of the MAC address according to the hash algorithm of the first hash overlapping cache, take the hash value of the second half of the MAC address according to the hash algorithm of the second hash overlapping cache, establish a one-to-one relationship between the hash value of the MAC address and the hash overlapping cache, and judge whether all the hash values of the MAC address meet the condition: for each group of one-to-one relationship between the hash value and the hash overlapping cache, all the bits that are 1 in the hash value are 1 in the corresponding bits of the hash overlapping cache; when all the hash values of the MAC address meet the condition, take out the MAC address; S7, repeat S6 until all the pre-stored MAC addresses are used up; S8, sort all the MAC addresses that meet the conditions according to the established sorting rule to form a MAC address sequence, and restore the wireless signal sequence according to the one-to-one correspondence between the MAC address sequence and the RSS value sequence; S9, perform positioning on the positioning terminal according to the wireless signals in the wireless signal sequence.

Images