CN102196561A - 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 PDF

Info

Publication number
CN102196561A
CN102196561A CN2011101370943A CN201110137094A CN102196561A CN 102196561 A CN102196561 A CN 102196561A CN 2011101370943 A CN2011101370943 A CN 2011101370943A CN 201110137094 A CN201110137094 A CN 201110137094A CN 102196561 A CN102196561 A CN 102196561A
Authority
CN
China
Prior art keywords
lac
base station
former
switching
existing
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.)
Granted
Application number
CN2011101370943A
Other languages
Chinese (zh)
Other versions
CN102196561B (en
Inventor
吕春月
黄家乾
陆萍
时宜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen Yaxon Networks Co Ltd
Original Assignee
Xiamen Yaxon Networks Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen Yaxon Networks Co Ltd filed Critical Xiamen Yaxon Networks Co Ltd
Priority to CN201110137094.3A priority Critical patent/CN102196561B/en
Publication of CN102196561A publication Critical patent/CN102196561A/en
Application granted granted Critical
Publication of CN102196561B publication Critical patent/CN102196561B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

A kind of base station LAC changing method based on wireless location
Technical field
The present invention relates to Location Based Services, a kind of base stations detected LAC changing method, thus finish correction to base station data, reach the effect that improves positioning accuracy.
Background technology
Location Based Services is called location-based service again, and (Location-Based-Services LBS), is meant the cooperation by portable terminal and mobile communication network navigation system, determines mobile subscriber's actual geographical position, is a kind of value-added service relevant with the position.Therefore wireless location technology is key technology among the LBS, also is simultaneously to solve enterprise to move the effective means of using as comprehensive location requirement (comprising indoor, outdoor) in the mobile crm system.
In the mobile communication network navigation system, be to position according to the base station location that portable terminal inserts.The data owner of base station will comprise: the longitude and latitude at LAC, CellID and place thereof.These data are basic datas of position fixing process, be the basic of accurate positioning, LAC+CellID can a base station of unique identification ID, the position of the base station of a reality can not change, in case but its ID has changed, just cause many traditional outstanding location algorithms also to become unable to do what one wishes, so all location algorithms all to make up under the consistent errorless prerequisite with its latitude and longitude coordinates of ID and carry out at LAC+CellID.
The LAC that finds the base station in the mobile communication network navigation system fails and position error expansion thereby cause locating owing to practical application request is adjusted in the recent period, and remedy this shortcoming needs the LAC data of base station are revised.Existing technical scheme is to utilize the mobile phone have the GPS module to come image data by the client, but this mode more new database need consuming time more of a specified duration, correction of data timely and effectively, real-time is relatively poor; Also having a kind of mode is by Special Equipment image data again, needs equally to strengthen the cost input, 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 with effective tracking mobile terminal and switches, and realize correction to wrong LAC data, and improve base station data, effectively improve positioning accuracy, 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 that comprises has:
A kind of base station LAC changing method based on wireless location, the process that comprises has:
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and portable terminal is simulated the location;
Process B extracts the Location Request of simulation position error greater than the base station of setting threshold and the failure of 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 according to base station LAC handoff list to the base station of former LAC and revises;
Process E recomputates the longitude and latitude in existing LAC zone according to the revised base station of LAC.
Further, in described process A, resolve the Location Request of all base stations,, then adopt the LAC+CellID location, promptly adopt first base station CellID that can match to position if LAC+CellID combination can be located; Otherwise,, then adopt the LAC location if LAC can locate; If the Location Request of all base stations all fails to match LAC, then restoring to normal position failure.
Further, in described process B, judge whether the result of simulation location satisfies with next bar:
B1: adopt LAC+CellID location and error greater than setting threshold X;
B2: adopt LAC location and error greater than setting threshold X;
B3: location failure;
If the result of simulation location satisfies above any one, then the base station requests information sets of above-mentioned three kinds of situations is made into base station requests information by the 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 existing LAC that the place, base station of LAC switching takes place are made as the 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 the base station Location Request priority treatment of polygon track matching algorithm to the band gps signal, does not handle with the base station Location Request of gps signal in the short time other back, finally generates the LAC handoff list;
Wherein, following 2 kinds of rudimentary algorithms are arranged:
Algorithm 1: polygon makes up fast algorithm, and step is as follows:
Step 1a: make up the boundary rectangle of discrete point set, calculate minimum and maximum longitude and latitude in the discrete point set;
Step 1b: the longitude and latitude that calculates the discrete point that intersects with boundary rectangle in the discrete point set;
Step 1c: calculate by spot projection, construct the part of outermost in the discrete point set and press the positive convex polygon that a definite sequence constitutes;
Algorithm 2: polygon track matching algorithm, step is as follows:
Step 2a: point is judged in polygon: make up a positive convex polygon according to algorithm 1, calculating judges that a discrete point is whether in this positive convex polygon according to longitude and latitude.
Step 2b: expansion boundary rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon then expands boundary rectangle;
Step 2c: the track coupling is calculated: existing second characteristic value and former second characteristic value of setting all discrete points in the positive convex polygon are identical, contrast existing first characteristic value and former first characteristic value of all discrete points in the positive convex polygon, carry out the track coupling, its track coupling result of calculation is divided into following several situation:
A. existing first characteristic value of all discrete points is A, and former first characteristic value of all discrete points is A;
B. existing first characteristic value of all discrete points is B, but former first characteristic value of all discrete points is A;
C. existing first characteristic value of part discrete point is A, and existing first characteristic value of remaining discrete point is B, C, D, E ... (one or more), former first characteristic value of all discrete points is A;
D. existing first characteristic value of all discrete points is B, C, D, E ... one or more, but former first characteristic value of all discrete points is A;
E. existing first characteristic value of all discrete points is A, but former first characteristic value of all discrete points is B, C, D, E ... one or more;
Preferably, first characteristic value of described discrete point is LAC, and second characteristic value of described discrete point is CellID, adopts the combination of such characteristic value, can be more simply and determine this discrete point uniquely.
According to above-mentioned 2 kinds of rudimentary algorithms, LAC to be carried out in the base station of intending switching be switched and determined processing, the handling process of process C is:
Step 300 enters this process, changes step 301.
Step 301 travels through each LAC and intends handoff list.Change step 302.
Step 302 adopts above-mentioned polygon to make up the fast algorithm circulation and makes up existing LAC base station requests point polygon.Change step 303.
Step 303 loads corresponding collection point, former LAC base station information.Change step 304.
Step 304 adopts the step 2a of above-mentioned polygon track matching algorithm to judge that collection point, former LAC base station is whether in the existing LAC base station requests point polygon that LAC intends switching.If then change step 305; Otherwise change step 306.
Step 305 writes down a certain now polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon correspondence.Change step 307.
Step 306 if do not have corresponding collection point, former LAC base station in the existing LAC base station requests point polygon, is then replenished its base station information as a series of new collections and is gathered compiling.Change step 303.
Step 307 is classified the LAC in the showing LAC base station requests point polygon according to above-mentioned polygon track matching algorithm, and all kinds of LAC are carried out sorting by the LAC weight with the dominant base principle of priority.Change step 308.
Step 308 further sorts the CellID behind all kinds of LAC by its matching degree with the CellID of request.Change step 309.
Step 309 is promptly finished the LAC switching judging of being with the 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.Change step 310.
Step 310 is followed the tracks of at short notice other of same terminal not with the request of gps signal.Change step 311.
Step 311 is carried out one-off pattern again and is drafted the position, simulates the location with the acquired original point LAC+CellID combination of passing through the correspondence that judges early stage.Change step 312.
Step 312 judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error that the error range that both has been less than original LAC+CellID combination is noted during again less than existing base station requests.Be then to change step 313; Otherwise change step 311, carry out the simulation location of next group handover information.
Step 313 is preserved handover information, comprises original LAC and existing LAC and CellID information thereof.Change step 314.
Step 314 withdraws from this process.
Further, in described process D, the LAC switching is divided into following three kinds of switching types according to the LAC handoff list:
1. switch (switching one to one) fully: the base station in former LAC zone all switches to an existing LAC zone;
2. locally switch (one-to-many switchings): the base station in former LAC zone switches to a plurality of LAC zones that show; Perhaps the part base station in former LAC zone is not carried out LAC and is switched, and remaining base station switches to one or more existing LAC zone;
3. merge and switch (many-one switching): the base station in a plurality of former LAC zone switches to an existing LAC zone;
And respectively the base station data of former LAC is carried out LAC according to these three kinds of switching types and revise, and revised base station data is done a mark according to its switching type.
Further, in described process E, switch, recomputate the longitude and latitude in existing LAC zone according to revised base station at dissimilar LAC:
1. switch (switching one to one) fully: the longitude and latitude that directly recomputates existing LAC zone 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 the former LAC zone if the base station number of LAC switching takes place in the former LAC zone, then recomputate existing LAC longitude and latitude, and cover former LAC longitude and latitude according to revised base station data
3. merge and switch (many-one switching): calculate the base station data mean value in former LAC zone, 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 are improved base station data, overcome that the location that causes is inaccurate because mobile LAC switches, degradation problem under the positioning accuracy.
Description of drawings
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 unusual schematic diagram in location that causes.
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 is the schematic diagram that the present invention is based on simulation 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 big and location failure request of position error in the base station LAC changing method of wireless location.
Fig. 5 the present invention is based on to judge a kind of model schematic diagram of constructing polygon object algorithm of subprocess that LAC switches in the base station LAC changing method of wireless location.
Fig. 6 the present invention is based on to judge the switch schematic diagram of idiographic flow of LAC in the base station LAC changing method of wireless location.
Fig. 7 the present invention is based on the schematic diagram of revising the 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 in conjunction with the accompanying drawings.
Explanation earlier we will or already used noun.
LAC: region code
CellID: base station cell ID
Former LAC: the LAC information that raw data base is gathered, but because A switching-B is supposed in the switching of moving, the base station under the then former LAC just becomes wrong base station data now, the A of this moment is exactly former LAC, and the base station that this routine Central Plains LAC gathers before being is stored in the data in the database.
Existing LAC: the LAC information that existing mobile phone terminal is gathered is up-to-date base station information, supposes A switching-B, and then B shows LAC, promptly correct base station data.
1. switch (switching one to one) fully: the base station in former LAC zone all switches to an existing LAC zone;
2. locally switch (one-to-many switchings): the base station in former LAC zone switches to a plurality of LAC zones that show; Perhaps the part base station in former LAC zone is not carried out LAC and is switched, and remaining base station switches to one or more existing LAC zone;
3. merge and switch (many-one switching): the base station in a plurality of former LAC zone switches to an existing LAC zone;
Switch submodel 1 (position error is greater than 6 kilometers): as shown in Figure 1, the LAC of terminal T region is originally in the a-quadrant, and now transforms to the B zone, then cause existing terminal T in the A location positioning to the B position, position error enlarges.
Switch submodel 2 (location failure): the reason of location failure is owing to do not match the LAC+CellID combination, and LAC switches and also may cause above phenomenon, so if the simulation positioning result is the location failure, then the LAC switching also might take place in this LAC, is defined as the LAC information of intending switching.
A kind of overall process of embodiment of base station LAC changing method of the present invention based on wireless location, as shown in Figure 2.
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and portable terminal is simulated the location.
Process B extracts the simulation position error greater than 6 kilometers Location Requests with the base station of simulation location failure, generates LAC plan 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 according to base station LAC handoff list to the base station of former LAC and revises.
Process E recomputates the longitude and latitude in existing LAC zone 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, then adopts the LAC+CellID location, promptly adopts first base station CellID that can match to position; Otherwise,, then adopt the LAC location if LAC can locate; If the Location Request of all base stations all fails to match LAC, then restoring to normal position failure.The idiographic flow of simulation location, as shown in Figure 3.
Step 100 enters this process, changes step 101.
Step 101, loading all base station requests to memory-mapped is the 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 sign, GPS information, anchor point, position error etc.Change 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, changes step 103.
Step 103 judges whether current base station LAC can locate, and is then to change step 104; Otherwise change step 105.
Step 104 is preserved the LAC information that current success is located, and changes step 106.
Step 105 continues to judge whether current base station is last base station information, is that then the restoring to normal position failure is replied or the LAC positioning result, changes step 109; Otherwise change step 102, continue to get next base station and simulate the location.
Step 106, current LAC successfully locatees, continues to judge by binary search whether this LAC+CellID can locate, be then to change step 107; Otherwise change step 108.
Step 107, base station IDs are located successfully, because the priority of base station IDs location is located greater than LAC, therefore the positioning result with base station IDs replaces LAC positioning result before, and successfully step 109 is changeed in the location.
Step 108, the principle of simulation location, the base station sequence number is forward more, its priority is high more, so in case the base station IDs location is unsuccessful, then adopt the successful LAC in first location that it is located, and can not be covered by follow-up operation, roll back to first LAC that successfully locatees after, change step 105.
Step 109, ending said process.
Process B is for determining to intend switching the idiographic flow of LAC, all simulation positioning results are classified, whether the result who judges the simulation location satisfies with next bar: B1: adopt LAC+CellID location and error greater than setting threshold X, B2: adopt LAC location and error greater than setting threshold X, B3: the location failure.If the result of simulation location satisfies above any one, then the base station requests information sets of above-mentioned three kinds of situations is made into base station requests information by the LAC index.Extract the idiographic flow of intending switching LAC information, as shown in Figure 4.
Step 200 enters this process, changes step 201.
Step 201 is taken out a simulation positioning result record, changes step 202 or step 203.
Step 202 is extracted the LAC locating information, changes step 204.
Step 203 judges whether the location failure, is then to change step 205; Otherwise change step 201, continue to take off a simulation positioning result and judge.
Whether step 204, error in judgement are then to change step 205 greater than 6 kilometers.Otherwise change step 201, continue to take off a simulation positioning result and judge.
Step 205, when sending base station requests with gps signal shine upon its corresponding city, change step 206.
Step 206 adopts the LAC position error greater than the information of LAC for intending switching 6 kilometers or request during the failure of location, preserves these information, changes step 207.
Step 207, ending said process.
The flow process of process C for judging that LAC switches, be than the key link among the present invention, construct collection point, former LAC base station polygon and existing LAC base station requests point polygon, by the base station Location Request priority treatment of polygon track matching algorithm to the band gps signal, does not handle with the base station Location Request of gps signal in the short time other back, it carries out the processing of LAC switching determination the base station of traversal plan handoff list, former LAC and existing LAC that the place, base station of LAC switching takes place are made as the LAC handoff list in pairs, finally generate the LAC handoff list;
Wherein, following 2 kinds of rudimentary algorithms are arranged:
Algorithm 1: polygon makes up fast algorithm, and step is as follows:
Step 1a: make up the boundary rectangle of discrete point set, calculate minimum and maximum longitude and latitude in the discrete point set;
Step 1b: the longitude and latitude that calculates the discrete point that intersects with boundary rectangle in the discrete point set;
Step 1c: calculate by spot projection, construct the part of outermost in the discrete point set and press the positive convex polygon that a definite sequence constitutes;
Algorithm 2: polygon track matching algorithm, step is as follows:
Step 2a: point is judged in polygon: make up a positive convex polygon according to algorithm 1, calculating judges that a discrete point is whether in this positive convex polygon according to longitude and latitude;
Step 2b: expansion boundary rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon then expands boundary rectangle;
Step 2c: the track coupling is calculated: existing second characteristic value and former second characteristic value of setting all discrete points in the positive convex polygon are identical, contrast existing first characteristic value and former first characteristic value of all discrete points in the positive convex polygon, carry out the track coupling, its track coupling result of calculation is divided into following several situation:
A. existing first characteristic value of all discrete points is A, and former first characteristic value of all discrete points is A;
B. existing first characteristic value of all discrete points is B, but former first characteristic value of all discrete points is A;
C. existing first characteristic value of part discrete point is A, and existing first characteristic value of remaining discrete point is B, C, D, E ... (one or more), former first characteristic value of all discrete points is A;
D. existing first characteristic value of all discrete points is B, C, D, E ... one or more, but former first characteristic value of all discrete points is A;
E. existing first characteristic value of all discrete points is A, but former first characteristic value 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 be switched and determined processing, the handling process of process C is:
Step 300 enters this process, changes step 301.As shown in Figure 6.
Step 301 travels through each LAC and intends handoff list.Change step 302.
Step 302 adopts above-mentioned polygon to make up the fast algorithm circulation and makes up existing LAC base station requests point polygon.Change step 303.
Step 303 loads corresponding collection point, former LAC base station information.Change step 304.
Step 304 adopts the step 2a of above-mentioned polygon track matching algorithm to judge that collection point, former LAC base station is whether in the existing LAC base station requests point polygon that LAC intends switching.If then change step 305; Otherwise change step 306.
Step 305 writes down a certain now polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon correspondence.Change step 307.
Step 306 if do not have corresponding collection point, former LAC base station in the existing LAC base station requests point polygon, is then replenished its base station information as a series of new collections and is gathered compiling.Change step 303.
Step 307 is classified the LAC in the showing LAC base station requests point polygon according to above-mentioned polygon track matching algorithm, and all kinds of LAC are carried out sorting by the LAC weight with the dominant base principle of priority.Change step 308.
Step 308 further sorts the CellID behind all kinds of LAC by its matching degree with the CellID of request.Change step 309.
Step 309 is promptly finished the LAC switching judging of being with the 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.Change step 310.
Step 310 is followed the tracks of at short notice other of same terminal not with the request of gps signal.Change step 311.
Step 311 is carried out one-off pattern again and is drafted the position, simulates the location with the acquired original point LAC+CellID combination of passing through the correspondence that judges early stage.Change step 312.
Step 312 judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error that the error range that both has been less than original LAC+CellID combination is noted during again less than existing base station requests.Be then to change step 313; Otherwise change step 311, carry out the simulation location of next group handover information.
Step 313 is preserved handover information, comprises original LAC and existing LAC and CellID information thereof.Change step 314.
Step 314 withdraws from this process.
The process of process D for 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 the source base station data are revised according to different situations, each switches and all need consider whether adjacent block of former LAC pickup area and existing LAC zone, after data are switched respective base station is indicated different flag bits according to different switching types.Concrete handling process, as shown in Figure 7.
Step 400 enters this process, changes step 401.
Step 401, the handoff list that loading procedure C generates, and it is pressed different switching types classify, be divided into switching one to one, one-to-many switching and many-one and switch commentaries on classics step 402.
Step 402 is carried out original LAC zone to every kind of switching type and is judged with the adjacent block of existing LAC: if adjacent block is then changeed step 403; Otherwise change step 404.
Step 403 is simulated the location to the base station under the former LAC, when judging the result navigate to and now sending this LAC request gps signal position distance whether in 500 meters, if then LAC enlarges, commentaries on classics step 405; Otherwise change step 406.
Step 404, then switch fully for LAC in original LAC zone and the non-adjacent block in existing LAC zone, belongs to switching type one to one.Change step 407.
Step 405 when LAC enlarges, then needs the base station under former LAC and the existing LAC is merged processing, changes step 407.
Step 406 if not adjacent block LAC enlarges, then belongs to local the switching, and promptly some base station does not switch among LAC, be still former LAC, and remaining part switches to one or more new LAC.Change step 407.
Step 407 compiles the base station data that switches, and adds corresponding marker bit when certain base station being carried out one type LAC handover operation.The concrete method of handling the switching mark position sees Table 1.Change step 408.
Step 408 withdraws from this process.
Table 1 switching mark position implication list
Figure 986599DEST_PATH_IMAGE001
Annotate: wherein a b c d is self-defined constant.
Process E is the process of reruning of LAC longitude and latitude, divide switching fully, local switching and merging to switch according to different switching types, wherein partial cut is changed to more common a kind of, its standard of reruning is for if the base station that switches accounts for the total base station of this LAC ratio and reaches 0.62 among a certain LAC, then according to rerun LAC position and cover original LAC longitude and latitude, revised base station.The idiographic flow that the LAC longitude and latitude is reruned, as shown in Figure 8.
Step 500 enters this process, changes step 501.
Step 501, the LAC switching type information that the retrieval from internal memory is different is changeed step 502.
Step 502 is if complete switching type (one to one) then changes step 505.
Step 503 is if local switching type (one-to-many) then changes step 506.
Step 504 if merge switching type (many-one), is then changeed step 508.
Step 505, former LAC is entirely existing LAC and substitutes, and the position of this LAC gets with regard to directly reruning according to source base station.Change step 509.
Step 506, the base station shifting ratio that accounts for the total base station of this LAC number reaches 0.62, then according to rerun LAC position and cover original LAC longitude and latitude, revised base station, changes step 507; Otherwise change step 509.
Step 507, the mean value of getting the latitude and longitude of base station after the corrigendum LAC position after as this switching.Change step 509.
Step 508, many-one switches, and the base station of getting under each former LAC is average as the LAC position after switching.Change step 509.
Step 509 withdraws from this process.
Although specifically show and introduced the present invention in conjunction with preferred embodiment; but the those skilled in the art should be understood that; in the spirit and scope of the present invention that do not break away from appended claims and limited; can make various variations to the present invention in the form and details, be protection scope of the present invention.

Claims (7)

1. base station LAC changing method based on wireless location is characterized in that the process that comprises has:
Process A, preliminary treatment, navigation system loads the Location Request of all base stations, and portable terminal is simulated the location;
Process B extracts the Location Request of simulation position error greater than the base station of setting threshold and the failure of 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 according to base station LAC handoff list to the base station of former LAC and revises;
Process E recomputates the longitude and latitude in existing LAC zone according to the revised base station of LAC.
2. a kind of base station LAC changing method according to claim 1 based on wireless location, it is characterized in that: in described process A, resolve the Location Request of all base stations, if LAC+CellID combination can be located, then adopt the LAC+CellID location, promptly adopt first base station CellID that can match to position; Otherwise,, then adopt the LAC location if LAC can locate; If the Location Request of all base stations all fails to match LAC, then 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 satisfies with next bar:
B1: adopt LAC+CellID location and error greater than setting threshold X;
B2: adopt LAC location and error greater than setting threshold X;
B3: location failure;
If the result of simulation location satisfies above any one, then the base station requests information sets of above-mentioned three kinds of situations is made into base station requests information by the LAC index.
4. a kind of base station LAC changing method according to claim 1 based on wireless location, it is characterized in that: in described process C, it carries out the processing of LAC switching determination the base station of traversal plan handoff list, former LAC and existing LAC that the place, base station of LAC switching takes place are made as the 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 the base station Location Request priority treatment of polygon track matching algorithm to the band gps signal, does not handle with the base station Location Request of gps signal in the short time other back, finally generates the LAC handoff list;
Wherein, following 2 kinds of rudimentary algorithms are arranged:
Algorithm 1: polygon makes up fast algorithm, and step is as follows:
Step 1a: make up the boundary rectangle of discrete point set, calculate minimum and maximum longitude and latitude in the discrete point set;
Step 1b: the longitude and latitude that calculates the discrete point that intersects with boundary rectangle in the discrete point set;
Step 1c: calculate by spot projection, construct the part of outermost in the discrete point set and press the positive convex polygon that a definite sequence constitutes;
Algorithm 2: polygon track matching algorithm, step is as follows:
Step 2a: point is judged in polygon: make up a positive convex polygon according to algorithm 1, calculating judges that a discrete point is whether in this positive convex polygon according to longitude and latitude;
Step 2b: expansion boundary rectangle: if the not enough setting threshold Y of the catercorner length of this positive convex polygon then expands boundary rectangle;
Step 2c: the track coupling is calculated: existing second characteristic value and former second characteristic value of setting all discrete points in the positive convex polygon are identical, contrast existing first characteristic value and former first characteristic value of all discrete points in the positive convex polygon, carry out the track coupling, its track coupling result of calculation is divided into following several situation:
A. existing first characteristic value of all discrete points is A, and former first characteristic value of all discrete points is A;
B. existing first characteristic value of all discrete points is B, but former first characteristic value of all discrete points is A;
C. existing first characteristic value of part discrete point is A, and existing first characteristic value of remaining discrete point is B, C, D, E ... one or more, former first characteristic value of all discrete points is A;
D. existing first characteristic value of all discrete points is B, C, D, E ... one or more, but former first characteristic value of all discrete points is A;
E. existing first characteristic value of all discrete points is A, but former first characteristic value 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 be switched and determined processing, the handling process of process C is:
Step 300 enters this process, changes step 301;
Step 301 travels through each LAC and intends handoff list, changes step 302;
Step 302 adopts above-mentioned polygon to make up the fast algorithm circulation and makes up existing LAC base station requests point polygon, changes step 303;
Step 303 loads corresponding collection point, former LAC base station information, changes step 304;
Step 304 adopts step 2a in the above-mentioned polygon track matching algorithm to judge that collection point, former LAC base station is whether in the existing LAC base station requests point polygon that LAC intends switching, if then change step 305; Otherwise change step 306;
Step 305 writes down a certain now polygonal LAC in collection point, former LAC base station and the CellID information of LAC base station requests point polygon correspondence, changes step 307;
Step 306 if do not have corresponding collection point, former LAC base station in the existing LAC base station requests point polygon, is then replenished its base station information as a series of new collections and is gathered compiling, changes step 303;
Step 307 is classified the switching of the LAC in all existing LAC base station requests point polygons according to above-mentioned polygon track matching algorithm, all kinds of LAC is switched carry out sorting by the LAC weight with the dominant base principle of priority, changes step 308;
Step 308, the CellID after further all kinds of LAC being switched changes step 309 by its matching degree ordering with the CellID of request;
Step 309 is promptly finished the LAC switching judging of being with the 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, changes step 310;
Step 310 is followed the tracks of at short notice other of same terminal not with the request of gps signal, changes step 311;
Step 311 is carried out one-off pattern again and is drafted the position, simulates the location with the acquired original point LAC+CellID combination of passing through the correspondence that judges early stage, changes step 312;
Step 312 judges whether error of its simulation location dwindles, and dwindling here has two layers of meaning: the actual error that the error range that both has been less than original LAC+CellID combination is noted during again less than existing base station requests is then to change step 313; Otherwise change step 311, carry out the simulation location of next group handover information;
Step 313 is preserved handover information, comprises original LAC and existing LAC and CellID information thereof, changes step 314;
Step 314 withdraws from this process.
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 the LAC handoff list LAC switching is divided into following three kinds of switching types:
1. switch (switching one to one) fully: the base station in former LAC zone all switches to an existing LAC zone;
2. locally switch (one-to-many switchings): the base station in former LAC zone switches to a plurality of LAC zones that show; Perhaps the part base station in former LAC zone is not carried out LAC and is switched, and remaining base station switches to one or more existing LAC zone;
3. merge and switch (many-one switching): the base station in a plurality of former LAC zone switches to an existing LAC zone;
And respectively the base station data of former LAC is carried out LAC according to these three kinds of switching types and revise, and revised base station data is done 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 at dissimilar LAC, recomputate the longitude and latitude in existing LAC zone according to revised base station:
1. switch (switching one to one) fully: the longitude and latitude that directly recomputates existing LAC zone 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 the former LAC zone if the base station number of LAC switching takes place in the former LAC zone, then recomputate existing LAC longitude and latitude, and cover former LAC longitude and latitude according to revised base station data
3. merge and switch (many-one switching): calculate the base station data mean value in former LAC zone, and calculate existing LAC longitude and latitude according to this.
7. a kind of base station LAC changing method according to claim 1 based on wireless location, it is characterized in that: described setting threshold X is 6 kilometers, described setting threshold Y is 50 meters.
CN201110137094.3A 2011-05-25 2011-05-25 Base station LAC (Location Area Code) switching method based on wireless positioning Active CN102196561B (en)

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 true CN102196561A (en) 2011-09-21
CN102196561B 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)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103298042A (en) * 2013-05-12 2013-09-11 南京载玄信息科技有限公司 Animal behavior based multi-signal cross-area intelligent switching method and device
CN103377585A (en) * 2012-04-25 2013-10-30 腾讯科技(深圳)有限公司 Method for locating administrative division based on longitude and latitude
CN105992338A (en) * 2015-02-12 2016-10-05 阿里巴巴集团控股有限公司 Positioning method and apparatus
CN106488558A (en) * 2016-11-14 2017-03-08 刘兰平 Mobile phone signal localization method and device
CN109548139A (en) * 2018-08-27 2019-03-29 福建新大陆软件工程有限公司 A kind of cell base station longitude and latitude data correcting method based on KNN
CN111787488A (en) * 2020-06-29 2020-10-16 北京东方国信科技股份有限公司 User positioning method and system

