CN104270723A - Multi-channel large data item broadcast scheduling method based on double-layer scheduling strategy - Google Patents
Multi-channel large data item broadcast scheduling method based on double-layer scheduling strategy Download PDFInfo
- Publication number
- CN104270723A CN104270723A CN201410473490.7A CN201410473490A CN104270723A CN 104270723 A CN104270723 A CN 104270723A CN 201410473490 A CN201410473490 A CN 201410473490A CN 104270723 A CN104270723 A CN 104270723A
- Authority
- CN
- China
- Prior art keywords
- data item
- channel
- data
- item
- algorithm
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multi-channel large data item broadcast scheduling method based on a double-layer scheduling strategy. The method includes three processes including large data item subpackaging, high-level data item channel allocating and low-level single channel data item allocating. In the initial stage, a server side judges whether large data items are included according to channel capacity of available channels and the data length of all required data items. If the large data items are included, a pre-subpackaging mechanism needs to be carried out and subpackaging is reasonably carried out. A high-level data item channel allocating algorithm is adopted, and the algorithm guarantees optimal channel allocation; meanwhile, the algorithm is optimized, and accordingly the situation that the channels skip many times when mobile subscribers obtain multiple data items is avoided, and average access time is reduced. In actual application, a feedback mechanism can be introduced for a low-layer single channel data item scheduling strategy, when the subscribers of mobile terminals receive data, the server side is fed back, if certain data are not required, the data can be removed in the next pushing cycle, and the average access time is greatly reduced.
Description
Technical field
The invention belongs to data transfer communications technology, be specifically related to the large data item broadcast dispatching method of a kind of multichannel based on double-deck scheduling strategy.
Background technology
By wireless channel broadcast data, the inferior positions such as asymmetric, the low broadband of mobile radio telecommunications not only can be overcome; And the database of a large amount of mobile device simultaneously efficient access server end can be supported, the cost and the recipient's quantity that send data are substantially irrelevant.Because energy consumption of mobile equipment is limited, data broadcast can reduce the consumption that it obtains data electricity.Wireless data broadcasting is the main way of current wireless network transmissions data, and broadcasting server sends data by common signal channel, and mobile phone users is intercepted broadcast channel and downloaded the data of oneself demand in time.
How obtaining the consumption of visit data and minimizing mobile device electricity fast, is two keys of wireless data broadcasting research.Correspondingly, two major parameters weighing broadcast behavior are: access time (Access time) and tuning period (Tuning time).Access time refers to file a request to from user obtain the time that request msg consumes.Tuning period refer to from user file a request to obtain request msg before time of consuming of monitor channel.
The broadcast scheduling algorithm of current main flow has the smooth scheduling (Flat Broadcast) for single data items (each user only asks a data item), the scheduling (Probabilistic based Broadcast) etc. based on access probability.QEM dispatching algorithm, modified model QEM dispatching algorithm, GCM algorithm etc. are had for the request of many data item.For each dispatching algorithm of many data item, QEM algorithm is the flooding algorithm discussing many data item in detail proposed the earliest, compares Randomized scheduling algorithm mean access time and decreases about 25%; Follow-on QEM algorithm under any circumstance mean access time is all short compared with QEM algorithm, but complexity is higher; GCM algorithm in all cases mean access time all comparatively QEM algorithm is long, but complexity is lower.
Multi-channel wireless data broadcast refers to that multiple channel carries out data broadcast simultaneously.Compare with single channel data broadcast, improve efficiency, decrease the access time.Although existing many researchers propose the data broadcast dispatching algorithm of some multichannel single data items requests in recent years, as two-layer scheduling strategy (two level optimization scheduling algorithm, TOSA).But the scheduling of many data item request is also in the trial stage under multichannel.For the large data item that data length is longer, if directly this data item is looked as a whole, then can cause this large data item during channel carries out data-pushing, if have this data item of other user's requests and start monitor channel, then need to wait until that current data-pushing end cycle started to push this data item to the next cycle, could start to receive.Not only considerably increase tuning period, too increase the access time simultaneously.
Summary of the invention
How efficiently, promptly the mobile device that the object of the invention is for limited energy obtains the many data item containing large data item and proposes the large data item broadcast dispatching method of a kind of multichannel based on double-deck scheduling strategy in asymmetric wireless network situation.
For achieving the above object, design of the present invention is:
Propose after carrying out subpackage preliminary treatment for the large data item that data items length is longer, multiple packet is carried out channel allocation by recycling channel allocation algorithm.Achieve under large data item pushes, when having other user's real-time requirement data during periodic broadcasting data, subpackage application makes user can obtain data for a long time without the need to waiting for, decreases mean access time.Meanwhile, achieve the request of the many data item of multichannel, by decreasing data access conflict and channel hopping decreases mean access time.
According to foregoing invention design, the present invention adopts following technical proposals:
The large data item broadcast dispatching method of multichannel based on double-deck scheduling strategy, comprise large data item data subpackage, high level data item channel allocation, low layer single channel data item distribute three processes, concrete steps are as follows:
A, large data item data subpackage, comprise the steps:
(a-1), initialization, server end obtains the unique identification of the mobile device of all request msgs, requires that each mobile device has an independently identify label number;
(a-2), server end obtains the sum of available channel and counts K, and be numbered all channels, requires that each channel has one and independently numbers;
(a-3), server end obtains the data item of all mobile subscribers access, and sum counts N, and to all data item incomes numbering, requires that each data item has a unique numbering;
(a-4), according to the numbering of step (a-2) each channel, obtain corresponding available channel bandwidth and count
, wherein
;
(a-5), according to the numbering of step (a-3) each data item, the accessed probability that statistics obtains each data item counts p, and the data packet length of each data item counts l;
(a-6), according to the data packet length of each data item of bandwidth sum of each available channel, whether judge in demand data item containing large data item, if containing, need to carry out the pre-subpackage process of large data item, if without, direct basis channel allocation method carries out channel allocation to each data item;
(a-7), according to the bandwidth of maximum available channel, pre-subpackage process is carried out to large data item, and all packets are numbered, require that each packet of this data item has a unique mark, and the identification information of numbering containing this data item;
(a-8), the larger channel of available channel bandwidth is chosen, and this channel reserved;
B, high level data item channel allocation, comprise the steps:
(b-1), the reserved channel with maximum available channel bandwidth is chosen, by each allocation of packets ready-portioned for large data item to this channel;
(b-2), according to the accessed probability of each data item and the product of its data length, divide the remainder data item except the large data item distributed, and arrange each data item from big to small according to the product obtained;
(b-3), according to the channel width of all the other channels except the channel distributed except, and arrange each channel from small to large according to the bandwidth of channel, note remains available channel and adds up to
;
(b-4), make
, wherein
represent the channel width of i-th available channel,
represent the
the channel width of individual available channel;
(b-5), using every 2B data item having sorted as one group, front B data item order-assigned to 1 to
in, rear B data item order-assigned arrives
in 1, the quantity square root that channel available is wide being therewith assigned to the data item of each channel is directly proportional;
(b-6), make
equal to be dispensed to the accessed frequency of all data item of i-th channel and the summation of length product square root, successively the more each channel of recurrence
value, find the minimum and maximum channel of this value and count
;
(b-7), from
in each data item of recursive call successively, find value
minimum data item is counted
;
(b-8), to channel
, compare
with
the size of value, if the former is greater than latter by channel
in minimum data item
move to channel
if the former is less than or equal to the latter, then maintain the original state;
(b-9) high level data item channel allocation algorithm, is completed;
C, low layer single channel data item are distributed, and comprise the steps:
(c-1), initialization rank, remove the channel of the large data item of transmission, to any distribute data channel i, get current time T=0, order
calculate the accessed frequency of all data item on this channel to be respectively designated as
be designated as with length
, data item
be spaced apart
, wherein M be channel i distribute data item summation and
;
(c-2), specify that the set of each channel data item transmission sequence is
;
(c-3), each data item of more each channel
value, find the minimum data item of this value and be designated as
, and
;
(c-4), after each S set added a data item, made
represent current time;
(c-5), current time T, order
, meet
and
that minimum data item puts into data set S;
(c-6), to data item all on this channel successively above-mentioned algorithm of recurrence, until all data item that this channel is assigned with all have been dispatched.
The present invention compared with prior art, has following apparent outstanding substantive distinguishing features and remarkable technological progress:
The inventive method is introduced in many data item containing large data item, and according to the pre-subpackage process of maximum channel capacity again subpackage push thought, decrease the mean access time of data item, decrease channel hopping number of times and data access conflict simultaneously, decrease the consumption of mobile terminal electric energy.The present invention absorbs the advantage of two-layer scheduling strategy, improves the algorithm (comprising channel allocation algorithm and log-time algorithm) of the two-layer scheduling strategy of multichannel single data items request.Adopt method of the present invention, can be implemented in and push in the large data item cycle, other mobile device real-time requirements obtain this data item, long-time without the need to waiting for, decrease mean access time.
Accompanying drawing explanation
Fig. 1 is Radio Data System system assumption diagram.
Fig. 2 is the present invention's pre-subpackage process schematic diagram.
Fig. 3 is the pre-subpackage process charts of the large data of the present invention.
Fig. 4 is high level data item channel assignment procedures figure of the present invention.
Fig. 5 is single channel data item allocation algorithm result schematic diagram of the present invention.
Fig. 6 is single channel data item allocation algorithm flow chart of the present invention.
Embodiment
Details are as follows by reference to the accompanying drawings for the preferred embodiments of the present invention:
The large data item broadcast dispatching method of multichannel based on double-deck scheduling strategy, comprise large data item data subpackage, high level data item channel allocation, low layer single channel data item distribute three processes, concrete steps are as follows:
A, large data item data subpackage, comprise the steps:
(a-1), initialization, server end obtains the unique identification of the mobile device of all request msgs, requires that each mobile device has an independently identify label number;
(a-2), server end obtains the sum of available channel and counts K=3, and be numbered all channels, requires that each channel has one and independently numbers, counts respectively
,
,
;
(a-3), server end obtains the data item of all mobile subscribers access, and sum counts N=7, and to all data item incomes numbering, requires that each data item has a unique numbering, counts respectively
,
,
,
,
,
,
;
(a-4), according to the numbering of step (a-2) each channel, obtain corresponding channel width and count respectively
=10,
=10,
=20, as
=20 represent channel
the data item of 20 element lengths can be transmitted;
(a-5), according to the numbering of step (a-3) each data item, the accessed probability that statistics obtains each data item is counted respectively
=0.5,
=0.2,
=0.1,
=0.1,
=0.07,
=0.05,
=0.01, and the data packet length of each data item is counted respectively
=1,
=16,
=3,
=3,
=2,
=3,
=2, as
represent data item
length be 2 element lengths;
(a-6), according to the data packet length of each data item of bandwidth sum of each available channel, judge whether containing large data item in demand data item, by
, determine
for large data item;
(a-7), according to the bandwidth of maximum available channel
=20, to large data item
carry out pre-subpackage process, and all packets are numbered, will
be that a packet divides into groups with every four cell data length, packet is counted respectively
,
,
,
;
(a-8), channel reservation
for transmitting data item
each packet;
B, high level data item channel allocation, comprise the steps:
(b-1), channel is chosen
, by large data item
each packet ready-portioned
,
,
,
be dispensed to this channel;
(b-2), according to each data item
value, divide except the large data item that distributed
outside remainder data item, and arrange each data item be from small to large followed successively by according to the product obtained
,
,
,
,
,
;
(b-3), channel is removed
, all the other channels arrange from small to large according to bandwidth and are followed successively by
,
, the available channel sum sorted is counted
;
(b-4), according to step (b-3) order
?
2, wherein
represent i-th (
) channel width of individual available channel,
represent the maximum of channel width in (b-3);
(b-5), using every 2B=4 data item having sorted as one group, under the prerequisite ensureing each channel width abundance, front 2 data item order-assigneds to 1 to
in, rear 2 data item order-assigneds arrive
in 1, result is
,
,
be dispensed to
,
,
,
be dispensed to
;
(b-6), make
equal to be dispensed to i-th
the accessed frequency of all data item of individual channel and the summation of length product square root, the more each channel of recurrence
be worth
, note
;
(b-7), from
in each data item of recursive call successively, find value
minimum data item is counted
;
(b-8), to channel
, compare
with
the size result of value is:
, then without the need to by data item
move to channel
;
(b-9), complete high level data item channel allocation algorithm, result is data item
,
,
be dispensed to
channel, data item
,
,
be dispensed to
channel;
C, low layer single channel data item are distributed, and comprise the steps:
(c-1), initial phase,
channel get respectively current time T=0,
, calculate each channel data item respectively
be spaced apart
, wherein M be each channel i distribute data item summation and
.
channel:
,
,
,
channel:
,
,
;
(c-2), specify that the set of each channel data item transmission sequence is
, current time,
channel S gathers equal complete or collected works;
(c-3), each data item of more each channel respectively
value, find the minimum data item of this value and be designated as
, and
, current time
channel
,
channel
;
(c-4),
channel is remaining data item only
then
the data transmission scheduling order of channel is
,
channel current time
;
(c-5),
channel current time T=1, order
, then
,
, meet
and
, then S data centralization adds data item
;
(c-6),
channel is remaining data item only
then
the data transmission scheduling order of channel is
;
(c-7), to sum up
channel S data set is
,
channel S data set is
.
In the system design process of reality, usually there is the one or more identical data item of many mobile phone users demands access.See Fig. 1 Radio Data System system assumption diagram, information server and broadcasting server all can use cable network to be connected with database direct retrieve data, and mobile terminal need by the wireless channel of wireless network listening broadcast server push data.In reality, many mobile terminal demands obtain the information based on a large amount of associated users in this geographical position, if all data entirety is regarded as a data item, then there is the mobile terminal of other these data item of demand to start monitor channel when broadcasting this data item, then need to wait for long time.If by the pre-subpackage of this large data item, then other users can first start receiving unit data.Shown in this comparison process subpackage process as pre-in Fig. 2 schematic diagram.
In the process of actual propelling data, multiple mobile terminal need monitor same available channel for obtaining same data, and different mobile subscribers can access this channel in the different time.As shown in Figure 3, first, server end obtains the channel capacity of each available channel to the pre-subpackage process chart of large data, and the packet allowing transmission how many bits as maximum in this channel, how many data item are transmitted in maximum permission.Secondly, server end obtains the length of all requested data item.According to the channel capacity of all available channels and the length of data item, judge whether to there is large data item.If there is large data item, then need to choose the maximum channel of channel capacity, judge subpackage strategy according to its channel capacity, pre-subpackage process is carried out to large data item.For each package number, require that each data is surrounded by unique identification, and numbering is containing this data item identifier.Sort according to packet number again.
As shown in Figure 4, first server end judges whether to there is large data item to high level data item channel assignment procedures figure.If do not deposit, then directly performing available channel data item allocation algorithm; If exist, server end need judge whether the pre-subpackage process having completed large data item.If complete, then to need the packet of large data item according to the order-assigned sorted, on the maximum channel of reserved channel capacity, then to perform channel allocation algorithm; If also for completing, then wait for that this mechanism is complete.After available channel data item allocation algorithm is complete, server end also needs to optimize this algorithm, server end need add up all data item of different user access, and according to users classification, finely tune the data item be assigned, make more being dispensed on same channel of the data item of same user's request, avoid because each data item of access needs channel hopping on a different channel, add the mean access time of mobile terminal.
After complete high level data item allocation algorithm, fill order's channel data item allocation algorithm the most on each channel.The result schematic diagram of this algorithm as shown in Figure 5, different mobile terminal can access this channel in the different time in actual applications, therefore the large data item of access frequency answers mean allocation on this channel, when having other mobile subscribers to need to obtain this data item, without the need to waiting for that this broadcast cycle terminates, this data item can be received, save mean access time, decrease the energy consumption of mobile terminal.This algorithm flow chart as shown in Figure 6, in actual applications, first server end needs to enter initial phase, obtain the length of all data item that this channel distributes and accessed frequency, specify the data set satisfied condition according to actual algorithm demand, the data item satisfied condition is added into this data set by each recurrence log-time algorithm one by one.Judge whether the channel of distribute data item all needs this algorithm complete, if complete, dual-layer data item dispatching algorithm can terminate.If without, need not complete channel all to complete.
After complete based on the multichannel large data item broadcast dispatching algorithm of double-deck scheduling strategy, meet under multi-mobile-terminal user accesses the background condition of many data item, when containing large data in desired data item, the mobile phone users average latency can be reduced by the pre-subpackage process of large data, the optimization of upper layer data item channel allocation algorithm avoids the repeatedly channel hopping of each mobile subscriber when obtaining many data item, decreases mean access time.Low layer single channel data item scheduling strategy can introduce feedback mechanism in actual applications, server end feedback is given when each mobile phone users receives these data, if a certain item number is according to no longer demand, the cycle can be pushed at next and remove this data, greatly reduce mean access time.
Claims (1)
1. based on the large data item broadcast dispatching method of multichannel of double-deck scheduling strategy, it is characterized in that, comprise large data item data subpackage, high level data item channel allocation, low layer single channel data item distribute three processes, concrete steps are as follows:
A, large data item data subpackage, comprise the steps:
(a-1), initialization, server end obtains the unique identification of the mobile device of all request msgs, requires that each mobile device has an independently identify label number;
(a-2), server end obtains the sum of available channel and counts K, and be numbered all channels, requires that each channel has one and independently numbers;
(a-3), server end obtains the data item of all mobile subscribers access, and sum counts N, and to all data item incomes numbering, requires that each data item has a unique numbering;
(a-4), according to the numbering of step (a-2) each channel, obtain corresponding available channel bandwidth and count
, wherein
;
(a-5), according to the numbering of step (a-3) each data item, the accessed probability that statistics obtains each data item counts p, and the data packet length of each data item counts l;
(a-6), according to the data packet length of each data item of bandwidth sum of each available channel, whether judge in demand data item containing large data item, if containing, need to carry out the pre-subpackage process of large data item, if without, direct basis channel allocation method carries out channel allocation to each data item;
(a-7), according to the bandwidth of maximum available channel, pre-subpackage process is carried out to large data item, and all packets are numbered, require that each packet of this data item has a unique mark, and the identification information of numbering containing this data item;
(a-8), the larger channel of available channel bandwidth is chosen, and this channel reserved;
B, high level data item channel allocation, comprise the steps:
(b-1), the reserved channel with maximum available channel bandwidth is chosen, by each allocation of packets ready-portioned for large data item to this channel;
(b-2), according to the accessed probability of each data item and the product of its data length, divide the remainder data item except the large data item distributed, and arrange each data item from big to small according to the product obtained;
(b-3), according to the channel width of all the other channels except the channel distributed except, and arrange each channel from small to large according to the bandwidth of channel, note remains available channel and adds up to
;
(b-4), make
, wherein
represent the channel width of i-th available channel,
represent the
the channel width of individual available channel;
(b-5), using every 2B data item having sorted as one group, front B data item order-assigned to 1 to
in, rear B data item order-assigned arrives
in 1, the quantity square root that channel available is wide being therewith assigned to the data item of each channel is directly proportional;
(b-6), make
equal to be dispensed to the accessed frequency of all data item of i-th channel and the summation of length product square root, successively the more each channel of recurrence
value, find the minimum and maximum channel of this value and count
;
(b-7), from
in each data item of recursive call successively, find value
minimum data item is counted
;
(b-8), to channel
, compare
with
the size of value, if the former is greater than latter by channel
in minimum data item
move to channel
if the former is less than or equal to the latter, then maintain the original state;
(b-9) high level data item channel allocation algorithm, is completed;
C, low layer single channel data item are distributed, and comprise the steps:
(c-1), initialization rank, remove the channel of the large data item of transmission, to any distribute data channel i, get current time T=0, order
calculate the accessed frequency of all data item on this channel to be respectively designated as
be designated as with length
, data item
be spaced apart
, wherein M be channel i distribute data item summation and
;
(c-2), specify that the set of each channel data item transmission sequence is
;
(c-3), each data item of more each channel
value, find the minimum data item of this value and be designated as
, and
;
(c-4), after each S set added a data item, made
represent current time;
(c-5), current time T, order
, meet
and
that minimum data item puts into data set S;
(c-6), to data item all on this channel successively above-mentioned algorithm of recurrence, until all data item that this channel is assigned with all have been dispatched.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410473490.7A CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410473490.7A CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104270723A true CN104270723A (en) | 2015-01-07 |
| CN104270723B CN104270723B (en) | 2018-01-02 |
Family
ID=52162199
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410473490.7A Expired - Fee Related CN104270723B (en) | 2014-09-17 | 2014-09-17 | Multichannel big data item broadcast scheduling method based on double-deck scheduling strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104270723B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103248500A (en) * | 2013-05-22 | 2013-08-14 | 武汉大学 | Real-time on-demand data broadcast scheduling method in consideration of size of data item |
-
2014
- 2014-09-17 CN CN201410473490.7A patent/CN104270723B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103248500A (en) * | 2013-05-22 | 2013-08-14 | 武汉大学 | Real-time on-demand data broadcast scheduling method in consideration of size of data item |
Non-Patent Citations (3)
| Title |
|---|
| AGUSTINUS BORGY WALUYO, FENG ZHU, DAVID TANIAR, BALA SRINIVASAN: "Design and Implementation of", 《IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS》 * |
| HAO LIANG,WEIHUA ZHUANG: "Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 * |
| THADPONG PONGTHAWORNKAMOL, KLARA NAHRSTEDT，GUIJUN WANG: "HybridCast: A Hybrid Probabilistic/Deterministic Approach for Adjustable Broadcast Reliability in Mobile Wireless Ad Hoc Networks", 《IEEE ICC 2009 PROCEEDINGS》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104270723B (en) | 2018-01-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101153121B1 (en) | Techniques for distributing content to multiple devices in a communication network | |
| US9088803B2 (en) | Software defined joint bandwidth provisioning and cache management for MBH video traffic optimization | |
| CN103260244B (en) | D2D uplink resource multiplexing mode switching method in a kind of cellular system | |
| CN102625252B (en) | Time-divided transmission method capable of avoiding interference for D2D multi-casting communication system | |
| CN103402207A (en) | Dynamically-variable resource allocation method for MF-TDMA (Multi-Frequency Time Division Multiple Access) satellite communication system | |
| CN101394220A (en) | Time slot uniform distribution method oriented to MF-TDMA system | |
| CN109388492A (en) | A kind of mobile block chain optimization calculation force distribution method under multiple edge calculations server scenes based on simulated annealing | |
| CN102387222A (en) | Address distribution method, apparatus and system thereof | |
| CN107040931A (en) | A kind of wireless and caching Resource co-allocation method of mist Radio Access Network | |
| CN106028463A (en) | Satellite-borne dynamic spectrum resource scheduling method based on service rate control | |
| CN103281786B (en) | The method for optimizing resources of a kind of Home eNodeB double-layer network based on energy efficiency | |
| Do et al. | How to cache in mobile hybrid IoT networks? | |
| CN104469851B (en) | Balanced handling capacity and the resource allocation methods of delay in a kind of LTE downlinks | |
| CN106792480B (en) | A kind of D2D communication resource allocation method based on cellular network | |
| CN108848482A (en) | Resource allocation methods based on mMTC layer-specific access frame | |
| CN106028453B (en) | Wireless dummy network resource cross-layer scheduling mapping method based on queueing theory | |
| CN101868032A (en) | Device and method for determining dispatching priority of users and dispatching device and method | |
| CN101964947B (en) | Data scheduling platform of integrated information service broadcasting system | |
| CN106793122B (en) | Method for safely allocating each bit minimized wireless resources of heterogeneous network | |
| CN104410976B (en) | A kind of distributed end-to-end user associates and time allocation method used therein with cellular network subscriber | |
| CN104270723A (en) | Multi-channel large data item broadcast scheduling method based on double-layer scheduling strategy | |
| CN103945545A (en) | Heterogeneous network resource optimizing method | |
| Ferng et al. | A dynamic resource reservation scheme with mobility prediction for wireless multimedia networks | |
| CN101778433B (en) | Method and device for scheduling radio resources | |
| CN102917277B (en) | Content fragment distribution method realizing on-demand casting through broadcasting |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180102 Termination date: 20200917 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |