CN101030937A - Multilevel random accessing method based on packet - Google Patents
Multilevel random accessing method based on packet Download PDFInfo
- Publication number
- CN101030937A CN101030937A CNA2007100517427A CN200710051742A CN101030937A CN 101030937 A CN101030937 A CN 101030937A CN A2007100517427 A CNA2007100517427 A CN A2007100517427A CN 200710051742 A CN200710051742 A CN 200710051742A CN 101030937 A CN101030937 A CN 101030937A
- Authority
- CN
- China
- Prior art keywords
- group
- base station
- travelling carriage
- random access
- random
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The method comprises: dividing the mobile stations desired to access the network into several groups; through two random access stages, the mobile station accesses the network; in first stage random access stage, the base station is only permitted to send group number signals; according to the group access state, the base station sets one of groups as 'currently active group, and instructs the mobile station in the group to enter into the second random access stage, and instructs the other groups not content use the backward random access channel. In the second stage, the mobile station in the current active group sends the random access signals, until successfully accessing the network or the access process is stopped by base station; when the access process is stopped, the base station sets another group to enter into second stage.
Description
Technical field
The invention belongs to the field of access technology at random of data link layer protocol in the wireless communication system, be specifically related to a kind of multistage accidental access method based on minute group.
Background technology
Inserting at random is the process of a travelling carriage request connecting system.Insert the access first that both can be used for travelling carriage at random, support call is initiated, and also can be used for the business such as transfer of data of page response, registration, short message and demblee form.What the random access protocol of existing mobile communications system adopted all is ALOHA access technology at random, but different system ALOHA has difference.
The characteristics of Jie Ruing are that each user can be according to the wish transmission information at random of oneself at random, and have only a common signal channel, as long as the frame that they sent out has a bit overlapping in time, will bump.The result of collision is that mistake all appears in the data that both sides' (also may be in many ways) of making collision are sent, thereby all must retransmit, and so just may continue to collide.The retransmission policy that ALOHA system adopts is to allow each user wait for one period at random, and then retransmits.As bumping again, then wait for one period at random again, till retransmitting successfully.
According to theory analysis, the performance of this pure ALOHA system is lower, and the maximum of its throughput can only reach 0.18, and the offered load of this system necessarily can not surpass 0.5, otherwise system is with regard to cisco unity malfunction.In order to improve the throughput of random access system, all users can be got up in time synchronously, and will be divided into a section isometric time slot (slot) time, simultaneously regulation, no matter when frame produces, it can only begin just can send at each time slot.Such ALOHA system is called time slot A LOHA or S-ALHOA.Theory analysis, this system is 1 o'clock at offered load, can reach the maximum 0.368 of throughput, and offered load can not surpass 1.By forefathers to two kinds of ALOHA systems more as can be known, when throughput was very little, the performance of pure ALOHA was good slightly; But when throughput increases, the performance of pure ALOHA meeting rapid deterioration, time slot A LOHA can work under higher throughput.
IS-95 adopts non-overlapped time slot A LOHA, because Access Preamble is longer, to cause inserting message also longer and channel speed is low, can make access speed very slow, and time delay is longer.Among the IS-2000, the both compatible access module of IS-95 improves at the deficiency of IS-95 again.Different with the non-overlapped time slot A LOHA scheme of IS-95 is, it has adopted the method for overlapping slot ALOHA, make long code as the function of time slot to prevent collision.Like this, the access information that the user sends can be overlapped on time shaft, has reduced time delay.When transmitting access exploration, send the access channel prefix earlier, should send the message encapsulation afterwards.
In the 3G mobile communication, adopt the S-ALOHA mode to insert at random.In this manner, each mobile radio station has data just to send out, and each does what he thinks is right, do not have unified commander, when the packet that inserts at random much is, will produce serious collision, causes strong noise, makes the network performance rapid deterioration.
In the mobile communication in future, along with mobile subscriber and class of business get more and more, the COS that needs to insert also increases, and must shine more and more frequent burst service to occur, and the performance of Random Access Channel such as collision probability, access delay etc. are with direct service impacting quality like this.
Summary of the invention
The object of the present invention is to provide a kind of multistage accidental access method based on minute group, the present invention can improve the performance that the multi-user inserts at random in the Radio Access Network, reduce the collision probability that the multiple terminals is inserted at random, improve the access efficiency of Radio Access Network, be specially adapted to the heavy load Radio Access Network.
A kind of multistage accidental access method based on minute group provided by the invention the steps include:
(1) the 1st grade of random access procedure, the base station comprises step (A1)-(A4), mobile radio station comprises step (B1)-(B3):
(A1) base station broadcast group information comprises that the first order of this random access procedure inserts the group number of indication, this random access procedure, each group number and attribute thereof at random;
(A2) group's coded signal of base station receiving mobile transmission, whether in each group have travelling carriage need initiate at random insert, and set up one " group inserts chained list " according to group's coded signal if judging;
Does (A3) base station judge that ' group inserts chained list ' is empty? if, be empty, all reverse random access channels are regained in the base station, change step (A1) over to; If chained list non-NULL, base station enter step (A4);
(A4) base station is provided with the group be positioned at the linked list head node and is " current active group ", the step (A5) that enters the 2nd grade of random access procedure;
(B1) travelling carriage is intercepted broadcast message, obtains the group information that this inserts at random;
(B2) travelling carriage is selected a group voluntarily according to the group information of this broadcasting, is under the jurisdiction of in certain group unless this travelling carriage has been specified in advance by the base station;
(B3) travelling carriage sends group's sign indicating number, the step (B4) that enters the 2nd grade of access procedure;
(2) the 2nd grades of random access procedures, the base station comprises step (A5)-(A8), mobile radio station comprises step (B4)-(B8):
(A5) base station broadcast BC-2 information: the group number information of " current active group " and reverse random access channel information;
(A6) the 2nd grade of access at random of current active group handled in the base station, in case the travelling carriage of current active group is initiated at random access attempts in the 2nd grade of (B6) process that inserts at random after, the base station is then according to the travelling carriage collision situation of access attempts at random, the travelling carriage of access attempts success at random is linked into network, and feeds back successful access information to it;
(A7) base station is when step (A6) process continues, whether be true: { (the 2nd grade of random access procedure is overtime) ∪ (current active group inserts and finishes) } if constantly detecting following condition, if this condition is true, the base station stops the 2nd grade of random access procedure of " current active group " immediately, the base station enters step (A8), otherwise the base station turns back to step (A6);
(A8) deletion " current active group " node the chained list is inserted from group in the base station, turns back to step (A3) then;
(B4) travelling carriage is intercepted base station broadcast, and in a single day travelling carriage obtains broadcast message, then enters step (B5);
(B5) travelling carriage judges to " travelling carriage access state " that according to the broadcast message that listens to if judged result is state S1, then travelling carriage changes step (B4) over to; If judged result is state S2, then travelling carriage changes step (B2) over to; If judged result is state S3, then travelling carriage enters step (B6);
State S1: the expression travelling carriage listens to BC-2 information, and knows that it does not belong to " the current active group " of base station broadcast;
State S2: the expression travelling carriage listens to BC-1 information;
State S3: the expression travelling carriage listens to BC-2 information, and knows that it belongs to " the current active group " of base station broadcast;
(B6) travelling carriage sends the radom heuristic signal by using reverse random access channel to the base station;
(B7) travelling carriage feeds back the index signal of coming according to the base station in step (A6), judge whether " inserting successfully " is true, if be true, travelling carriage enters step (B8), otherwise travelling carriage turns back to step (B5);
(B8) travelling carriage changes controlled access state over to, indicates that this travelling carriage finishes random access procedure smoothly, and is admitted by network.
The present invention has overcome that the multi-user initiates the low problem of access efficiency at random in the Radio Access Network that exists in the prior art, and particularly, the present invention has following technique effect:
(1) the present invention divides into some groups by broadcast message with travelling carriage by the base station, making travelling carriage initiate the first order with the identity of group earlier inserts at random, after group obtains to insert authority at random, Mobile Origination inserts for the 2nd grade at random, the collision probability that this method makes Mobile Origination insert at random reduces, and strengthens the probability that travelling carriage inserts at random.
(2) under the heavy load situation, promptly need the number of mobile stations of initiating to insert at random for the reverse random access channel number, under the bigger situation, can greatly improve the access efficiency at random of wireless communication system.
(3) can be according to the QoS level setting group number of business, make travelling carriage to select suitable group number according to initiating professional priority, group's priority is set according to the mapping table of group number and QoS of survice grade in the base station, then in the 1st grade of random access procedure, the group that qos requirement is higher comes the front end of group's chained list, make the group of high priority can enter the 2nd grade of random access procedure more timely, thereby satisfy travelling carriage inserting the requirement of real-time at random.
Description of drawings
Fig. 1 divides group's random access system network diagram for Radio Access Network;
Fig. 2 is the framework schematic diagram of the inventive method;
Fig. 3 is the system handles flow chart of the inventive method.
Embodiment
The present invention is further detailed explanation below in conjunction with accompanying drawing and example.
As shown in Figure 1, base station 010 set some groups 20.1,20.2 ..., 20.n, for mobile station in selecting, make that each travelling carriage all is under the jurisdiction of a group in the Radio Access Network, the corresponding group number of each group.As group 20.1 comprise travelling carriage 1.1 ..., 1.m, group 20.2 comprise travelling carriage 2.1 ..., 2.j ..., the 20.n of group comprise travelling carriage n.1 ..., n.k, m wherein, n, k, j represents arbitrary integer, and they can get identical value, also can have nothing in common with each other.Hereinafter will be with single sub-district Radio Access Network of " network " or " whole network " appellation Fig. 1.
As shown in Figure 2, the present invention carries out between above-mentioned base station and travelling carriage, and system starts random access procedure at every turn and all comprises the 1st grade of random access procedure and the 2nd grade of random access procedure; The 2nd grade of initiation that inserts at random be based on the 1st grade of result who inserts at random, and insert loop start as a result at random according to the 1st grade.
When each startup random access procedure was initial, the base station was according to group information of network condition broadcasting, and this information comprises the numbering of group number, each group, the access channel of each group, the selected attribute of each group and the priority of each group.Travelling carriage is chosen one of them group according to the group information of base station broadcast, as the group under own.Group number is the total number of the group that the base station is distributed in this random access procedure; All there is own unique numbering in each group, is called group number; Each group all is assigned access channel, the access channel of each group typically is designed to quadrature, can be so that the access channel of each group disturb mutually, to be that example is introduced accidental access method of the present invention below with the Walsh Code Channel, we are called for short group random access code road is group's sign indicating number, group's sign indicating number of each group is corresponding one by one with its group number, and mutually orthogonal between group's sign indicating number of each group, does not disturb mutually; The selected attribute of group is used to limit the behavior of choosing of travelling carriage, and promptly travelling carriage need could determine whether can choose this group according to oneself state; Group's Priority flag the degree of priority of this group in the wireless network random access procedure.The in a single day selected group of travelling carriage, then travelling carriage must not at will be changed the group number of oneself, removes nonsystematic and restarts a new random access procedure and broadcast the group number assignment information.Travelling carriage is at group's access phase, promptly in the 1st grade of random access procedure, send own under group's sign indicating number of group.Obviously, the travelling carriage of same group sends identical group's sign indicating number, and the group's sign indicating number that does not belong to the travelling carriage transmission of same group is inequality.The base station starts the 2nd grade of random access procedure after detecting group's access.In the 2nd grade of random access procedure, the base station only allows the i.e. travelling carriage transmission random access information of " current active group " of one of them group, the travelling carriage of other groups then keeps mourning in silence, and must not send accidental access signal, to avoid that the travelling carriage of current active group is caused interference.After 2 grades of processes of this order finished, the random access procedure of whole network was got back to the 1st grade active group again the stage is set, and the base station resets " current active group ", and whole network enters the 2nd grade of random access procedure once more.Circulation and so forth all is linked into the decision of in the network or base station up to all travelling carriages and stops this random access procedure.
Below in conjunction with Fig. 1, Fig. 2 and Fig. 3, accesses at random at different levels and reciprocal step thereof are further described.Shown in Figure 3, the base station end the processing stage have 8, be respectively that A1 is to A8; Mobile you the processing stage also have 8, be respectively that B1 is to B8.
One, the 1st grade of random access procedure:
In the 1st grade of random access procedure, there are four processing procedures the base station, is respectively A1～A4, and the flow process of these processes is as follows:
A1: base station broadcast group information, also i.e. as shown in Figure 3 BC-1 broadcast message.BC-1 broadcast message content comprises that the first order of this random access procedure inserts the group number of indication, this random access procedure, each group number and attribute thereof at random.Broadcast by BC-1 the base station, and the indication travelling carriage enters the 1st grade of random access procedure.The base station waits for that subsequently the B3 process of travelling carriage finishes, thereby enters the A2 process.
In this step, the base station can adopt broadcast mode to the travelling carriage broadcast message, but is not limited to by broadcast channel, can also pass through forward control channel or forward access channel.
A2: group's coded signal that the base station receiving mobile sends, whether the base station receives behind these group's coded signals has travelling carriage need initiate to insert at random in each group of decidable, and set up one " group insert chained list " according to group's coded signal, this chained list is a group number tabulation, comprises all groups that have travelling carriage to send group's sign indicating number in 1 grade of random access procedure of this order.The order of this chained list is according to the priority arrangement of group, and the group of equal priority arranges according to its group's coded signal peci-order that the base station receives.If in 1 grade of random access procedure of this order, insert at random without any Mobile Origination, then an empty chained list will be set up in the base station.After finishing the A2 process, the base station enters the A3 process.
Group's access chained list can be worked out according to group's priority and group's access signal power in the base station.The group that priority is high is organized in the chained list head, and priority is identical, then works out in the chained list according to the peci-order of group's access signal.
A3: base station Rule of judgment 1: " ' group insert chained list ' is empty? "If be empty, show that then this random access procedure is all over, the base station is recoverable to all reverse random access channels, restarts new random access procedure once, and whole network is got back to the A1 process once more; If the chained list non-NULL, then the base station enters the A4 process.
A4: the base station is provided with the group that is positioned at the linked list head node and is " current active group ".Entering the 2nd grade of random access procedure then, also is the A5 process.
Travelling carriage then carries out B1 successively to three processing procedures of B3:
B1: travelling carriage is intercepted broadcast message, thereby knows the group information that this inserts at random.Enter the B2 process then.
B2: travelling carriage is selected a group voluntarily according to the group information of this broadcasting, is under the jurisdiction of in certain group unless this travelling carriage has been specified in advance by the base station.The method of mobile station in selecting group is decided according to the BC-1 broadcast message, if the group that has been every class service definition in the BC-1 broadcast message, then travelling carriage must be selected group according to the class of service of self, if certain class business has a plurality of groups, then travelling carriage needs therefrom to select one at random.In case after the good group of mobile station in selecting, then enter the B3 process.
Travelling carriage can require to choose group number according to the real-time of the business of self initiating.Real-time requires the high high group number of real-time of then choosing, and the real-time attribute of group number is by base station definition and broadcasting.
B3: travelling carriage sends group's sign indicating number.Travelling carriage sends its group's coded signal according to its group's selection result to the base station, and the base station enters the A2 process after receiving group's coded signal that travelling carriage sends, and travelling carriage then enters the B4 process.
Two, the 2nd grade of random access procedure:
In the 2nd grade of random access procedure, there are four processing procedures the base station, is respectively A5～A8, and the flow process of these processes is as follows:
A5: base station broadcast BC-2 information, BC-2 broadcast message content comprises: the group number information of " current active group " and reverse random access channel information.This broadcast message is used to instruct each travelling carriage to enter the 2nd grade of access behavior behind the random access procedure.
In this step, the base station also can adopt broadcast mode to the travelling carriage broadcast message, but is not limited to by broadcast channel, can also pass through forward control channel or forward access channel.
A6: the 2nd grade of access at random of current active group handled in the base station, in case the travelling carriage of current active group is initiated at random access attempts in the 2nd grade of B6 process that inserts at random after, the base station is then according to the travelling carriage collision situation of access attempts at random, the travelling carriage of access attempts success at random is linked into network, and feeds back successful access information to it.
A7: when the base station continued in the A6 process, whether the condition 2 that constantly detects the A7 process was true.Condition 2 is designed to compound condition, and is typical, and condition 2 is set at { (the 2nd grade of random access procedure is overtime) ∪ (current active group inserts and finishes) }, and the overtime thresholding here is provided with by the base station.If condition 2 is true, the base station stops the 2nd grade of random access procedure of " current active group " immediately, and the base station enters the A8 process; Otherwise the base station turns back to the A6 process, continues to handle the access attempts at random of current active group.
In this step, current active group inserts the detection that finishes and can judge according to the energy of access channel; When the energy of access channel is lower than the threshold value of a setting in the base station detects a period of time, judge that then the 2nd grade of random access procedure of current active group finishes, condition 2 is true.
A8: deletion " current active group " node the chained list is inserted from group in the base station, turns back to the A3 process then.
Travelling carriage then carries out B4 successively to five processing procedures of B8:
B4: travelling carriage is intercepted base station broadcast.Travelling carriage needs to intercept base station broadcast information in this process, broadcast message might be the BC-1 broadcast message, also may be the BC-2 broadcast message.In a single day travelling carriage obtains broadcast message, then enters the B5 process.
B5: travelling carriage is judged condition 3 " travelling carriage access state " according to the broadcast message that listens to.The state judged result of condition 3 has and only has three kinds:
＜1〉state S1: the expression travelling carriage listens to BC-2 information, and knows that it does not belong to " the current active group " of base station broadcast;
＜2〉state S2, the expression travelling carriage listens to BC-1 information, and this shows that the base station restarted a new random access procedure, and state S2 is also referred to as and inserts Reset Status at random;
＜3〉state S3, the expression travelling carriage listens to BC-2 information, and knows that it belongs to " the current active group " of base station broadcast; The Mobile Origination of this indication information indication " current active group " inserts for the 2nd grade at random.
If the state judged result of condition 3 is state S1, then travelling carriage turns back to the B4 process; If the state judged result of condition 3 is state S2, then travelling carriage turns back to the B2 process;
If the state judged result of condition 3 is state S3, then travelling carriage enters into the B6 process;
B6: Mobile Origination is access attempts at random.In this process, travelling carriage sends the radom heuristic signal by using reverse random access channel to the base station.
B7: the index signal that travelling carriage is come in A6 process feedback according to the base station, Rule of judgment 4: whether travelling carriage successfully is linked in the network.If be true, travelling carriage enters the B8 process, otherwise travelling carriage turns back to the B5 process.
B8: travelling carriage changes controlled access state over to, indicates that this travelling carriage finishes random access procedure smoothly, and is admitted by network.
Two, 1 grade of random access procedure of the 2nd grade of random access procedure to the is reciprocal
Base station service object in the 2nd grade of random access procedure is the travelling carriage of " current active group ", and the travelling carriage that belongs to other groups then bans use of reverse random access channel.In case the base station detects condition 2 for true, then finish the 2nd grade of random access procedure of " current active group " immediately, and " current active group " from inserting chained list, group deleted, set group then and insert head node new in the chained list and be " current active group ", and " current active group " opened the 2nd grade of random access procedure.
System inserts the 2nd grade of last group in the chained list up to group and inserts at random and finish so repeatedly, and then this random access procedure is all finished, and a new random access procedure must be restarted in system.
Claims (5)
1, a kind of multistage accidental access method based on minute group the steps include:
(1) the 1st grade of random access procedure, the base station comprises step (A1)-(A4), mobile radio station comprises step (B1)-(B3):
(A1) base station broadcast group information comprises that the first order of this random access procedure inserts the group number of indication, this random access procedure, each group number and attribute thereof at random;
(A2) group's coded signal of base station receiving mobile transmission, whether in each group have travelling carriage need initiate at random insert, and set up one " group inserts chained list " according to group's coded signal if judging;
Does (A3) base station judge that ' group inserts chained list ' is empty? if, be empty, all reverse random access channels are regained in the base station, change step (A1) over to; If chained list non-NULL, base station enter step (A4);
(A4) base station is provided with the group be positioned at the linked list head node and is " current active group ", the step (A5) that enters the 2nd grade of random access procedure;
(B1) travelling carriage is intercepted broadcast message, obtains the group information that this inserts at random;
(B2) travelling carriage is selected a group voluntarily according to the group information of this broadcasting, is under the jurisdiction of in certain group unless this travelling carriage has been specified in advance by the base station;
(B3) travelling carriage sends group's sign indicating number, the step (B4) that enters the 2nd grade of access procedure;
(2) the 2nd grades of random access procedures, the base station comprises step (A5)-(A8), mobile radio station comprises step (B4)-(B8):
(A5) base station broadcast BC-2 information: the group number information of " current active group " and reverse random access channel information;
(A6) the 2nd grade of access at random of current active group handled in the base station, in case the travelling carriage of current active group is initiated at random access attempts in the 2nd grade of (B6) process that inserts at random after, the base station is then according to the travelling carriage collision situation of access attempts at random, the travelling carriage of access attempts success at random is linked into network, and feeds back successful access information to it;
(A7) base station is when step (A6) process continues, whether be true: { (the 2nd grade of random access procedure is overtime) ∪ (current active group inserts and finishes) } if constantly detecting following condition, if this condition is true, the base station stops the 2nd grade of random access procedure of " current active group " immediately, the base station enters step (A8), otherwise the base station turns back to step (A6);
(A8) deletion " current active group " node the chained list is inserted from group in the base station, turns back to step (A3) then;
(B4) travelling carriage is intercepted base station broadcast, and in a single day travelling carriage obtains broadcast message, then enters step (B5);
(B5) travelling carriage judges to " travelling carriage access state " that according to the broadcast message that listens to if judged result is state S1, then travelling carriage changes step (B4) over to; If judged result is state S2, then travelling carriage changes step (B2) over to; If judged result is state S3, then travelling carriage enters step (B6);
State S1: the expression travelling carriage listens to BC-2 information, and knows that it does not belong to " the current active group " of base station broadcast;
State S2: the expression travelling carriage listens to BC-1 information;
State S3: the expression travelling carriage listens to BC-2 information, and knows that it belongs to " the current active group " of base station broadcast;
(B6) travelling carriage sends the radom heuristic signal by using reverse random access channel to the base station;
(B7) travelling carriage feeds back the index signal of coming according to the base station in step (A6), judge whether " inserting successfully " is true, if be true, travelling carriage enters step (B8), otherwise travelling carriage turns back to step (B5);
(B8) travelling carriage changes controlled access state over to, indicates that this travelling carriage finishes random access procedure smoothly, and is admitted by network.
2, method according to claim 1 is characterized in that: in the step (B2), travelling carriage requires to choose group number according to the real-time of the business of self initiating.
3, method according to claim 1 and 2 is characterized in that: in (A2) step, group's access chained list is worked out according to group's priority and group's access signal power in the base station.
4, method according to claim 3 is characterized in that: in (A1) step with (A5) in the step, the base station adopts broadcast mode to the travelling carriage broadcast message.
5, method according to claim 4 is characterized in that: in (A7) step, it is to judge according to the energy of access channel that current active group inserts the detection that finishes; When the energy of access channel is lower than the threshold value of a setting in the base station detects a period of time, judge that then the 2nd grade of random access procedure of current active group finishes, condition 2 is true.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100517427A CN101030937B (en) | 2007-03-22 | 2007-03-22 | Multilevel random accessing method based on packet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100517427A CN101030937B (en) | 2007-03-22 | 2007-03-22 | Multilevel random accessing method based on packet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101030937A true CN101030937A (en) | 2007-09-05 |
| CN101030937B CN101030937B (en) | 2010-04-14 |
Family
ID=38716023
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100517427A Expired - Fee Related CN101030937B (en) | 2007-03-22 | 2007-03-22 | Multilevel random accessing method based on packet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101030937B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102271417A (en) * | 2011-07-22 | 2011-12-07 | 华为技术有限公司 | Random access procedure management method for long term evolution network and user equipment |
| WO2012129784A1 (en) * | 2011-03-30 | 2012-10-04 | Motorola Solutions, Inc. | Multi-group communications and related devices |
| CN103391517A (en) * | 2012-05-10 | 2013-11-13 | Jvc建伍株式会社 | Communication system, communication control method, mobile station, and base station |
| CN101741810B (en) * | 2008-11-07 | 2014-06-11 | 华为终端有限公司 | Condition-based user selection method, server and system |
| CN104852760A (en) * | 2015-04-14 | 2015-08-19 | 京信通信技术(广州)有限公司 | Transmission media access control method and system |
| US9729286B2 (en) | 2014-01-17 | 2017-08-08 | Industrial Technology Research Institute | Data transmission and feedback methods, devices and system |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI575980B (en) * | 2014-04-14 | 2017-03-21 | 財團法人資訊工業策進會 | Long term evolution network system and group communication method thereof |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1549610A (en) * | 2003-05-09 | 2004-11-24 | 北京三星通信技术研究有限公司 | Method for providing multi-stage insertion service in public insertion information channel |
| CN1242628C (en) * | 2003-05-27 | 2006-02-15 | 中国科学技术大学 | Channel inserting method in spread spectrum grouped network based on multipacket receive |
| CN100362771C (en) * | 2004-07-06 | 2008-01-16 | 华为技术有限公司 | Access decision method for physical random access channel under four-antenna mode |
-
2007
- 2007-03-22 CN CN2007100517427A patent/CN101030937B/en not_active Expired - Fee Related
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741810B (en) * | 2008-11-07 | 2014-06-11 | 华为终端有限公司 | Condition-based user selection method, server and system |
| WO2012129784A1 (en) * | 2011-03-30 | 2012-10-04 | Motorola Solutions, Inc. | Multi-group communications and related devices |
| US9161178B2 (en) | 2011-03-30 | 2015-10-13 | Liang Chen | Multi-group communications and related devices |
| CN102271417A (en) * | 2011-07-22 | 2011-12-07 | 华为技术有限公司 | Random access procedure management method for long term evolution network and user equipment |
| WO2013013606A1 (en) * | 2011-07-22 | 2013-01-31 | 华为技术有限公司 | Random access procedure management method and user equipment in long term evolution network |
| CN102271417B (en) * | 2011-07-22 | 2014-09-17 | 华为技术有限公司 | Random access procedure management method for long term evolution network and user equipment |
| CN103391517A (en) * | 2012-05-10 | 2013-11-13 | Jvc建伍株式会社 | Communication system, communication control method, mobile station, and base station |
| CN103391517B (en) * | 2012-05-10 | 2018-03-23 | Jvc建伍株式会社 | Communication system, communication control method, movement station and base station |
| US9729286B2 (en) | 2014-01-17 | 2017-08-08 | Industrial Technology Research Institute | Data transmission and feedback methods, devices and system |
| CN104852760A (en) * | 2015-04-14 | 2015-08-19 | 京信通信技术(广州)有限公司 | Transmission media access control method and system |
| CN104852760B (en) * | 2015-04-14 | 2018-05-25 | 京信通信技术(广州)有限公司 | Transmission media connection control method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101030937B (en) | 2010-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101064728A (en) | TD-SCDMA system based random access controlling method | |
| CN1190929C (en) | Allocation of resources in packet-switched data transfer | |
| CN101030937A (en) | Multilevel random accessing method based on packet | |
| CN1574833A (en) | Apparatus and method for enhancing transfer rate in a wireless local area network (LAN) | |
| CN1802012A (en) | Method for realizing network service provider selection | |
| CN1910839A (en) | Apparatus and method for establishing radio bearer of mobile terminal | |
| CN1893344A (en) | Multi-carrier-wave communication system TSO time-slot resource distribution method and grouped data transmission method | |
| CN1918923A (en) | Direct transition to cell dch | |
| CN1613209A (en) | Method for providing interactive data service in a mobile communication system | |
| CN1822573A (en) | System and method for controlling data traffic in a wireless communication system | |
| CN1788515A (en) | Fast setup of physical communication channels | |
| CN1204426A (en) | Method for compensating for time dispersion in communication system | |
| CN1217558C (en) | Method for reducing radio channel access delay in wireless communication system | |
| US8351353B2 (en) | Forward channel sharing method in time division communication system | |
| CN101064560A (en) | Method for identifying random access of time-division synchronous CDMA system | |
| CN1260917C (en) | A control method for random access | |
| CN1549485A (en) | Information channel sharing method for supporting concentration service in CDMA system | |
| CN1612501A (en) | Transmitting data using multi-frames | |
| CN1192519C (en) | Wireless network inserted into RACH channel using several sustained probabilities | |
| CN101034935A (en) | Data multiplexing method of multi-user device for the mobile communication network and its system | |
| CN101043307A (en) | Method and apparatus for de-activating hybrid automatic repeat request process in a wireless communications system | |
| CN1128556C (en) | Packet data service providing method in communication system | |
| CN1859623A (en) | Method for realizing stream media service | |
| CN1852592A (en) | Method for avoiding interference of residence multi-cast business | |
| CN101064908A (en) | Method for identifying different service random access in time-division synchronous CDMA 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100414 Termination date: 20140322 |