CN1627837A - Method for seeking mobile station - Google Patents
Method for seeking mobile station Download PDFInfo
- Publication number
- CN1627837A CN1627837A CN 200310118407 CN200310118407A CN1627837A CN 1627837 A CN1627837 A CN 1627837A CN 200310118407 CN200310118407 CN 200310118407 CN 200310118407 A CN200310118407 A CN 200310118407A CN 1627837 A CN1627837 A CN 1627837A
- Authority
- CN
- China
- Prior art keywords
- paging
- district
- bsc
- lane place
- extended boundary
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000036316 preload Effects 0.000 claims description 10
- 230000000630 rising effect Effects 0.000 abstract description 2
- 210000004027 cell Anatomy 0.000 description 19
- 101150117600 msc1 gene Proteins 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 210000003888 boundary cell Anatomy 0.000 description 4
- 230000002950 deficient Effects 0.000 description 4
- 102000047724 Member 2 Solute Carrier Family 12 Human genes 0.000 description 2
- 108091006621 SLC12A1 Proteins 0.000 description 2
- 108091006620 SLC12A2 Proteins 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 2
- 101150081322 LAC3 gene Proteins 0.000 description 1
- 101100020526 Pycnoporus cinnabarinus LCC3-1 gene Proteins 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
First, the method calculates borderline zones extended for each actual seeking location zone. When a MS is to be sought, according to extended seeking strategy setup in advance, BSC carried out seeking for location zone registered by MS as well as extended borderline zones corresponding to the location zone. The invention increases success ratio of seeking MS located at borderline zones of location zone. Since the said extended borderline zones are calculated by BSC according to certain algorithm based on information of free switchable neighbouring areas existed in BSC already. Thus, complexity of network planning is reduced; amount of message to be sought is lowered effectively. Advantages are: avoiding network burthen from quick rising so as to guarantee safety of system.
Description
Technical field
The present invention relates to Code Division Multiple Access (CDMA) (CDMA) technical field, be meant the method for a kind of mobile paging station (MS) especially.
Background technology
In cdma system, can be in base station controller (BSC) and mobile switching centre (MSC) side definition position district, so-called lane place is the set of some specific cells.Cdma system adopts the mode of registration to notify the lane place at certain current place of MS of the Visited Location Registor of mobile switching centre (MSC/VLR) usually, when this MS does when called, MSC/VLR is to this MS position district distributing paging, and the beep-page message that BSC is responsible for receiving from MSC/VLR converts idle message all sub-districts under this lane place to and distributes.Specify the implementation procedure of prior art below.
Figure 1 shows that the paging scheme schematic diagram of prior art one.Network shown in Figure 1 is, is connected to BSC1 under MSC1, is connected to lane place 1 (LAC1) and lane place 2 (LAC2) under the BSC1, and comprises sub-district 1 (CELL1) and sub-district 2 (CELL2) in LAC1, comprises sub-district CELL3 and CELL4 in LAC2.Suppose that certain MS initiated registration on the CELL2 of LAC1, then to write down the positional information of current MS be LAC1 to MSC1/VLR, if this moment, MS did called, then MSC1 can initiate paging to LAC1, after BSC receives the paging request of MSC, can promptly issue general page messages (GPM) to sub-districts all in the LAC1 to CELL1 and CELL2, if this moment, MS did not switch to sub-district below the LAC2 from the LAC1 free time, then MS can pagedly arrive.
The shortcoming of prior art one is: MS can be paged to prerequisite be that it must be in the sub-district below the LAC1, if the CELL1 free time of MS below LAC1 switches to the sub-district below the LAC2, because CDMA agreement IS95 and IS2000 serial protocols defective---there is not the registration in position-based district, therefore, MS can not initiate the registration in position-based district.Like this regularly register overtime before, when this MS does when called, MSC/VLR will be according to registered information, beep-page message is issued to LAC1, correspondingly, after BSC receives the paging request of MSC, can be to sub-districts all in the LAC1, promptly CELL1+CELL2 is carried out paging, will occur the situation of paging like this, the phenomenon of " subscriber absent " promptly occurs less than MS.
In order to overcome the defective of prior art one, in prior art two, introduced registration (Zone-based registration) based on the zone.According to the CDMA agreement, after MS receives system parameters message (SPM), will register current registration zone (REG_ZONE).Register method is as follows:
In MS, have zone list (ZONE_LISTs), when MS move to one it when not having the ZONE of storage, when promptly the ZONE_list of MS the inside does not comprise this ZONE, will initiate once to register.ZONE with the MS place in enrollment process adds among the ZONE_LISTs.Behind timer expiry, the ZONE of this registration can be deleted.MS is by the registration zone (REG_ZONE) to each ZONE, and system identification (SID) and NID (NID) are discerned, thereby discern each ZONE, i.e. ZONE=REG_ZONE+SID+NID.MS supports a plurality of ZONE of registration, the number that can register ZONE in each MS is at most determined by registration zone sum (TOTAL_ZONES) field among the system message SPM, the holding time of each ZONE in the ZONE_LISTs of MS decided by registration zone retention time (ZONE_TIMER) field, and wherein the shortest time is 1 minute.In the network planning, use different ZONE in order to guarantee different LAC, the sign that each REG_ZONE is set is all different.
Based on above technology, and be example, CELL1 be planned to REG_ZONE1, CELL2 is planned to REG_ZONE2 with network shown in Figure 1, all the other by that analogy, and the value of the TOTAL_ZONE field in the SPM message is set to 1 or 2.When MS took place between the border cell of lane place by idle the switching, MS can initiate the location registers based on REG_ZONE like this, made MSC1/VLR can obtain the present position-region information of MS timely, to guarantee to the lane place distributing paging that has MS.
Figure 2 shows that the paging scheme schematic diagram of prior art two.
Set-up mode one: the value that makes the TOTAL_ZONES field is 1, promptly can only preserve a ZONE in the ZONE_LISTs of MS at most, promptly can only comprise the record of a REG_ZONE+SID+NID.Concrete method to set up is as follows:
Suppose the ZONE2 start registration of MS below LAC1, the ZONE in the promptly current ZONE_LISTs of being kept at is ZONE2; When the ZONE3 of MS below ZONE2 moves to LAC2, owing in the ZONE_LISTs of MS, do not have ZONE3, and the value of the TOTAL_ZONE of ZONE_LISTs is 1, therefore, MS will delete one " old registration record " (" Oldes Entry ") according to agreement, after soon ZONE2 deletes from ZONE_LISTs, ZONE3 be added in the ZONE_LISTs, ZONE in the then current ZONE_LISTs of being kept at is ZONE3, and the information of preserving among the VLR is the lane place of ZONE3 respective cell.By above-mentioned planning ZONE method, guarantee MS in case the registration that idle switching will be initiated the REG_ZONE type takes place, thereby the information among the VLR can be upgraded in time on the LAC border.
The defective of above-mentioned method to set up is: if the wireless environment more complicated of LAC1 and LAC2 borderline region, the initiation REG_ZONE registration that then MS can be frequent, so not only increased the load of network side, and made mobile phone power consumption more, and in the process that MS registers, can not pagedly arrive.
Set-up mode two: the value that makes the TOTAL_ZONES field is 2, promptly can only preserve two ZONE in the ZONE_LISTs of MS at most, promptly comprises the record of two REG_ZONE+SID+NID.Concrete method to set up is as follows:
Suppose the ZONE2 start registration of MS below LAC1, the ZONE in the promptly current ZONE_LISTs of being kept at is ZONE2; When the ZONE3 of MS below ZONE2 moves to LAC2, owing in the ZONE_LISTs of MS, do not have ZONE3, and the value of the TOTAL_ZONE of ZONE_LISTs is 2, at this moment, MS can initiate registration, and ZONE3 is added in the ZONE_LISTs, and then the ZONE in the current ZONE_LISTs of MS is ZONE2 and ZONE3, at this moment, the information of preserving among the MSC/VLR has been updated to ZONE3.
After the ZONE2 information that writes down in the ZONE_LISTs is overtime, if MS turns back to ZONE2 again, then owing in ZONE_LISTs, there has not been ZONE2, stipulate according to agreement, MS can initiate registration more again, and promptly MS can initiate the registration to ZONE2 again, upgrades the information of preserving among the MSC/VLR, if it is called that this MS this moment does, then can successfully pagedly arrive.
The defective of above-mentioned method to set up is: do not have set-up mode one so frequent though the position is upgraded, and can solve most of mobile phone the paging of LAC border less than problem, if but the ZONE2 information that in ZONE_LISTs, writes down overtime before, MS turns back to ZONE2 again, because ZONE2 is also in ZONE_LISTs, stipulate according to agreement, MS can not initiate registration again, and the information of preserving among the MSC/VLR is the lane place of ZONE3 respective cell, if this moment this MS do called, then can occur paging less than problem.
Figure 3 shows that the paging scheme schematic diagram of prior art three.The thinking of prior art three is: move to CELL3 at MS from CELL2, and initiated in the absence of registration, if MSC1 carries out paging to LAC1, and when not obtaining the response of MS, MSC1 starts whole net paging, BSC1 under MSC1 and BSC2 while distributing paging soon, and BSC1 and BSC2 are simultaneously to following LAC1, LAC2 and LAC3 distributing paging.
The defective of such scheme is: though can paging arrive MS, but the paging amount that MSC1 issues is bigger, and ineffertive pager message is many, the CPU that has increased all BSC under the MSC1 handles the load of all base transceiver stations (BTS) paging channel under load and the MSC1, can cause BSC MSC under to transship when serious or paging channel is transshipped.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of method of mobile paging station, be positioned at the paging success rate of lane place borderline region MS, reduce the quantity of beep-page message in the wireless network simultaneously in order to raising.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of method of mobile paging station, this method may further comprise the steps:
A, be respectively each actual paging lane place and calculate extended boundary sub-district;
B, when certain mobile station MS of BSC paging, the load current according to system, BSC be according to predefined extended boundary paging policy, and paging is carried out in the lane place that this MS registered and the extended boundary sub-district of this lane place correspondence.
Preferably, the method for the extended boundary sub-district of the actual paging of the described calculating of step a lane place is:
A1, BSC inquire about the border cell in the actual paging lane place of waiting to be provided with the extended boundary sub-district from self database;
The free time of a2, the described border cell correspondence of difference query steps a1 is switched Neighboring Cell List;
A3, each idle switching Neighboring Cell List of being inquired about from step a2 are rejected and belong to the free time of waiting to be provided with the lane place in and switch the adjacent area, and after merging the free time switching adjacent area of repeating, obtain the extended boundary sub-district of actual paging lane place.
Preferably, the described predefined extended boundary paging policy of step b is:
If system when preload bigger, then BSC at first treats the lane place that paging MS registered and carries out paging, when BSC does not obtain treating the response of paging MS, again paging is carried out in the extended boundary sub-district of this MS institute registration location district correspondence;
If system is less when preload, then the BSC lane place that MS registered and this lane place pairing extended boundary sub-district of directly treating paging is carried out paging simultaneously;
If working as preload, system is between above-mentioned two kinds of situations, then BSC at first treats the lane place that paging MS registered and carries out paging, when BSC does not obtain treating the response of paging MS, again this MS institute registration location district and pairing extended boundary sub-district, this lane place are carried out paging simultaneously.
Preferably, this method further comprises: BSC counts paging request message, and preestablish count threshold N, when treating the lane place that paging MS registered, BSC carries out N paging, when all not obtaining treating the response message of paging MS, again to the pairing extended boundary of this MS sub-district, or this MS institute registration location district and pairing extended boundary sub-district, this lane place are carried out paging simultaneously.
Preferably, described count threshold N is according to the current setting state of network.
Preferably, described system when the size of preload be to determine according to what of paging channel message traffic.
Preferably, described each actual paging lane place and extended boundary sub-district all are positioned at a BSC.
Preferably, this method further comprises: the described extended boundary sub-district that calculates of step a is kept in the database of BSC; When certain MS of BSC paging, described step b is: the load current according to system, BSC is according to predefined extended boundary paging policy, the direct extended boundary sub-district that paging lane place correspondence is treated in inquiry from database, and this is treated that the lane place of paging and the extended boundary sub-district of this lane place correspondence carry out paging.
The present invention at first is respectively each actual paging lane place and calculates the extended boundary sub-district; When certain MS was paged, BSC enlarged paging range according to predefined expansion paging policy, has promptly increased the paging to the extended boundary sub-district of this MS place LAC correspondence, thereby has improved the paging success rate that is positioned at lane place borderline region MS; Simultaneously, because the applied extended boundary of the present invention sub-district is according to the existing idle neighboring BS information that switches among the BSC, automatically calculate according to certain algorithm by BSC, therefore, reduced the complexity of the network planning, simultaneously reduce the quantity of beep-page message in the wireless network effectively, avoided the sharply situation of rising of network load, thereby guaranteed the safety of system.Use the present invention, solved the low problem of paging success rate on LAC border in a BSC.The present invention all is suitable for for the cdma system that adopts third generation partner to plan 2 (3GPP2,3th Generation Partnership Project 2) protocol of I S95/IS95A/IS95B/IS2000 and follow-up evolution agreement.
Description of drawings
Figure 1 shows that the paging scheme schematic diagram of prior art one;
Figure 2 shows that the paging scheme schematic diagram of prior art two;
Figure 3 shows that the paging scheme schematic diagram of prior art three;
Figure 4 shows that and use paging scheme schematic diagram of the present invention.
Embodiment
For making technical scheme of the present invention clearer, again the present invention is described in further details below in conjunction with drawings and the specific embodiments.
Figure 4 shows that and use paging scheme schematic diagram of the present invention.Cyberrelationship shown in Figure 4 is: divided two LAC under a BSC, be respectively LACn and LACm, and CELLni belongs to LACn, CELLmi belongs to LACm.Because the characteristics of wireless environment, some covering overlapping areas can occur, promptly can have the phenomenon of signal overlap each other, according to the analysis of front at border cell, when if idle the switching takes place in MS between CELLmi and CELLni, then may occur paging less than situation.
In order to be illustrated more clearly in technical scheme of the present invention, at first arrange several terms at this:
Extended boundary sub-district: the sub-district that needs extra paging simultaneously during the paging real cell;
Self adaptation expansion paging algorithm: BSC switches the algorithm that neighbouring relations obtain the extended boundary sub-district according to the free time;
Extended boundary paging (Extended Boundary Paging): refer to that BSC not only carries out paging in the paging range of MSC appointment, again paging is carried out in the extended boundary sub-district that goes out according to self adaptation expansion paging algorithm computation;
Intelligence paging algorithm: the load current according to system, adjust paging policy and paging range automatically.
Thinking of the present invention is: when certain MS of BSC paging, application self-adapting expansion paging algorithm is respectively each actual paging lane place and calculates the extended boundary sub-district; The load current according to system, BSC be according to predefined extended boundary paging policy, and paging is carried out in the lane place that this MS registered and the extended boundary sub-district of this lane place correspondence.
Be example with LACn below, specifying application self-adapting expansion paging algorithm is the method that LACn calculates the extended boundary sub-district.Table 1 is depicted as the extended boundary sub-district corresponding with LACn.
| Border cell under the actual LACn | The idle adjacent area of switching | Explanation | The extended boundary cell list of LACn |
| ??CELLn1 | CELLn2，CELLm1， CELLm2，CELLm3 | CELLni belongs to LACn, CELLmi belongs to LACm, and CELLni can not be included in the extended boundary sub-district | CELLm1，??CELLm2， CELLm3，??CELLm4， CELLm5，??CELLm6， CELLm7 |
| ??CELLn2 | CELLn3，CELLm2 CELLm3 | ||
| ??CELLn3 | CELLn1，CELLm4， CELLm5，CELLm6， CELLm7 |
Table 1
The concrete step that is provided with is:
At first, BSC inquires about the border cell CELLni of LACn from database; As in the present embodiment, obtaining border cell by inquiry is CELLn1, CELLn2 and CELLn3;
Secondly, BSC inquires about the pairing idle Neighboring Cell List that switches of CELLni from database, and its corresponding free time switches the Neighboring Cell List set and should be CELLni and CELLmi; In the present embodiment, by Query Database, obtain the set of the pairing idle switching Neighboring Cell List of CELLn1 and be CELLn2, CELLm1, CELLm2 and CELLm3; The set of the pairing idle switching Neighboring Cell List of CELLn2 is CELLn3, CELLm2 and CELLm3; The set of the pairing idle switching Neighboring Cell List of CELLn3 is CELLn1, CELLm4, CELLm5, CELLm6 and CELLm7;
Since MS can not take place when in CELLni, carrying out idle the switching paging less than problem, therefore, switch the Neighboring Cell List from the free time of acquired CELLni of comprising and CELLmi again and weed out the sub-district CELLni that belongs to LACn; In the present embodiment, CELLn1, CELLn2 and CELLn3 are with disallowable;
At last, in remaining idle handoff list set, merge the sub-district CELLmi that repeats, thereby obtain final extended boundary cell list; In the present embodiment, resulting final extended boundary sub-district is CELLm1, CELLm2, CELLm3, CELLm4, CELLm5, CELLm6 and CELLm7; So far, obtained the extended boundary sub-district of LACn.
Use said method, BSC calculates corresponding extended boundary sub-district respectively for each actual LAC.This extended boundary sub-district can be precomputed by BSC, and is kept in the same BSC with the LAC of reality, i.e. all corresponding extended boundary cell list of each actual LAC; Perhaps, just calculate when being employed at every turn this extended boundary sub-district.
When MSC paging MS, according to intelligent paging algorithm, promptly current load according to system, automatically adjust paging policy, that is to say that the load that BSC is current according to system is from predefined a plurality of extended boundary paging policies, automatically select the paging policy an of the best, paging is carried out in the lane place at this MS place and all extended boundary sub-districts of this lane place correspondence.The specific implementation method is as follows:
Suppose that the current lane place of registering of MS is LACn in MSC/VLR, when this MS when called, BSC judges the current load of system according to the paging channel message traffic;
If the current load of system is bigger, then BSC at first treats the lane place that paging MS registered and carries out paging, and the number of times of paging counted, when the number of times of paging has arrived predefined count threshold N, and when not receiving the response message of MS yet, again paging is carried out in the extended boundary sub-district of this MS institute registration location district correspondence, promptly earlier LACn is carried out paging, when paging does not all meet with a response message for N time, carry out paging to the extended boundary sub-district of LACn again; Wherein, predefined count threshold N, state that can be current according to network as flow etc., disposes in Database Dynamic;
If system is less when preload, then BSC carries out paging simultaneously with regard to the lane place that MS registered and this lane place pairing extended boundary sub-district of directly treating paging for the first time, promptly directly the extended boundary sub-district of LACn and LACn is carried out paging simultaneously;
If working as preload, system is between above-mentioned two kinds of situations, then BSC at first treats the lane place that paging MS registered and carries out paging, and the number of times of paging counted, when the number of times of paging has arrived predefined count threshold N, and when not receiving the response message of MS yet, again this MS institute registration location district and pairing extended boundary sub-district, this lane place are carried out paging simultaneously, promptly earlier LACn is carried out paging, when paging does not all meet with a response message for N time, carry out paging simultaneously to the extended boundary sub-district of LACn and LACn again.
If the extended boundary sub-district is just to calculate at every turn, when then carrying out the extended boundary paging, all need to calculate the extended boundary sub-district when being employed at every turn; If the extended boundary sub-district is to be precomputed by BSC, and be kept in the same BSC with the LAC of reality, it is all corresponding extended boundary cell list of each actual LAC, when then carrying out the extended boundary paging at every turn, BSC can directly inquire from database and treat pairing extended boundary sub-district, paging lane place, and then paging is carried out in the lane place of actual paging and the extended boundary sub-district of this lane place correspondence.
The present invention all is suitable for for the cdma system that adopts 3GPP2 protocol of I S95/IS95A/IS95B/IS2000 and follow-up evolution agreement.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1, a kind of method of mobile paging station is characterized in that, this method may further comprise the steps:
A, be respectively each actual paging lane place and calculate extended boundary sub-district;
B, when certain mobile station MS of BSC paging, the load current according to system, BSC be according to predefined extended boundary paging policy, and paging is carried out in the lane place that this MS registered and the extended boundary sub-district of this lane place correspondence.
2, method according to claim 1 is characterized in that, the method for the extended boundary sub-district of the actual paging of the described calculating of step a lane place is:
A1, BSC inquire about the border cell in the actual paging lane place of waiting to be provided with the extended boundary sub-district from self database;
The free time of a2, the described border cell correspondence of difference query steps a1 is switched Neighboring Cell List;
A3, each idle switching Neighboring Cell List of being inquired about from step a2 are rejected and belong to the free time of waiting to be provided with the lane place in and switch the adjacent area, and after merging the free time switching adjacent area of repeating, obtain the extended boundary sub-district of actual paging lane place.
3, method according to claim 1 is characterized in that, the described predefined extended boundary paging policy of step b is:
If system when preload bigger, then BSC at first treats the lane place that paging MS registered and carries out paging, when BSC does not obtain treating the response of paging MS, again paging is carried out in the extended boundary sub-district of this MS institute registration location district correspondence;
If system is less when preload, then the BSC lane place that MS registered and this lane place pairing extended boundary sub-district of directly treating paging is carried out paging simultaneously;
If working as preload, system is between above-mentioned two kinds of situations, then BSC at first treats the lane place that paging MS registered and carries out paging, when BSC does not obtain treating the response of paging MS, again this MS institute registration location district and pairing extended boundary sub-district, this lane place are carried out paging simultaneously.
4, method according to claim 3, it is characterized in that, this method further comprises: BSC counts paging request message, and preestablish count threshold N, when treating the lane place that paging MS registered, BSC carries out N paging, when all not obtaining treating the response message of paging MS, again to the pairing extended boundary of this MS sub-district, or this MS institute registration location district and pairing extended boundary sub-district, this lane place are carried out paging simultaneously.
5, method according to claim 4 is characterized in that, described count threshold N is according to the current setting state of network.
6, method according to claim 3 is characterized in that, the size that described system works as preload is how much determining according to the paging channel message traffic.
7, method according to claim 1 is characterized in that, described each actual paging lane place and extended boundary sub-district all are positioned at a BSC.
8, method according to claim 1 is characterized in that, this method further comprises:
The described extended boundary sub-district that calculates of step a is kept in the database of BSC;
When certain MS of BSC paging, described step b is: the load current according to system, BSC is according to predefined extended boundary paging policy, the direct extended boundary sub-district that paging lane place correspondence is treated in inquiry from database, and this is treated that the lane place of paging and the extended boundary sub-district of this lane place correspondence carry out paging.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101184076A CN100359963C (en) | 2003-12-09 | 2003-12-09 | Method for seeking mobile station |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101184076A CN100359963C (en) | 2003-12-09 | 2003-12-09 | Method for seeking mobile station |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1627837A true CN1627837A (en) | 2005-06-15 |
| CN100359963C CN100359963C (en) | 2008-01-02 |
Family
ID=34761135
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101184076A Expired - Lifetime CN100359963C (en) | 2003-12-09 | 2003-12-09 | Method for seeking mobile station |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100359963C (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008080310A1 (en) * | 2006-12-29 | 2008-07-10 | China Mobile Group Beijing Co., Ltd. | A sub-lac paging method |
| CN101141819B (en) * | 2007-10-18 | 2010-06-02 | 中兴通讯股份有限公司 | Method and device for improving inter-system paging success rate |
| CN101801003A (en) * | 2010-02-02 | 2010-08-11 | 中兴通讯股份有限公司 | Paging method and device |
| CN101350935B (en) * | 2007-07-18 | 2011-05-11 | 中兴通讯股份有限公司 | Method for paging user terminal in a radio communication system |
| CN101068370B (en) * | 2006-04-07 | 2011-06-15 | 华为技术有限公司 | User equipment calling method and system |
| CN102209390A (en) * | 2011-05-24 | 2011-10-05 | 电信科学技术研究院 | Distribution method and equipment of paging range |
| CN102316578A (en) * | 2010-07-06 | 2012-01-11 | 中兴通讯股份有限公司 | Paging method and system, and radio network controller |
| CN102647787A (en) * | 2007-06-04 | 2012-08-22 | 华为技术有限公司 | Paging device |
| CN101360258B (en) * | 2007-07-30 | 2012-10-10 | 中兴通讯股份有限公司 | Method for implementing customer terminal calling in wireless communication system |
| CN101938814B (en) * | 2009-06-29 | 2013-11-06 | 华为技术有限公司 | Mobile terminal paging method and mobile call center equipment |
| CN104602343A (en) * | 2015-02-16 | 2015-05-06 | 中怡(苏州)科技有限公司 | Paging method, neighbor list recording method and paging device |
| CN112423289A (en) * | 2020-11-09 | 2021-02-26 | Oppo广东移动通信有限公司 | Method, device, equipment and storage medium for preventing application from being stuck |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2220900C (en) * | 1996-11-14 | 2002-02-12 | Ntt Mobile Communications Network Inc. | Paging scheme for mobile communication system using increased paging channel data transmission rate |
| US6292667B1 (en) * | 1998-05-05 | 2001-09-18 | Telefonaktiebolaget Lm Ericsson (Publ) | Multicell area paging for cellular telecommunications system |
| SE519308C2 (en) * | 1998-12-15 | 2003-02-11 | Ericsson Telefon Ab L M | Cellular mobile communication system and method in such system |
| US6289227B1 (en) * | 1999-05-20 | 2001-09-11 | Qualcomm Incorporated | Method and apparatus for scheduling wake-up time in a CDMA mobile station |
| US7164926B2 (en) * | 2001-06-12 | 2007-01-16 | Telefonaktiebolaget Lm Ericsson (Publ) | Global paging of mobile stations in a wireless network using MSC pool |
-
2003
- 2003-12-09 CN CNB2003101184076A patent/CN100359963C/en not_active Expired - Lifetime
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068370B (en) * | 2006-04-07 | 2011-06-15 | 华为技术有限公司 | User equipment calling method and system |
| WO2008080310A1 (en) * | 2006-12-29 | 2008-07-10 | China Mobile Group Beijing Co., Ltd. | A sub-lac paging method |
| CN102647787A (en) * | 2007-06-04 | 2012-08-22 | 华为技术有限公司 | Paging device |
| CN102647787B (en) * | 2007-06-04 | 2016-08-17 | 华为技术有限公司 | Paging equipment |
| CN101350935B (en) * | 2007-07-18 | 2011-05-11 | 中兴通讯股份有限公司 | Method for paging user terminal in a radio communication system |
| CN101360258B (en) * | 2007-07-30 | 2012-10-10 | 中兴通讯股份有限公司 | Method for implementing customer terminal calling in wireless communication system |
| CN101141819B (en) * | 2007-10-18 | 2010-06-02 | 中兴通讯股份有限公司 | Method and device for improving inter-system paging success rate |
| CN101938814B (en) * | 2009-06-29 | 2013-11-06 | 华为技术有限公司 | Mobile terminal paging method and mobile call center equipment |
| CN101801003A (en) * | 2010-02-02 | 2010-08-11 | 中兴通讯股份有限公司 | Paging method and device |
| WO2011095030A1 (en) * | 2010-02-02 | 2011-08-11 | 中兴通讯股份有限公司 | Paging method and device |
| CN102316578A (en) * | 2010-07-06 | 2012-01-11 | 中兴通讯股份有限公司 | Paging method and system, and radio network controller |
| WO2012159491A1 (en) * | 2011-05-24 | 2012-11-29 | 电信科学技术研究院 | Method and device for distributing paging range |
| CN102209390B (en) * | 2011-05-24 | 2016-02-03 | 电信科学技术研究院 | The distribution method of paging range and equipment |
| CN102209390A (en) * | 2011-05-24 | 2011-10-05 | 电信科学技术研究院 | Distribution method and equipment of paging range |
| CN104602343A (en) * | 2015-02-16 | 2015-05-06 | 中怡(苏州)科技有限公司 | Paging method, neighbor list recording method and paging device |
| TWI602463B (en) * | 2015-02-16 | 2017-10-11 | 中磊電子股份有限公司 | Paging method, neighbor list recording method and paging device |
| CN104602343B (en) * | 2015-02-16 | 2018-04-13 | 中磊电子（苏州）有限公司 | Paging method and paging equipment |
| CN112423289A (en) * | 2020-11-09 | 2021-02-26 | Oppo广东移动通信有限公司 | Method, device, equipment and storage medium for preventing application from being stuck |
| CN112423289B (en) * | 2020-11-09 | 2023-06-27 | Oppo广东移动通信有限公司 | Method and device for preventing application from being blocked, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100359963C (en) | 2008-01-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1129340C (en) | Identifier allocation method | |
| CN101068370B (en) | User equipment calling method and system | |
| CN1175689C (en) | Method and apparatus for transferring information between mobile terminals and entities in a radio access network | |
| CN1127877C (en) | Arranging control signallings in telecommunication system | |
| CN1729649A (en) | Wireless gateway, and associated method, for a packet radio communication system | |
| CN1627837A (en) | Method for seeking mobile station | |
| CN1756437A (en) | Method for determinig a mobility index for a mobile unit | |
| CN1502213A (en) | Method for establishing a list of neighbouring cells in a mobile radiocommunication system | |
| CN1314278C (en) | Method for conducting roaming limitation | |
| CN101043704A (en) | Method, network and apparatus for updating user equipment locating information | |
| CN101047947A (en) | Mobile management method in gradual network | |
| CN101060711A (en) | A mobile communication terminal position updating method | |
| CN1917697A (en) | Method for transferring user inside node pool of core network, and node | |
| CN1925672A (en) | Method for transferring user terminal in service universal grouping wireless business supporting node pool | |
| WO2005084068A1 (en) | Method and apparatus for intelligent paging in a wireless communication network | |
| CN101039523A (en) | Joint user transferring method and communication system and service GPRS support node | |
| CN101039510A (en) | Method for realizing equivalent routing area in wireless evolution network | |
| CN1921684A (en) | Beep-page method in wireless city region network | |
| CN1910835A (en) | Method for handover between asynchronous communication network and synchronous communication network | |
| CN1882151A (en) | Method for reducing core network node load | |
| CN1882169A (en) | Handling method for user device transfer between different core network nodes | |
| CN1859698A (en) | Method for solving calling left user as non-success problem after core net node fault | |
| CN1585505A (en) | Method for inquiring channel type by service wireless network controller | |
| CN1874592A (en) | Sorted method for locating cells under disjuncture of controller of base station | |
| CN1728880A (en) | Location structure configuration training method for use in a cellular mobile communication system |
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 | ||
| CX01 | Expiry of patent term |
Granted publication date: 20080102 |
|
| CX01 | Expiry of patent term |