CN104935643B - A kind of digital cluster system data frame dynamic buffering processing method - Google Patents
A kind of digital cluster system data frame dynamic buffering processing method Download PDFInfo
- Publication number
- CN104935643B CN104935643B CN201510277991.2A CN201510277991A CN104935643B CN 104935643 B CN104935643 B CN 104935643B CN 201510277991 A CN201510277991 A CN 201510277991A CN 104935643 B CN104935643 B CN 104935643B
- Authority
- CN
- China
- Prior art keywords
- data frame
- dynamic
- time
- actual quantity
- desired amt
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Abstract
The invention discloses a kind of digital cluster system data frame dynamic buffering processing method, solves the problems, such as that upper layer transport and processing delay eat dishes without rice or wine to contradict between timing with stringent Digital Clustering, belong to wireless communication field.The method is to count transmission and the processing delay on upper layer in real time in channel device, and the desired amt of data frame in dynamic pool is calculated using this time delay as parameter.When the actual quantity of data frame in dynamic pool is equal to desired amt, keep the quantity of data frame in dynamic pool constant；When the actual quantity of data frame in dynamic pool is less than desired amt, increase the quantity of data frame in dynamic pool；When the actual quantity of data frame in dynamic pool is more than desired amt, the quantity of data frame in dynamic pool is reduced.In this way, in the case where being tightly controlled the time for data transmission of eating dishes without rice or wine, ensure that upper layer gives the data come and can accurately be placed in corresponding time slot and be transmitted.
Description
Technical field
The invention belongs to wireless communication field more particularly to a kind of digital cluster system data frame dynamic buffering processing sides
Method.
Background technology
Digital Clustering channel device system is to meet the Digital Clustering wireless access system of Chinese Digital cluster national standard.It should
System specifically includes rail traffic, electric power, harbour, airport, government, army etc. suitable for industry wireless private network.Digital Clustering
Channel device system realizes the wireless access functions such as protocol stack physical layer, MAC layer, radio-frequency receiving-transmitting, while also providing local and remote
Thread management function.When the connection with switching centre disconnects, can support basic registration in this system coverage area, calling and
The business such as short message.System supports GPS, IEEE1588 isochronon method of synchronization, ensure that systematicness when seamless cell switching
Energy and service quality.System uses pure IP networking technologys and total system redundancy, ensure that system application flexibility and is
System reliability.Compared to traditional channel device, have receiving sensitivity high, strong interference immunity, terminal mobility is good, system safety
The high advantage of property.
By taking TETRA digital cluster systems as an example, in TETRA systems, each radio carrier, either uplink
Or downlink, is all divided into 4 time slots in time.Each time slot is known as a physical channel, can be used for speech or data
Business, signaling or the two mixed transport.The timeslot number of uplink and downlink is equal, between the pairs of time slot of uplink and downlink
It is staggered in time and is equivalent to the time difference of two time slots (see Fig. 1).(see Fig. 2) in TETRA frame structures, each TDMA frame has
4 time slots.18 TDMA frames constitute a multi-frame.The 18th frame in multi-frame is used as control signaling, referred to as control frame.60 multiple
Frame constitutes a superframe.Superframe is for long repeating frame.
Since Digital Clustering is using TDMA technologies, data, which need to be carried in fixed time slot, to be transmitted, often
The time of one time slot is fixed, but the transmission of upper layer data and processing have certain time delay, and this time is not solid
Fixed, giving the data come which results in upper layer may reach or delay in advance, and if delaying, will miss it needs
The time slot to be carried can only wait until that the corresponding time slot of next frame retransmits.In this case, it is necessary to a kind of mechanism, it can
Ensure to eat dishes without rice or wine the real-time that upper data send.
Invention content
Technical problem solved by the invention is：It the characteristics of for digital cluster system frame structure, proposes and realizes one
Data-interface mechanism of the kind based on dynamic pool.By measuring and counting number in propagation delay time and dynamic adjustment buffer pool in real time
According to the quantity of frame, solves the contradiction between transmission delay and strict numerical cluster air interface timing, ensure that air interface
The real-time processing of data.
The object of the present invention is achieved like this：A kind of digital cluster system data frame dynamic buffering processing method, including
Following steps：
Step 1：Initialize the actual quantity of data frame in the channel device dynamic pool of digital cluster system；
Step 2：N times send downlink data request and receive downlink data and ask back in channel device statistics current slot
The average value of multiple time difference；Wherein, N is integer；
Step 3：Channel device is according to the desired amt of data frame in the mean value calculation dynamic pool of time difference；
Step 4：Channel device compares the actual quantity and desired amt of data frame in dynamic pool, if actual quantity
It is identical as desired amt, then keep the actual quantity of data frame in dynamic pool constant by sending a downlink data request；
If actual quantity is more than desired amt, the reality of data frame in dynamic pool is reduced by not sending downlink data request
Border quantity；If actual quantity is less than desired amt, increased in dynamic pool by continuously transmitting downlink data request
The actual quantity of data frame；
Step 5：Using subsequent time period as current slot, return to step two；
Complete digital cluster system data frame dynamic buffering processing method.
Wherein, step 2 is specially：
S1：Channel device sends downlink data request, and records the time for sending downlink data request；
S2：Channel device receives downlink data request and replys, and record receives the time of reply；
S3：Channel device calculates it and sends the time difference of downlink data request and the time for receiving reply；
S4：It repeats S1 to S3N times, finds out the average value of time difference obtained by n times；Wherein, N is integer.
Wherein, the average value of time difference is in S4:
In formula,For the average value of time difference, Δ t is the time difference, and n is the number of seeking time difference.
Wherein, the desired amt of data frame is in step 3：
In formula, M is the desired amt of data frame,For the average value of time difference, T is a slot time, and [] indicates
Rounding.
Wherein, if actual quantity is less than desired amt in step 4, continuously transmitting two downlink data requests makes
The actual quantity of data frame increases by 1 in state buffer pool.
Compared with prior art the advantage of the invention is that：
The method of the invention can ensure when each time slot of eating dishes without rice or wine is sent out data, number all in need
It is transmitted according to being placed in time slot, accumulation or the missing of data will not be caused.Middle time slot of eating dishes without rice or wine is improved to greatest extent
Service efficiency, ensure that data send accuracy and real-time.
Description of the drawings
Fig. 1 is the correspondence of the TETRA uplink downlink time slots of the prior art；
Fig. 2 is the frame structure of the TETRA of the prior art；
Fig. 3 be the present invention dynamic pool in data frame actual quantity adjustment flow.
Specific implementation mode
The present invention will be further described in detail with reference to the accompanying drawings and examples.
The invention discloses in a kind of digital clustering communication system, upper layer transport and processing delay and stringent number are solved
Cluster is eated dishes without rice or wine the method contradicted between timing.This method is to increase treatment mechanism in channel device, counts upper layer in real time
Transmission and processing delay, and the actual quantity of data frame in dynamic pool is adjusted accordingly.Data frame in dynamic pool
Actual quantity adjusts process (see Fig. 3)：After channel device counts upper layer transport and processing delay, counted using this time delay as parameter
Calculation obtains the desired amt of data frame in dynamic pool.When the actual quantity of data frame in dynamic pool is equal to desired amt
When, keep the quantity of data frame in dynamic pool constant；When the actual quantity of data frame in dynamic pool is less than desired number
When amount, increase the quantity of data frame in dynamic pool；When the actual quantity of data frame in dynamic pool is more than desired amt
When, reduce the quantity of data frame in dynamic pool.In this way, in the case where being tightly controlled the time for data transmission of eating dishes without rice or wine,
Ensure that upper layer gives the data come and can accurately be placed in corresponding time slot and be transmitted.
Embodiment：The actual quantity of data frame is 4 in setting dynamic pool when channel device initializes, and has often handled 72
The data of time slot are generated the desired amt of data frame in a dynamic pool, the reality of data frame in buffer pool are adjusted with this
Quantity.A kind of digital cluster system data frame dynamic buffering processing method, includes the following steps：
Step 1：Channel device sends an ascending time slot message, and records current time point as Tn；
Step 2：The corresponding descending time slot message of channel device processing, and current time point is recorded as Tn+1；
Step 3：The time difference Δ t of a time slot up-downlink message is calculated according to the two time points；
Step 4：The time difference of a multi-frame totally 72 time slots in cumulative calculation current slot, seeking time difference are averaged
Value；
Wherein, the average value of time difference is:
In formula,For the average value of time difference, Δ t is time difference, N=72.
Step 5：According to 14167 microsecond of time slot, the average value of time difference is converted to be time slot unit, with this
As the desired amt of data frame in dynamic pool；
Wherein, the desired amt of data frame is：
In formula, M is the desired amt of data frame,For the average value of time difference, T is a slot time, and [] indicates
Rounding,With T as unit of microsecond.
For example, if the average value of time differenceFor 28334 microseconds, then in dynamic pool data frame desired amt M
It is 2；If the average value of time differenceFor 46000 microseconds, then the desired amt M of data frame is 4 in dynamic pool.
Step 6：If current desired amt is 4, actual quantity 4 then illustrates that actual quantity is synchronous with desired amt,
Send the request of a descending time slot data；If current desired amt is 8, actual quantity 4, then illustrate current time delay compared with
Greatly, the data for needing to ask descending time slot in advance, continuously transmit the request of two descending time slot data, while by dynamic pool
The actual quantity of middle data frame adds 1, becomes 5；If current desired amt is 3, actual quantity 5, then illustrate current time delay compared with
Small, the data in simultaneous buffering pond have ensured to fill corresponding descending time slot enough, need not ask the data of descending time slot,
The actual quantity of data frame in dynamic pool is subtracted 1 simultaneously, becomes 4.
In such a manner, each multi-frame (1.02s) adjusts the desired amt of data frame in a dynamic pool, energy
The actual quantity of data frame is close to desired value quantity in enough real-time control dynamic pools, when postponing larger can and
When request data in advance, the data that descending time slot will not be caused idle, while please no longer be look for novelty when postponing smaller, and
When release buffer pool in data, will not be in the accumulation at data.Perfectly solves network delay between timing of eating dishes without rice or wine
Contradiction.
Step 7：Using subsequent time period as current slot, return to step one；
Complete digital cluster system data frame dynamic buffering processing method.
In conclusion these are only the preferred application example of the present invention, it is not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent substitution, improvement and etc. done should be included in the guarantor of the present invention
Within the scope of shield.
Claims (4)
1. a kind of digital cluster system data frame dynamic buffering processing method, it is characterised in that include the following steps：
Step 1：Initialize the actual quantity of data frame in the channel device dynamic pool of digital cluster system；
Step 2：N times send downlink data request and receive what downlink data request was replied in channel device statistics current slot
The average value of time difference；Wherein, N is integer；
Step 3：Channel device is according to the desired amt of data frame in the mean value calculation dynamic pool of time difference；Data frame
Desired amt calculation formula is：
In formula, M is the desired amt of data frame,For the average value of time difference, T is a slot time, and [] indicates rounding,With T as unit of microsecond；
Step 4：Channel device compares the actual quantity and desired amt of data frame in dynamic pool, if actual quantity and phase
It hopes quantity identical, then keeps the actual quantity of data frame in dynamic pool constant by sending a downlink data request；If
Actual quantity is more than desired amt, then reduces the actual number of data frame in dynamic pool by not sending downlink data request
Amount；If actual quantity is less than desired amt, increase data in dynamic pool by continuously transmitting downlink data request
The actual quantity of frame；
Step 5：Using subsequent time period as current slot, return to step two；
Complete digital cluster system data frame dynamic buffering processing method.
2. a kind of digital cluster system data frame dynamic buffering processing method according to claim 1, which is characterized in that institute
The step of stating two be specially：
S1：Channel device sends downlink data request, and records the time for sending downlink data request；
S2：Channel device receives downlink data request and replys, and record receives the time of reply；
S3：Channel device calculates it and sends the time difference of downlink data request and the time for receiving reply；
S4：It repeats S1 to S3N times, finds out the average value of time difference obtained by n times；Wherein, N is integer.
3. a kind of digital cluster system data frame dynamic buffering processing method according to claim 2, which is characterized in that institute
The average value of time difference is in the S4 stated:
In formula,For the average value of time difference, Δ t is the time difference, and n is the number of seeking time difference.
4. a kind of digital cluster system data frame dynamic buffering processing method according to claim 1, which is characterized in that institute
If actual quantity is less than desired amt in the step of stating four, continuously transmitting two downlink data requests makes in dynamic pool
The actual quantity of data frame increases by 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510277991.2A CN104935643B (en) | 2015-05-27 | 2015-05-27 | A kind of digital cluster system data frame dynamic buffering processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510277991.2A CN104935643B (en) | 2015-05-27 | 2015-05-27 | A kind of digital cluster system data frame dynamic buffering processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104935643A CN104935643A (en) | 2015-09-23 |
| CN104935643B true CN104935643B (en) | 2018-08-21 |
Family
ID=54122614
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510277991.2A Active CN104935643B (en) | 2015-05-27 | 2015-05-27 | A kind of digital cluster system data frame dynamic buffering processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104935643B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107529097A (en) * | 2016-06-20 | 2017-12-29 | 北京信威通信技术股份有限公司 | A kind of method and device of adaptive regulating video buffer size |
| CN108111984B (en) * | 2017-12-26 | 2021-07-30 | 海能达通信股份有限公司 | Communication method and system of wireless dispatching desk and wireless dispatching desk |
| CN108347645B (en) * | 2018-01-19 | 2021-02-26 | 浙江大华技术股份有限公司 | Method and device for decoding and displaying video frame |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6990073B1 (en) * | 2001-03-28 | 2006-01-24 | Lsi Logic Corporation | Data packet congestion management technique |
| CN102045552A (en) * | 2009-10-14 | 2011-05-04 | 中兴通讯股份有限公司 | Method and system for sending multimedia code stream |
| CN102752212A (en) * | 2012-07-12 | 2012-10-24 | 苏州阔地网络科技有限公司 | Method and system for controlling transmission rate |
-
2015
- 2015-05-27 CN CN201510277991.2A patent/CN104935643B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6990073B1 (en) * | 2001-03-28 | 2006-01-24 | Lsi Logic Corporation | Data packet congestion management technique |
| CN102045552A (en) * | 2009-10-14 | 2011-05-04 | 中兴通讯股份有限公司 | Method and system for sending multimedia code stream |
| CN102752212A (en) * | 2012-07-12 | 2012-10-24 | 苏州阔地网络科技有限公司 | Method and system for controlling transmission rate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104935643A (en) | 2015-09-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11006427B2 (en) | Communication system, base station, and communication terminal for controlling interference from neighboring cells | |
| US8184564B2 (en) | Staggering bursts of broadcast management frames in a wireless network device having a plurality of MAC addresses | |
| CN102811494B (en) | A kind of data transmission method and device | |
| CN112314017A (en) | Time synchronized radio bearers for supporting Precision Timing Protocol (PTP) -based Time Sensitive Network (TSN) applications | |
| CN102958058A (en) | Method and device for notifying user equipment to carry out dynamical uplink and downlink configuration in heterogeneous network | |
| US20140301374A1 (en) | Mechanism for Group Polling Without Precise Timing | |
| EP3226606B1 (en) | Method for ran-wlan aggregation | |
| CN104935643B (en) | A kind of digital cluster system data frame dynamic buffering processing method | |
| EP2088806B1 (en) | Method, a system of location of a mobile station within a radio coverage zone of a cell and to a radio cellular network implementing this system and a radio cellular network | |
| CN112544118A (en) | Method, apparatus and computer readable medium for random access | |
| US10314010B2 (en) | Apparatus for radio communication systems | |
| WO2011082525A1 (en) | Method and apparatus for determining timing advance quantity for usr terminal | |
| CN104284300B (en) | Data sending method and equipment | |
| JP2022163220A (en) | Method, apparatus, and computer program | |
| CN103297206B (en) | Mixed self-adapting repeating method and equipment | |
| WO2018197659A1 (en) | Delay-based trigger for activating uplink splitting | |
| CN117716678A (en) | Transmitting data via a forward interface with adjustable timing | |
| EP2995145B1 (en) | Elimination of muting during evolved multicast broadcast service (embs) service change | |
| WO2021035751A1 (en) | Communication method and apparatus | |
| CN108432306B (en) | Paging in a group communication system | |
| CN107231686B (en) | Uplink data transmission method in Internet of things, base station and terminal | |
| US20230171082A1 (en) | System for time synchronization between server and iot device | |
| EP3731575B1 (en) | Method for clock synchronization of protocols, and network, base station and user equipments | |
| US10313143B1 (en) | Wireless communication system to provide buffering in a single frequency network | |
| KR102178660B1 (en) | Scheme for supporting transceiving mbms service packet in a wireless 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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Fu Jinyu Inventor after: Li Yong Inventor after: Ji Shuxin Inventor after: Li Fei Inventor after: Fan Lintao Inventor after: Liu Wei Inventor after: Sun Minjie Inventor before: Li Yong Inventor before: Ji Shuxin Inventor before: Li Fei Inventor before: Fan Lintao Inventor before: Liu Wei Inventor before: Sun Minjie |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |