CN102238429A - Channel scheduling method for mobile television network - Google Patents
Channel scheduling method for mobile television network Download PDFInfo
- Publication number
- CN102238429A CN102238429A CN2010101672046A CN201010167204A CN102238429A CN 102238429 A CN102238429 A CN 102238429A CN 2010101672046 A CN2010101672046 A CN 2010101672046A CN 201010167204 A CN201010167204 A CN 201010167204A CN 102238429 A CN102238429 A CN 102238429A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- key assignments
- bit rate
- network
- 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)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention provides a channel scheduling method for a mobile television network. The channel scheduling method comprises the following steps of: defining bit rates of a plurality of channels, wherein the channels correspond to different bit rates; defining the bit rates of bursts to compute a plurality of key values, wherein the key values correspond to the channels; constructing a binary tree by using an algorithm according to the key values, wherein a plurality of leaf nodes of the binary tree correspond to the channels; and arranging a plurality of burst durations of the channels according to paths from each leaf node to a root node of the binary tree, wherein each burst duration is used for transmitting the bursts. Therefore, the coding efficiency of the television channel and the utilization efficiency of network bandwidth can be improved.
Description
Technical field
The invention relates to a kind of scheduling method, and particularly relevant for a kind of channel scheduling method of mobile tv network.
Background technology
The crossfire service that present IP-Based mobile TV-system is provided, be that (Real-time Transport Protocol, the audio-visual crossfire of base in the time of RTP) will having (time-based), interactive service (interactiveservice) or prompting service (notification service) send the mobile TV client terminal device to through RTP to broadcast (broadcast) or (multicast) mode that multicasts.
(it provides the transfer approach of a television channel for Digital Video Broadcasting-Handheld, standard DVB-H), and it mainly is to give a pulse of each network frame (frame) (burst) according to the digital video hand-held broadcast.Wherein, each network frame transmits the presentation content that television channel transmitted, and the delivery time that next pulse occurs is pointed out in each pulse meeting.After running gear receives pulse, just the information that can the pairing network frame of received pulse be transmitted, and after receiving, close radio frequency (radio frequency, RF) circuit, occur just can starting radio circuit once more up to receiving pulse next time, can save power consumption with this.
Because program category that each channel transmitted may be different, so the required bit rate (bit rate) of each television channel can corresponding its program category and different, for example the needed bit rate of physical culture program talk property program come highly.Therefore, the mode of above-mentioned pulse can not be inferred the bit rate of television channel.And, to each television channel coding the time, then use identical bit rate to encode, wherein bit rate can be as the criterion with the maximum in all television channels, so that each television channel can both be encoded.According to above-mentioned, because the required bit rate difference of each channel if the television channel that is encoded is not the television channel of bit rate maximum, then can be wasted network bandwidth and place asemantic part.Moreover, asemantic part encoded only can lose time, and can reduce the efficient of coding.
Summary of the invention
The invention provides a kind of channel scheduling method of mobile tv network, can improve the code efficiency of television channel, and improve the frequency range service efficiency of mobile tv network.
The present invention proposes a kind of channel scheduling method of mobile tv network, and it comprises: define the bit rate of a plurality of channels, wherein the corresponding different bit rates of these channels; The bit rate of definition pulse (burst) is to calculate a plurality of key assignments, and wherein these key-value pairs are answered these channels; Make up binary tree (binary tree) according to these key assignments and via algorithm, wherein corresponding these channels of a plurality of leaf nodes of binary tree; Arrange a plurality of impulse durations (burst during) of these channels according to each leaf node to the path of the root node of binary tree, wherein each impulse duration is in order to transmit pulse.
In an embodiment of the present invention, above-mentioned algorithm comprises: define a plurality of nodes and deposit to formation, wherein corresponding these channels of these nodes; Take out two first nodes in the formation, wherein the pairing key assignments of these first nodes is a reckling in the formation; According to these first node definition internal nodes, wherein at least one first node is the child node of internal node, and the first node of the child node of non-internal node is deposited back formation; Internal node is deposited to formation; When the node number of formation is that the node in the formation is the root node of binary tree for the moment.
In an embodiment of the present invention, above-mentioned step according to these first node definition internal nodes comprises: when the pairing key assignments of these first nodes is identical, these first nodes are the child node of internal node, and the pairing key assignments of internal node is the summation of the key assignments of these first nodes; When the pairing key assignments of these first nodes not simultaneously, first node according to the key assignments smaller defines false node, false node and key assignments smaller's first node is the child node of internal node, and the pairing key assignments of internal node is the summation of key assignments of the key assignments of false node and key assignments smaller's first node.
In an embodiment of the present invention, the key assignments of above-mentioned false node correspondence is same as key assignments smaller in these first nodes.
In an embodiment of the present invention, the bit rate of above-mentioned root node correspondence is less than or equal to the frequency range of mobile tv network.
In an embodiment of the present invention, the bit rate of above-mentioned pulse size is a bit rate reckling in these channels.
In an embodiment of the present invention, above-mentioned each key assignments is the ratio of the bit rate of the bit rate of corresponding channel and pulse.
In an embodiment of the present invention, above-mentioned these channels are extremely arranged by little greatly in regular turn according to its bit rate.
In an embodiment of the present invention, the bit rate of above-mentioned each channel be bit rate reckling in these channels two i-1 power doubly, i is the channel number of each channel.
Based on above-mentioned, the channel scheduling method of mobile tv network of the present invention, its bit rate according to each television channel is encoded, and improves the efficient of television channel coding with this.And, when decoding, can carry out the waste of power consumption in the time of can avoiding deciphering with this according to the bit rate of each television channel.In addition, make up binary tree, arrange the assigned impulse duration of each television channel, can avoid the conflict of pulse with this according to leaf node to the path of root node of corresponding each television channel according to the key assignments of each channel and via algorithm.
For the above-mentioned feature and advantage of the present invention can be become apparent, embodiment cited below particularly, and cooperate institute's accompanying drawing to be described in detail below.
Description of drawings
Fig. 1 is the flow chart of the algorithm of one embodiment of the invention.
Fig. 2 A to Fig. 2 H is that schematic diagram set up in the binary tree of one embodiment of the invention;
Fig. 3 is the impulse duration configuration schematic diagram of one embodiment of the invention;
Fig. 4 is the flow chart of channel scheduling method of the mobile tv network of one embodiment of the invention.
Description of reference numerals
210,220,230,250,260,270,280: node;
240: formation;
BT0～BT7: pulse;
S110, S120, S130, S140,150,160, S410, S420, S430, S440: step.
Embodiment
In the present embodiment, suppose all corresponding bit rate (bit rate) of each television channel in the mobile tv network, and the bit rate of the program that each television channel transmitted can be less than or equal to the pairing bit rate of each television channel.For one thing, if the bit rate of television channel correspondence is 200k, then the bit rate of the TV programme that this television channel transmitted can be less than or equal to 200k, for example 190k, 180k... etc.And, define i television channel t at this
iCorresponding bit rate equals 2
I-1* r
1, wherein i is a positive integer, and r
1Be definable minimal bit rate.
Summarize a regularity by above-mentioned, exactly for whole television channels, can arrange cis-position according to the height of its bit rate.In other words, with bit rate, television channel t
1≤ t
2≤ ...≤t
T, wherein T is a positive integer and is maximum channel number, and television channel t
1～t
TBit rate less than the frequency range of mobile tv network.Because television channel t
1Bit rate be television channel t
1～t
TBit rate in reckling, so television channel t
1Bit rate be minimal bit rate r
1
In addition, in order to make full use of the frequency range of mobile tv network, the frequency range of definable mobile tv network is television channel t
1～t
TThe summation of bit rate, that is the frequency range of wireless network
But for the information of television channel can transmit fully, the frequency range of definable mobile tv network can be more than or equal to television channel t
1～t
TThe summation of bit rate, that is the frequency range of mobile tv network
And the quantity of available pulse (burst) is used as judging the foundation of television channel bit rate, as with minimal bit rate r
1As the bit rate size of a pulse, then television channel t
iBit rate/television channel t
1Bit rate=television channel t
iThe number of pulses that has, and the key assignments of each television channel (key) can equal the number of pulses of each channel, with key assignments as the foundation of judging each television channel bit rate.
Then, can provide an algorithm at embodiments of the invention, this algorithm can be set up a binary tree (binary tree) according to the key assignments of above-mentioned each channel, and the leaf node of binary tree is represented a television channel respectively.Fig. 1 is the flow chart of the algorithm of one embodiment of the invention.Please refer to Fig. 1, in this algorithm, can define a plurality of nodes earlier, and above-mentioned node can be placed in the formation (queue) (step S110), wherein these nodes can be distinguished corresponding television channel t
1～t
T, and the key assignments of each node is the key assignments of corresponding television channel.
Then, algorithm can take out the node (being first node) (step S120) of two key assignments minimums from formation, and according to these two nodes generation definition internal nodes (step S130), two nodes that wherein are removed one at least are the child node of internal node, that is this internal node is a father node, and the key assignments of this internal node is the summation of the key assignments of its child node.And in two nodes that are removed, the node of the child node of non-this internal node also can be deposited back formation.
After the intact justice of internal node was finished, then internal node can be stored to formation (step S140).If the node in the formation is (step S150) when (comprising two) more than two, from formation, take out the node (step S120) of two key assignments minimums again, and produce a father node (being another internal node) and deposit to formation according to above-mentioned steps S130 and S140.When remaining a node in the formation (step S150), then stop computing, and a last remaining node then can be regarded as root (root) node in the formation, and promptly the root node (step S160) that is binary tree of the last remaining node in the formation is finished above-mentioned binary tree foundation with this.
For instance, suppose that television channel t is arranged at present
1, t
2And t
3, and television channel t
1, t
2And t
3Bit rate be respectively 200k, 400k and 800k bps (bits per second, bps).At this with television channel t
1Bit rate as the size of a pulse, that is the bit rate of pulse is 200kdps.According to above-mentioned, television channel t
1Key assignments be 1 (being 200k/200k), television channel t
2Key assignments be 2 (they being 400k/200k), television channel t
3Key assignments be 4 (they being 800k/200k).
Fig. 2 A to Fig. 2 H is that schematic diagram set up in the binary tree of one embodiment of the invention.Please in regular turn with reference to Fig. 2 A to Fig. 2 H, the algorithm of present embodiment is understood first defined node 210,220 and 230, and node 210,220 and 230 is deposited to formation 240, wherein node 210,220 and the corresponding television channel t of 230 difference
1, t
2And t
3, that is the key assignments of node 210,220 and 230 is respectively 1,2 and 4.Then, can to take out earlier key assignments be that 1 node 210 and key assignments are 2 node 220 to the algorithm of present embodiment.Because the key assignments difference of node 210 and 220, the bigger node 220 of key assignments this moment can be deposited back in the formation 240 again, and according to the false node 250 of node 210 definition, the key assignments of wherein false node 250 is 1.
Then, define the father node of internal node 260 as node 210 and false node 250, and internal node 260 is deposited to formation 240, wherein the key assignments of internal node 260 is 2 (being 1+1).At this moment, key assignments being arranged in the formation 240 is that 2 node 220, key assignments are that 4 node 230 and key assignments are 2 internal node 260.Because the node number in the formation 240 greater than 2, therefore can take out key assignments again from formation 240 is 2 node 220 and internal node 260.Because the key assignments of node 220 is same as internal node 260, therefore can be according to node 220 and internal node 260 definition internal nodes 270, and internal node 270 is deposited to formation 240, wherein internal node 270 is the father node of node 220 and internal node 260, and the key assignments of internal node 270 is 4 (being 2+2).
At this moment, it is 4 node 230 and internal node 270 that key assignments is arranged in the formation 240, therefore node 230 and internal node 270 can be removed, define internal node 280 in view of the above and deposit back in the formation 240, wherein internal node 280 is the father node of node 230 and internal node 270, and the key assignments of internal node 280 is 8 (being 4+4).At this moment, an only surplus node (being internal node 280) in the formation 240, so key assignments is the root node that 8 internal node 280 is binary tree.And the relation of above-mentioned each node of foundation can form and comprise corresponding television channel t
1, t
2And t
3The binary tree of node, this binary tree is shown in Fig. 2 H, and corresponding television channel t
1, t
2And t
3The node leaf of binary tree (leaf) node for this reason.With bit rate, the bit rate of internal node 280 (being root node) can be greater than television channel t
1, t
2And t
3The summation of bit rate, so internal node 280 pairing bit rates can equal the frequency range of mobile tv network.Perhaps, internal node 280 pairing bit rates also can be less than the frequency range of mobile tv network.
Then, in order to prevent collisions of pulses, we obtain the total quantity of a pulse in the network frame via the frequency range R of mobile tv network divided by impulse magnitude, and the key assignments of internal node 280 can be equal to or less than the total quantity of pulse in the network frame.And, can utilize the constructed binary tree of above-mentioned algorithm to determine the impulse duration (burst during) of each pulse.Please refer to Fig. 2 H, be example with the binary tree of Fig. 2 H, and suppose that the binary number of the left branch correspondence of each node is 0, the binary number of the right branch correspondence of each node is 1.
With television channel t
1, television channel t
1Key assignments be 1, that is in a network frame television channel t
1Be assigned to 1 pulse.And, corresponding television channel t
1Node 210 to the path of root node (being internal node 280) be 011, so television channel t
1The impulse duration that is assigned to is the 4th impulse duration (this begins by 000 because of binary number) in the network frame, as shown in Figure 3, and television channel t
1Be assigned to the impulse duration of respective pulses BT3.With television channel t
2, television channel t
2Key assignments be 2, that is in a network frame television channel t
2Be assigned to 2 pulses.And, corresponding television channel t
2Node 220 to the path of root node 280 be 01.Because the degree of depth of binary tree is 3 shown in Fig. 2 H, so television channel t
2The binary number that should obtain 3 figure places just can correspond to impulse duration, mends X at this high level in weak point, and wherein X can be 0 or 1.In view of the above, corresponding television channel t
2Binary number should be X01, so television channel t
2The impulse duration that is assigned to is the individual impulse duration of (promptly 001) and 6 (promptly 101) in the network frame the 2nd, as shown in Figure 3, and television channel t
2Be assigned to the impulse duration of respective pulses BT1 and BT5.
With television channel t
3, television channel t
3Key assignments be 4, that is in a network frame television channel t
3Be assigned to 4 pulses.And, corresponding television channel t
3Node 230 to the path of root node 280 be 0.Similarly, because the degree of depth of binary tree is 3, so corresponding television channel t
3Binary number should be XX0, so television channel t
2The impulse duration that is assigned to is the individual impulse duration of (promptly 000), 3 (promptly 010), 5 (promptly 100) and 7 (promptly 110) in the network frame the 1st, as shown in Figure 3, and television channel t
2Be assigned to the impulse duration of respective pulses BT0, BT2, BT4 and BT6.According to above-mentioned, television channel t
1～t
3Assigned impulse duration can be not overlapping, can prevent collisions of pulses with this, and the television channel t that can sort
1～t
3Employed pulse can reduce the waste of network bandwidth.Moreover, television channel t
1～t
3Can encode by corresponding its bit rate, therefore can improve the efficient of coding and reduce the power consumption of deciphering.
What deserves to be mentioned is that the binary number of the left branch correspondence of each node is 0 in the foregoing description, the binary number of the right branch correspondence of each node is 1.But in other embodiments, the binary number of the left branch correspondence of each node can be 1, and the binary number of the right branch correspondence of each node can be 0.And, can determine the impulse duration of each channel to the path of root node according to the node of corresponding each channel according to above-mentioned explanation.
According to above-mentioned, can converge whole is the channel scheduling method of a mobile tv network.Fig. 4 is the flow chart according to the channel scheduling method of the mobile tv network of one embodiment of the invention.Please refer to Fig. 4, at first define the bit rate (step S410) of a plurality of television channels.And, the key assignments (step S420) of bit rate to calculate each television channel of definition pulse.Then, make up binary tree (step S430) according to the key assignments of each channel and via algorithm.At last, arrange the assigned impulse duration of each television channel (step S440) according to leaf node to the path of the root node of binary tree of corresponding each television channel.Wherein, the details of each step can then repeat no more at this with reference to above-mentioned explanation.
In sum, the channel scheduling method of the mobile tv network of the embodiment of the invention, its bit rate according to each television channel is encoded, and improves the efficient of coding with this.And, when decoding, can carry out the waste of power consumption in the time of can avoiding deciphering with this according to the bit rate of each television channel.In addition, make up binary tree, arrange the assigned impulse duration of each television channel, can avoid the conflict of pulse with this according to leaf node to the path of root node of corresponding each television channel according to the key assignments of each channel and via an algorithm.
Though the present invention describes as above with embodiment; right its is not in order to limit the present invention, to have in any affiliated technical field and know the knowledgeable usually, not break away from the spirit and scope of the invention; all can do a little change and retouching, so protection range of the present invention is when being as the criterion with claims.
Claims (9)
1. the channel scheduling method of a mobile tv network comprises:
Define the bit rate of a plurality of channels, the corresponding different bit rates of wherein said channel;
The bit rate that defines a pulse is to calculate a plurality of key assignments, and wherein said key-value pair is answered described channel;
Make up a binary tree according to described key assignments and via an algorithm, wherein the corresponding described channel of a plurality of leaf nodes of this binary tree; And,
Arrange a plurality of impulse durations of described channel according to each described leaf node to the path of a root node of this binary tree, wherein each described impulse duration is in order to transmit this pulse.
2. according to the channel scheduling method of the described mobile tv network of claim 1, wherein this algorithm comprises:
Define a plurality of nodes and deposit to a formation the corresponding described channel of wherein said node;
Take out two first nodes in this formation, the pairing key assignments of wherein said first node is a reckling in this formation;
Define an internal node according to described first node, wherein said first node one at least is the child node of this internal node, and the first node of the child node of non-this internal node is deposited back this formation;
This internal node is deposited to this formation; And,
When the node number of this formation is that the node in this formation is this root node of this binary tree for the moment.
3. according to the channel scheduling method of the described mobile tv network of claim 2, wherein the step that defines this internal node according to described first node comprises:
When the pairing key assignments of described first node was identical, described first node was the child node of this internal node, and the pairing key assignments of this internal node is the summation of the key assignments of described first node; And,
When the pairing key assignments of described first node not simultaneously, first node according to the key assignments smaller defines a false node, this vacation node and key assignments smaller's first node is the child node of this internal node, and the pairing key assignments of this internal node is the summation of key assignments of the key assignments of this vacation node and key assignments smaller's first node.
4. according to the channel scheduling method of the described mobile tv network of claim 3, key assignments that wherein should vacation node correspondence is same as key assignments smaller in the described first node.
5. according to the channel scheduling method of the described mobile tv network of claim 1, wherein the bit rate of this root node correspondence is less than or equal to the frequency range of this mobile tv network.
6. according to the channel scheduling method of the described mobile tv network of claim 1, wherein the bit rate of this pulse size is a bit rate reckling in the described channel.
7. according to the channel scheduling method of the described mobile tv network of claim 6, wherein each described key assignments is the ratio of the bit rate of the bit rate of corresponding channel and this pulse.
8. according to the channel scheduling method of the described mobile tv network of claim 1, wherein said channel is extremely arranged by little greatly in regular turn according to its bit rate.
9. the channel scheduling method of described mobile tv network according to Claim 8, wherein the bit rate of each described channel be bit rate reckling in the described channel two i-1 power doubly, i is the channel number of each described channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010167204 CN102238429B (en) | 2010-04-27 | 2010-04-27 | Channel scheduling method for mobile television network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010167204 CN102238429B (en) | 2010-04-27 | 2010-04-27 | Channel scheduling method for mobile television network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102238429A true CN102238429A (en) | 2011-11-09 |
| CN102238429B CN102238429B (en) | 2013-05-22 |
Family
ID=44888562
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010167204 Active CN102238429B (en) | 2010-04-27 | 2010-04-27 | Channel scheduling method for mobile television network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102238429B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4991975A (en) * | 1988-11-22 | 1991-02-12 | At&T Bell Laboratories | Division multiplexing and demultiplexing means lightwave communication system comprising optical time |
| US6963545B1 (en) * | 1998-10-07 | 2005-11-08 | At&T Corp. | Voice-data integrated multiaccess by self-reservation and stabilized aloha contention |
| CN101262360A (en) * | 2008-04-11 | 2008-09-10 | 中国电信股份有限公司 | A method and device for real time stream media multi-point transmission |
-
2010
- 2010-04-27 CN CN 201010167204 patent/CN102238429B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4991975A (en) * | 1988-11-22 | 1991-02-12 | At&T Bell Laboratories | Division multiplexing and demultiplexing means lightwave communication system comprising optical time |
| US6963545B1 (en) * | 1998-10-07 | 2005-11-08 | At&T Corp. | Voice-data integrated multiaccess by self-reservation and stabilized aloha contention |
| CN101262360A (en) * | 2008-04-11 | 2008-09-10 | 中国电信股份有限公司 | A method and device for real time stream media multi-point transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102238429B (en) | 2013-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101951556B (en) | Wireless sensor network data distribution method based on network coding | |
| CN101171786B (en) | Method, device and system for communication session management | |
| CN101803440A (en) | keep-alive for wireless network | |
| CN102457492A (en) | Coordinated transmission method for streaming media file, system and device | |
| CN103220258B (en) | Meeting sound mixing method, terminal and Media Resource Server | |
| TW201044891A (en) | Method and apparatus for handling MBMS dynamic scheduling information | |
| CN104103162A (en) | Intelligent remote controller one-way communication method | |
| CN101827425A (en) | Uplink data sending method and system | |
| CN101488870B (en) | Method, system and equipment for implementing sound mixing | |
| CN102957729B (en) | A kind of multimedia conferencing audio/video transmission method and equipment | |
| CN102238429B (en) | Channel scheduling method for mobile television network | |
| CN103929776B (en) | A kind of jamming control method and device of MTC device access network | |
| CN103024906A (en) | Communication method, terminal, base station and system | |
| CN105141412A (en) | Fountain-coding-based method for ensuring multicast security transmission of multimedia | |
| Majidi et al. | Optimized joint unicast-multicast panoramic video streaming in cellular networks | |
| CN103957102A (en) | Safety multicast source authentication method based on group data packet coupling | |
| WO2011017989A1 (en) | Configuration method and device for notification information of multimedia broadcast multicast service | |
| CN101163331A (en) | Method for transmitting MBMS paging information and MCCH information | |
| CN104079389A (en) | Retransmission method of mobile broadcasting services | |
| CN101151923A (en) | Method of operating a radio station | |
| Abedini et al. | Harnessing multiple wireless interfaces for guaranteed QoS in proximate P2P networks | |
| CN101729173A (en) | File carousel method based on ground mobile multimedia broadcasting system | |
| CN103685141B (en) | The implementation method of a kind of transmission service and equipment | |
| TWI404418B (en) | Channel schedule method of mobile television net | |
| CN102572705B (en) | User feedback-based scheduling method and equipment in multicast system and multicast 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 |