Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

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

Inactive Publication Date: 2019-03-12
NANJING UNIV OF SCI & TECH
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Theoretically, as the number of base stations increases, the positioning accuracy of mobile terminals will be improved, but increasing the number of base stations will undoubtedly increase costs, increase power consumption, and reduce positioning performance. Therefore, in practical applications, the cost of setting up base stations and Positioning Accuracy Requirements

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Positioning base station selection method based on minimum spanning tree clustering algorithm

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a positioning base station selection method based on a minimum spanning tree clustering algorithm. The method comprises the following steps: firstly, acquiring positions of basestations and signal time of arrival (TOA) measured by the base stations; secondly, dividing the base stations into k initial clusters through the minimum spanning tree clustering algorithm, and taking a base station position mean value in each class as a data center of the class; after that, carrying out iteration, selecting a base station nearest to a clustering center in each class as a representative, judging whether the positioning precision of a mobile terminal meets the requirement or not, if yes, taking the k base stations as initial base station groups, otherwise, expanding k and clustering again; and finally, sorting the obtained base station groups according to the measured TOA values from small to large, and gradually reducing the base station with a large TOA value until the minimum number of base stations are output. According to the positioning base station selection method based on the minimum spanning tree clustering algorithm provided by the invention, the k base stations can be selected from all N base stations to participate in positioning, so as to achieve the approximately optimal positioning precision by using as few base stations as possible.

Description

technical field [0001] The invention relates to the selection of a positioning base station, in particular to a selection method of a positioning base station based on a minimum spanning tree clustering algorithm. Background technique [0002] The base station-based mobile terminal technology is a wireless network positioning technology, and it is also a common location information service (LBS) technology, which is a new positioning technology that does not need the support of hardware modules such as GPS. This positioning technology uses the information of the base station in the mobile network, combined with the location information of the base station itself, and uses the relevant positioning algorithm to calculate the geographic location information of the mobile terminal. [0003] Among them, the positioning algorithm based on signal time of arrival (TOA) is a commonly used positioning algorithm. Its principle is to convert the propagation time of electrical signals in...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W4/02H04W64/00
CPCH04W4/023H04W64/003
Inventor 桂林卿施云丛海波鲍菲菲杨梦霞束锋陆锦辉
Owner NANJING UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products