CN104394534B - A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query - Google Patents
A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query Download PDFInfo
- Publication number
- CN104394534B CN104394534B CN201410625162.4A CN201410625162A CN104394534B CN 104394534 B CN104394534 B CN 104394534B CN 201410625162 A CN201410625162 A CN 201410625162A CN 104394534 B CN104394534 B CN 104394534B
- Authority
- CN
- China
- Prior art keywords
- cognitive user
- user
- cooperative
- cooperating
- packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query, include a pair of primary users and some cognitive users pair in cooperative cognitive wireless network, primary user is used as relaying by recruiting cognitive user, assist to complete to authorize communication, and cooperated by managing, coordinate the access of other non-cooperating cognitive users by cooperative cognitive user, form the two-stage centre management structure being made up of primary user and cooperative cognitive user.The present invention devises the selection of cooperative cognitive user, renewal, and the Data Transmission Controlling with different priorities, can realize that the dynamic of polytype node, high-efficiency frequency spectrum are shared in the case where business randomness is relatively strong.
Description
Technical field
The present invention relates to mobile communication technology field, and in particular to a kind of two-stage center cooperation frequency based on priority query
Compose shared mechanism.
Background technology
With the fast development of wireless communication technology, unassigned frequency spectrum is fewer and fewer, the problem of frequency spectrum resource shortage
Increasingly highlight.At the same time, according to FCC (Federal Communications Commission,
FCC survey report) shows that below 3GHz frequency spectrum service efficiency is in the range of 15%~85%, and 3-6GHz frequency spectrum is sharp
With rate less than 0.5%, the total availability of frequency spectrum of various wireless systems is below 10%.Relative to limited frequency spectrum resource, low frequency
Spectrum utilization rate causes the serious wasting of resources.Cognitive radio (Cognitive radio, CR) has good prospect as one
Dynamic spectrum technology of sharing, can effectively solve the problem that above-mentioned contradiction, receive extensive concern in recent years.
In the cognitive communications of reality, primary user's emitter PTIts destination node of potential range PRFarther out, or sending and receiving end it
Between link stopped by building and signal undergoes deep fading etc., so as to cause link-quality can not support PTTo PRIt is straight
Connect letter.Document K Letaief, Z Wei.Cooperative communications for cognitive radio
networks[J].Proceedings of the IEEE,2009,97(5):878-893 (lead to by the cooperation of cognitive radio networks
Letter) in point out, primary user can recruit qualified cognitive user, and as relaying auxiliary, its completes communication.Used as to cognition
Family provide assist return, primary user permit cognitive user use a part of communication resource, as the time slot in time domain shared mechanism,
Channel in frequency domain shared mechanism etc., to complete cognition transmission.Above-mentioned scene is referred to as cooperative cognitive wireless network
(Cooperative Cognitive Radio Networks, CCRN), by designing corresponding cooperation transmission mechanism, Ke Yigai
The communication quality of philanthropist user, while cognitive user is obtained communication opportunity.
Although such scheme can realize that master secondary user asks to the efficiently shared of the communication resource, but still in the presence of some
Topic.First, the data of master secondary user send the moment for being limited in transmission cycle, and the randomness that business reaches may be led
Cause a part even All Time in certain stage idle, cause the wasting of resources.Secondly, existing cooperation transmission mechanism, which is only studied, awards
Resource-sharing between power user and the cognitive nodes for participating in cooperating, without reference to the resource point for the cognitive nodes for having neither part nor lot in cooperation
Match somebody with somebody, it is random and limited, the channel as return on the one hand to participate in the cognitive nodes quantity of cooperation and its business transmission demand
Access authority may not obtain making full use of for cooperative cognitive node, on the other hand, cooperation is largely had neither part nor lot in system but is had logical
The cognitive nodes of letter demand can not access the frequency spectrum of free time.
Document A Gamini, T Zahir, Z Panlop and A Zomaya.Performance analys is of
EDF schedul ing in a multi-priority preemptive M/G/1 queue[J].IEEE
Transactions on Parallel and D istributed Systems,2013,25(8):How preferential 2149-2158 is (
Level preemptive type M/G/1 queues EDF scheduling performance evaluation) in by traffic packets reach node behavior modeling be Poisson mistake
Journey, collaboration frequency spectrum sharing method is devised, and delay performance is analyzed with the M/G/1 queuing models with priority,
But in the solution in question, cooperative cognitive user assist primary user transmission after with the common competitive channel of other cognitive users,
There is no due return, it is for cooperative cognitive user and unfair.
The content of the invention
In view of the shortcomings of the prior art, the present invention is intended to provide a kind of two-stage center collaboration frequency spectrum based on priority query
Shared mechanism, solves the resource for not taking into full account cooperative cognitive node and non-cooperating cognitive nodes in existing frequency spectrum share scheme
Assignment problem, and realize that the dynamic of polytype node, high-efficiency frequency spectrum are shared in the case where business randomness is relatively strong.
To achieve these goals, the present invention adopts the following technical scheme that：
A kind of process of the two-stage center collaboration frequency spectrum shared mechanism based on priority query is as follows：
Step 1, selecting collaboration cognitive user, specifically comprise the following steps：
Step 1.1, primary user's emitter PTPeripherad cognitive user broadcast relay recruits request packet, and the packet includes
Primary user's receiver PRInformation；
Step 1.2, receive the request and be ready that the cognitive user for serving as relaying sends cooperation call request packet, it is logical at it
P is found in the range of letterR；
Step 1.3, P is worked asRAfter receiving the call request from least one relaying cognitive user, PRCarry out broadcast response；
Step 1.4, P can be receivedTRelaying recruit request and PRThe cognitive user of response possesses the condition of relaying, PTRoot
According to the Link State relevant with candidate cooperative cognitive user of acquisition, according to the criterion selecting collaboration that end-to-end data rate is maximum
Cognitive user；
Step 2, PTCarry out data transmission, mainly including PT→SrAnd Sr→PRTwo stages, the sequencing of the two are fixed
And recur, SrFor cooperative cognitive user；In the initial time of each time slot, as long as PTIt is grouped into and reaches, soon sends number
According to；
Step 3, cooperative cognitive user SrCarry out data transmission, first to PTPacket forwarded, then according to authorize industry
The occupancy situation being engaged in channel, carries out the transmission of its data；
Step 4, non-cooperating cognitive user carries out data transmission：As cooperative cognitive user SrDetect channel idle and itself
And during no data transmission, coordinate non-cooperating cognitive user access channel.
It should be noted that each cognitive user includes cognition transmitting node STWith cognition receiving node SR, as primary user to assist
Make the cognition transmitting node of cognitive userDuring as via node, data transfer includes
And4 types, signalling includeAccess request packet is sent,Access permission packet is fed back, wherein
For the cognition receiving node of cooperative cognitive user,WithCognition transmitting node and cognition for non-cooperating cognitive user receive
Node；When to recognize receiving nodeAs relaying, the return transmitted as assistance mandate business, withCorresponding cognition transmitting
NodeChannel access chance will be obtained, data transfer includes 4 types：AndSignalling includesWithAccess request packet is sent,Feed back access permission packet.
It should be noted that PTThe renewal of cooperative cognitive user can periodically be carried out：If PTWhen initiating renewal process
It was found that more preferable cooperative cognitive user, PTCurrent cooperative cognitive user is notified to release cooperation relation, then according to the side of step 1
Method selects new cooperative cognitive userAnd establish contact.
It should be noted that cooperative cognitive user SrCan actively it release and PTCooperation relation, PTI.e. according to step after response
Rapid 1 initiates new cooperative cognitive user's selection course again, chooses new cooperative cognitive user
It should be further stated that current cooperative cognitive user SrBefore cooperation relation is released, that is safeguarded is non-
The telecommunication management record of cooperative cognitive user is sent to PT；In PTSelected cooperative cognitive userAfterwards, by PTThese information are turned
Issue selectedAfter the handing-over of management data is completed, SrExit；Broadcast transmission Hello is grouped, its coverage
After interior non-cooperating cognitive user receives the packet, added in the acknowledgment packet of return the numbering of node, node maintenance from
Body communications records；By the communications records of each non-cooperating cognitive user received and from PTForwarding telecommunication management record into
Row compares, and the node entries not having in management database are increased, the nodes records with identical ID are updated.
It should be noted that cooperative cognitive user S in step 4rWhen detecting channel idle and itself and no data transmission,
It is the access protocol based on request license difference to coordinate non-cooperating cognitive user access channel, and the agreement particular content is as follows：
1) each cognitive user safeguards 1 variableRepresent cognitive user send access request packet number with
The difference of the access permission packet number received；SrSafeguard all cognitive users
2) non-cooperating cognitive user i updates its variableNon-cooperating cognitive user i sends an access request packet,
Its variableAdd 1；Non-cooperating cognitive user i is from SrPlace obtains an access permission packet, its variableSubtract 1；
3) cooperative cognitive user SrMore new variablesAs cooperative cognitive user SrReceive and come from non-cooperating cognitive user i
Access request packet, then it is corresponding with non-cooperating cognitive user iAdd 1；As cooperative cognitive user SrRecognize to non-cooperating
Know that user i returns to an access permission packet, then it is correspondingSubtract 1；
4) non-cooperating cognitive user i is to cooperative cognitive user SrWhen asking channel, the variable safeguardedSeal together
Sent in access request packet, cooperative cognitive user SrThe information that will be receivedWith the information of self maintainedEnter
Row compares, if not what cooperative cognitive user i was reportedWith SrSafeguard correspondingDifference exceedes thresholding θthWhen, cooperation is recognized
Know user SrRequest to non-cooperating cognitive user i is refused, and is selected from effective requestMaximum non-cooperating is recognized
Know user, current idle time slot is distributed into the user.
The beneficial effects of the present invention are：
1st, it can be very good solve cooperative cognitive node and the resource allocation problem of non-cooperating cognitive nodes, and in business
Realize that the dynamic of polytype node, high-efficiency frequency spectrum are shared in the case that randomness is relatively strong；
2nd, the data transfer of different type user in cooperative cognitive wireless network is considered, and devises one kind and is based on asking
The access protocol of license difference is sought, ensure that cooperative cognitive user shares with non-cooperating cognitive user to the dynamic of the communication resource；
3rd, influence of the dynamic characteristic of network topology and communication process to system is considered, primary user can periodically initiate
Relay selection process detects to channel, when find more preferable cooperative cognitive user be present when, then with current cooperative cognitive
User releases cooperation relation, and establishes and contact with new cooperative cognitive user；Current cooperative cognitive user can also actively solve
Except the cooperation relation with primary user, current cooperative cognitive user sends the request for releasing cooperation relation, primary user to primary user
New relay selection process is initiated after response immediately, so can when network topology structure and communication process change,
Preferable data transmission performance is ensured by the renewal of cooperative cognitive user.
Brief description of the drawings
Fig. 1 is the implementation process diagram of the present invention；
Fig. 2 is that the present invention is used as the data transfer and signalling when relaying using the cognition transmitting node of cooperative cognitive user
Analysis chart；
Fig. 3 is that the present invention is used as the data transfer and signalling when relaying using the cognition receiving node of cooperative cognitive user
Analysis chart；
Fig. 4 is the theoretical value that the average waiting delay of primary user of the present invention changes with its packet arrival rate and analog simulation
Comparative result figure；
Fig. 5 is the theoretical value and simulation that the average waiting delay of cooperative cognitive user of the present invention changes with its packet arrival rate
The comparative result figure of emulation；
Fig. 6 is the theoretical value and mould that the average waiting delay of non-cooperating cognitive user of the present invention changes with its packet arrival rate
Intend the comparative result figure of emulation.
Embodiment
Below with reference to accompanying drawing, the invention will be further described, it is necessary to which explanation, the present embodiment is with this technology side
Premised on case, detailed implementation steps and operating process are given, but protection scope of the present invention is not limited to the present embodiment.
The operation principle of the present invention：
The present invention is suitable for cooperative cognitive wireless network, including a pair of primary users and some cognitive users pair, primary user
(PU) emitter PTIts destination node of potential range PRFarther out, the link or between sending and receiving end is by building stop and signal
Deep fading etc. is undergone, so as to cause link-quality can not support PTTo PRDirect communication.When transmitting data, PU possesses highest
Priority, cooperative cognitive user (CSU) SrTake second place, the priority of non-cooperating cognitive user (NCSU) is minimum, and wherein CSU is responsible for association
NCSU communication is adjusted, and permits poor access protocol to ensure the fairness of NCSU access channels based on request.Secondly, PTCan
Periodically to carry out relay selection process, work as PTIt was found that when preferably relaying be present, PTNotify current via node
Release cooperation relation, then with new relayingContact is established, current CSU can also actively release the pass that cooperates with PU
System.
As shown in figure 1, the two-stage center collaboration frequency spectrum shared mechanism based on priority query comprises the following steps：
The first step, choose CSU.Primary user's emitter PTPeripherad cognitive user broadcast relay recruits request packet, should
Packet includes primary user's receiver PRInformation.Receive the request and be ready that the cognitive user for serving as relaying sends cooperation calling
Request packet, P is found in its communication rangeR.Work as PRAfter receiving the call request from cognitive user (being probably multiple), PR
Carry out broadcast response.P can be receivedTRelaying recruit request and PRThe cognitive user of response possesses as the condition of relaying, PTRoot
According to the Link State relevant with candidate cooperative cognitive user of acquisition, CSU is chosen according to the maximum criterion of end-to-end data rate；
Second step, PU data transfer.In the initial time of each time slot, as long as PTIt is grouped into and reaches, soon sends.
Authorizing the transmission of packet includes PT→SrAnd Sr→PRTwo stages, the sequencing of the two are fixed and recurred, SrFor CSU；
3rd step, CSU data transfer.SrFirst to PTPacket forwarded, then according to authorize business to channel
Occupancy situation, attempt the transmission of its data；
4th step, NCSU data transfer.NCSU has minimum priority, if SrDetect channel idle and oneself
Also when no data is sent, NCSU access channels are coordinated according to the access protocol of difference is permitted based on request；
The access protocol based on request license difference is as follows：Each cognitive user safeguards 1 variableExpression is recognized
Know that user sends the difference of the number and the access permission received packet (AGP) number of access request packet (ARP), the value is bigger
Show that the experience of user is poorer.SrSafeguard all cognitive users
NCSU updatesProcess be：Node i sends an ARP,Add 1；Node i is from SrPlace obtains one
AGP,Subtract 1.SrRenewalRule it is similar therewith, work as SrReceive the ARP from node i, then it is corresponding with the nodeAdd 1, work as SrAn AGP is returned to node i, thenSubtract 1.In addition, defining node i is to Sr, will when asking channelEncapsulate and send in arp together, SrBy the information received compared with the information of self maintained, for reporting of user
Value and SrThe difference of maintenance value exceedes thresholding θthUser's request refused, and selected from effective requestMaximum
User, current idle time slot is distributed into the user.
In the present invention, selection of the primary user as first order centre management via node, cooperative cognitive user is as
Secondary center, the orderly access of other non-cooperating cognitive users is also responsible for while middle sublicense business.
The cooperative cognitive wireless network of the present invention, including a pair of primary user PTAnd PR, in primary user's emitter PTAnd primary user
Receiver PRBetween direct communication link is not present.Each cognitive nodes have unique mark (ID).The communication of all nodes
(including signal is sent with receiving) radius is equal, it then follows strict slot synchronization structure, node are grouped into up to the independent pool of obedience
Pine distribution.Slot length is set as the transmission time of a packet, and packet can only be transmitted in time slot section start, all nodes
Data packet size it is identical.Control signaling is transmitted by independent low-rate channel.All nodes use half-duplex operation mould
Formula, the topological structure of network is relatively stable, and channel has quasistatic feature.In PTAnd PRIt is overlapping covered it is interior exist
Cognitive nodes, they meet as the primary condition of relaying, i.e., to PTAnd PRIt is reachable.Fig. 2 is to recognize transmitting node in
After situation, Fig. 3 is to recognize situation of the receiving node as relaying, and solid line represents data transfer, dotted line expression signaling in figure
Transmission.
As shown in Fig. 2 each cognitive user includes cognition transmitting node and cognition receiving node, if recognizing with CSU
Know transmitting nodeAs relaying, three circles from left to right represent primary user's emitter P respectivelyT, relaying cognition transmitting section
PointPrimary user's receiver PRCommunication range, the communication radius of three is equal.Cognitive user (SU) in region I can be examined
Measure PTTransmission, can be used as relaying, region NCSU launch (such as) can disturbReception comes from PTSignal and PR
Reception comes fromInterim signal.SU in region II is able to detect that PTTransmission, and be located atCoverage in, the area
The SU transmitting meetings pair in domainReception comes from PTSignal interfere.SU in region III is not directly detected PTTransmission, its
Communication is (such as) can disturbReceive PTInformation andTo PRTransfer authorization data.NCSU in region IV can be rightReception comes from PTSignal produce interference.PTAs first order center from region II selecting collaboration cognitive userMake
The non-cooperating cognitive nodes in its overlay area are managed and coordinated for second level center, to avoid SU to authorizing communication
Interference.
With CSU cognition transmitting nodeData transfer includes 4 types during as relaying：
AndWhereinFor withCorresponding CSU cognition receiving node,WithFor the cognition of non-cooperating cognitive user
Transmitting node and cognition receiving node.As shown in Figure 2, the data transfer of primary userWithIt is preferential for highest
LevelThe data transfer of cooperative cognitive userPriority take second place, be middle priorityNon-cooperating cognitive user
Data transferAndPriority it is minimum, be low priority
In fig. 2, signalling includes NCSU transmission access request packet ARP and CSU feedback access permission packets AGP.During transfer primary user's business, its own, which may also be grouped into, reaches.WhenRelaying work after the completion of,To letter
Road is detected, if primary user does not have new data relay requirement, i.e. channel idle,The biography of its data can directly be carried out
It is defeated.In this course, if NCSU (such as S1) be grouped into and reach, its cognition transmitting node is (such as) toSend ARP.When
The packet end of transmission, and detect channel idle, simultaneouslyReceive and come fromARP,ToReturn to AGP, S1Under
One time slot sends the packet of oneself.
If as shown in figure 3, to recognize receiving nodeAs relaying, three circles from left to right represent primary respectively
Family emitter PT, relaying cognition receiving nodePrimary user's receiver PRCommunication range, the communication radius of three is equal.Close
It is identical with Fig. 2 in the discussion of different zones.The return transmitted as assistance mandate business, withCorresponding cognition transmitting nodeChannel access chance will be obtained, data transfer includes 4 types： And
Similarly, the data transfer of primary userWithFor limit priorityThe data transfer of cooperative cognitive userPriority take second place, be middle priorityThe data transfer of non-cooperating cognitive userWith
AndPriority it is minimum, be low priority
In figure 3, signalling include NCSU andSend access request packet ARP and CSU feedback access permissions point
Group AGP.During transfer primary user's business, its own, which may also be grouped into, reaches.WhenRelaying work after the completion of,Channel is detected, if primary user does not have new data relay requirement, i.e. channel idle, andReceive and come from's
ARP, then recognize receiving nodeAGP can be returned to notifyData transmission can be started.In this course, if NCSU (such as
S1) be grouped into and reach, its cognition transmitting node is (such as) toSend ARP.WhenThe packet end of transmission, andInspection
Channel idle is measured, simultaneouslyReceive and come fromARP,ToReturn to AGP, S1Point of oneself is sent in next time slot
Group.
In addition, PTRelay selection process is periodically initiated, the selection of the duration depends on the change of channel, becomes for fast
Channel, the relaying update cycle should be shorter, to obtain the preferable transmission performance being adapted with channel variation, becomes channel for slow, in
Should be larger after the update cycle, reduce overhead while transmission performance is not lost.Work as PTIt was found that when preferably relaying be present,
PTNotify current via node to release cooperation relation, then with new relayingEstablish contact.Current CSU can also be actively
The cooperation relation with PU is released, current CSU is needed actively to PTSend the request for releasing cooperation relation, PTInitiated immediately after response
New relay selection process.
With CSU renewal, its NCSU managed also changes therewith, therefore provides current cooperative cognitive user SrSolving
Before cooperation relation, the NCSU safeguarded telecommunication management record is sent to PT, then by PTThese information are transmitted to selectedAfter the handing-over of management data is completed, SrExit.Broadcast transmission Hello is grouped, and the NCSU in its coverage is received
After the packet, numbering, the self communication record of node maintenance of node, secondary administrative center are added in the acknowledgment packet of return
The information such as NCSU fair, orderly access can be realized according to these records.By each NCSU received communications records and from
PTThe telecommunication management record of forwarding is compared, and is increased managing the node entries that do not have in database, to
Identical ID nodes records are updated.In order to control the management database size that CSU is safeguarded, while can be active in view of NCSU
The entrance of state or the management for leaving secondary centre, it can be each user management record one life span of increase, remember every time
The replacement of record renewal triggering life span, is deleted the record more than life span.In order to simple, assume herein all
The personal record that NCSU is reported is genuine and believable, that is, the NCSU of deception or malice is not present.
The application effect of the present invention is described further by following emulation experiment：
Simulated conditions：Assuming that each cognitive user be grouped into up to independently of each other and obey Poisson distribution, make PU, CSU and
NCSU packet arrival rate is respectively λp、λcsAnd λncs.Time slot XsRepresent, and Xs=1/ μ.Ignore the processing delay of node.It is right
In PU, it, which is grouped transmission, includes two stages, is required to 1/ μ time, total service time is 2/ μ.For CSU, ignoring
In the case of the frequency spectrum detection time, the service time being each grouped is 1/ μ.For NCSU, its packet service time is also 1/ μ.
The theoretical value and the result of analog simulation that Fig. 4 changes for PU average waiting delay with its packet arrival rate are compared
Compared with.Average latency E (the W of primary user's packetp) include current group (time slot is occupied) when packet enters PU queues or stop
Average Time Remaining E (the R of vacation (time slot is idle)p) service time of PU packets for having been waited in queue with other it
With.Because using the time slot free time as having a holiday, the length of recess is 1/ μ.
UseThe average length of PU queues is represented, can be obtained：
Wherein, XpFor the service time of PU packets.Assuming that the channel utilization of primary user is ρp, there is ρp=λpXp.It can obtain
It is grouped into that the probability that other PU packet is being transmitted is run into after reaching is 2 λ to PUp/μ。
According to Little theorems, average queue length isIt can calculate：
Fig. 5 is the result progress of the theoretical value that CSU average waiting delay changes with its packet arrival rate and analog simulation
Compare.Average waiting delay E (the W of CSU packetscs) include following components：The current packet for receiving service is had a holiday
Average Time Remaining E (the R of phasecs), CSU be grouped into up to when PU queues in high priority packet average residual service timeWith the average residual service time length being grouped in CSU queuesAnd CSU is grouped in waiting process and reached
The λ of wait time delay 2 that brings of PU packetspE(Wcs)/μ.Following formula can be obtained：
In above formulaWithPU and CSU queue lengths are represented respectively.
Using Little theorems, it is readily obtainedWithE(Wcs) be calculated as follows：
Fig. 6 is the result progress of the theoretical value that NCSU average waiting delay changes with its packet arrival rate and analog simulation
Compare.NCSU average latency includes：The Average Time Remaining E of the current packet or recess for receiving service
(Rncs), NCSU be grouped into up to when PU queues in average residual service time for being groupedWhat is be grouped in CSU queues is averaged
Residual service timeWith the average residual service time being grouped in NCSU queuesAnd waited in NCSU packets
The wait time delay that the high priority packet reached in journey is brought.The average waiting delay expression formula of available NCSU packets is such as
Under：
Wherein,WithPU, CSU and NCSU queue length are represented respectively.Above formula equal sign right-hand member last two
Item then represents the PU reached in the NCSU packet stand-by period and increases the stand-by period newly caused by CSU packets respectively.
According to Little theorems,E(Wncs) meter
Calculate as follows：
It can be obtained by Fig. 4, PU wait time delay is with λpIncrease and increase, by carried mechanism can ensure PU highest
Priority, authorized transmissions are not influenceed by cognition business, and analog simulation and the calculated results fitting are accurate.It can be obtained by Fig. 5,
CSU wait time delay is with λcsIncrease and increase, the fitting of theoretical calculation and simulation results is accurate.Because primary user has
Highest priority, for the Σ λ of determinationncs, CSU wait time delay is with λpIncrease and increase.It can be obtained by Fig. 6, give λp
And λcs, NCSU wait time delay is with Σ λncsIncrease and increase.Because NCSU priority is minimum, λpAnd λcsIncrease all can
Increase NCSU time delays, and because PU service time is longer (two time slots), improve λpIt is bigger to NCSU time delay influence.
It follows that carried mechanism can ensure primary user's limit priority, using the access authority of higher priority as
Return to cooperative cognitive node, dynamic, efficient frequency spectrum share can be realized in the case where business randomness is relatively strong, because
It is feasible that this present invention, which puies forward mechanism,.
For those skilled in the art, technical scheme that can be more than and design, provide various corresponding
Change and deform, and all these change and deformation should be construed as being included within the protection domain of the claims in the present invention.
Claims (6)
1. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query, it is characterised in that the mechanism process is such as
Under：
Step 1, selecting collaboration cognitive user, specifically comprise the following steps：
Step 1.1, primary user's emitter PTPeripherad cognitive user broadcast relay recruits request packet, and the packet includes primary
Family receiver PRInformation；
Step 1.2, receive the request and be ready that the cognitive user for serving as relaying sends cooperation call request packet, in its model that communicates
Enclose interior searching PR；
Step 1.3, P is worked asRAfter receiving the call request from least one relaying cognitive user, PRCarry out broadcast response；
Step 1.4, P can be receivedTRelaying recruit request and PRThe cognitive user of response possesses the condition of relaying, PTAccording to obtaining
The Link State relevant with candidate cooperative cognitive user obtained, recognized according to the maximum criterion selecting collaboration of end-to-end data rate
User；
Step 2, PTCarry out data transmission, mainly including PT→SrAnd Sr→PRTwo stages, the sequencing of the two are fixed and connected
Supervention is given birth to, SrFor cooperative cognitive user；In the initial time of each time slot, as long as PTIt is grouped into and reaches, soon sends data；
Step 3, cooperative cognitive user SrCarry out data transmission, first to PTPacket forwarded, then according to authorize business pair
The occupancy situation of channel, carry out the transmission of its data；
Step 4, non-cooperating cognitive user carries out data transmission：As cooperative cognitive user SrDetect channel idle and itself have no
When data are sent, coordinate non-cooperating cognitive user access channel.
2. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query according to claim 1, its feature
It is, each cognitive user includes cognition transmitting node STWith cognition receiving node SR, when primary user's recognizing with cooperative cognitive user
Know transmitting nodeDuring as via node, data transfer includes And4 species
Type, signalling includeAccess request packet is sent,Feed back access permission packet；WhereinFor cooperative cognitive user's
Recognize receiving node,WithCognition transmitting node and cognition receiving node for non-cooperating cognitive user；Received when to recognize
NodeAs relaying, the return transmitted as assistance mandate business, withCorresponding cognition transmitting nodeChannel will be obtained
Chance is accessed, data transfer includes 4 types：AndSignalling bag
IncludeWithAccess request packet is sent,Feed back access permission packet.
3. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query according to claim 1, its feature
It is, PTThe renewal of cooperative cognitive user can periodically be carried out：If PTFind that preferably cooperation is recognized when initiating renewal process
Know user, PTNotify current cooperative cognitive user to release cooperation relation, then recognize according to the new cooperation of the method choice of step 1
Know userAnd establish contact.
4. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query according to claim 1, its feature
It is, cooperative cognitive user SrCan actively it release and PTCooperation relation, PTInitiated again according to step 1 newly after response
Cooperative cognitive user's selection course, choose new cooperative cognitive user
5. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query according to claim 3 or 4, it is special
Sign is, current cooperative cognitive user SrBefore cooperation relation is released, the communication tube for the non-cooperating cognitive user safeguarded
Reason record is sent to PT；In PTSelected cooperative cognitive userAfterwards, by PTThese information are transmitted to selectedComplete
After the handing-over for managing data, SrExit；Broadcast transmission Hello is grouped, and the non-cooperating cognitive user in its coverage receives
After the packet, numbering, the self communication record of node maintenance of node are added in the acknowledgment packet of return；By what is received
Communications records of each non-cooperating cognitive user and from PTThe telecommunication management record of forwarding is compared, in management database
Without node entries increased, the nodes records with identical ID are updated.
6. a kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query according to claim 1, its feature
It is, cooperative cognitive user S in step 4rWhen detecting channel idle and itself and no data transmission, coordinate non-cooperating cognition and use
Family access channel is the access protocol based on request license difference, and the agreement particular content is as follows：
1) each cognitive user safeguards 1 variableRepresent that cognitive user sends the number of access request packet and received
Access permission is grouped the difference of number；SrSafeguard all cognitive users
2) non-cooperating cognitive user i updates its variableNon-cooperating cognitive user i sends an access request packet, and it becomes
AmountAdd 1；Non-cooperating cognitive user i is from SrPlace obtains an access permission packet, its variableSubtract 1；
3) cooperative cognitive user SrMore new variablesAs cooperative cognitive user SrReceive the access from non-cooperating cognitive user i
Request packet, then it is corresponding with non-cooperating cognitive user iAdd 1；As cooperative cognitive user SrTo non-cooperating cognitive user i
Return to an access permission packet, then it is correspondingSubtract 1；
4) non-cooperating cognitive user i is to cooperative cognitive user SrWhen asking channel, the variable safeguardedIt is encapsulated in together
Sent in access request packet, cooperative cognitive user SrThe information that will be receivedWith the information of self maintainedCompared
Compared with, if not what cooperative cognitive user i was reportedWith SrSafeguard correspondingDifference exceedes thresholding θthWhen, cooperative cognitive is used
Family SrRequest to non-cooperating cognitive user i is refused, and is selected from effective requestMaximum non-cooperating cognition is used
Family, current idle time slot is distributed into the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410625162.4A CN104394534B (en) | 2014-11-07 | 2014-11-07 | A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410625162.4A CN104394534B (en) | 2014-11-07 | 2014-11-07 | A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104394534A CN104394534A (en) | 2015-03-04 |
| CN104394534B true CN104394534B (en) | 2018-02-23 |
Family
ID=52612358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410625162.4A Active CN104394534B (en) | 2014-11-07 | 2014-11-07 | A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104394534B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106559794B (en) * | 2015-09-25 | 2019-12-10 | 上海无线通信研究中心 | Inter-network frequency spectrum sharing control method and frequency spectrum controller |
| CN105517039B (en) * | 2015-12-08 | 2018-09-21 | 中国联合网络通信集团有限公司 | Data transfer control method and device in a kind of cognition network |
| CN106941725B (en) * | 2016-01-04 | 2020-04-21 | 中国移动通信集团公司 | Method and device for sending uplink data, user equipment and base station |
| CN106358215A (en) * | 2016-08-31 | 2017-01-25 | 上海交通大学 | Data caching based relay network cooperation method |
| US10433180B2 (en) * | 2016-12-22 | 2019-10-01 | Qualcomm Incorporated | Dynamic medium sharing |
| CN112532416A (en) * | 2019-12-26 | 2021-03-19 | 数海信息技术有限公司 | Security state information management method and system based on consensus mechanism |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2182662A1 (en) * | 2008-10-31 | 2010-05-05 | Nokia Siemens Networks GmbH & Co. KG | Method of and radio network for transmitting layered data to multiple receiving stations |
| CN103974266A (en) * | 2013-02-04 | 2014-08-06 | 华为技术有限公司 | Relay transmission method, device and system |
-
2014
- 2014-11-07 CN CN201410625162.4A patent/CN104394534B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2182662A1 (en) * | 2008-10-31 | 2010-05-05 | Nokia Siemens Networks GmbH & Co. KG | Method of and radio network for transmitting layered data to multiple receiving stations |
| CN103974266A (en) * | 2013-02-04 | 2014-08-06 | 华为技术有限公司 | Relay transmission method, device and system |
Non-Patent Citations (4)
| Title |
|---|
| "Cooperative Communications for Cognitive Radio Networks";Khaled Ben Letaief.etc;《Proceedings of the IEEE》;20090428;全文 * |
| "Delay Analysis for Cognitive Radio Networks with Random Access: A Fluid Queue View";Shanshan Wang，Junshan Zhang，Lang Tong;《INFOCOM, 2010 Proceedings IEEE》;20100506;全文 * |
| "Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue";Vidura Gamini Abhaya.etc;《IEEE Transactions on Parallel and Distributed Systems 》;20130702;全文 * |
| "Queueing analysis of opportunistic access in cognitive radios";Isameldin Suliman .etc;《 Cognitive Radio and Advanced Spectrum Management, 2009. CogART 2009. Second International Workshop on》;20090721;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104394534A (en) | 2015-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104394534B (en) | A kind of two-stage center collaboration frequency spectrum shared mechanism based on priority query | |
| Logeshwaran et al. | L‐RUBI: An efficient load‐based resource utilization algorithm for bi‐partite scatternet in wireless personal area networks | |
| CN104869526B (en) | A kind of communication of device-to-device and its resource allocation methods, equipment | |
| Luo et al. | Self-coordinating localized fair queueing in wireless ad hoc networks | |
| CN109561513B (en) | Distributed conflict-free ad hoc network multiple access protocol | |
| Chung et al. | Performance analysis of HomePlug 1.0 MAC with CSMA/CA | |
| Debroy et al. | Contention based multichannel MAC protocol for distributed cognitive radio networks | |
| CN101801000A (en) | Secondary user access method for maximization of capacity of dynamic spectrum sharing system | |
| Hu et al. | Cognitive medium access control protocols for secondary users sharing a common channel with time division multiple access primary users | |
| RU2011101387A (en) | INTERFERENCE SETTING CHART AND ITS APPLICATION FOR THE PURPOSE OF NETWORK RESOURCES | |
| CN109362122B (en) | Transmission scheduling method and system for communication data in low-power-consumption wide area network | |
| CN105873170A (en) | Multichannel medium access control method of cognitive radio mobile self-organized network | |
| Li et al. | An RSU-coordinated synchronous multi-channel MAC scheme for vehicular ad hoc networks | |
| Xia et al. | Opportunistic channel sharing in stochastic networks with dynamic traffic | |
| Mai et al. | CSMA/CA-based uplink MAC protocol design and analysis for hybrid VLC/Wifi networks | |
| Kim et al. | A fast joining scheme based on channel quality for IEEE802. 15.4 e TSCH in severe interference environment | |
| Yu et al. | A high-throughput MAC protocol for wireless ad hoc networks | |
| Luís et al. | A novel reservation-based MAC scheme for distributed cognitive radio networks | |
| Dhurandher et al. | Contract theory based medium access contention resolution in TDMA cognitive radio networks | |
| Kim et al. | Improving spectral and temporal efficiency of collocated IEEE 802.15. 4 LR-WPANs | |
| Fahs et al. | Collision prevention in distributed 6TiSCH networks | |
| Tong et al. | A stochastic geometry approach to the modeling of IEEE 802.11 p for vehicular ad hoc networks | |
| Wang et al. | A cognitive MAC protocol for QoS provisioning in ad hoc networks | |
| Zhao et al. | A novel dynamic spectrum access algorithm for cognitive radio networks | |
| Gau | Modeling the slotted nonpersistent CSMA protocol for wireless access networks with multiple packet reception |
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 |