CN105721082B - A kind of multiuser channel cognitive method applied to cognitive radio - Google Patents
A kind of multiuser channel cognitive method applied to cognitive radio Download PDFInfo
- Publication number
- CN105721082B CN105721082B CN201610086790.9A CN201610086790A CN105721082B CN 105721082 B CN105721082 B CN 105721082B CN 201610086790 A CN201610086790 A CN 201610086790A CN 105721082 B CN105721082 B CN 105721082B
- Authority
- CN
- China
- Prior art keywords
- channel
- secondary user
- user
- order
- aware
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
Landscapes
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of multiuser channel cognitive method applied to cognitive radio.The channel-aware of multiple secondary user's can be realized using the present invention, and secondary user's collision probability is low, system average throughput is high, system complexity is low.All available channels are ranked up and numbered first；Then whole channel-awares order of the preceding m channel of each secondary user's is obtained using the method for exhaustion；The channel-aware order of m secondary user's is combined, calculates the system average throughput under all combinations；It is the optimal perception sequential combination of the preceding m channel of m secondary user's corresponding to maximum system average throughput；Then the m+1 channel is perceived, channel S is added in the case where the relative perceptual ordinal position of the original m channel of holding is constantm+1, computing system average throughput, the optimal perception sequential combination of the preceding m+1 channel of m secondary user's of acquisition；The like, finally obtain the optimal perception of N number of channel of m secondary user's sequentially.
Description
Technical field
The present invention relates to cognitive radio technology field, and in particular to a kind of multiuser channel applied to cognitive radio
Cognitive method.
Background technology
In different parts of the world, wireless frequency spectrum is mostly allocated to panoramic mechanism.With the development of science and technology,
The shortage of frequency spectrum will turn into one of bottleneck of wireless communication technology development.In recent years, cognitive radio technology enters masses'
The visual field, it is intended to make full use of the problem of idle frequency spectrum of mandate is to alleviate spectrum shortage.
In cognitive radio networks, secondary user's (unauthorized user) can not use primary user (authorized user)
Receiving and transmitting signal is carried out during related frequency range.This means the priority of secondary user's will be less than primary user.So when frequency spectrum accesses,
Secondary user's must be before being transmitted, and perception, which whether there is primary user, is used the frequency spectrum.Because substantial amounts of potential channel is deposited
Secondary user's can select multi-channel transmission.This technology is referred to as multichannel cognition Access Control.
Secondary user's select a channel to be perceived first, start transmission signal if channel idle, if channel is occupied
Keep silent within a period of time with then, without transmitting and perceiving.On the other hand, secondary user's can be perceived continuously in order
Channel, untill idle channel is perceived.In this context, when channel-aware order and related stopping rule (stop
Only perceive and when start transmission signal) it is very necessary.
In the case of multiuser distributed perception, there can be multiple secondary user's while to detect the channel not primary
Family uses and determines to access the situation of the channel simultaneously, causes to conflict, so needing to formulate different perception according to different user
With stopping strategy.
At present, most of research about cognitive radio perceptual strategy mainly single secondary user's perception sequentially and its
Correlation stop strategy, and pure strategy centralization perceive etc..And for the distributed perceptual strategy research of multi-user
That carries out is less, and the general method using exhaustive search carries out the formulation of perceptual strategy at present, more and potential in secondary user's
When available channel is more, algorithm complex is high, poor practicability.
The content of the invention
In view of this, the invention provides a kind of multiuser channel cognitive method applied to cognitive radio, Neng Goushi
The channel-aware of existing multiple secondary user's, and secondary user's collision probability is low, system average throughput is high, system complexity is low,
And performance comparable intends Brute-force search algorithm.
The multiuser channel cognitive method applied to cognitive radio networks of the present invention, the network include m secondary
User, N number of potentially useful channel, N ＞ ＞ m, m >=2, channel-aware method comprise the following steps：
Step 1, the probability all potentially useful channels not used by it in a time slot by primary user, from greatly to
It is small to be ranked up and number；
Step 2, m channel before perception, including following sub-step：
Step 2.1, for preceding m channel S1,S2,...Sm, each secondary user's be respectively adopted the method for exhaustion obtain be possible to
Channel-aware order, each secondary user's has m！Kind channel-aware order；Calculate the secondary under each channel-aware order
User throughput；
Step 2.2, respectively from the m of each secondary user's！One is arbitrarily selected in kind channel-aware order to be combined, altogether
There is (m！)mKind combination, calculates the system average throughput under each combination, and the system average throughput is m times under the combination
The secondary user's handling capacity summation of level user；
Step 2.3, find and combined corresponding to maximum system average throughput, the channel of each secondary user's corresponding to the combination
Perceive sequential combination AmBmCmDm... it is the optimal perception sequential combination of the preceding m channel of m secondary user's；Wherein, AmFor with
The optimal perception order of the preceding m channel at family 1, BmFor user 2 preceding m channel optimal perception order, the like；
Step 3, the m+1 channel, including following sub-step are perceived：
Step 3.1, each secondary user's are respectively by channel Sm+1Add the optimal perception of this secondary user's obtained to step 2
In order, and keep original m channel S1,S2,...SmRelative perceptual ordinal position it is constant, each secondary user's has m+
1 kind of channel-aware order；Calculate the secondary user's handling capacity under each channel-aware order；
Step 3.2, one is arbitrarily selected from the m+1 kind channel-aware orders of each secondary user's respectively to be combined,
Shared (m+1)mKind combination；Calculate the system average throughput under each combination；
Step 3.3, find and combined corresponding to maximum system average throughput, the channel of each secondary user's corresponding to the combination
Perceive sequential combination Am+1Bm+1Cm+1Dm+1... it is the optimal perception sequential combination of the preceding m+1 channel of m secondary user's；Its
In, Am+1For the optimal perception order of the preceding m+1 channel of user 1, Bm+1Optimal perception for the preceding m+1 channel of user 2 is suitable
Sequence, the like；
Step 4, in the way of step 3, perceive successively m+2, m+3 ..., N number of channel, finally obtain m is secondary
The optimal perception sequential combination of N number of channel of user is the channel-aware order of N number of channel of m final secondary user's
ANBNCNDN…；Wherein, ANFor the optimal perception order of N number of channel of user 1, BNOptimal perception for N number of channel of user 2 is suitable
Sequence, the like.
Beneficial effect：
(1) present invention concentrates the perceptual strategy for formulating multiple level user by telegon, reduces multiple secondary user's hairs
The probability of raw conflict, adds system average throughput.
(2) compared with traditional exhaustive search algorithm, in the case where only losing the cost of fraction performance, more secondary user's point are reduced
The complexity of cloth perceptual strategy.The computation complexity of traditional exhaustive search algorithm is O ((N！)m), and increment proposed by the present invention
The complexity of algorithm is only
Brief description of the drawings
Fig. 1 is the inventive method flow chart.
Fig. 2 is the structure of time slot of perceptive mode of the present invention.
Embodiment
The present invention will now be described in detail with reference to the accompanying drawings and examples.
The invention provides a kind of multiuser channel cognitive method applied to cognitive radio, secondary use is being greatly reduced
On the premise of family collision probability, lifting system average throughput, performance comparable intends Brute-force search algorithm, and complexity is low, can use
Perceived in how secondary user distribution formula.
Energy and feature detection are two kinds of main flow cognitive methods.A channel is perceived in energy measuring method normally only to be needed not
To 1ms time, and feature detection is then needed more than 20ms.Because each user needs in each time slot continuously to perceive multiple letters
Road, so the present invention is only applicable to the sensing network using energy detection method.
Consider a kind of cognition network containing a telegon and m secondary user's.Assuming that the potentially useful channel set of network
For S (S={ s1,s2,...,sN, N ＞ ＞ m, m >=2), each user can once perceive a channel, and have the perception of oneself suitable
Sequence.Such as：The perception order of user 1 passes through (a1,a2,...,ak,...,aN) represent, the perception order of user 2 passes through (b1,
b2,...,bk,...,bN) represent etc..Wherein subscript k represents the perceived position of channel, i.e. akRepresent what user 1 need to perceive for k-th
Channel, bkK-th of the channel that need to be perceived of user 2 is represented, by that analogy.
Whole sensing network assumes stringent synchronization, while perceptive mode uses structure of time slot, i.e., signal is perceived and transmitted
A length of t multiple time slots when total time is divided into.It is as shown in Figure 2 to perceive structure of time slot.In FIG. 2, it is assumed that user is perceiving
The free time is found during k-th of channel, then using the remaining time of the time slot in k-th of channel transmission data.It is used to feel in time slot
Know that the time of each channel is represented with τ.Each time slot, which includes, perceives part (maximum N × τ) and hop (minimum t-N × τ).
If a user completes to perceive in k-th of channel, sense part is divided into k τ, and hop is t-k τ.Time slot efficiency is by transmitting
The percentage that part accounts for whole time slot represents.When a user completes to perceive in k-th channel, then time slot efficiency ckFor
ck=(t-k τ)/t (1)
In each time slot, each channel only exist entirely taken by primary user, entirely taken by secondary user's or not by
Take three kinds of situations.By that in advance to the characteristic of channel and primary user to prior informations such as the use habits of the channel, can obtain one
Channel s in individual time slotiThe probability not used by primary userFor each channel, primary user is at certain
The state of individual time slot is independently of other time slots, also independently of other channels.
In channel set S, channel according toSize is ranked up numbering, i.e.,：
Each secondary user's perceive, until looking for when each time slot starts according to respective perception order to channel
To idle channel.If certain secondary user's determines to access some channel, claim the user in the channel " stopping ".Each secondary use
Family is required to channel perception in each time slot and selects some idle channel transmission signal.If some secondary user's determines to stop
Some channel is terminated in, the secondary user's will select corresponding speed R transmission signals.
The present invention is perceived as starting point with how secondary user collaborative, considers the computational complexity of telegon, makes do not losing
On the premise of a large amount of performances, the computation complexity of cognitive method, the channel-aware method tool of multiple secondary user's are reduced as far as possible
Body is realized by following steps：
Step 1：For all m secondary user's, preceding m channel-aware takes traditional Brute-force search algorithm.Due to channel
1 to channel m primary user's free time probability is (respectively) maximum, so potentially useful channel set is { s1,
s2,...,sm}.If a user completes to perceive in k-th of channel, the data throughout U of a secondary user's is definedkFor one
The information bit that individual time slot can transmit, i.e.,：
Uk=Rck (2)
For each secondary user's, the perception of its all possible preceding m channel is obtained sequentially using the method for exhaustion.
By taking secondary user's 1 as an example, all possible perception order of its preceding m channel is respectively (s1,s2,s3...,sm), (s2,s1,
s3...,sm), (s1,s3,s2...,sm),…,(sm,sm-1,sm-2...,s1), common (m！) kind order.Then correspond to secondary user's 1
The first perception order (s1,s2,s3...,sm), the now handling capacity U of secondary user's 11_1For：
Corresponding to second of perception order (s of secondary user's 12,s1,s3,s4,...,sm), now secondary user's 1 are handled up
Measure U1_2For：
Corresponding to the third perception order (s of secondary user's 11,s3,s2,s4,s5...,sm), now secondary user's 1 gulp down
The amount of telling U1_3For：
The like, obtain the handling capacity U of secondary user's 1 corresponding to all possible perception order of secondary user's 11_1,
U1_2,...,U1_(m！)。
Similarly, secondary user's handling capacity corresponding to all perception orders of each secondary user's is obtained.
System average throughput is the summation of m secondary user's handling capacity, shares (m！)mKind situation, corresponding each secondary use
Secondary user's handling capacity combination corresponding to the difference perception order of family, i.e.,
Utol_1=U1_1+U2_1+...+Um_1
Utol_2=U1_1+U2_1+...+Um_2
After calculating and comparison to system average throughput, maximum system average throughput U can be obtainedtol_x, you can obtain
Obtain each secondary user's handling capacity U corresponding to maximum system average throughput1_i,U2_j,...Um_w, and then find corresponding each time
The perception sequential combination of level user, is designated as： As m times
The optimal perception sequential combination of the preceding m channel of level user.
Due to using traditional Brute-force search algorithm, in epicycle perception, computation complexity is O ((m！)m)。
Step 2：Perceive the m+1 channel.It can be obtained by step 1, the optimal perception sequential combination of preceding m channel isRemember under the optimum combination, the preceding m channel-aware order of user 1 is Am=(a1,a2,
a3,...am), the preceding m channel-aware order of user 2 is Bm=(b1,b2,b3,...,bm), by that analogy.Next need to increase
Add channel Sm+1To AmIn, while keep original m channel S1,S2,...SmRelative perceptual ordinal position it is constant.Then adding
Channel Sm+1Afterwards, new perception order isWherein, A' has m+1 kind situations, i.e. (sm+1,a1,
a2,...,am),(a1,sm+1,a2,...,am),...,(a1,a2,...,am,sm+1).Equally, B' also has m+1 kind situations (sm+1,
b1,b2,...,bm),(b1,sm+1,b2,...,bm),...,(b1,b2,...,bm,sm+1), the like.
Calculate each secondary user's and add channel Sm+1Afterwards, secondary user's corresponding to all possible perception order are handled up
Amount.Exemplified by 1, A' the first perception order (sm+1,a1,a2,...,am) corresponding to secondary user's handling capacity be
A' second of perception order (a1,sm+1,a2,...,am) corresponding to handling capacity be
The like, obtain user 1 and add channel Sm+1Afterwards, it is secondary corresponding to all possible perception order A' to use
Family handling capacity UA'_1,UA'_2,...,UA'_m+1, common (m+1) kind.
Similarly, all secondary user's are obtained and are adding channel Sm+1Afterwards, it is secondary corresponding to all possible perception order
User throughput.
Due to there are m secondary user's, therefore there is (m+1)mThe possible perception combination of kind (A', B' ...).
The system average throughput under all perception combinations (A', B' ...) is calculated, i.e.,：
Utol_1=UA'_1+UB'_1+UC'_1+UD'_1+...
Utol_2=UA'_2+UB'_1+UC'_1+UD'_1+...
Utol_3=UA'_3+UB'_1+UC'_1+UD'_1+...
After calculating and comparison to system average throughput, maximum system average throughput U can be obtainedtol_y, you can obtain
Each secondary user's handling capacity corresponding to maximum system average throughput is obtained, and then the perception for finding corresponding each secondary user's is suitable
Sequence combines, and is designated as：For the preceding m+1 of m secondary user's
The optimal perception sequential combination of individual channel.
The computation complexity that then epicycle perceives is O ((m+1)m)。
Step 3：In the way of step 2, perceive successively m+2, m+3 ..., N number of channel.
Wherein, when perceiving j-th of channel, the computation complexity that the wheel perceives is O (jm), j=m+2, m+3 ..., N.
Finally, the perception order that can obtain all N number of potentially useful channels is：
Then the computation complexity of inventive algorithm is
Step 4：The perception order for N number of potentially useful channel that each secondary user's obtain according to step 3Distributed perception is carried out, and is carried out data transmission.
If multiple secondary user's detect the channel and are not used by primary user and determine to access the channel simultaneously simultaneously, with
Lower three kinds of situations will produce：
Situation 1：Failure simultaneously perceives again：Each user utilizes same compensation mechanism, to avoid possible conflict.1
Secondary user's, which have been won, to be competed and utilizes time slot remaining time transmission signal.Remaining secondary user's continues according to original perception order
Perceive other channels.
Situation 2：Fail and exit：Similar to situation 1, multiple secondary user's use certain compensation mechanism to avoid conflicting.
Wherein 1 secondary user's, which are won, to be competed and utilizes time slot remaining time transmission signal.And other secondary user's are in this timeslot not
Perceived again and transmission signal, " exited " time slot.The situation does not have practical significance, enters as just a kind of extreme case
Row compares.
Situation 3：Conflict.There is no compensation mechanism.When multiple secondary user's at the same time it is wished that stopping same channel (multiple secondary use
Family detects the channel and is not used by primary user and determine to access the channel simultaneously) when, multiple secondary user's utilize the channel
Data are transmitted, lead to a conflict generation, and final no user can utilize the channel.
Simulating scenes assume that number of users is 2,7 potentially useful channels (N=7), time slot duration t=1, Mei Gexin be present
Road detecting period τ=0.1.Channel i primary user's free time probability is θi=0.05 × κi, wherein κiIt is a regulation coefficient.For
The scene, is implemented as follows.
Embodiment 1, κiFor even number and 2≤κ1≤ 18,2≤κ2≤κ1, 2≤κ3≤κ2And 0≤κi≤κi-1, i=4,5,6,7,
Then wherein θi∈[0,0.9]。
Embodiment 2,10≤κ7≤κ6≤κ5...≤κ1≤ 18, then wherein θi∈[0.5,0.9]。
Embodiment 3,1≤κ7≤κ6≤κ5...≤κ1≤ 10, then wherein θi∈[0.05,0.5]。
In each case, the maximum system average throughput obtained by exhaustive search method is by ToptRepresent, and by this
The system average throughput invented obtained by the delta algorithm proposed is Tincremental, the relative mistake of the two performance is away from being defined as
(Topt-Tincremental)/Topt。
Telegon carries out the formulation of perception order using abovementioned steps and Fig. 1 algorithm flow charts, and each secondary user's are according to most
The optimal perception order obtained eventually carries out distributed perception, and carries out data transmission.
Table 1 is the result of implementation in the case of various.It can be seen that the relative performance gap of inventive algorithm and exhaustive search
Method is very nearly the same, and complexity is thenMuch smaller than the O ((N of exhaustive search method！)m)。
Table 1
In summary, presently preferred embodiments of the present invention is these are only, is not intended to limit the scope of the present invention.
Within the spirit and principles of the invention, any modification, equivalent substitution and improvements made etc., it should be included in the present invention's
Within protection domain.
Claims (1)
1. a kind of multiuser channel cognitive method applied to cognitive radio networks, the network includes m secondary user's, N
Individual potentially useful channel, N ＞ ＞ m, m >=2, it is characterised in that comprise the following steps：
Step 1, the probability all potentially useful channels not used by it in a time slot by primary user, enters from big to small
Row sorts and numbered；
Step 2, preceding m channel in the potentially useful channel obtained in step 1, including following sub-step are perceived：
Step 2.1, for preceding m channel S1,S2,...Sm, each secondary user's are respectively adopted the method for exhaustion and obtain all possible letter
Road perception order, each secondary user's have m！Kind channel-aware order；Calculate the secondary user's under each channel-aware order
Handling capacity；
Step 2.2, respectively from the m of each secondary user's！One is arbitrarily selected in kind channel-aware order to be combined, and is shared
(m！)mKind combination, calculates the system average throughput under each combination, and the system average throughput is m secondary under the combination
The secondary user's handling capacity summation of user；
Step 2.3, find and combined corresponding to maximum system average throughput, the channel-aware of each secondary user's corresponding to the combination
Sequential combination AmBmCmDm... it is the optimal perception sequential combination of the preceding m channel of m secondary user's；Wherein, AmFor user's 1
The optimal perception order of preceding m channel, BmFor user 2 preceding m channel optimal perception order, the like；
Step 3, the m+1 channel, including following sub-step are perceived：
Step 3.1, each secondary user's are respectively by channel Sm+1Add the optimal perception order of this secondary user's obtained to step 2
In, and keep original m channel S1,S2,...SmRelative perceptual ordinal position it is constant, each secondary user's has m+1 kinds
Channel-aware order；Calculate the secondary user's handling capacity under each channel-aware order；
Step 3.2, arbitrarily select one from the m+1 kind channel-aware orders of each secondary user's respectively to be combined, share
(m+1)mKind combination；Calculate the system average throughput under each combination；
Step 3.3, find and combined corresponding to maximum system average throughput, the channel-aware of each secondary user's corresponding to the combination
Sequential combination Am+1Bm+1Cm+1Dm+1... it is the optimal perception sequential combination of the preceding m+1 channel of m secondary user's；Wherein, Am+1
For the optimal perception order of the preceding m+1 channel of user 1, Bm+1For user 2 preceding m+1 channel optimal perception order, successively
Analogize；
Step 4, in the way of step 3, perceive successively m+2, m+3 ..., N number of channel, the m secondary user's finally obtained
N number of channel optimal perception sequential combination be m final secondary user's N number of channel channel-aware order
ANBNCNDN…；Wherein, ANFor the optimal perception order of N number of channel of user 1, BNOptimal perception for N number of channel of user 2 is suitable
Sequence, the like.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610086790.9A CN105721082B (en) | 2016-02-16 | 2016-02-16 | A kind of multiuser channel cognitive method applied to cognitive radio |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610086790.9A CN105721082B (en) | 2016-02-16 | 2016-02-16 | A kind of multiuser channel cognitive method applied to cognitive radio |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105721082A CN105721082A (en) | 2016-06-29 |
| CN105721082B true CN105721082B (en) | 2018-01-16 |
Family
ID=56156791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610086790.9A Expired - Fee Related CN105721082B (en) | 2016-02-16 | 2016-02-16 | A kind of multiuser channel cognitive method applied to cognitive radio |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105721082B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080261639A1 (en) * | 2007-04-23 | 2008-10-23 | The Hong Kong University Of Science And Technology | Cluster-based cooperative spectrum sensing in cognitive radio systems |
| CN102457338A (en) * | 2011-11-09 | 2012-05-16 | 南京邮电大学 | Method for selecting multi-user sensing channel in cognitive sensor network |
| CN104202757A (en) * | 2014-08-19 | 2014-12-10 | 昆明理工大学 | Performance optimization detection method of cognitive radio network |
-
2016
- 2016-02-16 CN CN201610086790.9A patent/CN105721082B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080261639A1 (en) * | 2007-04-23 | 2008-10-23 | The Hong Kong University Of Science And Technology | Cluster-based cooperative spectrum sensing in cognitive radio systems |
| CN102457338A (en) * | 2011-11-09 | 2012-05-16 | 南京邮电大学 | Method for selecting multi-user sensing channel in cognitive sensor network |
| CN104202757A (en) * | 2014-08-19 | 2014-12-10 | 昆明理工大学 | Performance optimization detection method of cognitive radio network |
Non-Patent Citations (1)
| Title |
|---|
| Multi-Channel Selection Maximizing Throughput;Luca Zappaterra等;《IEEE》;20141230;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105721082A (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2755157C1 (en) | Apparatus and method for configuring arrigental access, apparatus and method for random access and base station | |
| CN107947878B (en) | Cognitive radio power distribution method based on energy efficiency and spectrum efficiency joint optimization | |
| CN106656374A (en) | Cooperative broadband spectrum sensing method based on double-threshold energy detection | |
| CN106658422A (en) | Network side positioning method and network side positioning system for aiming at high-sparse WiFi data | |
| TR201815509T4 (en) | Frame structures for wireless communication systems. | |
| CN101729164B (en) | Wireless resource allocation method and cognitive radio user equipment | |
| CN108811138A (en) | The method and apparatus of transmission control information | |
| US20100065728A1 (en) | Apparatus and method for setting group of sensor node | |
| CA2127606A1 (en) | Code-division multiple-access mobile telephone system | |
| CN105978644B (en) | Star based on cuckoo searching algorithm ground cognitive system frequency spectrum access method | |
| CN102036389A (en) | Multichannel diversity-based cognitive medium access control realizing method | |
| Liao et al. | A handshake based ordered scheduling MAC protocol for underwater acoustic local area networks | |
| CN106961404A (en) | A kind of transmission signal processing method and processing device | |
| CN105721082B (en) | A kind of multiuser channel cognitive method applied to cognitive radio | |
| CA2077332A1 (en) | Method and apparatus for accommodating a variable number of communication channels in a spread spectrum communication system | |
| GB2351422A (en) | Association of a training code to a channelisation code in a mobile telecommunications system | |
| CN106533592A (en) | Multi-service data communication method and communication system for underwater acoustic network | |
| CN105898873A (en) | Data frame distribution method and device and data transmission method and device | |
| CN109219055A (en) | A kind of primary user's duty rate estimation | |
| NO20025478L (en) | Change of transmission speed in a telecommunications system | |
| JP6034510B2 (en) | Improvements to active signaling in cognitive wireless communication networks | |
| CN106911367A (en) | The extensive mimo channel method of estimation of multiple cell and device based on iterative interference cancellation | |
| US11144589B2 (en) | Object search server, system having same and used to search for object based on color-sentiment, and method thereof | |
| CN108900265A (en) | Full duplex cognitive radio networks method for channel allocation based on matching game | |
| CN112073976A (en) | User general grouping method in non-orthogonal multiple access based on machine learning |
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: 20180116 Termination date: 20220216 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |