CN1852602B - Random access requestment method - Google Patents
Random access requestment method Download PDFInfo
- Publication number
- CN1852602B CN1852602B CN200510134793A CN200510134793A CN1852602B CN 1852602 B CN1852602 B CN 1852602B CN 200510134793 A CN200510134793 A CN 200510134793A CN 200510134793 A CN200510134793 A CN 200510134793A CN 1852602 B CN1852602 B CN 1852602B
- Authority
- CN
- China
- Prior art keywords
- random
- current
- request
- inserts
- bts
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The method saves random access (RA) value carried by previous piece of random access request. The method includes steps: (1) receiving current RA request, determining whether RA carried by current RArequest is identical to the saved RA; if yes, then, discarding the current RA request, and ending the flow, otherwise executing step (2); (2) assigning special dedicated control channel SDCCH to entity of sending current RA access request. The invention solves issue that it is difficult for mobile station to access network cause by large numbers of abnormal RA access request in current technique.
Description
Technical field
The present invention relates to wireless communication technology, relate in particular to a kind of request control method that inserts at random.
Background technology
According to current comprehensive mobile communication system (GSM) agreement, under any circumstance, travelling carriage (MS) inserts the GSM network as need, all should at first send to base station sub-system (BSS) and insert request application Separate Dedicated Control Channel (SDCCH) at random.Correspondingly, BSS is receiving that inserting request back execution assignment procedure at random is MS assignment SDCCH.
Fig. 1 is the existing flow chart that inserts the request control method at random, and the existing request control method that inserts at random comprises:
Step 101～102: base station (BTS) resolves channel request (CH_REQ) message that MS sends by Random Access Channel (RACH), know the access value at random (RA) and current C H_REQ message time corresponding retardation (TA) and the frame number (FN) that carry in the current C H_REQ message, be called current RA, TA and FN herein; BTS carries current RA, TA and FN at least to base station controller (BSC) channel request (CH_RQD) message in this message.
Step 103～106:BSC is that MS distributes SDCCH according to the Radio Resource situation of network; BSC notice BTS carries out activation process and activates the SDCCH that is distributed; BSC sends assignment (IMM_ASS) order to BTS, and notice BTS is that MS distributes the SDCCH that is activated; BTS sends assignment (IMM_ASS) message to MS, wherein carries the channel of the SDCCH that distributes to MS and describes.
Wherein, step 104 comprises that further step 104a～104c:BSC transmitting channel activates (CHAN_ACTIV) message informing BTS and prepares the respective channel resource; BTS prepares the respective channel resource; The BTS Return Channel activates and confirms that (CHAN_ACTIV_ACK) message is to BSC.
MS carries the RA of one 8 bit usually to the CH_REQ message that BTS sends in the step 101, and RA further comprises two fields: length is access reason (EC) field of 3～6 bits, and expression MS requires to insert the reason of GSM network; Length is random reference value (RR) field of 2～5 bits, owing to the RR field is provided with at random by MS, so the RA that MS carries in the double CH_REQ message that BSS sends must be unequal.Simultaneously, because CH_REQ message has also been added relevant bottom-up information when being encapsulated as bottom message, so BTS can also be known the TA and the FN of this CH_REQ message correspondence by resolving CH_REQ message.
Insert at random in the request control method existing, BSS is defaulted as the request that inserts at random of being received from the request of access at random of MS and distributes SDCCH for it, will be called the request that normally inserts at random herein from the request of access at random of MS.But in actual applications, BSS received inserts the request of access at random that may comprise also in the request that the abnormal signal source by non-MS is sent at random, will be called the request that inserts unusually at random from the request of access at random in the abnormal signal source of non-MS herein.For example, following two class abnormal signal sources once appearred in the current GSM network: first kind abnormal signal source, its continuous transmission is carried the first kind that equates RA in a large number and is inserted request unusually at random, and the differences of the FN that asks of continuous two unusual accesses at random are 1, the absolute value of the difference of TA is less than 3; The second class abnormal signal source, its continuous transmission are carried second class that equates RA in a large number and are inserted request unusually at random, and the differences of the FN that asks of continuous two unusual accesses at random are 2, the absolute value of the difference of TA is less than 3.
Correspondingly, BSS is after receiving the above-mentioned request of access unusually at random, if still handle the request that inserts unusually at random according to the current request of access at random control method, following consequence: BSS to occur and directly distribute SDCCH for the abnormal signal source that request inserts at random, that is to say, the abnormal signal source will occupy the SDCCH that MS is intended distributing in network Central Plains, this will make the SDCCH resource of network go short of, strengthened the difficulty of MS access network. simultaneously, because current abnormal signal source sends a large amount of unusual requests that insert usually continuously, make the SDCCH of network exhaust very soon, cause MS even might can't apply for SDCCH, also just can't access network.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of request control method that inserts at random, can solve the MS that causes because of a large amount of unusual requests of access at random in the prior art and insert difficult problem.
According to above-mentioned purpose, the invention provides a kind of request control method that inserts at random, this method comprises:
A, last one of preservation insert the RA of access value at random that request is carried at random,
B, receive the current request that inserts at random, judge and currently insert the RA that request carries at random and whether equate with the RA of described preservation, if, the RA that is preserved with current RA replacement and abandon current access at random and ask process ends, otherwise execution in step C then;
C, the RA and the assignment SDCCH that are preserved with current RA replacement give the entity that sends the current request of access at random.
Wherein, assignment described in the step C comprises: BSC distributes SDCCH according to the Radio Resource situation of network for sending the current entity that inserts request at random, BSC notice BTS activates the SDCCH that is distributed, and BSC sends Assignment Command by BTS to sending the current entity that inserts request at random.
Wherein, the RA that preserves described in the steps A is kept at BTS,
Receive described in the step B and be: BTS receives the current request that inserts at random,
Judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C,
Further comprise before the assignment described in the step C: BTS reports current the access at random to ask to give BSC.
Wherein, the RA that preserves described in the steps A is kept at BSC,
Receive described in the step B and be: BSC receives the current request that inserts at random by BTS,
Judge described in the step B and be: BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, if then replace the RA that is preserved with current RA and abandon current request, the process ends, otherwise execution in step C of inserting at random.
Wherein, in the described steps A, BTS further preserves last of self receiving and inserts request time corresponding lead TA at random,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
Wherein, in the described steps A, BTS further preserves a last frame number FN who inserts the request correspondence at random who self receives,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
Wherein, in the described steps A, BTS further preserves a last TA and a FN who inserts the request correspondence at random who self receives,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
Wherein, in the described steps A, last one that BSC further preserves BTS and received is inserted the corresponding TA of request at random,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
Wherein, in the described steps A, BSC further preserves the last FN who inserts the request correspondence at random that BTS receives,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
Wherein, in the described steps A, BSC further preserves a last TA and the FN who inserts the request correspondence at random that BTS receives,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, and whether the difference of the current FN that inserts corresponding FN at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon current request, the process ends, otherwise execution in step C of inserting at random with current RA.
In first embodiment of the invention, the request of access at random that the BTS Direct Filtration is received has only to be judged as the normal request that inserts request at random through BTS and just can to report BSC, thereby is the entity assignment SDCCH that sends request by BSC.
In the second embodiment of the present invention, BTS reports all that receive to insert request at random, filter the request of access at random that reports by BSC respectively according to BTS, have only after BSC is judged as normally access request at random, BSC just can be the entity assignment SDCCH that sends request.
As seen, insert at random in the request control method of the present invention, BSS can filter the request of access at random of being received after receiving and inserting request at random, has only to be judged as the normal request that inserts request at random through BSS and just can be responded.By filtering the request that inserts unusually at random, greatly reduce the SDCCH quantity that BSC distributes to the abnormal signal source, solved in the prior art because of inserting the SDCCH resource anxiety, the MS that cause at random inserts difficult problem unusually in a large number.
Simultaneously, if being mistaken for unusually at random, the request that normally inserts at random that MS sent inserts, because double the access at random that same MS sent asks the RA that carries must be difference, so the request of access at random that this MS retransmits can not judged by accident once more, like this, when filtering the unusual request of access at random, guaranteed that also MS can be assigned to SDCCH insusceptibly.
Description of drawings
Fig. 1 is the flow chart that prior art inserts the request control method at random.
Fig. 2 is the flow chart that inserts the request control method at random of the embodiment of the invention one.
Fig. 3 is the flow chart that inserts the request control method at random of the embodiment of the invention two.
Embodiment
Core concept of the present invention is: BSS judges at first whether this inserts request at random is the request that inserts unusually at random after receiving and inserting request at random, if, then directly abandon this request, otherwise for sending the entity assignment SDCCH of this request.
Embodiment one: in the present embodiment, BTS judges at first whether this inserts request at random is the request that inserts unusually at random after receiving and inserting request at random, if, then directly abandon this request, otherwise report request to give BSC so that BSC is for sending the entity assignment SDCCH of request.
Fig. 2 is the flow chart that inserts the request control method at random of the embodiment of the invention one, wherein, increase the memory cell that is used to store RA among the BTS, preserve BTS in this memory cell in advance and insert the RA that request is known at random by resolving article one of being received, specifically, BTS preserves the RA that article one CH_REQ message of being received is carried in advance.
Simultaneously, the request of the access at random control method of present embodiment is that BTS handles second and the later request of the access at random control method of being received that inserts employing when asking at random of second, and the request of the access at random control method of present embodiment comprises:
Step 201～202:BTS resolves the CH_REQ message of receiving, knows current RA, TA and FN; BTS judges whether current RA and the RA that is preserved equate, if, then replace the RA that is preserved, and directly abandon this request with current RA, process ends, otherwise, replace the RA that is preserved with current RA, and execution in step 203 and subsequent step thereof.Among Fig. 2 with current RA and the unequal situation of the RA that preserved be example.
Step 203～207:BTS sends CH_RQD message to BSC, carries current RA, TA and FN in the CH_RQD message at least; BSC distributes SDCCH according to the Radio Resource situation of network for sending the entity that inserts request at random; BSC notice BTS carries out activation process and activates the SDCCH that is distributed; BSC sends the IMM_ASS order to BTS, and notice BTS is that the entity that transmission inserts request at random distributes the channel that is activated; BTS sends IMM_ASS message to sending the entity that inserts request at random, describes comprising the channel of the SDCCH that distributes to this entity.
Wherein, step 205 can comprise further that step 205a～205c:BSC sends CHAN_ACTIV message informing BTS and prepares the respective channel resource; BTS prepares the respective channel resource; BTS returns CHAN_ACTIV_ACK message and gives BSC.
In the request of the access at random control method of present embodiment, memory cell among the BTS also can be preserved BTS in advance by resolving RA and the corresponding TA that article one CH_REQ message received is known, correspondingly, above-mentioned steps 202 comprises: BTS judges that whether equal current RA with the RA that preserves of institute, and whether the absolute value of current TA and the difference of the TA that is preserved is smaller or equal to 2, if, then replace RA and the TA that is preserved with current RA and TA, and directly abandon this request, process ends, otherwise, replace RA and the TA that is preserved with current RA and TA, and execution in step 203 and subsequent step thereof.
Perhaps, memory cell among the BTS also can be preserved BTS in advance by resolving RA and the corresponding FN that article one CH_REQ message received is known, correspondingly, above-mentioned steps 202 comprises: BTS judges whether current RA and the RA that is preserved equate, and whether the absolute value of current FN and the difference of the FN that is preserved is smaller or equal to 5, if, then replace RA and the FN that is preserved with current RA and FN, and directly abandon this request, process ends, otherwise, replace RA and the FN that is preserved with current RA and FN, and execution in step 203 and subsequent step thereof.
Perhaps, memory cell among the BTS also can be preserved BTS in advance by resolving RA and corresponding TA and the FN that article one CH_REQ message received is known, correspondingly, step 202 comprises: BTS judges whether current RA and the RA that is preserved equate, and whether the absolute value of current TA and the difference of the TA that is preserved is smaller or equal to 2, and whether the absolute value of current FN and the difference of the FN that is preserved is smaller or equal to 5, if, then use current RA, TA and FN replace the RA that is preserved, TA and FN, and directly abandon this request, process ends, otherwise, use current RA, TA and FN replace the RA that is preserved, TA and FN, and execution in step 203 and subsequent step thereof.
Embodiment two: in the present embodiment, BTS directly reports BSC after receiving and inserting request at random, judges by BSC whether this inserts request at random is the request that inserts unusually at random, if, then directly abandon this request, otherwise BSC is directly for sending the entity assignment SDCCH of request.
Fig. 3 is the flow chart that inserts the request control method at random of the embodiment of the invention two, wherein, at least one BTS that increase and this BSC administer among the BSC is at least one memory cell one to one, each memory cell is used to store BSC respectively and inserts the RA that request is known at random by the article one of resolving corresponding BTS and reporting, specifically, each memory cell is preserved the RA of knowing by article one CH_RQD message of resolving corresponding BTS respectively in advance.
Simultaneously, the request that inserts the at random control method of present embodiment be BSC handle from the second of each BTS and second later insert request at random the time request of the access at random control method that adopts, the request of the access at random control method of present embodiment comprises:
Step 301～303:BTS resolves the CH_REQ message of receiving, knows current RA, TA and FN; BTS sends CH_RQD message to BSC, carries current RA, TA and FN in this message at least; BSC resolves the CH_RQD message of receiving, know current RA, TA and FN, judge whether the RA that current RA and the last CH_RQD message from this BTS of being preserved are carried equates, if, then replace a last RA that CH_RQD message is carried who is preserved, and directly abandon this request, process ends from this BTS with current RA, otherwise replace a last RA that CH_RQD message is carried who is preserved, and execution in step 304 and subsequent step thereof from this BTS with current RA.The unequal situation of RA of carrying with current RA and the last CH_RQD message from this BTS of being preserved among Fig. 3 is an example.
Step 304～307:BSC distributes SDCCH according to the Radio Resource situation of network for sending the entity that inserts request at random; BSC notice BTS carries out activation process and activates the SDCCH that is distributed; BSC sends the IMM_ASS order to BTS, and notice BTS is that the entity that transmission inserts request at random distributes the channel that is activated; BTS sends IMM_ASS message to sending the entity that inserts request at random, describes comprising the channel of the SDCCH that distributes to this entity.
Wherein, step 305 can comprise further that step 306a～306c:BSC sends CHAN_ACTIV message informing BTS and prepares the respective channel resource; BTS prepares the respective channel resource; BTS returns CHAN_ACTIV_ACK message and gives BSC.
In the request of the access at random control method of present embodiment, each memory cell of BSC also can be preserved RA and the TA of knowing from article one CH_RQD message of corresponding BTS by resolving respectively in advance, correspondingly, above-mentioned steps comprises: BSC resolves the CH_RQD message of receiving, know current RA, TA and FN, judge whether current RA equates with the RA that is preserved, and whether the absolute value of current TA and the difference of the TA that is preserved is smaller or equal to 2, if, then replace RA and the TA that is preserved, and directly abandon this request, process ends with current RA and TA, otherwise replace RA and the TA that is preserved, and execution in step 304 and subsequent step thereof with current RA and TA.
Perhaps, each memory cell of BSC also can be preserved RA and the FN of knowing from article one CH_RQD message of corresponding BTS by resolving respectively in advance, correspondingly, above-mentioned steps 303 comprises: BSC resolves the CH_RQD message of receiving, know current RA, TA and FN, judge whether current RA equates with the RA that is preserved, and whether the absolute value of current FN and the difference of the FN that is preserved is smaller or equal to 5, if, then replace RA and the FN that is preserved, and directly abandon this request, process ends with current RA and FN, otherwise replace RA and the FN that is preserved, and execution in step 304 and subsequent step thereof with current RA and FN.
Perhaps, each memory cell of BSC also can be preserved the RA of knowing from article one CH_RQD message of corresponding BTS by resolving respectively in advance, TA and FN, correspondingly, above-mentioned steps 303 comprises: BSC resolves the CH_RQD message of receiving, know current RA, TA and FN, judge whether current RA equates with the RA that is preserved, and whether the absolute value of current TA and the difference of the TA that is preserved is smaller or equal to 2, and whether the absolute value of current FN and the difference of the FN that is preserved is smaller or equal to 5, if, then use current RA, TA and FN replace the RA that is preserved, TA and FN, and directly abandon this request, process ends, otherwise use current RA, TA and FN replace the RA that is preserved, TA and FN, and execution in step 304 reaches thereafter.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.
Claims (10)
1. one kind is inserted the request control method at random, it is characterized in that this method comprises:
A, last one of preservation insert the RA of access value at random that request is carried at random;
B, receive the current request that inserts at random, judge and currently insert the RA that request carries at random and whether equate with the RA of described preservation, if, the RA that is preserved with current RA replacement and abandon current access at random and ask process ends, otherwise execution in step C then;
C, the RA and the assignment Separate Dedicated Control Channel SDCCH that are preserved with current RA replacement give the entity that sends the current request of access at random.
2. the method for claim 1, it is characterized in that, assignment described in the step C comprises: base station controller BSC is distributed SDCCH according to the Radio Resource situation of network for sending the current entity that inserts request at random, BSC informing base station BTS activates the SDCCH that is distributed, and BSC sends Assignment Command by BTS to sending the current entity that inserts request at random.
3. method as claimed in claim 1 or 2 is characterized in that the RA that preserves in the described steps A is kept at BTS,
Receive described in the step B and be: BTS receives the current request that inserts at random,
Judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C,
Further comprise before the assignment described in the step C: BTS reports current the access at random to ask to give BSC.
4. method as claimed in claim 1 or 2 is characterized in that the RA that preserves in the described steps A is kept at BSC,
Receive described in the step B and be: BSC receives the current request that inserts at random by BTS,
Judge described in the step B and be: BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, if then replace the RA that is preserved with current RA and abandon current request, the process ends, otherwise execution in step C of inserting at random.
5. method as claimed in claim 3 is characterized in that, in the described steps A, BTS further preserves last of self receiving and inserts request time corresponding lead TA at random,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
6. method as claimed in claim 3 is characterized in that, in the described steps A, BTS further preserves a last frame number FN who inserts the request correspondence at random who self receives,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
7. method as claimed in claim 3 is characterized in that, in the described steps A, BTS further preserves a last TA and a FN who inserts the request correspondence at random who self receives,
Correspondingly, judge described in the step B and be: BTS judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon current request, the process ends, otherwise execution in step C. of inserting at random with current RA
8. method as claimed in claim 4 is characterized in that, in the described steps A, last one that BSC further preserves BTS and received is inserted the corresponding TA of request at random,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
9. method as claimed in claim 4 is characterized in that, in the described steps A, BSC further preserves the last FN who inserts the request correspondence at random that BTS receives,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current FN that inserts the corresponding FN of request at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon the current request that inserts at random with current RA, process ends, otherwise execution in step C.
10. method as claimed in claim 4 is characterized in that, in the described steps A, BSC further preserves a last TA and the FN who inserts the request correspondence at random that BTS receives,
Correspondingly, judge described in the step B and be: described BSC judges current the access at random asks the RA that carries whether to equate with the RA that self preserves, and whether the absolute value of the difference of the current TA that inserts the corresponding TA of request at random and self preserve is smaller or equal to 2, and whether the difference of the current FN that inserts corresponding FN at random and self preserve is smaller or equal to 5, if, then replace the RA that is preserved and abandon current request, the process ends, otherwise execution in step C of inserting at random with current RA.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200510134793A CN1852602B (en) | 2005-12-16 | 2005-12-16 | Random access requestment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200510134793A CN1852602B (en) | 2005-12-16 | 2005-12-16 | Random access requestment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1852602A CN1852602A (en) | 2006-10-25 |
| CN1852602B true CN1852602B (en) | 2010-05-05 |
Family
ID=37134065
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200510134793A Expired - Fee Related CN1852602B (en) | 2005-12-16 | 2005-12-16 | Random access requestment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1852602B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101111033B (en) * | 2007-08-31 | 2013-10-02 | 华为技术有限公司 | Crosstalk detecting method, network side equipment and terminal |
| CN101188863B (en) * | 2007-12-19 | 2012-06-06 | 中兴通讯股份有限公司 | Allocation method for independent private control channel |
| CN101895855B (en) * | 2009-05-18 | 2013-06-26 | 中国移动通信集团公司 | Access method, base station and access system of mobile terminal |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1387735A (en) * | 1999-09-07 | 2002-12-25 | 艾利森公司 | Controlled transmission of wireless communications device identity |
| CN1434651A (en) * | 2002-01-23 | 2003-08-06 | 英业达集团(上海)电子技术有限公司 | Device and method for filtering call-in interference by phonetic prompting |
| CN1588887A (en) * | 2004-09-30 | 2005-03-02 | 西安西电捷通无线网络通信有限公司 | Abnormal processing method for mobile node in flexible IP network technology system |
-
2005
- 2005-12-16 CN CN200510134793A patent/CN1852602B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1387735A (en) * | 1999-09-07 | 2002-12-25 | 艾利森公司 | Controlled transmission of wireless communications device identity |
| CN1434651A (en) * | 2002-01-23 | 2003-08-06 | 英业达集团(上海)电子技术有限公司 | Device and method for filtering call-in interference by phonetic prompting |
| CN1588887A (en) * | 2004-09-30 | 2005-03-02 | 西安西电捷通无线网络通信有限公司 | Abnormal processing method for mobile node in flexible IP network technology system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1852602A (en) | 2006-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2515597B1 (en) | Method for wireless resource scheduling, network element of access network and terminal thereof | |
| US10772122B2 (en) | Method for random access in idle state and device | |
| US8374151B2 (en) | Method and system for acquiring continuous packet connectivity technology support capability information | |
| EP2553979B1 (en) | Post access policing in a mobile communication network | |
| JP4439918B2 (en) | Method and apparatus for bandwidth class acquisition and assignment in a wireless communication system | |
| KR101896905B1 (en) | Network access method and apparatus | |
| CN113438644B (en) | Data transmission method, device and system | |
| US11758603B2 (en) | Service request handling | |
| US20130344903A1 (en) | Method for allocating identification, method for paging group, and communication device | |
| CN104640212B (en) | A resource allocation method and device | |
| CN108834215B (en) | Connectionless transmission method and terminal suitable for uplink small data packet | |
| JP2020074644A (en) | Connection establishing method and device | |
| CN105120529A (en) | Long-term evolutional cellular network based D2D (Device to Device) communication establishing device and method | |
| KR20220110752A (en) | System and method for sidelink communication in a wireless communication network | |
| CN1968501A (en) | Method and system for sensing user end access style in core network | |
| EP2744285B1 (en) | Method and device for short-delay resource management, and wireless access network device | |
| KR101362835B1 (en) | User device, base station, and method in mobile communication system | |
| CN110831256A (en) | Method and device for recovering data radio bearer, storage medium and electronic device | |
| CN113271687B (en) | Data transmission method, service base station and anchor point base station | |
| CN1852602B (en) | Random access requestment method | |
| CN102790810B (en) | IP (internet protocol) address allocation method and device | |
| CN102137471A (en) | Access control method, system and equipment | |
| CN101188863B (en) | Allocation method for independent private control channel | |
| EP1271985B1 (en) | Method to speed up uplink data setup for GPRS mobile internet access . | |
| EP1983784A1 (en) | Mobile station, radio access network device, and resource request method |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100505 Termination date: 20171216 |