Citations (3)

* Cited by examiner, † Cited by third party
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
US20100197320A1 (en) * 2007-06-20 2010-08-05 Thomas Ulrich Accessibility of Private Base Station
CN101895922A (en) * 2009-05-20 2010-11-24 大唐移动通信设备有限公司 Information acquisition method, system and device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100197320A1 (en) * 2007-06-20 2010-08-05 Thomas Ulrich Accessibility of Private Base Station
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

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103377585A (en) * 2012-04-25 2013-10-30 腾讯科技(深圳)有限公司 Method for locating administrative division based on longitude and latitude
CN103298042A (en) * 2013-05-12 2013-09-11 南京载玄信息科技有限公司 Animal behavior based multi-signal cross-area intelligent switching method and device
CN105992338A (en) * 2015-02-12 2016-10-05 阿里巴巴集团控股有限公司 Positioning method and apparatus
CN106488558A (en) * 2016-11-14 2017-03-08 刘兰平 Mobile phone signal localization method and device
CN109548139A (en) * 2018-08-27 2019-03-29 福建新大陆软件工程有限公司 A kind of cell base station longitude and latitude data correcting method based on KNN
CN109548139B (en) * 2018-08-27 2021-03-23 福建新大陆软件工程有限公司 KNN-based cell base station longitude and latitude data correction method
CN111787488A (en) * 2020-06-29 2020-10-16 北京东方国信科技股份有限公司 User positioning method and system
CN111787488B (en) * 2020-06-29 2022-07-05 北京东方国信科技股份有限公司 User positioning method and system

Also Published As

Publication number Publication date
CN102196561B (en) 2014-07-09

Similar Documents

Publication Publication Date Title
CN102196561B (en) Base station LAC (Location Area Code) switching method based on wireless positioning
EP2825850B1 (en) Segment validation
JP4790017B2 (en) Method and apparatus for automatically optimizing neighbor list in synchronous CDMA network
Chen et al. CrowdTracking: Real-time vehicle tracking through mobile crowdsensing
CN104819726A (en) Navigation data processing method, navigation data processing device and navigation terminal
CN110992681B (en) Traffic network attribute information generation method, device, storage medium and electronic equipment
CN101299834A (en) Method for checking base station position
CN109272032A (en) Trip mode recognition methods, device, computer equipment and storage medium
CN106488529A (en) A kind of method and device for accessing WIFI network
CN104537102A (en) Positive geocoding service method and system for obtaining longitude and latitude
CN111935733A (en) Method, device and equipment for checking base station position information and computer storage medium
CN103888975A (en) Base station latitude and longitude data verification method and system
CN112381078B (en) Elevated-based road identification method, elevated-based road identification device, computer equipment and storage medium
CN106446102A (en) Method and device for terminal positioning based on map fences
CN108900978B (en) Urban trunk road connection method based on mobile terminal signaling data
CN112235714B (en) POI positioning method and device based on artificial intelligence, computer equipment and medium
KR100653529B1 (en) Method and apparatus for optimizing neighbor list automatically in asynchronous w-cdma network
CN107979818B (en) Method for processing initial data of wireless fingerprint database
CN106921940A (en) With track user's lookup method and device and go together user's lookup method and device
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
CN113873423A (en) Terminal positioning method, device and system
CN106162548A (en) A kind of method and device identifying that super remote adjacent area covers
CN111552759B (en) Method, device, equipment and medium for acquiring action track related data
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