CN101277260A - Data transmission method for high speed packet service - Google Patents
Data transmission method for high speed packet service Download PDFInfo
- Publication number
- CN101277260A CN101277260A CNA2007100895295A CN200710089529A CN101277260A CN 101277260 A CN101277260 A CN 101277260A CN A2007100895295 A CNA2007100895295 A CN A2007100895295A CN 200710089529 A CN200710089529 A CN 200710089529A CN 101277260 A CN101277260 A CN 101277260A
- Authority
- CN
- China
- Prior art keywords
- frame
- high speed
- transmit leg
- time interval
- node
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a data transmitting method of high-speed grouping operation. A sending side constitutes leisure frame and sends the frame to a receiving side when judges having no data to be sent in pre-set interval. The method can solve problem that the receiving side can not process congestion detection based on no-changing prior protocol frame structure, and can process reliable congestion detection when grouping operation rate is lower.
Description
Technical field
The present invention relates to wireless communication system, particularly the data transmission method of high-speed packet data service.
Background technology
In the 3-G (Generation Three mobile communication system), HSUPA (High Speed Uplink Packet Access, High Speed Uplink Packet inserts) and HSDPA (High Speed Downlink Packet Access, high-speed downlink packet inserts) professional introducing, promoted the peak rate of Packet Service greatly, increasing to ground transmission bandwidth demand, particularly introduce IP carrying after, irrespective major issue must not be in the congested and delay of terrestrial transmission.Therefore in Release 6 versions, in Iub/Iur mouth Frame Protocol FP (Frame Protocol), introduce congestion detection and congested indicating mechanism, carried the transmitting time and the frame number of data when promptly transmit leg sends Frame; Whether whether the recipient transmit frame delay by detecting adjacent two data frame time difference judgment data, detect adjacent two data frame frame number judges whether to take place admission control continuously, if frame delay or LOF take place, the recipient sends the congested indication frame of transmission to transmit leg, allow transmit leg know congestion condition on this direction transmission channel, adjust follow-up data and send strategy, as shown in Figure 1.
Yet (the formal title of agreement is E-DCH FP in the HSUPA frame structure in 3Gpp Release 6 version TS 25.427 agreements, here in order echoing, to prolong and use HSUPA, down together) with HSDPA, frame number FSN (Frame Sequence Number) represents scope 0～15 with 4bit.For 2msTTI (Transmission Time Interval, Transmission Time Interval), if every TTI sends a FP frame, the every 32ms of FSN unrolls, just as long as two adjacent FP frame times at interval greater than 32ms, even FSN is continuous, can not judge whether frame losing.Equally, the frame transmitting time is represented with 8bit CFN (ConnectionFrame Number) and subframe numbers (Subframe Number), subframe numbers scope 0～4, frame transmitting time scope 0～2558ms (CFN*10+Subframe Number*2), therefore, if adjacent two frame time differences can not judge whether to take place frame delay greater than 2558ms.
As shown in Figure 2, when adjacent two frame times at interval [0,32ms), receiver side can carry out reliable frame delay and LOF judgement, if adjacent two frame times are at interval at [32ms, 2558ms), receiver side can be done the reliable frame defer sentence, but can not do reliable frame loses judgement, if adjacent two frame times are at interval more than or equal to 2558ms, receiver side can not be done reliable frame and lose judgement, can not do the reliable frame defer sentence.
When the HSUPA service rate is low, adjacent two frame times are bigger at interval, cause receiver side can not do the reliable frame congestion detection, same situation also may appear among the HSDPA, therefore how to allow receiver side can carry out reliable frame congestion detection the problem to be solved in the present invention just.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of data transmission method of high speed packet service, when Packet data service speed is low, still can carry out reliable congestion detection.
In order to solve the problems of the technologies described above, the invention provides a kind of data transmission method of high speed packet service, it is characterized in that transmit leg does not have data to send then to construct empty frame and send it to the recipient in judging pre-set time interval.
Further, said method specifically may further comprise the steps:
(a) transmit leg sends Frame, and timer is resetted, and restarts timing, when arriving pre-set time interval, has judged whether that data will send, if, carry out normal data transmission flow, return this step, otherwise, carry out next step;
(b) transmit leg is constructed empty frame and is sent it to the recipient, returns step (a).
Further, when described high speed packet service was high speed uplink chain grouping access service, described transmit leg was that Node B is Node B, and described recipient is RNC for radio network controller.Described pre-set time interval is a n Transmission Time Interval, wherein, and 0＜n≤16.
Further, in described step (b), transmit leg adds the number of retransmission of mixing automatic repeat requests in described empty frame.
Further, when described high speed packet service was high speed down link group insersion business, described transmit leg was that radio network controller is RNC, and described recipient is Node B for Node B.Described pre-set time interval is the chronomere of n RNC frame number counter, wherein, and 0＜n≤16.
Further, in described step (a) before, set the time interval that transmit leg is judged by strengthening dedicated channel.
In sum, the Iub/Iur congestion mechanism is improved one's methods and is had following tangible technique effect:
1, do not change on the basis of existing protocol frame structure, solved the problem that receiver side can not effectively not carry out congestion detection;
2, by insert empty frame in HSUPA, RNC can in time obtain HARQ and retransmit situation, so that do real-time power control.
Description of drawings
Fig. 1 is the congested control schematic diagram of Iub/Iur among the existing HSUPA;
Fig. 2 is the schematic diagram that concerns of the consecutive frame time interval and congested control among the existing HSUPA;
Fig. 3 is a HSUPA upstream data frame assumption diagram;
Fig. 4 inserts empty frame and takies the maximum bandwidth graph of a relation for present embodiment HSUPA.
Fig. 5 is HS-DSCH data frame structure figure.
Embodiment
Main thought of the present invention is: the defective that can not do reliable congestion detection at Iub/Iur mouth congestion mechanism in the current agreement when service rate is low, on the basis that does not change the present frame protocol architecture, a kind of method that the FP frame sends density of controlling is proposed: when transmitter side free of data frame sends, insert empty frame, allow receiver side can carry out effective congestion detection.
In HSUPA, by high level configuration Node B, specify each MAC-d Flow (MAC-d stream) every n TTI to send a Frame at least, if the application layer service rate is low or the reason such as of poor quality of eating dishes without rice or wine, cause n TTI not have professional Frame and send, Node B need insert empty frame and send to RNC on this MAC-d Flow at this moment.The data transmission procedure of Node B is as follows:
Step 110, Node B sends Frame (comprising the Frame and the empty frame that have data normally), timer is resetted, pick up counting, judged whether that in the time interval that sets in advance normal Frame will send, if, carry out normal data transmission flow, return this step, otherwise, next step carried out;
Node B starts timer when initialization.The described time interval can be set to n * TTI, and wherein, n value scope is 0＜n≤16, when n=0, represents this invalid configuration, does not send even just there is professional Frame, does not also send empty frame to RNC.
Step 120, Node B constructs empty frame and sends to RNC, returns step 110.
The Iur mouth is the interface between SRNC and the DRNC, and the Iub mouth is the interface between SRNC and the Node B.Node B should send to DRNC by the Iub mouth by the sky frame, and DRNC is transparent to SRNC with it.
Node B can carry HARQ (mixing automatic repeat requests) retransmission information in empty frame.As shown in Figure 3, when MAC-es PDU number (Number of MAC-es PDUs) when being 0, this subframe is an empty frame, can carry effective HARQ number of retransmission (Number of HARQRetransmissions) in the empty frame, be used for RNC and monitor the signal quality of eating dishes without rice or wine, help RNC and carry out real-time exterior ring power control.
Insert empty frame among the HSUPA, need the certain upstream bandwidth of waste, an empty frame FP layer takies 6Byte, and under the limiting case of up no professional packet, FP layer occupied bandwidth is 6*8/ (TTI*n) kbps, i.e. 48/ (TTI*n) kbps; Calculate by minimum TTI=2ms, then FP layer occupied bandwidth is for being 24/nkbps.Fig. 4 has provided n value and the relation that takies maximum bandwidth, in fact the n value is more little, congestion detection result is reliable more, and detection sensitivity is high more, but the n value is more little, occupied bandwidth may be many more, bandwidth waste is serious more, thus n round the consideration of need between bandwidth waste and congestion detection sensitivity, trading off, as can be seen from this figure, the n value equals 3 or 4 can satisfy the little and highly sensitive requirement of congestion detection of waste bandwidth simultaneously, can do representative value and dispose the b to Node by RNC.
Equally, also adopt similar processing among the HSDPA.Fig. 5 is HS-DSCH (high speed shared data channel) data frame structure figure, the last transmission of RNC HS-DSCH FP Frame is limited by Flow Control only, do not have the restriction of TTI, its Configuration Values adopts the chronomere (10ms) of RFN (RNC Frame Number counter, RNC frame number counter).Specify the every n of each a HS-DSCH FP 10ms to send a Frame at least by the high level configuration; If reasons such as the application layer service rate is low or Flow Control is limited cause n 10ms not have professional Frame and send, RNC need insert empty frame and sent to Node B on this HS-DSCH FP this moment.The data transmission procedure of RNC is as follows:
Step 210, RNC sends Frame, and timer is resetted, and picks up counting, and has judged whether that in the time interval that sets in advance normal Frame will send, if, carry out normal data transmission flow, return this step, otherwise, carry out next step;
RNC starts timer when initialization.The described time interval is set to n RFN unit interval, and wherein n value scope is 0＜n≤16, when n=0, represents this invalid configuration, does not send even just there is professional Frame, does not also send empty frame to Node B.For HSDPA, same, when n=3 or n=4, also can satisfy the little and highly sensitive requirement of congestion detection of waste bandwidth simultaneously.
Step 220, RNC constructs empty frame and sends to Node B, returns step 210.
As shown in Figure 5, when PDU number (Num Of PDUs) when being 0, this frame is an empty frame.
In HSUPA and HSDPA, high-rise (referring generally to Operation and Maintenance platform OMC) disposes the n value to Node B or RNC by NBAP agreement (3Gpp TS25.433), set up E-DCH channel (Enhanced DCH by agreement 9.2.2.13Da, strengthen dedicated channel), on the basis of original cell, add following E-DCH cell: (high-rise configuration to RNC is inner interface configuration)
| The cell title | Option whether | Span | Explanation |
| Every n TTI will send an E-DCH Frame (E-DCH Send Data Frame Per n TTI at least) at least | Optional | 0～16 | N=0 represents this invalid configuration; |
In other embodiments, high level can directly dispose the judgement time interval of Node B or RNC by the E-DCH channel.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. the data transmission method of a high speed packet service is characterized in that, transmit leg does not have data to send in judging pre-set time interval then to construct empty frame and send it to the recipient.
2. the method for claim 1 is characterized in that, described method specifically may further comprise the steps:
(a) transmit leg sends Frame, and timer is resetted, and restarts timing, when arriving pre-set time interval, has judged whether that data will send, if, carry out normal data transmission flow, return this step, otherwise, carry out next step;
(b) transmit leg is constructed empty frame and is sent it to the recipient, returns step (a).
3. method as claimed in claim 1 or 2 is characterized in that, when described high speed packet service was high speed uplink chain grouping access service, described transmit leg was that Node B is Node B, and described recipient is RNC for radio network controller.
4. method as claimed in claim 3 is characterized in that, described pre-set time interval is a n Transmission Time Interval, wherein, and 0＜n≤16.
5. method as claimed in claim 4 is characterized in that, described n=3 or n=4.
6. method as claimed in claim 3 is characterized in that, in described step (b), transmit leg adds the number of retransmission of mixing automatic repeat requests in described empty frame.
7. method as claimed in claim 1 or 2 is characterized in that, when described high speed packet service was high speed down link group insersion business, described transmit leg was that radio network controller is RNC, and described recipient is Node B for Node B.
8. method as claimed in claim 7 is characterized in that, described pre-set time interval is the chronomere of n RNC frame number counter, wherein, and 0＜n≤16.
9. method as claimed in claim 8 is characterized in that, described n=3 or n=4.
10. method as claimed in claim 2 is characterized in that, in described step (a) before, sets the time interval that transmit leg is judged by strengthening dedicated channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007100895295A CN101277260A (en) | 2007-03-27 | 2007-03-27 | Data transmission method for high speed packet service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007100895295A CN101277260A (en) | 2007-03-27 | 2007-03-27 | Data transmission method for high speed packet service |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101277260A true CN101277260A (en) | 2008-10-01 |
Family
ID=39996283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007100895295A Pending CN101277260A (en) | 2007-03-27 | 2007-03-27 | Data transmission method for high speed packet service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101277260A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102098732A (en) * | 2011-02-24 | 2011-06-15 | 大唐移动通信设备有限公司 | Method and apparatus for processing Iub interface congestion |
| CN103580760A (en) * | 2012-07-26 | 2014-02-12 | 深圳市加力尔电子科技有限公司 | Tire pressure monitoring system and RF communication efficiency test method thereof |
| CN104714424A (en) * | 2013-12-16 | 2015-06-17 | 上海华兴数字科技有限公司 | Communication system and method used for industrial controller |
| CN104980253A (en) * | 2015-05-28 | 2015-10-14 | 南京科力威电子设备有限公司 | Forward direction frame-loss resistance wireless transmission method of waveform data for measuring vital signs |
-
2007
- 2007-03-27 CN CNA2007100895295A patent/CN101277260A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102098732A (en) * | 2011-02-24 | 2011-06-15 | 大唐移动通信设备有限公司 | Method and apparatus for processing Iub interface congestion |
| CN103580760A (en) * | 2012-07-26 | 2014-02-12 | 深圳市加力尔电子科技有限公司 | Tire pressure monitoring system and RF communication efficiency test method thereof |
| CN103580760B (en) * | 2012-07-26 | 2016-04-06 | 深圳市云图电装系统有限公司 | Tire pressure monitoring system and RF communication efficiency method of testing thereof |
| CN104714424A (en) * | 2013-12-16 | 2015-06-17 | 上海华兴数字科技有限公司 | Communication system and method used for industrial controller |
| CN104714424B (en) * | 2013-12-16 | 2018-04-03 | 上海华兴数字科技有限公司 | A kind of communication system and method for industrial control unit (ICU) |
| CN104980253A (en) * | 2015-05-28 | 2015-10-14 | 南京科力威电子设备有限公司 | Forward direction frame-loss resistance wireless transmission method of waveform data for measuring vital signs |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7724656B2 (en) | Uplink congestion detection and control between nodes in a radio access network | |
| CN102598833B (en) | Method and knot for transport network congestion control for enhanced uplink communications | |
| CN101288247B (en) | Method and apparatus for transmitting/receiving control information of user equipment for uplink data transmission | |
| EP2107739B1 (en) | System and method for avoiding stall using timer for high-speed downlink packet access system | |
| KR100498347B1 (en) | Data-processing method for supporting amr codec | |
| CN101040491B (en) | Congestion control within a radio access network | |
| CN101222419B (en) | Data communication method and system, data transmitting/receiving device | |
| KR101565403B1 (en) | METHOD OF HANDLING AN ERROR ON CS voice over HSPA | |
| EP1745669B1 (en) | Hsdpa flow control | |
| US20090003290A1 (en) | Method and Apparatus for Selecting Transport Format Combination in a Wireless Communication System | |
| CN101277260A (en) | Data transmission method for high speed packet service | |
| Zheng | Optimizing wireless multimedia transmissions through cross layer design | |
| CN101060476B (en) | Dispatching information transmission method in enhanced special channel and user terminal | |
| CN101188784B (en) | Method for improving UTRAN HSUPA IP transmission performance | |
| CN100596360C (en) | Method for increasing radio-link control hierarchy data transmission efficiency | |
| Wang et al. | Cross-layer design for LTE system with jointly AMC and ARQ on fading channel | |
| CN101572911B (en) | Data packet transmission/sending method and mobile communication system | |
| CN102811109A (en) | Method and system for detecting loss of service frames of uplinking enhanced dedicated channel | |
| CN102231895A (en) | Data communication method and system as well as data transmitting/receiving devices | |
| CN101296174A (en) | Method for informing congestion of high-speed packet access service at Iub/Iur port | |
| Necker et al. | Protocol interference between up-and downlink channels in HSDPA | |
| CN101730168A (en) | Data packet transmitting/sending method and 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 | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20081001 |