Positioning base station selection method based on minimum spanning tree clustering algorithm
A clustering algorithm and technology for locating base stations, which are applied in location information-based services, wireless communications, electrical components, etc., can solve the problems of reducing positioning performance, increasing power consumption, and increasing costs
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017] The positioning base station selection method based on the minimum spanning tree clustering algorithm described in the present invention can select suitable k base stations from among all N base stations to participate in positioning, so as to use as few base stations as possible to achieve approximately optimal positioning Accuracy, the specific steps are as follows:
[0018] 1. The present invention first obtains base station location data and signal time of arrival (TOA) data measured by the base station;
[0019] 2. Assuming that there are N base stations, for the obtained N base stations, first construct a fully weighted graph according to the distance between the base stations, and obtain the adjacency matrix of the base station distance, and then find the minimum spanning tree of the adjacency matrix through the minimum spanning tree prim algorithm , and finally delete the k-1 edges with the largest weight in the minimum spanning tree to obtain k subtrees, each s...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com