CN102196561B - Base station LAC (Location Area Code) switching method based on wireless positioning - Google Patents
Base station LAC (Location Area Code) switching method based on wireless positioning Download PDFInfo
- Publication number
- CN102196561B CN102196561B CN201110137094.3A CN201110137094A CN102196561B CN 102196561 B CN102196561 B CN 102196561B CN 201110137094 A CN201110137094 A CN 201110137094A CN 102196561 B CN102196561 B CN 102196561B
- Authority
- CN
- China
- Prior art keywords
- lac
- base station
- existing
- switching
- former
- 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.)
- Active
Links
Abstract
The invention provides a base station LAC (Location Area Code) switching method based on wireless positioning. According to the method, the LAC where the switching specifically happens is judged for tracking detection of a positioning terminal, a final data file is corrected and an effect before a mobile base station LAC is switched is finally realized to improve the positioning precision. The method comprises the steps of loading all base station requests by a system to carry out simulated positioning; extracting a request with larger positioning error and positioning failure; carrying out LAC switching judging on base station request information to be switched and generating a specific switching list; correcting original base station data according to the switching list; and recalculating LAC longitude and latitude according to a switching proportion. According to the invention, the false data of the base station in the wireless positioning process can be effectively corrected, the base station data are perfected and problems of inaccuracy in positioning and descending of positioning precision, caused by mobile LAC switching, are overcome.
Description
Technical field
The present invention relates to Location Based Services, a kind of base stations detected LAC changing method, thus complete the correction to base station data, reach the effect that improves positioning precision.
Background technology
Location Based Services is called again location-based service (Location-Based-Services, LBS), refers to by the cooperation of mobile terminal and mobile communication network navigation system, determines mobile subscriber's actual geographic position, is a kind of value-added service relevant to position.Therefore wireless location technology is a key technology in LBS, is also to solve enterprise mobile application as the effective means of (comprising indoor, outdoor) of comprehensive location requirement in mobile crm system simultaneously.
In mobile communication network navigation system, be to position according to the base station location of mobile terminal access.The data of base station mainly comprise: the longitude and latitude at LAC, CellID and place thereof.These data are basic datas of position fixing process, the basic of accurate positioning, LAC+CellID can a base station of unique identification ID, the position of a real base station can not change, once but its ID has changed, just cause many traditional outstanding location algorithms also to become unable to do what one wishes, therefore all location algorithms all will combine under ID errorless prerequisite consistent with its latitude and longitude coordinates and carry out at LAC+CellID.
The LAC that finds the base station in mobile communication network navigation system in the recent period, because practical application request is adjusted, expands with position error thereby cause locating unsuccessfully, and make up this shortcoming need revise the LAC data of base station.Existing technical scheme is to be utilized with the mobile phone of GPS module and carried out image data by client, but this mode more new database need consuming time more of a specified duration, correction of data timely and effectively, real-time is poor; Also having a kind of mode is by Special Equipment Resurvey data, need to strengthen equally cost and drop into, take time and effort, and impracticable.
Summary of the invention
For addressing the above problem, the present invention aims to provide a kind of base station LAC changing method based on wireless location, detects LAC switch with effective tracking mobile terminal, and realize the correction to wrong LAC data, and improve base station data, effectively improve positioning precision, and can reduce design cost, simple and practical.
Technical scheme of the present invention is: a kind of base station LAC changing method based on wireless location, and the process comprising has:
A base station LAC changing method based on wireless location, the process comprising has:
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and mobile terminal is simulated to location;
Process B, extracts simulation position error and is greater than setting threshold and simulates the Location Request of failed base station, location, generates LAC and intends handoff list;
Process C, carries out the processing of LAC switching determination for the base station that LAC intends switching, and generates base station LAC handoff list;
Process D, carries out LAC correction according to base station LAC handoff list to the base station of former LAC;
Process E, recalculates the longitude and latitude in existing LAC region according to the revised base station of LAC.
Further, in described process A, resolve the Location Request of all base stations, if LAC+CellID combination can be located, adopt LAC+CellID location, adopt first base station CellID that can match to position; Otherwise, if LAC can locate, adopt LAC location; If the Location Request of all base stations all fails to match LAC, restoring to normal position failure.
Further, in described process B, judge whether the result of simulation location meets with next:
B1: adopt LAC+CellID location and error to be greater than setting threshold X;
B2: adopt LAC location and error to be greater than setting threshold X;
B3: locate unsuccessfully;
If the result of simulation location meets above any one, the base station requests information that the base station requests Information Organization of above-mentioned three kinds of situations is become to press LAC index.
Further, in described process C, it carries out the processing of LAC switching determination the base station of traversal plan handoff list, former LAC and the existing LAC at the place, base station that LAC switching occurs are made as to LAC handoff list in pairs, its decision method is: construct collection point, former LAC base station polygon and existing LAC base station requests point polygon, by polygon path matching algorithm to the architecture request priority treatment with gps signal, afterwards other in the short time are not processed with the architecture request of gps signal, finally generated LAC handoff list;
Wherein, there are following 2 kinds of rudimentary algorithms:
Algorithm 1: polygon builds fast algorithm, and step is as follows:
Step 1a: build the boundary rectangle of discrete point set, calculate longitude and latitude minimum and maximum in discrete point set;
Step 1b: the longitude and latitude that calculates discrete point crossing with boundary rectangle in discrete point set;
Step 1c: calculate by spot projection, construct the positive convex polygon that the part point of outermost in a discrete point set forms in certain sequence;
Algorithm 2: polygon path matching algorithm, step is as follows:
Step 2a: point judges in polygon: build a positive convex polygon according to algorithm 1, judge that according to calculation of longitude & latitude a discrete point is whether in this positive convex polygon.
Step 2b: expanding external rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon, expanding external rectangle;
Step 2c: path matching calculates: the existing Second Eigenvalue of setting all discrete points in positive convex polygon is identical with former Second Eigenvalue, contrast existing the First Eigenvalue and the former the First Eigenvalue of all discrete points in positive convex polygon, carry out path matching, its path matching result of calculation is divided into following several situation:
A. the existing the First Eigenvalue of all discrete points is A, and the former the First Eigenvalue of all discrete points is A;
B. the existing the First Eigenvalue of all discrete points is B, but the former the First Eigenvalue of all discrete points is A;
C. the existing the First Eigenvalue of part discrete point is A, and the existing the First Eigenvalue of remaining discrete point is B, C, D, E ... (one or more), the former the First Eigenvalue of all discrete points is A;
D. the existing the First Eigenvalue of all discrete points is B, C, D, E ... one or more, but the former the First Eigenvalue of all discrete points is A;
E. the existing the First Eigenvalue of all discrete points is A, but the former the First Eigenvalue of all discrete points is B, C, D, E ... one or more;
Preferably, the First Eigenvalue of described discrete point is LAC, and the Second Eigenvalue of described discrete point is CellID, adopts such characteristic value combinations, can more simply and uniquely determine this discrete point.
According to above-mentioned 2 kinds of rudimentary algorithms, LAC to be carried out in the base station of intending switching and be switched and determined processing, the handling process of process C is:
Step 300, enters this process, goes to step 301.
Step 301, travels through each LAC and intends handoff list.Go to step 302.
Step 302, adopts above-mentioned polygon to build fast algorithm circulation and builds existing LAC base station requests point polygon.Go to step 303.
Step 303, loads corresponding collection point, former LAC base station information.Go to step 304.
Step 304, adopts the step 2a of above-mentioned polygon path matching algorithm to judge in the existing LAC base station requests point polygon of whether intending switching at LAC in collection point, former LAC base station.If so, go to step 305; Otherwise go to step 306.
Step 305, records a certain existing corresponding polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon.Go to step 307.
Step 306, if there is no corresponding collection point, former LAC base station in existing LAC base station requests point polygon, the base station information of being treated as a series of new collections supplements and gathers compiling.Go to step 303.
Step 307, classifies the LAC in showed LAC base station requests point polygon according to above-mentioned polygon path matching algorithm, and all kinds of LAC are carried out sorting by LAC weight with the preferential principle of dominant base.Go to step 308.
Step 308, further matching degree sequence with the CellID of request by it by the CellID after all kinds of LAC.Go to step 309.
Step 309, completes the LAC switching judging with gps signal request so far, preserves these intermediate object program, comprises the concrete Termination ID and the relevant LAC information thereof that send these base station requests.Go to step 310.
Step 310, follows the tracks of other the not requests with gps signal at short notice of same terminal.Go to step 311.
Step 311, re-starts one-off pattern and drafts position, simulates location with the corresponding acquired original point LAC+CellID combination judging through early stage.Go to step 312.
Step 312, judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error of recording when the error range that has both been less than original LAC+CellID combination is less than existing base station requests again.To go to step 313; Otherwise go to step 311, carry out the simulation location of next group handover information.
Step 313, preserves handover information, comprises original LAC and existing LAC and CellID information thereof.Go to step 314.
Step 314, exits this process.
Further, in described process D, according to LAC handoff list, LAC is switched and is divided into following three kinds of switching types:
1. switch (switching one to one) completely: the base station in a former LAC region all switches to an existing LAC region;
2. local switching (one-to-many switching): the base station in a former LAC region switches to multiple existing LAC regions; Or LAC switching is not carried out in the part base station in a former LAC region, remaining base station switches to one or more existing LAC region;
3. merge and switch (many-one switching): the base station in multiple former LAC region switches to an existing LAC region;
And respectively the base station data of former LAC is carried out to LAC correction according to these three kinds of switching types, and revised base station data is done to a mark according to its switching type.
Further, in described process E, switch for dissimilar LAC, recalculate the longitude and latitude in existing LAC region according to revised base station:
1. switch (switching one to one) completely: the longitude and latitude that directly recalculates existing LAC region according to the base station data of former LAC;
2. locally switch (one-to-many switchings): account for 0.62 of total number of base in former LAC region if there is the base station number of LAC switching in former LAC region, recalculate existing LAC longitude and latitude according to revised base station data, and cover former LAC longitude and latitude
3. merge and switch (many-one switching): calculate the base station data mean value in former LAC region, and calculate existing LAC longitude and latitude according to this.
Preferably, described setting threshold X is 6 kilometers, and described setting threshold Y is 50 meters.
A kind of base station LAC changing method based on wireless location of the present invention, the data that can effectively correct mistakes, improve base station data, overcome because mobile LAC switches that the location causing is inaccurate, degradation problem under positioning precision.
Accompanying drawing explanation
Fig. 1 be the present invention is based in the base station LAC changing method of wireless location a kind of because LAC switches the abnormal schematic diagram in location causing.
Fig. 2 is the schematic diagram that the present invention is based on an embodiment overall process in the base station LAC changing method of wireless location.
Fig. 3 the present invention is based on the schematic diagram of simulating position fixing process in the base station LAC changing method of wireless location.
Fig. 4 the present invention is based on the schematic diagram that extracts the large and location failure request of position error in the base station LAC changing method of wireless location.
Fig. 5 the present invention is based in the base station LAC changing method of wireless location, to judge a kind of model schematic diagram of constructing polygon object algorithm of subprocess that LAC switches.
Fig. 6 the present invention is based in the base station LAC changing method of wireless location, to judge the switch schematic diagram of idiographic flow of LAC.
Fig. 7 the present invention is based on the schematic diagram of revising base station data flow process in the base station LAC changing method of wireless location.
Fig. 8 is the schematic diagram that the present invention is based on the LAC longitude and latitude flow process of reruning in the base station LAC changing method of wireless location.
Embodiment
Now the present invention is further described with embodiment by reference to the accompanying drawings.
The noun that we will or use is first described.
LAC: region code
CellID: base station cell ID
Former LAC: the LAC information that raw data base gathers, but due to mobile switching, suppose A switching->B, the base station under former LAC just becomes wrong base station data now, A is now exactly former LAC, and the base station that this routine Central Plains LAC gathers before being is stored in the data in database.
Existing LAC: the LAC information that existing mobile phone terminal gathers is up-to-date base station information, supposes A switching->B, B shows LAC, i.e. correct base station data.
1. switch (switching one to one) completely: the base station in a former LAC region all switches to an existing LAC region;
2. local switching (one-to-many switching): the base station in a former LAC region switches to multiple existing LAC regions; Or LAC switching is not carried out in the part base station in a former LAC region, remaining base station switches to one or more existing LAC region;
3. merge and switch (many-one switching): the base station in multiple former LAC region switches to an existing LAC region;
Switch submodel 1 (position error is greater than 6 kilometers): as shown in Figure 1, the LAC of terminal T region is originally in a-quadrant, and now transforms to B region, causes existing terminal T to navigate to B position in A position, and position error expands.
Switch submodel 2 (locating unsuccessfully): locating failed reason is owing to not matching LAC+CellID combination, and LAC switches and also may cause above phenomenon, if so simulation positioning result is for to locate unsuccessfully, also likely there is LAC switching in this LAC, is defined as intending the LAC information of switching.
Overall process of embodiment of a kind of base station LAC changing method based on wireless location of the present invention, as shown in Figure 2.
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and mobile terminal is simulated to location.
Process B, extracts the Location Request that simulation position error is greater than 6 kilometers and failed base station, simulation location, generates LAC and intends handoff list.
Process C, carries out the processing of LAC switching determination for the base station that LAC intends switching, and generates base station LAC handoff list.
Process D, carries out LAC correction according to base station LAC handoff list to the base station of former LAC.
Process E, recalculates the longitude and latitude in existing LAC region according to the revised base station of LAC.
Process A is the idiographic flow of simulation location, resolves the Location Request of all base stations, if LAC+CellID combination can be located, adopts LAC+CellID location, adopts first base station CellID that can match to position; Otherwise, if LAC can locate, adopt LAC location; If the Location Request of all base stations all fails to match LAC, restoring to normal position failure.The idiographic flow of simulation location, as shown in Figure 3.
Step 100, enters this process, goes to step 101.
Step 101, loading all base station requests to memory-mapped is base station information concordance list, and the information that request record comprises has base station requests string (maximum 7 groups of base station informations) that terminal uploads, request time, Termination ID, operator's mark, GPS information, anchor point, position error etc.Go to step 102.
Step 102, traversal is the station list of request once, i.e. base station requests string (maximum 7 groups of base station informations), from dominant base, dominant base is first base station information of base station requests string, goes to step 103.
Step 103, judges whether current base station LAC can locate, and is to go to step 104; Otherwise go to step 105.
Step 104, preserves the LAC information that current success is located, and goes to step 106.
Step 105, continues to judge whether current base station is last base station information, is that restoring to normal position is unsuccessfully replied or LAC positioning result, goes to step 109; Otherwise go to step 102, continue to get next base station and simulate location.
Step 106, current LAC successfully locates, continues to judge by binary search whether this LAC+CellID can locate, be to go to step 107; Otherwise go to step 108.
Step 107, base station IDs is located successfully, because the priority of base station IDs location is greater than LAC location, the LAC positioning result before therefore replacing with the positioning result of base station IDs, successfully location goes to step 109.
Step 108, the principle of simulation location, base station sequence number is more forward, its priority is higher, so once base station IDs location is unsuccessful, adopts first to locate successful LAC it is located, and can not be covered by follow-up operation, roll back to after first LAC successfully locating, go to step 105.
Step 109, ending said process.
Process B determines the idiographic flow of intending switching LAC, all simulation positioning results are classified, whether the result that judges simulation location meets with next: B1: adopt LAC+CellID location and error to be greater than setting threshold X, B2: adopt LAC location and error to be greater than setting threshold X, B3: to locate unsuccessfully.If the result of simulation location meets above any one, the base station requests information that the base station requests Information Organization of above-mentioned three kinds of situations is become to press LAC index.Extract the idiographic flow of intending switching LAC information, as shown in Figure 4.
Step 200, enters this process, goes to step 201.
Step 201, takes out a simulation positioning result record, goes to step 202 or step 203.
Step 202, extracts LAC locating information, goes to step 204.
Step 203, judges whether to locate unsuccessfully, is to go to step 205; Otherwise go to step 201, continue to take off a simulation positioning result and judge.
Step 204, whether error in judgement is greater than 6 kilometers, is to go to step 205.Otherwise go to step 201, continue to take off a simulation positioning result and judge.
Step 205, according to send when base station requests with gps signal shine upon its corresponding city, go to step 206.
Step 206, adopt LAC position error be greater than 6 kilometers or while locate unsuccessfully the LAC of request be the information of plan switching, preserve these information, go to step 207.
Step 207, ending said process.
Process C is the flow process that judges that LAC switches, compared with the key link in the present invention, construct collection point, former LAC base station polygon and existing LAC base station requests point polygon, by polygon path matching algorithm to the architecture request priority treatment with gps signal, afterwards other in the short time are not processed with the architecture request of gps signal, it carries out the processing of LAC switching determination the base station of traversal plan handoff list, former LAC and the existing LAC at the place, base station that LAC switching occurs are made as to LAC handoff list in pairs, finally generate LAC handoff list;
Wherein, there are following 2 kinds of rudimentary algorithms:
Algorithm 1: polygon builds fast algorithm, and step is as follows:
Step 1a: build the boundary rectangle of discrete point set, calculate longitude and latitude minimum and maximum in discrete point set;
Step 1b: the longitude and latitude that calculates discrete point crossing with boundary rectangle in discrete point set;
Step 1c: calculate by spot projection, construct the positive convex polygon that the part point of outermost in a discrete point set forms in certain sequence;
Algorithm 2: polygon path matching algorithm, step is as follows:
Step 2a: point judges in polygon: build a positive convex polygon according to algorithm 1, judge that according to calculation of longitude & latitude a discrete point is whether in this positive convex polygon;
Step 2b: expanding external rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon, expanding external rectangle;
Step 2c: path matching calculates: the existing Second Eigenvalue of setting all discrete points in positive convex polygon is identical with former Second Eigenvalue, contrast existing the First Eigenvalue and the former the First Eigenvalue of all discrete points in positive convex polygon, carry out path matching, its path matching result of calculation is divided into following several situation:
A. the existing the First Eigenvalue of all discrete points is A, and the former the First Eigenvalue of all discrete points is A;
B. the existing the First Eigenvalue of all discrete points is B, but the former the First Eigenvalue of all discrete points is A;
C. the existing the First Eigenvalue of part discrete point is A, and the existing the First Eigenvalue of remaining discrete point is B, C, D, E ... (one or more), the former the First Eigenvalue of all discrete points is A;
D. the existing the First Eigenvalue of all discrete points is B, C, D, E ... one or more, but the former the First Eigenvalue of all discrete points is A;
E. the existing the First Eigenvalue of all discrete points is A, but the former the First Eigenvalue of all discrete points is B, C, D, E ... one or more;
According to above-mentioned 2 kinds of rudimentary algorithms, LAC to be carried out in the base station of intending switching and be switched and determined processing, the handling process of process C is:
Step 300, enters this process, goes to step 301.As shown in Figure 6.
Step 301, travels through each LAC and intends handoff list.Go to step 302.
Step 302, adopts above-mentioned polygon to build fast algorithm circulation and builds existing LAC base station requests point polygon.Go to step 303.
Step 303, loads corresponding collection point, former LAC base station information.Go to step 304.
Step 304, adopts the step 2a of above-mentioned polygon path matching algorithm to judge in the existing LAC base station requests point polygon of whether intending switching at LAC in collection point, former LAC base station.If so, go to step 305; Otherwise go to step 306.
Step 305, records a certain existing corresponding polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon.Go to step 307.
Step 306, if there is no corresponding collection point, former LAC base station in existing LAC base station requests point polygon, the base station information of being treated as a series of new collections supplements and gathers compiling.Go to step 303.
Step 307, classifies the LAC in showed LAC base station requests point polygon according to above-mentioned polygon path matching algorithm, and all kinds of LAC are carried out sorting by LAC weight with the preferential principle of dominant base.Go to step 308.
Step 308, further matching degree sequence with the CellID of request by it by the CellID after all kinds of LAC.Go to step 309.
Step 309, completes the LAC switching judging with gps signal request so far, preserves these intermediate object program, comprises the concrete Termination ID and the relevant LAC information thereof that send these base station requests.Go to step 310.
Step 310, follows the tracks of other the not requests with gps signal at short notice of same terminal.Go to step 311.
Step 311, re-starts one-off pattern and drafts position, simulates location with the corresponding acquired original point LAC+CellID combination judging through early stage.Go to step 312.
Step 312, judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error of recording when the error range that has both been less than original LAC+CellID combination is less than existing base station requests again.To go to step 313; Otherwise go to step 311, carry out the simulation location of next group handover information.
Step 313, preserves handover information, comprises original LAC and existing LAC and CellID information thereof.Go to step 314.
Step 314, exits this process.
Process D is process initial data being processed according to handoff list, switch instances is classified: switching one to one, one-to-many switch and many-one switches, and according to different situations, source base station data are revised, each switches all needs to consider whether adjacent block of former LAC pickup area and existing LAC region, to respective base station being indicated to different flag bits according to different switching types after data exchange.Concrete handling process, as shown in Figure 7.
Step 400, enters this process, goes to step 401.
Step 401, the handoff list that loading procedure C generates, and it is classified by different switching types, be divided into switching one to one, one-to-many switching and many-one and switch, go to step 402.
Step 402, carries out original LAC region to every kind of switching type and judges with the adjacent block of existing LAC: if adjacent block goes to step 403; Otherwise go to step 404.
Step 403, simulates location to the base station under former LAC, and the result that navigates to of judgement gps signal position distance when now sending this LAC request whether in 500 meters, if LAC expands, goes to step 405; Otherwise go to step 406.
Step 404, the non-adjacent block in Yu XianLAC region, original LAC region, switches completely for LAC, belongs to switching type one to one.Go to step 407.
Step 405, in the time that LAC expands, needs former LAC to merge processing with the base station under existing LAC, goes to step 407.
Step 406, if not adjacent block LAC expands, belongs to local and switches, and in a LAC, some base station does not switch, and be still former LAC, and remaining part switches to one or more new LAC.Go to step 407.
Step 407, compiles the base station data switching, and in certain base station being carried out to the LAC handover operation of a type, adds corresponding flag bit.The concrete method of processing switching mark position is in table 1.Go to step 408.
Step 408, exits this process.
Table 1 switching mark position implication list
Note: wherein a b c d is self-defined constant.
Process E is the process of reruning of LAC longitude and latitude, divide switching completely, local switching and merging switching according to different switching types, wherein partial cut is changed to more common one, if its standard of reruning is the base station that switches in a certain LAC to be accounted for the total base station of this LAC ratio and reaches 0.62, according to rerun LAC position cover original LAC longitude and latitude, revised base station.The idiographic flow that LAC longitude and latitude is reruned, as shown in Figure 8.
Step 500, enters this process, goes to step 501.
Step 501, the different LAC switching type information of retrieval from internal memory, goes to step 502.
Step 502, if complete switching type (one to one) goes to step 505.
Step 503, if local switching type (one-to-many) goes to step 506.
Step 504, if merge switching type (many-one), goes to step 508.
Step 505, former LAC is entirely existing LAC and substitutes, and just directly rerun and obtain according to source base station in the position of this LAC.Go to step 509.
Step 506, the ratio that base station shifting has accounted for the total base station of this LAC number reaches 0.62,, according to rerun LAC position cover original LAC longitude and latitude, revised base station, goes to step 507; Otherwise go to step 509.
Step 507, the LAC position of the mean value of getting the latitude and longitude of base station after corrigendum after as this switching.Go to step 509.
Step 508, many-one switches, and gets the LAC position after the average conduct switching in base station under each former LAC.Go to step 509.
Step 509, exits this process.
Although specifically show and introduced the present invention in conjunction with preferred embodiment; but those skilled in the art should be understood that; not departing from the spirit and scope of the present invention that appended claims limits; can make a variety of changes the present invention in the form and details, be protection scope of the present invention.
Claims (6)
1. the base station LAC changing method based on wireless location, is characterized in that, the process comprising has:
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and mobile terminal is simulated to location;
Process B, extracts simulation position error and is greater than setting threshold and simulates the Location Request of failed base station, location, generates LAC and intends handoff list;
Process C, carries out the processing of LAC switching determination for the base station that LAC intends switching, and generates base station LAC handoff list;
Concrete: it carries out the processing of LAC switching determination the base station of traversal plan handoff list, former LAC and the existing LAC at the place, base station that LAC switching occurs are made as to LAC handoff list in pairs, its decision method is: construct collection point, former LAC base station polygon and existing LAC base station requests point polygon, by polygon path matching algorithm to the architecture request priority treatment with gps signal, afterwards other in the short time are not processed with the architecture request of gps signal, finally generated LAC handoff list;
Wherein, there are following 2 kinds of rudimentary algorithms:
Algorithm 1: polygon builds fast algorithm, and step is as follows:
Step 1a: build the boundary rectangle of discrete point set, calculate longitude and latitude minimum and maximum in discrete point set;
Step 1b: the longitude and latitude that calculates discrete point crossing with boundary rectangle in discrete point set;
Step 1c: calculate by spot projection, construct the positive convex polygon that the part point of outermost in a discrete point set forms in certain sequence;
Algorithm 2: polygon path matching algorithm, step is as follows:
Step 2a: point judges in polygon: build a positive convex polygon according to algorithm 1, judge that according to calculation of longitude & latitude a discrete point is whether in this positive convex polygon;
Step 2b: expanding external rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon, expanding external rectangle;
Step 2c: path matching calculates: the existing Second Eigenvalue of setting all discrete points in positive convex polygon is identical with former Second Eigenvalue, contrast existing the First Eigenvalue and the former the First Eigenvalue of all discrete points in positive convex polygon, carry out path matching, its path matching result of calculation is divided into following several situation:
A. the existing the First Eigenvalue of all discrete points is A, and the former the First Eigenvalue of all discrete points is A;
B. the existing the First Eigenvalue of all discrete points is B, but the former the First Eigenvalue of all discrete points is A;
C. the existing the First Eigenvalue of part discrete point is A, and the existing the First Eigenvalue of remaining discrete point is B, C, D, E ... one or more, the former the First Eigenvalue of all discrete points is A;
D. the existing the First Eigenvalue of all discrete points is B, C, D, E ... one or more, but the former the First Eigenvalue of all discrete points is A;
E. the existing the First Eigenvalue of all discrete points is A, but the former the First Eigenvalue of all discrete points is B, C, D, E ... one or more;
According to above-mentioned 2 kinds of rudimentary algorithms, LAC to be carried out in the base station of intending switching and be switched and determined processing, the handling process of process C is:
Step 300, enters this process, goes to step 301;
Step 301, travels through each LAC and intends handoff list, goes to step 302;
Step 302, adopts above-mentioned polygon to build fast algorithm circulation and builds existing LAC base station requests point polygon, goes to step 303;
Step 303, loads corresponding collection point, former LAC base station information, goes to step 304;
Step 304, adopts the step 2a in above-mentioned polygon path matching algorithm to judge in the existing LAC base station requests point polygon of whether intending switching at LAC in collection point, former LAC base station, if so, goes to step 305; Otherwise go to step 306;
Step 305, records a certain existing corresponding polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon, goes to step 307;
Step 306, if there is no corresponding collection point, former LAC base station in existing LAC base station requests point polygon, the base station information of being treated as a series of new collections supplements and gathers compiling, goes to step 303;
Step 307, switches the LAC in all existing LAC base station requests point polygons to classify according to above-mentioned polygon path matching algorithm, and all kinds of LAC are switched and carry out sorting by LAC weight with the preferential principle of dominant base, goes to step 308;
Step 308, the CellID matching degree sequence with the CellID of request by it after further all kinds of LAC being switched, goes to step 309;
Step 309, completes the LAC switching judging with gps signal request so far, preserves these intermediate object program, comprises the concrete Termination ID and the relevant LAC information thereof that send these base station requests, goes to step 310;
Step 310, follows the tracks of other the not requests with gps signal at short notice of same terminal, goes to step 311;
Step 311, re-starts one-off pattern and drafts position, simulates location with the corresponding acquired original point LAC+CellID combination judging through early stage, goes to step 312;
Step 312, judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error of recording when the error range that has both been less than original LAC+CellID combination is less than existing base station requests is again to go to step 313; Otherwise go to step 311, carry out the simulation location of next group handover information;
Step 313, preserves handover information, comprises original LAC and existing LAC and CellID information thereof, goes to step 314;
Step 314, exits this process;
Process D, carries out LAC correction according to base station LAC handoff list to the base station of former LAC;
Process E, recalculates the longitude and latitude in existing LAC region according to the revised base station of LAC.
2. a kind of base station LAC changing method based on wireless location according to claim 1, it is characterized in that: in described process A, resolve the Location Request of all base stations, if LAC+CellID combination can be located, adopt LAC+CellID location, adopt first base station CellID that can match to position; Otherwise, if LAC can locate, adopt LAC location; If the Location Request of all base stations all fails to match LAC, restoring to normal position failure.
3. a kind of base station LAC changing method based on wireless location according to claim 1, is characterized in that: in described process B, judge whether the result of simulation location meets with next:
B1: adopt LAC+CellID location and error to be greater than setting threshold X;
B2: adopt LAC location and error to be greater than setting threshold X;
B3: locate unsuccessfully;
If the result of simulation location meets above any one, the base station requests information that the base station requests Information Organization of above-mentioned three kinds of situations is become to press LAC index.
4. a kind of base station LAC changing method based on wireless location according to claim 3, is characterized in that: described setting threshold X is 6 kilometers, and described setting threshold Y is 50 meters.
5. a kind of base station LAC changing method based on wireless location according to claim 1, is characterized in that: in described process D, according to LAC handoff list, LAC is switched and is divided into following three kinds of switching types:
1. switch (switching one to one) completely: the base station in a former LAC region all switches to an existing LAC region;
2. local switching (one-to-many switching): the base station in a former LAC region switches to multiple existing LAC regions; Or LAC switching is not carried out in the part base station in a former LAC region, remaining base station switches to one or more existing LAC region;
3. merge and switch (many-one switching): the base station in multiple former LAC region switches to an existing LAC region;
And respectively the base station data of former LAC is carried out to LAC correction according to these three kinds of switching types, and revised base station data is done to a mark according to its switching type.
6. a kind of base station LAC changing method based on wireless location according to claim 1, is characterized in that: in described process E, switch for dissimilar LAC, recalculate the longitude and latitude in existing LAC region according to revised base station:
1. switch (switching one to one) completely: the longitude and latitude that directly recalculates existing LAC region according to the base station data of former LAC;
2. locally switch (one-to-many switchings): account for 0.62 of total number of base in former LAC region if there is the base station number of LAC switching in former LAC region, recalculate existing LAC longitude and latitude according to revised base station data, and cover former LAC longitude and latitude;
3. merge and switch (many-one switching): calculate the base station data mean value in former LAC region, and calculate existing LAC longitude and latitude according to this.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110137094.3A CN102196561B (en) | 2011-05-25 | 2011-05-25 | Base station LAC (Location Area Code) switching method based on wireless positioning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110137094.3A CN102196561B (en) | 2011-05-25 | 2011-05-25 | Base station LAC (Location Area Code) switching method based on wireless positioning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102196561A CN102196561A (en) | 2011-09-21 |
| CN102196561B true CN102196561B (en) | 2014-07-09 |
Family
ID=44603770
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110137094.3A Active CN102196561B (en) | 2011-05-25 | 2011-05-25 | Base station LAC (Location Area Code) switching method based on wireless positioning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102196561B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103377585B (en) * | 2012-04-25 | 2017-02-08 | 腾讯科技（深圳）有限公司 | Method for locating administrative division based on longitude and latitude |
| CN103298042B (en) * | 2013-05-12 | 2016-02-24 | 南京载玄信息科技有限公司 | The transregional intelligent switch method of multi signal based on Animal Behavior Science and device |
| CN105992338B (en) * | 2015-02-12 | 2019-12-24 | 阿里巴巴集团控股有限公司 | Positioning method and device |
| CN106488558A (en) * | 2016-11-14 | 2017-03-08 | 刘兰平 | Mobile phone signal localization method and device |
| CN109548139B (en) * | 2018-08-27 | 2021-03-23 | 福建新大陆软件工程有限公司 | KNN-based cell base station longitude and latitude data correction method |
| CN111787488B (en) * | 2020-06-29 | 2022-07-05 | 北京东方国信科技股份有限公司 | User positioning method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146268A (en) * | 2007-10-08 | 2008-03-19 | 华为技术有限公司 | Realization method, communication system and base station for multi-media broadcast and multi-cast service |
| CN101895922A (en) * | 2009-05-20 | 2010-11-24 | 大唐移动通信设备有限公司 | Information acquisition method, system and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI20075469A0 (en) * | 2007-06-20 | 2007-06-20 | Nokia Siemens Networks Oy | Private base station accessibility |
-
2011
- 2011-05-25 CN CN201110137094.3A patent/CN102196561B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146268A (en) * | 2007-10-08 | 2008-03-19 | 华为技术有限公司 | Realization method, communication system and base station for multi-media broadcast and multi-cast service |
| CN101895922A (en) * | 2009-05-20 | 2010-11-24 | 大唐移动通信设备有限公司 | Information acquisition method, system and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102196561A (en) | 2011-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102196561B (en) | Base station LAC (Location Area Code) switching method based on wireless positioning | |
| CN101668335B (en) | Method and locating device for locating at least one mobile radio subscriber | |
| CN110213724B (en) | Pseudo base station motion trajectory identification method | |
| US8903403B2 (en) | Method and apparatus for evaluating cross-cell coverage | |
| CN102271394B (en) | Call-record-data-based mobile terminal positioning method and device | |
| CN104461281A (en) | Managing method and managing server of mobile terminal desktop icons and mobile terminal | |
| CN101299834A (en) | Method for checking base station position | |
| CN106101999A (en) | The recognition methods of a kind of user trajectory and device | |
| EP2773151B1 (en) | Cellular Tower Disambiguation For Use In GeoLocation Of Mobile Devices | |
| CN111935733B (en) | Method, device and equipment for checking base station position information and computer storage medium | |
| CN105491529A (en) | Memory mapping processing method of mobile terminal location data and big data platform | |
| CN104537102A (en) | Positive geocoding service method and system for obtaining longitude and latitude | |
| CN104144423A (en) | False base station positioning method and network server | |
| CN105517148A (en) | Positioning method and device | |
| US7359712B2 (en) | Method and apparatus for confirming position of a mobile station | |
| CN102131170B (en) | Method, system and equipment for positioning mobile terminal | |
| CN104796981A (en) | Safety region alarming method and system based on plurality of base station marks as well as mobile terminal | |
| CN114390438B (en) | Traffic equipment positioning method and device | |
| CN112235714B (en) | POI positioning method and device based on artificial intelligence, computer equipment and medium | |
| CN106162548B (en) | Method and device for identifying ultra-far neighbor cell coverage | |
| CN113207170B (en) | Position fusion correction method based on multi-source signaling | |
| KR100619389B1 (en) | System and method for setting up the service zone based on bts in mobile communication network | |
| CN101938769A (en) | Method and system for processing optimized data for wireless communication network | |
| CN115604656B (en) | Label positioning method, system and electronic equipment based on scene binding | |
| CN111356152A (en) | Base station position correction method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |