CN104144428B - A kind of time division multiplex channel time slot division methods - Google Patents
A kind of time division multiplex channel time slot division methods Download PDFInfo
- Publication number
- CN104144428B CN104144428B CN201410354057.1A CN201410354057A CN104144428B CN 104144428 B CN104144428 B CN 104144428B CN 201410354057 A CN201410354057 A CN 201410354057A CN 104144428 B CN104144428 B CN 104144428B
- Authority
- CN
- China
- Prior art keywords
- time slot
- slot
- mini
- time
- state
- 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.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of time division multiplex channel time slot division methods, including according to the disposal ability of cognition wireless network and the minimum distinguishable flow of primary user, the duration of mini-slot is determined, whole time frame is divided into the set of mini-slot composition；Then mini-slot set is grouped, obtains time slot sets；And the flow of primary user is allocated between time slot according to algorithm so that time slot takes or idle completely.Pass through the present invention, can be standardized the assignment of traffic and Time Slot Occupancy of primary user, avoid time slot from the situation that part takes occur, and simplify detection of the secondary user in wireless cognition network to time slot state, the detection efficiency to time slot state is improved, reduces the transmission control complexity of secondary user.
Description
Technical field
The present invention relates to network communication field, more particularly to a kind of time division multiplex channel time slot division methods.
Background technology
With the rapid growth of radio communication service demand, it is currently available that frequency spectrum resource is just becoming more and more rare, more
Carry out more users, also numerous emerging wireless access technologys all are attempting to use those limited and increasingly crowded frequency ranges；
And on the other hand, the whole world overwhelming majority authorizes the actual spectrum utilization rate of frequency range but very low.
To solve the above problems, cognitive radio technology arises at the historic moment, the core of the technology is by wireless environment
Perceive, realize dynamically using fixed allocation to the frequency range of authorized user and other idle frequency ranges to improve existing frequency spectrum
The utilization rate of resource.Cognition wireless network (Cognitive Radio Networks, CRN) is then prolonging for cognitive radio concept
Stretch, cordless communication network of new generation will be that to have one of the cognition network, its core objective of cognitive ability be exactly according to network
Environment and user's request, dynamically distribute frequency spectrum resource, so as to realize the optimization of network configuration.
In CRN networks, primary user (Primary Users, PU) refer to those uses to certain section of frequency spectrum have it is high preferential
Level or the user of legal authorization, secondary user (Secondary Users, SU) refer to the user of those low priorities.SU is to frequency
The use of spectrum must not interfere to PU, therefore it is required that it, which can quickly and reliably perceive PU, uses the situation for authorizing frequency spectrum.SU must
Must possess the cognitive ability to existing channel occupancy situation, thus also referred to as cognitive user (Cognitive Users), in net
Cognitive nodes are then expressed as in network structure.
The open frequency spectrum of cognition network allows the shared identical frequencies of PU of the SU and authoring system in network using strategy
Section, according to the agreement and interference constraints condition reached with PU, SU can be on the premise of PU not be disturbed, using those not by PU
The frequency range of occupancy.From the point of view of principle, the frequency spectrum share strategy in cognition network is broadly divided into cover type and superposing type.Either cover
Lid formula or superposing type, its target are all to improve PU and SU degree of share as far as possible on the premise of PU is not influenceed, improve frequency
Rate resource utilization.For this target, existing various documents propose kinds of schemes.
S.Huang is equal to 2008 in the The27th Conference On ComputerCommunications (U.S.
Institute of Electrical and Electric Engineers computer communication conference) on " the Opportunistic spectrum access in that deliver
Cognitive radio networks " (waiting for an opportunity frequency spectrum access) in cognition wireless network, it is proposed that based on different perception,
Keep out of the way three kinds of frequency spectrum access schemes with transmission mechanism, and give the closed-form analytical for secondary user's performance.
Anandkumar was published in IEEE INFOCOM (institute of electrical and electronic engineers computer communication international conference) equal to 2010
On " Opportunistic spectrum access with multiple users：learning under
(multi-user's waits for an opportunity frequency spectrum access to competition "：Consider the learning algorithm of user's competition), how have studied makes multiple times
Cooperative distribution reaches total throughout maximum in level user, and proposes a kind of study mechanism and reach progressive in a distributed fashion
Formula is optimal.But the method for above-mentioned document has stronger application limitation.
Ahmad was published in Information Theory equal to 2009, IEEE Transactions (U.S. electric and
Electronic Engineering Association's information theory) on " Optimality of myopic sensing in multichannel
Opportunistic access, (multichannel waits for an opportunity the optimality of short-sighted cognitive method in access), it was demonstrated that in primary user be
Independently and with the Markov Process Model under equal distribution, when state change and time positive correlation, short-sighted perceptual strategy is most
Excellent.Tekin is equal to 2011 to be sent out on IEEE INFOCOM (institute of electrical and electronic engineers computer communication international conference)
" the Online learning in opportunistic spectrum access of table：A restless bandit
Approach, (the on-line study mechanism for waiting for an opportunity frequency spectrum access), construct one and consider secondary under primary user's frequency range time dependant conditions
The on-line learning algorithm of user's frequency spectrum access.But the defects of above-mentioned algorithm, is to use centralized algorithm, possesses higher
Computational complexity and extra communication overhead.
Reach preferable CRN communication efficiencies, i.e. the property that PU and SU frequency spectrum share degree is maximized without influenceing PU again
Can, significant challenge is that SU needs perceive PU busy-idle condition and the occupancy situation to frequency spectrum accurately and in time.Existing skill
Art is started with from raising SU perceptions mostly, various state and frequency spectrum perception algorithms is designed, to obtain highest frequency spectrum resource
Utilization rate.However, it is contemplated that the randomness of PU flows and sudden (burstiness), the simple perception for relying on SU, very
Hardly possible obtains relatively good perceived effect.
And existing literature lacks the way for utilizing and optimizing PU assignment of traffic improvement SU perceived effects.
The content of the invention
In order to overcome shortcoming and deficiency existing for prior art, the present invention provides a kind of time division multiplex channel time slot division side
Method.
A kind of time division multiplex channel time slot division methods, comprise the following steps：
S1 sets currently available total bandwidth as W, when a length of T of the time frame of systemF, according to the processing of wireless cognition network
Ability, mini-slot duration δ is determined as follows：
δ=TF/2M,
Wherein, M is positive integer, and the transmission capacity of each mini-slot is δ W；
S2 is in units of δ, by the duration T of time frameFIt is divided into the set S of N number of mini-slot composition：
Wherein N is mini-slot sum；For floor functions, return is less than TF/ δ maximum integer；T(τi) it is to obtain
Take τiThe function of duration, Z represent set of integers；
Any one mini-slot in S3 selection set S is as CCCH θCCC, control letter is transmitted for primary user
Breath；Remaining N-1 mini-slot in set S is grouped again according to mini-slot capacity δ 2 powers, obtains time slot sets Φ,
Wherein M is that data transmit total number of timeslots；For floor functions, return is less than log2(TF/ δ) most
Big integer；T(θk) it is to obtain θkThe function of duration.
Each time slot θkInclude 2kIndividual mini-slot：
S4 reads flow R (t) of the primary user in t from queue, and R (t) is expressed as into maximum mini-slot capacity δ W
2 power multiples sum, i.e.,：
Wherein, Ik[R (t)] is indicator function, is determined by system in the PU flow R (t) that t is read from queue, its
It is worth for 0 or 1：
In above formulaFor ceiling functions, ＆ is step-by-step AND operator.
S5 is according to IkThe value of [R (t)], the primary user flow R (t) that t is read is assigned on time slot collection Φ time slot
Forwarded；
Whole time slot states in S6 detection time frames, current state is selected as number of the idle time slot as secondary user
According to transmission time slot.
According to I in the S5kThe value of [R (t)], the primary user flow R (t) that t is read is assigned to time slot collection Φ's
Forwarded on time slot, specific method is as follows：
S5-1, under original state, k=M-1 is made, whereinAnd current flow to be allocated is designated as
V, and make V=R (t)；
S5-2, if Ik[R (t)]=1, then distribute 2 from Vkδ W flow gives time slot θk, and it is (V-2 to update Vkδ W),
If Ik[R (t)]=0, then perform S5-3；
S5-3, if k>0, then make k subtract 1, return to S5-2；Otherwise, V residual flow is distributed into time slot θ0, distributed
Journey terminates.
It is two in wireless cognition network according to the free timeslot in the sequence detection time frame of time order and function in the S6
Level user transmits data, is specially：The seizure condition of current time slots detects in secondary user, judges whether its state is " occupancy "；
If it is, skipping, next time slot is continued checking for；If the time slot state is " free time ", secondary user takes the time slot；
Said process continues to that whole time slot inspections finish in set φ, or the current shared time slot total capacity of secondary user has met
Untill the demand of this transmission of secondary user.
Time slot θ is detected in the S6kState when, without detecting time slot θ one by onekIn all 2kIndividual mini-slot, and only need to examine
Survey first mini-slotIts state is equal to those slots θkState.
Mini-slot duration δ in the S1 is the optimal value in the case where cognition wireless network disposal ability allows.
In the S6, when needing the secondary user's number for sending data more than one, an access agent need to be set up and born
Duty completes time slot state detection, and coordinates the resource request of multiple secondary users；The access agent can be full-time agency, or
One secondary user's node of selection is held a concurrent post.
Beneficial effects of the present invention：
1) SU transmission control complexity is reduced.
Existing CRN is not in order that SU transmission is interfered to PU QoS, it is necessary to the signal to noise ratio that can be allowed according to PU
(S/N) a transimission power threshold value (threshold, also referred to as interference temperature) is set for SU, and will
SU transimission power is carefully controlled in below the threshold value.SU can neither influence PU, again with PU shared channels, this aspect
The complexity of SU transmission controls is added, on the other hand limits SU efficiency of transmission.
Using the present invention, whole time frame is divided into set of time-slot first；PU is to wherein each time slot θkOccupancy be
100% occupancy or 100% idle, the situation appearance for avoiding part from taking.Because SU need not share a time slot with PU, also
Without being gone to set SU power threshold value according to PU SNR, SU transmission control algolithm is simplified, and can use the channel
Whole transmittabilities.
2) SU detection efficiency is improved.
SU detects any one time slot θkState when, it is not necessary to detect time slot θ one by onekIn all 2kThe state of individual mini-slot,
Only need to choose first mini-slotSU knows mini-slotState be equal to and know its those slots θkState.This
Invention SU is often sent detection complexity required for a data fromIt is reduced to
3) too high peak-to-average force ratio (PAPR, peak-to-average power rate) is avoided
The present invention is grouped to form multiple non-slotted channels based on mini-slot, relative to based on frequency partition (Frequency
Division the frequency channels of formation), all time slot carrier frequencies of the invention are identicals, so as to avoid excessive peak
It is more non-linear than caused by (Peak-to-Average Power Ratio, PAPR) and overload and out-of-band radiation (out-of-
Band radiation) the problems such as.
Brief description of the drawings
Fig. 1 is the workflow diagram of the present invention.
Fig. 2 is the time slot state testing process schematic diagram of the present invention.
Fig. 3 is the mini-slot packet schematic diagram of the present invention.
Fig. 4 (a) represents the PU flows fragment distribution schematic diagram before distribution of the embodiment of the present invention, and Fig. 4 (b) represents that the present invention is real
Apply the PU flows fragment distribution schematic diagram after example distribution.
Embodiment
With reference to embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are not
It is limited to this.
Embodiment
As shown in figure 1, a kind of time division multiplex channel time slot division methods, comprise the following steps：
S1 sets present channel available bandwidth as W=3Mbps, when a length of T of the time frame (Time-frame) of systemF=1
Second, mini-slot duration δ is determined as follows：
δ=TF/2M=1/2M,
According to the disposal ability of wireless cognition network and PU minimum distinguishable flow, the present embodiment selection M=8, then have:
δ=1/2M≈3.9ms.
S2 is in units of δ, by currently available time frame TFIt is divided into N number of mini-slot within=1 second:
Whole mini-slot composition set S：
S={ τi|T(τi)=δ, 0≤i<256, i ∈ Z },
Wherein T (τi) it is to obtain τiThe function of duration.
S3 without loss of generality, selects mini-slot τ0As public control time slot βCCCThen according to 2 times of mini-slot duration δ
Fang Bei, set S member is grouped, the number of packet is M=8；So as to obtain time slot sets Φ：
Φ={ θk|T(θk)=2kδ,0≤k<8, k ∈ Z },
Wherein each time slot includes one group of mini-slot：
And time slot θkCorresponding transmission capacity is
θkW=2kδW.
In view of present channel available bandwidth W=3Mbps, the mini-slot packet of the present embodiment and the timeslot capacity such as institute of table 1
Show and Fig. 3 shown in.
The mini-slot of table 1 is grouped to be divided with time slot
| Time slot | θCCC | θ0 | θ1 | θ2 | θ3 |
| Mini-slot | τ0 | τ1 | τ2~τ3 | τ4~τ7 | τ8~τ15 |
| Duration | δ | δ | 2δ | 4δ | 8δ |
| Capacity (bps) | 12K | 12K | 24K | 48K | 96K |
| Time slot | θ4 | θ5 | θ6 | θ7 | (total) |
| Mini-slot | τ16~τ31 | τ32~τ63 | τ64~τ127 | τ128~τ255 | |
| Duration | 16δ | 32δ | 64δ | 128δ | 256δ |
| Capacity (bps) | 192K | 384K | 768K | 1536K | 3M |
R (t) is expressed as the sum of mini-slot capacity δ W 2 powers times by S4：
Wherein, Ik[R (t)] represents the coefficient of kth item in above-mentioned and formula, and its value is 0 or 1, by the PU flow R (t) of t
Determine:
In above formulaFor ceiling functions, ＆ is step-by-step AND operator.
S5 is according to Ik[R(t)](0≤k<M value), by t read PU flow R (t) be assigned to time slot collection Φ when
Forwarded in gap.With the following method, its step is assignment of traffic：
S5-1, under original state, k=M-1=7 is made, and current flow to be allocated is designated as V, and make V=R (t)；Such as：
The packet traffic fragment { R (0) ..., R (7T) } of PUs 8 moment (0-7T) for 236,156,102,65,34,95,189,
160 } (unit：pps,packets per second)；
S5-2, if Ik[R (t)]=1, then distribute 2 from Vkδ W flow gives time slot θk, and it is (V-2 to update VkδW)；
Otherwise S5-3 is performed；
S5-3, if k>0, then it is (k-1) to update k, returns to S5-2；Otherwise V residual flow is fully allocated to time slot
θ0, assigning process terminates；
Because the unit of timeslot capacity is bps (bits per second), and PU flux units are pps, therefore, right
Before PU flows are allocated, the conversion between bps and pps need to be carried out first.Each packet length may be variant, maximum
1538 bytes, minimum 64 bytes.
To ensure that time slot can accommodate most long packet, the present embodiment is used uniformly 1500 bytes and calculated, then obtains
The mini-slot capacity in units of pps be(whereinFloor functions are represented, downwards
Round), then corresponding timeslot capacity list 2 is as follows.
Time slot distribution of the table 2 based on pps
| Time slot | θCCC | θ0 | θ1 | θ2 | θ3 |
| Mini-slot | τ0 | τ1 | τ2~τ3 | τ4~τ7 | τ8~τ15 |
| Timeslot capacity (pps) | 1 | 1 | 2 | 4 | 8 |
| Time slot | θ4 | θ5 | θ6 | θ7 | (total) |
| Mini-slot | τ16~τ31 | τ32~τ63 | τ64~τ127 | τ128~τ255 | |
| Timeslot capacity (pps) | 16 | 32 | 64 | 128 | 256 |
Based on channel capacity shown in table 2, time slot the service condition such as table 3 and Fig. 4 (a), Fig. 4 after PU assignment of traffic are carried out
(b) shown in
The PU assignment of traffic situation tables of table 3
UMT in table 3 represents PU and sends the mask that data actually use time slot every time, and the mask is passed through by PU senders
Public control time slot θCCCPU recipient is sent to, recipient knows that this data of PU senders send actual use by UMC
Time slot list, so as to filter out unrelated time slot when receiving data, against the influence of SU data transmission.
As shown in Fig. 2 in detection time slot θkState when, without detecting θ one by onekIn all 2kThe state of individual mini-slot, and
Only need to detect first mini-slotThe mini-slot knownState be equal to and know those slots θkState.
For example SU needs to detect time slot θ7State, θ7Comprising mini-slot be τ127~τ254Because the invention enables θ7
In all mini-slot state it is completely the same, therefore SU only need to be from τ127~τ254The mini-slot of middle access time earliest is carried out
Detection, you can obtain time slot θ7State, be reduced to 1 time so that SU detection number of operations is never exceeded into 128 times.
When determining mini-slot capacity δ, PU minimum distinguishable flow and system processing power need to be considered to determine.Subtract
Small δ is advantageous to improve the resolution capability of flow, so as to reduce the waste of time interval resource；But reduce δ with mini-slot in seasonal system
Duration reduce, sum increase, so as to the requirement for increasing the processing load of system, improving time precision.Appropriate way is
On the premise of system capability allows, optimal δ are chosen
Above-described embodiment is the preferable embodiment of the present invention, but embodiments of the present invention are not by the embodiment
Limitation, other any Spirit Essences without departing from the present invention with made under principle change, modification, replacement, combine, simplification,
Equivalent substitute mode is should be, is included within protection scope of the present invention.
Claims (6)
1. a kind of time division multiplex channel time slot division methods, it is characterised in that comprise the following steps：
S1 sets currently available total bandwidth as W, when a length of T of the time frame of systemF, according to the disposal ability of wireless cognition network,
Mini-slot duration δ is determined as follows：
δ=TF/2M,
Wherein, M is positive integer, and the maximum transfer capacity of each mini-slot is δ W；
S2 is in units of δ, by the duration T of time frameFIt is divided into the set S of N number of mini-slot composition：
Wherein N is mini-slot sum；For floor functions, return is less than TF/ δ maximum integer；T(τi) it is to obtain τiWhen
Long function, Z represent set of integers；
Any one mini-slot in S3 selection set S transmits control information as public control time slot for primary user；To set
Remaining N-1 mini-slot is grouped again according to mini-slot duration δ 2 powers in S, obtains time slot sets Φ,
Wherein M is data transmission slots sum；For floor functions, return is less than log2(TF/ δ) it is maximum whole
Number；T(θk) it is to obtain θkThe function of duration,
Each time slot θkInclude 2kIndividual mini-slot：
<mrow>
<msub>
<mi>&theta;</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mo>{</mo>
<msubsup>
<mi>&tau;</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>&tau;</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msubsup>
<mo>,</mo>
<mo>...</mo>
<msubsup>
<mi>&tau;</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>L</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msubsup>
<mo>}</mo>
<mo>,</mo>
<mi>L</mi>
<mo>=</mo>
<msup>
<mn>2</mn>
<mi>k</mi>
</msup>
<mo>;</mo>
</mrow>
S4 reads flow R (t) of the primary user in t from queue, and R (t) is expressed as 2 times of maximum mini-slot capacity δ W
The sum of square multiple, i.e.,：
Wherein, Ik[R (t)] is indicator function, and its value is 0 or 1；For ceiling functions, return is more thanMinimum
Integer；
S5 is according to IkThe value of [R (t)], the primary user flow R (t) that t is read is assigned on time slot collection Φ time slot and turned
Hair；
Whole time slot states in S6 detection time frames, current state is selected to be passed for the time slot of free time as the data of secondary user
Send time slot.
2. according to the method for claim 1, it is characterised in that according to I in the S5kThe value of [R (t)], t is read
Primary user flow R (t) be assigned on time slot collection Φ time slot and forwarded, specific method is as follows：
S5-1, under original state, k=M-1 is made, whereinAnd current flow to be allocated is designated as V, and make
V=R (t)；
S5-2, if Ik[R (t)]=1, then distribute 2 from Vkδ W flow gives time slot θk, and it is (V-2 to update Vkδ W), if Ik
[R (t)]=0, then perform S5-3；
S5-3, if k>0, then it is k-1 to update k, returns to S5-2；Otherwise, residual flow V is fully allocated to time slot θ0, distributed
Journey terminates.
3. according to the method for claim 1, it is characterised in that according to the sequence detection time frame of time order and function in the S6
In free timeslot, be wireless cognition network in secondary user transmit data, be specially：Secondary user's detection current time slots
Seizure condition, judge whether its state is " occupancy "；If it is, skipping, next time slot is continued checking for；If the time slot shape
State is " free time ", then secondary user takes the time slot；Said process continues to that whole time slot inspections finish in set φ, or two level
Untill the current shared time slot total capacity of user has met the needs of this transmission of secondary user.
4. according to the method for claim 1, it is characterised in that：Time slot θ is detected in the S6kState when, without examining one by one
Survey time slot θkIn all 2kIndividual mini-slot, and only need to detect first mini-slotIts state is equal to those slots θkShape
State.
5. according to the method for claim 1, it is characterised in that：Mini-slot duration δ in the S1 is in cognitive wireless
The optimal value that network disposal ability allows.
6. according to the method for claim 1, it is characterised in that in the S6, when the secondary user's number for needing transmission data
When mesh is more than one, an access agent need to be set up and be responsible for completing time slot state detection, and coordinate the resource of multiple secondary users
Request；The access agent is full-time agency, or one secondary user's node of selection is held a concurrent post.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410354057.1A CN104144428B (en) | 2014-07-23 | 2014-07-23 | A kind of time division multiplex channel time slot division methods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410354057.1A CN104144428B (en) | 2014-07-23 | 2014-07-23 | A kind of time division multiplex channel time slot division methods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104144428A CN104144428A (en) | 2014-11-12 |
| CN104144428B true CN104144428B (en) | 2017-12-01 |
Family
ID=51853477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410354057.1A Expired - Fee Related CN104144428B (en) | 2014-07-23 | 2014-07-23 | A kind of time division multiplex channel time slot division methods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104144428B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10616914B2 (en) | 2017-01-06 | 2020-04-07 | Qualcomm Incorporated | Unicast data transmission on a downlink common burst of a slot using mini-slots |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102035786A (en) * | 2010-11-12 | 2011-04-27 | 清华大学 | Time division duplex transmission method for broadband wireless communication system |
| CN102123515A (en) * | 2011-03-10 | 2011-07-13 | 西安电子科技大学 | Superframe-based efficient media access control method in wireless body area network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8805428B2 (en) * | 2010-10-27 | 2014-08-12 | Dynamic Invention Llc | Cooperative spectrum sensing in cognitive radio networks |
-
2014
- 2014-07-23 CN CN201410354057.1A patent/CN104144428B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102035786A (en) * | 2010-11-12 | 2011-04-27 | 清华大学 | Time division duplex transmission method for broadband wireless communication system |
| CN102123515A (en) * | 2011-03-10 | 2011-07-13 | 西安电子科技大学 | Superframe-based efficient media access control method in wireless body area network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104144428A (en) | 2014-11-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10548071B2 (en) | System and method for communicating traffic over licensed or un-licensed spectrums based on quality of service (QoS) constraints of the traffic | |
| Tumuluru et al. | Performance analysis of cognitive radio spectrum access with prioritized traffic | |
| Wang et al. | Load-balancing spectrum decision for cognitive radio networks | |
| Byun et al. | Dynamic spectrum allocation in wireless cognitive sensor networks: Improving fairness and energy efficiency | |
| Huang et al. | Priority-based traffic scheduling and utility optimization for cognitive radio communication infrastructure-based smart grid | |
| EP3132571B1 (en) | Apparatus and method for dynamic resource allocation over licensed and unlicensed spectrums | |
| Kar et al. | Throughput-optimal scheduling in multichannel access point networks under infrequent channel measurements | |
| CN101984719A (en) | Resource reuse method and equipment for machine-to-machine (M2M) downlink control information | |
| CN108370569A (en) | The communication resource distribution of telecommunication network | |
| MacKenzie et al. | Throughput and delay analysis for p-persistent CSMA with heterogeneous traffic | |
| Amer et al. | Association optimization in Wi-Fi networks: Use of an access-based fairness | |
| Saadat et al. | License assisted access-WiFi coexistence with TXOP backoff for LTE in unlicensed band | |
| Shigueta et al. | A strategy for opportunistic cognitive channel allocation in wireless Internet of Things | |
| CN105407490A (en) | Implement method and system to allow different communication systems to coexist in license-free frequency band | |
| CN104144427B (en) | A kind of wireless cognition network band allocating method | |
| Yoon et al. | Multichannel CSMA/CA protocol for OFDMA-based broadband power-line communications | |
| CN104219772B (en) | A kind of channel access method and channel access device | |
| Le et al. | A new QoS resource allocation scheme using GTS for WPANs | |
| CN104144428B (en) | A kind of time division multiplex channel time slot division methods | |
| Wei et al. | Dynamic system level frequency spectrum allocation scheme based on cognitive radio technology | |
| CN103442363B (en) | Use the minimized frequency spectrum aggregation method of cognitive TD-LTE intermediate frequency spectrum switching times of TVWS | |
| Mišić et al. | Cognitive MAC protocol with transmission tax: Dynamically adjusting sensing and data performance | |
| Zeng et al. | Weight based channel selection towards 5G in the unlicensed spectrum | |
| Ruan et al. | Towards low-delay body area networks: An investigation on the hybrid MAC of SmartBAN and IEEE 802.15. 6 wireless body area network | |
| Al-Anbagi et al. | Time slot allocation in WSNs for differentiated smart grid traffic |
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: 20171201 Termination date: 20210723 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |