CN113543280A - Neighbor relation discovery method and device, electronic equipment and storage medium - Google Patents
Neighbor relation discovery method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113543280A CN113543280A CN202110583513.XA CN202110583513A CN113543280A CN 113543280 A CN113543280 A CN 113543280A CN 202110583513 A CN202110583513 A CN 202110583513A CN 113543280 A CN113543280 A CN 113543280A
- Authority
- CN
- China
- Prior art keywords
- roaming
- wlan
- edge
- paths
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/16—Discovering, processing access restriction or access information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a neighbor relation discovery method, a neighbor relation discovery device, electronic equipment and a storage medium, wherein the method is applied to a cloud platform and comprises the following steps: acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period, wherein each roaming path consists of an AP (access point) which is associated before the roaming of the corresponding wireless terminal at a starting point and an AP which is associated after the roaming of the corresponding wireless terminal at an end point; aiming at each AP in the WLAN, generating an undirected graph by taking the AP as a vertex and taking a roaming path with a starting point in the obtained roaming path as an edge; calculating the weight of each edge in each generated undirected graph according to the obtained roaming path; and selecting edges with weights meeting preset conditions from all undirected graphs, and determining that the APs in the roaming path corresponding to the selected edges have a neighbor relation. The method and the device can improve the accuracy of discovering the neighbor relation between the APs.
Description
Technical Field
The present application relates to the field of wireless technologies, and in particular, to a neighbor relation discovery method and apparatus, an electronic device, and a storage medium.
Background
In a Wireless Local Area Network (WLAN), a neighbor relationship between Access Points (APs) is important basic data for adjusting Wireless parameters such as channel, power, bandwidth, and the like.
At present, the neighbor relation between APs is usually discovered by scanning wireless electromagnetic signals between APs each other. However, such a discovery method is easily affected by scanning time intervals, interleaving of wireless electromagnetic signals, and the like, so that the discovery result is inaccurate, and the use experience of the whole WLAN is further affected.
Disclosure of Invention
In order to overcome the problems in the related art, the application provides a neighbor relation discovery method, a neighbor relation discovery device, an electronic device and a storage medium.
According to a first aspect of embodiments of the present application, a neighbor relation discovery method is provided, where the method is applied to a cloud platform, and the method includes:
acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period, wherein each roaming path consists of an AP (access point) which is associated before the roaming of the corresponding wireless terminal at a starting point and an AP which is associated after the roaming of the corresponding wireless terminal at an end point;
for each AP in the WLAN, generating an undirected graph by taking the AP as a vertex and taking a roaming path with a starting point in the acquired roaming path as an edge;
calculating the weight of each edge in each generated undirected graph according to the obtained roaming path;
and selecting edges with weights meeting preset conditions from all undirected graphs, and determining that the APs in the roaming path corresponding to the selected edges have a neighbor relation.
According to a second aspect of the embodiments of the present application, there is provided a neighbor relation discovery apparatus, which is applied to a cloud platform, the apparatus including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring roaming paths of all wireless terminals accessing the WLAN in a set time period, and each roaming path consists of an AP (access point) which is associated before the roaming of the corresponding wireless terminal at a starting point and an AP which is associated after the roaming of the corresponding wireless terminal at an end point;
a generating module, configured to generate an undirected graph for each AP in the WLAN, with the AP as a vertex and a roaming path with a starting point in the acquired roaming path as an edge;
the calculation module is used for calculating the weight of each edge in each generated undirected graph according to the obtained roaming path;
and the determining module is used for selecting edges of which the weights meet preset conditions from all undirected graphs and determining that the APs in the roaming paths corresponding to the selected edges have neighbor relations.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
in the embodiment of the application, the neighbor relation between the APs is not discovered by mutually scanning the wireless electromagnetic signals between the APs, but roaming paths of all wireless terminals accessing the WLAN within a set time period are acquired through a cloud platform; then, generating an undirected graph by the cloud platform based on each AP in the WLAN and the obtained roaming path; and finally discovering the AP with the neighbor relation based on the generated undirected graph by the cloud platform. Since the neighbor relation discovery mode is that the cloud platform discovers based on roaming data of the wireless terminal (namely, data capable of reflecting real neighbor relation), the accuracy of discovery results is improved, and the use experience of the whole WLAN is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a schematic flowchart of a neighbor relation discovery method according to an embodiment of the present application;
fig. 2A is one of schematic diagrams of an undirected graph generated by a cloud platform according to an embodiment of the present application;
fig. 2B is a second schematic diagram of an undirected graph generated by a cloud platform according to an embodiment of the present application;
fig. 2C is a third schematic diagram of an undirected graph generated by a cloud platform according to the present embodiment;
fig. 3 is a schematic structural diagram of a neighbor relation discovery apparatus according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
Next, examples of the present application will be described in detail.
The embodiment of the application provides a neighbor relation discovery method, which is applied to a cloud platform, and as shown in fig. 1, the method can include the following steps:
s11, acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period.
In this step, each roaming path is composed of an AP associated before roaming, where the starting point is the corresponding wireless terminal, and an AP associated after roaming, where the ending point is the corresponding wireless terminal.
S12, aiming at each AP in the WLAN, taking the AP as a vertex, taking a roaming path with a starting point in the obtained roaming path as an edge of the AP, and generating an undirected graph;
s13, calculating the weight of each edge in each generated undirected graph according to the obtained roaming path;
s14, selecting edges with weights meeting preset conditions from all undirected graphs, and determining that the APs in the roaming paths corresponding to the selected edges have neighbor relations.
Specifically, in step S11, when the AP in the WLAN is a fat AP, the cloud platform may acquire roaming paths of all wireless terminals accessing the WLAN within a set time period from the fat AP in the WLAN.
For a fat AP in a WLAN, once a wireless terminal associated with the fat AP roams, the fat AP generates a corresponding roaming path.
When an AP in a WLAN networking is a thin AP, the cloud platform may acquire roaming paths of all wireless terminals accessing the WLAN within a set time period from an Access Controller (AC) in the WLAN.
For an AC in a WLAN, once a wireless terminal associated with the AC roams, the AC generates a corresponding roaming path.
Here, the set time period may be set according to the actual requirement of the WLAN networking, for example, the set time period may be set by day, year, or the like.
In the above step S12, assuming that the AP1 in the WLAN is taken as a vertex example, and assuming that the roaming paths with the starting point of AP1 in the obtained roaming paths are respectively the roaming path composed of the starting point AP1 and the ending point AP2, the roaming path composed of the starting point AP1 and the ending point AP3, and the roaming path composed of the starting point AP1 and the ending point AP4, the cloud platform may use the AP1 as a vertex, and generate an undirected graph with the 3 roaming paths as edges as shown in fig. 2A.
Specifically, in step S13, the cloud platform may calculate a weight of each edge in each generated undirected graph by:
counting the number of roaming paths corresponding to each edge from the obtained roaming paths aiming at each edge in each generated undirected graph;
and determining the counted quantity value as the weight of the edge.
For example, still taking the undirected graph shown in fig. 2A as an example, assuming that, for the edge from AP1 to AP2, the number of roaming paths corresponding to the edge is counted from the obtained roaming paths to be 2, then the weight of the edge from AP1 to AP2 is determined to be 2.
Assuming that the number of roaming paths corresponding to the edge is counted from the acquired roaming paths to be 3 for the edge from AP1 to AP3, the weight of the edge from AP1 to AP3 is determined to be 3.
Assuming that the number of roaming paths corresponding to the edge is 4 counted from the obtained roaming paths for the edge from AP1 to AP4, the weight of the edge from AP1 to AP4 is determined to be 4.
In one example, the weights of the edges may be embodied in an undirected graph, as shown in FIG. 2B.
Specifically, in step S14, when the cloud platform selects edges whose weights satisfy the preset condition from all undirected graphs, the edges whose weights are not lower than the set threshold may be selected from all undirected graphs.
Here, the setting threshold may be set according to the actual situation of WLAN networking.
For example, assuming that all undirected graphs are as shown in fig. 2C, assuming that the threshold is set to 3, it can be determined that AP1 and AP3 have a neighbor relationship, AP1 and AP4 have a neighbor relationship, AP2 and AP3 have a neighbor relationship, AP6 and AP8 have a neighbor relationship, AP5 and AP7 have a neighbor relationship, and AP5 and AP9 have a neighbor relationship.
According to the technical scheme, in the embodiment of the application, the neighbor relation between the APs is not discovered by mutually scanning the wireless electromagnetic signals between the APs, but the roaming paths of all the wireless terminals accessing the WLAN within the set time period are acquired through the cloud platform; then, generating an undirected graph by the cloud platform based on each AP in the WLAN and the obtained roaming path; and finally discovering the AP with the neighbor relation based on the generated undirected graph by the cloud platform. Since the neighbor relation discovery mode is that the cloud platform discovers based on roaming data of the wireless terminal (namely, data capable of reflecting real neighbor relation), the accuracy of discovery results is improved, and the use experience of the whole WLAN is improved.
Based on the same inventive concept, the present application further provides a neighbor relation discovery apparatus, which is applied to a cloud platform, and a schematic structural diagram of the apparatus is shown in fig. 3, and specifically includes:
an obtaining module 31, configured to obtain roaming paths of all wireless terminals accessing the WLAN within a set time period, where each roaming path includes an AP associated before a start point of a corresponding wireless terminal roams and an AP associated after an end point of the corresponding wireless terminal roams;
a generating module 32, configured to generate an undirected graph for each AP in the WLAN, with the AP as a vertex and a roaming path with a starting point in the acquired roaming path as an edge;
the calculating module 33 is configured to calculate a weight of each edge in each generated undirected graph according to the obtained roaming path;
a determining module 34, configured to select, from all undirected graphs, an edge whose weight satisfies a preset condition, and determine that an AP in a roaming path corresponding to the selected edge has a neighbor relation.
Preferably, the obtaining module 31 is specifically configured to:
acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period from a fat AP in the WLAN; alternatively, the first and second electrodes may be,
and acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period from an Access Controller (AC) in the WLAN.
Preferably, the calculating module 33 is specifically configured to calculate a weight of each edge in each generated undirected graph by:
counting the number of roaming paths corresponding to each edge from the obtained roaming paths aiming at each edge in each generated undirected graph;
and determining the counted quantity value as the weight of the edge.
Preferably, the determining module 34 is specifically configured to:
and selecting edges with weights not lower than a set threshold value from all undirected graphs.
According to the technical scheme, in the embodiment of the application, the neighbor relation between the APs is not discovered by mutually scanning the wireless electromagnetic signals between the APs, but the roaming paths of all the wireless terminals accessing the WLAN within the set time period are acquired through the cloud platform; then, generating an undirected graph by the cloud platform based on each AP in the WLAN and the obtained roaming path; and finally discovering the AP with the neighbor relation based on the generated undirected graph by the cloud platform. Since the neighbor relation discovery mode is that the cloud platform discovers based on roaming data of the wireless terminal (namely, data capable of reflecting real neighbor relation), the accuracy of discovery results is improved, and the use experience of the whole WLAN is improved.
An electronic device is further provided in the embodiments of the present application, as shown in fig. 4, and includes a processor 41 and a machine-readable storage medium 42, where the machine-readable storage medium 42 stores machine-executable instructions that can be executed by the processor 41, and the processor 41 is caused by the machine-executable instructions to: and implementing the steps of the neighbor relation discovery method.
The machine-readable storage medium may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the machine-readable storage medium may be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In yet another embodiment provided by the present application, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the neighbor relation discovery method described above.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (10)
1. A neighbor relation discovery method is applied to a cloud platform, and comprises the following steps:
acquiring roaming paths of all wireless terminals accessing a Wireless Local Area Network (WLAN) within a set time period, wherein each roaming path consists of an Access Point (AP) with a starting point related to the roaming of the corresponding wireless terminal and an AP with an end point related to the roaming of the corresponding wireless terminal;
for each AP in the WLAN, generating an undirected graph by taking the AP as a vertex and taking a roaming path with a starting point in the acquired roaming path as an edge;
calculating the weight of each edge in each generated undirected graph according to the obtained roaming path;
and selecting edges with weights meeting preset conditions from all undirected graphs, and determining that the APs in the roaming path corresponding to the selected edges have a neighbor relation.
2. The method of claim 1, wherein acquiring roaming paths of all wireless terminals accessing a wireless local area network WLAN within a set time period comprises:
acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period from a fat AP in the WLAN; alternatively, the first and second electrodes may be,
and acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period from an Access Controller (AC) in the WLAN.
3. The method according to claim 1, wherein the weight of each edge in each generated undirected graph is calculated by:
counting the number of roaming paths corresponding to each edge from the obtained roaming paths aiming at each edge in each generated undirected graph;
and determining the counted quantity value as the weight of the edge.
4. The method according to claim 1, wherein selecting edges whose weights satisfy a preset condition from all undirected graphs specifically comprises:
and selecting edges with weights not lower than a set threshold value from all undirected graphs.
5. A neighbor relation discovery apparatus applied to a cloud platform, the apparatus comprising:
the wireless terminal roaming method comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring roaming paths of all wireless terminals accessing a Wireless Local Area Network (WLAN) in a set time period, and each roaming path consists of an Access Point (AP) which is associated before the roaming of the corresponding wireless terminal at a starting point and an AP which is associated after the roaming of the corresponding wireless terminal at an end point;
a generating module, configured to generate an undirected graph for each AP in the WLAN, with the AP as a vertex and a roaming path with a starting point in the acquired roaming path as an edge;
the calculation module is used for calculating the weight of each edge in each generated undirected graph according to the obtained roaming path;
and the determining module is used for selecting edges of which the weights meet preset conditions from all undirected graphs and determining that the APs in the roaming paths corresponding to the selected edges have neighbor relations.
6. The apparatus of claim 5, wherein the obtaining module is specifically configured to:
acquiring roaming paths of all wireless terminals accessing a Wireless Local Area Network (WLAN) within a set time period from fat APs in the WLAN; alternatively, the first and second electrodes may be,
and acquiring roaming paths of all wireless terminals accessing the WLAN within a set time period from an access controller AC in the WLAN.
7. The apparatus according to claim 5, wherein the calculating module is specifically configured to calculate a weight of each edge in each generated undirected graph by:
counting the number of roaming paths corresponding to each edge from the obtained roaming paths aiming at each edge in each generated undirected graph;
and determining the counted quantity value as the weight of the edge.
8. The apparatus of claim 5, wherein the determining module is specifically configured to:
and selecting edges with weights not lower than a set threshold value from all undirected graphs.
9. An electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: carrying out the method steps of any one of claims 1 to 4.
10. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110583513.XA CN113543280A (en) | 2021-05-27 | 2021-05-27 | Neighbor relation discovery method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110583513.XA CN113543280A (en) | 2021-05-27 | 2021-05-27 | Neighbor relation discovery method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113543280A true CN113543280A (en) | 2021-10-22 |
Family
ID=78094796
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110583513.XA Withdrawn CN113543280A (en) | 2021-05-27 | 2021-05-27 | Neighbor relation discovery method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113543280A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060092883A1 (en) * | 2004-05-31 | 2006-05-04 | Samsung Electronics Co., Ltd. | Probing method for fast handoff in WLAN |
| CN101568108A (en) * | 2008-04-21 | 2009-10-28 | 华为技术有限公司 | Switching method and equipment between heteroid systems |
| US20110292898A1 (en) * | 2009-02-18 | 2011-12-01 | Thomson Licensing A Corporation | Centralized channel selection method and apparatus for wireless networks in a dense deployment environment |
| CN105138859A (en) * | 2015-09-30 | 2015-12-09 | 四川师范大学 | Three-dimensional panorama roaming path finding method and system |
| US20180359648A1 (en) * | 2017-06-08 | 2018-12-13 | Cisco Technology, Inc. | Roaming and transition patterns coding in wireless networks for cognitive visibility |
| CN109673015A (en) * | 2019-01-02 | 2019-04-23 | 北京工业大学 | A kind of tracing area planing method based on spectral clustering |
| CN111951351A (en) * | 2020-08-12 | 2020-11-17 | 智慧足迹数据科技有限公司 | Position thermodynamic diagram generation method and device, electronic equipment and storage medium |
| CN112235804A (en) * | 2020-10-12 | 2021-01-15 | 江苏亨鑫众联通信技术有限公司 | Base station remote unit dynamic grouping method and device, and cell networking method and system |
-
2021
- 2021-05-27 CN CN202110583513.XA patent/CN113543280A/en not_active Withdrawn
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060092883A1 (en) * | 2004-05-31 | 2006-05-04 | Samsung Electronics Co., Ltd. | Probing method for fast handoff in WLAN |
| CN101568108A (en) * | 2008-04-21 | 2009-10-28 | 华为技术有限公司 | Switching method and equipment between heteroid systems |
| US20110292898A1 (en) * | 2009-02-18 | 2011-12-01 | Thomson Licensing A Corporation | Centralized channel selection method and apparatus for wireless networks in a dense deployment environment |
| CN105138859A (en) * | 2015-09-30 | 2015-12-09 | 四川师范大学 | Three-dimensional panorama roaming path finding method and system |
| US20180359648A1 (en) * | 2017-06-08 | 2018-12-13 | Cisco Technology, Inc. | Roaming and transition patterns coding in wireless networks for cognitive visibility |
| CN109673015A (en) * | 2019-01-02 | 2019-04-23 | 北京工业大学 | A kind of tracing area planing method based on spectral clustering |
| CN111951351A (en) * | 2020-08-12 | 2020-11-17 | 智慧足迹数据科技有限公司 | Position thermodynamic diagram generation method and device, electronic equipment and storage medium |
| CN112235804A (en) * | 2020-10-12 | 2021-01-15 | 江苏亨鑫众联通信技术有限公司 | Base station remote unit dynamic grouping method and device, and cell networking method and system |
Non-Patent Citations (5)
| Title |
|---|
| 宋倩;郦苏丹;: "WLAN中的一种快速安全的切换协议设计", 信息技术, no. 08, pages 1 * |
| 曲军青;高仲合;胡广昌;: "对邻居图重连接算法的改进", 计算机应用与软件, no. 03 * |
| 李;陈义;李娟;杨洪生;: "邻居图在无线局域网快速切换中的应用", 微计算机信息, no. 26 * |
| 李莉;陈海燕;李壮壮;时健;: "3G移动网络规划优化仿真软件的设计与实现", 中国新通信, no. 02, pages 3 * |
| 葛坤玉;汪鹏;魏振春;卫星;: "基于改进邻居图的WLAN快速切换机制研究", 合肥工业大学学报(自然科学版), no. 03 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108260075B (en) | Addressing method and device for deployment position of base station | |
| CN107426764B (en) | Cell measurement method and device | |
| JP5102346B2 (en) | Adaptive polygon computation in adaptive positioning of enhanced cell identity | |
| CN110012416B (en) | User terminal positioning method and device | |
| CN109428657B (en) | Positioning method and device | |
| CN110493740B (en) | Indoor positioning method and positioning server | |
| EP2825899A1 (en) | Supporting an update of stored information | |
| WO2013136128A1 (en) | Generating radio channel models parameter values | |
| EP2990830A1 (en) | Method and device for indoor positioning | |
| US9612313B2 (en) | Supporting coverage area modeling | |
| CN108235344B (en) | Configuration method and device of neighbor cell suitable for eSRVCC switching | |
| CN109981214B (en) | Transmission control method and device | |
| CN106686611B (en) | Method and device for evaluating indoor weak coverage area | |
| Martin-Escalona et al. | Ranging estimation error in wifi devices running ieee 802.11 mc | |
| CN110381528A (en) | Method, terminal device and the network equipment of carrier wave measurement | |
| CN111818550B (en) | Method, device and equipment for predicting network coverage condition | |
| CN110536363B (en) | Circuit domain fallback frequency point configuration method and device, electronic equipment and storage medium | |
| CN113543280A (en) | Neighbor relation discovery method and device, electronic equipment and storage medium | |
| CN108024327B (en) | User positioning method and device | |
| WO2016028208A1 (en) | Method and positioning node for positioning of a mobile terminal | |
| KR101694521B1 (en) | Apparatus and method for generating radio fingerprint map | |
| CN108271183B (en) | Neighbor cell optimization method and device based on original measurement report | |
| CN115273899A (en) | Voice quality evaluation method, device, equipment and storage medium | |
| CN107371235B (en) | User terminal positioning method and device | |
| KR20190050631A (en) | Location measuring method using mobile network quality information and apparatus therefor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20211022 |
|
| WW01 | Invention patent application withdrawn after publication |