CN101754242A - Access method of opportunistic cognitive multi-carrier link layer protocol - Google Patents

Access method of opportunistic cognitive multi-carrier link layer protocol Download PDF

Info

Publication number
CN101754242A
CN101754242A CN200910155857A CN200910155857A CN101754242A CN 101754242 A CN101754242 A CN 101754242A CN 200910155857 A CN200910155857 A CN 200910155857A CN 200910155857 A CN200910155857 A CN 200910155857A CN 101754242 A CN101754242 A CN 101754242A
Authority
CN
China
Prior art keywords
carrier
carrier wave
access
user
unauthorized
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN200910155857A
Other languages
Chinese (zh)
Other versions
CN101754242B (en
Inventor
李雪娇
张朝阳
王培雅
姜松
陈少磊
陈晓明
张建敏
林泽
陈淑保
王秋芳
唐颖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN200910155857XA priority Critical patent/CN101754242B/en
Publication of CN101754242A publication Critical patent/CN101754242A/en
Application granted granted Critical
Publication of CN101754242B publication Critical patent/CN101754242B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an access method of an opportunistic cognitive multi-carrier link layer protocol. Each unauthorized user perceives the using state of the carrier, an initial access probability table is generated according to various user service requirements, the sending and receiving parties choose the access channel to establish links according to the access probability table, and the access probability table is updated according to collision probability initiated in the earlier stage. In addition, the invention provides a time-frequency two-dimensional signaling exchange mode in the link negotiation process, which solves the problem of information asymmetry of the sending and receiving parties and effectively avoids the problem of hidden terminal. By fully utilizing the time-frequency two-dimensional factors, the access method has the advantages that the resources of the system are utilized to a greater degree, the collision frequency is reduced, the success probability of node access is improved, and the access method has good practical value.

Description

The cut-in method of opportunistic cognitive multi-carrier link layer protocol
Technical field
The present invention relates to the wireless cognition communications field, relate in particular to a kind of cut-in method of opportunistic cognitive multi-carrier link layer protocol.
Background technology
802.11DCF (Distributed Coordinate Function) distributed collaborative mode is to share the multi-user who designs under the prerequisite of individual channel a plurality of users to compete single-channel access strategy, the access way simple possible is extensive use of in 802.11 agreements; When having a plurality of available channel in the system, the user can adopt the access way of OFDM to insert a plurality of channels and finish communication.For adopting single-channel agreement, adopt a plurality of channels can reach higher network throughput.
The multichannel chain-line layer access protocol of single-transceiver generally all is to consider that interstitial content is identical with available channel number, and each node is only selected a channel wherein when competitive channel.Pass through public control channel exchange of control information simultaneously between the receiving-transmitting sides node.Therefore, both sides only need intercept public control link information and get final product in setting up the link process.
Kaveh Ghaboosi, Matti Latva-aho, Yang xiao is the cognitive link layer access protocol that has proposed to have common signaling exchange channel at " A Distributed Multi-channelCognitive MAC Protocol for IEEE 802.11s Wireless Mesh Networks ", has provided effective channel switching method in the agreement.But each node of this paper is only competed a channel, and adopts public signaling exchange message, does not consider that node competes the situation of a plurality of channels.In unauthorized system,,, then increase system cost, and agreement does not solve the problem of concealed terminal node if distribute fixed channel because the activity of authorized user has no idea to guarantee to exist a fixing control channel not to be subjected to the interference of authorized user.
Carlos Cordeiro and Kiran Challapali has proposed the C-MAC agreement at " C-MAC:A Cognitive MAC Protocolfor Multi-Channel Wireless Networks ", agreement adopts the pack arrangement of superframe, each channel is divided time slot in logic, come exchange message and negotiated channel to use by the BP time slot before the transfer of data, can solve the problem of concealed terminal node well.This agreement adopts public control link, is not having public control channel, and may perceive under the situation of different idle available carrier wave two the sending out of transmitting-receiving, and this agreement is also inapplicable.
Jungmin So and Nitin Vaidya has proposed the MMAC agreement in " Multi-Channel MAC for Ad Hoc Networks:Handling Multi-Channel Hidden Terminals Using A single Transceiver ", dynamically use the method for a plurality of channels to improve network throughput by node.Each node is equipped with semiduplex transceiver in the agreement, selects access channel by favorite channels tabulation mechanism is set, and finishes the channel access procedure of receiving-transmitting sides by the ATIM window, has improved the channel utilization of system greatly.This agreement is divided into High with the access preference of channel, and Middle and Low are after node is selected current channel, this channel is High for the state of this node, if node is competed this channel failure, then channel is Low at the state of this node, and the channel that does not have to insert then is Middle.After repeatedly selecting renewal, each node all has some fixing favorite channels preferentially to insert.This agreement is in the process that the design channel select to insert, and the probability flux of successful access channel is bigger, and need just tend towards stability through user's favorite channels table for a long time, is not suitable for the unauthorized user that authorized user arrives at any time and inserts.
Therefore, in not having the unauthorized system of Common Control Channel, each unauthorized user is equipped with a semiduplex transceiver, and receiving-transmitting sides is under the situation that may perceive different idle carrier waves, and exchange of control information is set up link.In the system, receiving-transmitting sides all is to carry out in the situation of single-hop during communication.
Summary of the invention
The objective of the invention is to the dependence of Common Control Channel, to avoid hidden terminal problem, realize that unauthorized system sets up the simplicity of link, improve the access probability of success of link in order to solve specific implementation in above-mentioned each scheme; When not having Common Control Channel, take the situation of a plurality of subcarriers at the node that is equipped with single-transceiver, a kind of cut-in method of opportunistic cognitive multi-carrier link layer protocol is provided.
The technical scheme that the present invention solves its technical problem is:
The cut-in method of opportunistic cognitive multi-carrier link layer protocol comprises the steps:
1) each unauthorized user all is equipped with a semiduplex transceiver, and dynamically switched carrier realizes intercepting carrier wave or transmission information; Each unauthorized user in adding unauthorized system, the idle condition of all carrier waves in the perception frequency range, and obtain the duration that unauthorized user uses carrier wave;
2) when having listened to data need receive the time, this unauthorized user just receives data; If this unauthorized user need send data, to determine the carrier number n that the user inserts according to unauthorized each user's of system business demand, unauthorized user selects n carrier wave of probability maximum to insert according to the access probability table, after each access is finished, upgrade the access probability table according to access probability table update algorithm;
3) on n carrier wave, send the spectral coordination request package, carried the duration of carrier number, available carrier wave collection and the frame data transmission of selecting access in the bag, receiving terminal receives the spectral coordination request package of transmitting terminal on own available subcarrier, in conjunction with the available carrier wave situation of oneself, determine the carrier wave of both sides' joint communications, and the carrier number that will finally determine, carrier wave collection and duration feed back to transmit leg with the form of spectral coordination respond packet; Seize same carrier wave if a plurality of users occur in the process of exchange harmony messages, spectral coordination request package or the spectral coordination respond packet between the user bumps at this moment, in case bump, is considered as this access failure; Receiving-transmitting sides is determined to begin transmitting data information behind the communication link, and transfer of data adopts the access way of OFDM.
Described step 1) is: the identifying information in each unauthorized user packet header is made up of two parts, one is non-authoring system identification, one is the unauthorized user sign, the attribute information of system has partly been carried in unauthorized system identification, and being used to indicate this bag is authoring system transmission package or unauthorized system transmissions bag; A new unauthorized user after entering unauthorized system, guarantee with the synchronous situation of other unauthorized users under, the user begins the current unauthorized system of perception place frequency range intercarrier and takies situation; If the carrier wave free time then is denoted as 0,, then be denoted as 1 if carrier wave is busy; Node determines by intercepting the header packet information of each busy carrier wave whether this carrier wave is that authorized user takies, if not, then intercept the duration of this bag transmission and the destination address of transmission, and check whether need reception with the matching addresses of oneself.
Described step 2) be: obtain current available number of sub carrier wave and the current unauthorized user number that is in active state by perception, unauthorized user i determines the carrier number n that own needs insert according to the business demand of self iEach unauthorized user all has an access probability table, represents the access probability of this user to all available subcarriers; The initial value of access probability is selected the probable value of carrier wave at random in the table for the user; The user brings in constant renewal in the access probability table of oneself by access probability table update algorithm; The access probability table updating method is:
A) determine the access carrier number n of node according to user's business demand i
B) access probability of the unauthorized node of initialization, access way is for inserting at random; To a certain user i, access probability is n i/ N, wherein, n iAccess carrier number for user i; p i=[n i/ N n i/ N ... n i/ N];
C) user i selects the n of access probability maximum from the access probability table iIndividual available carrier wave inserts, and when the carrier wave probability of selecting to insert is identical, selects the carrier wave of corresponding number to insert at random;
D) when having only a user i access carrier j, then user i has successfully inserted carrier wave j, the p in the corresponding access probability table I, jAdd and upgrade step-length step;
E) as a plurality of user i, i+n ..., when i+m competed carrier wave j simultaneously, a plurality of users' controlling packet can clash, and produced collision, each node in access probability table separately with the p of correspondence I, j, p I+n, j..., p I+m, jDeduct and upgrade step-length step;
F) finish access after, each unauthorized user all obtains the access probability table that upgraded, i.e. a P=p i=[p I, 0p I, 1... p I, N-1], step a) is returned in access next time again;
Described step 3) is: receiving-transmitting sides does not have public control channel to be used for exchange control signaling when transmitting and receive data, transmitting terminal selects carrier wave to receiving terminal spectral coordination request package according to the access probability table, carry transmitting terminal in the bag and select the carrier number of transmission, the duration of idle carrier wave collection of transmitting terminal and frame data transmission, receiving terminal is after intercepting the spectral coordination request package on the idle carrier wave of self node, controlling packet is received, and by all idle carrier wave of receiving terminal selection both sides, and carrier wave selection information and duration are confirmed in the feedback of transmission spectral coordination respond packet on the final carrier wave of selecting, the shared each other carrier link of notice transmitting terminal tells neighbor node to upgrade the virtual carrier sensing in wireless network communication sign simultaneously;
Receiving terminal determines that the step of access carrier is as follows:
G) the receiving terminal carrier wave that at first will receive transmitting terminal information is listed access carrier collection C in A RIf receive the number n of information carrier T-rEqual transmitting terminal and select the carrier number n of access t, then C A R = C A T , Transmitting terminal is at n T-rSend feedback information spectral coordination respond packet on the carrier wave of individual correspondence;
H) if receiving terminal is received the number n of information carrier T-rLess than n tThe time, it is also not exclusively available at receiving terminal that promptly transmitting terminal is selected the carrier wave of access, and then receiving terminal will contrast the idle carrier wave collection C of transmitting terminal C R, from set { C ⊆ C A R , C ⊂⃒ C A T - R } The middle n that selects t-n T-rIndividual probability maximum and the carrier wave of transmitting terminal free time insert;
I) if the carrier number of public free time of both sides is lower than n t, then select the carrier waves of all public free time, number is n r, and on the carrier wave of these selections, send spectral coordination respond packet information;
Wherein, transmitting terminal access carrier collection is C A T = { c i , c i + j , . . . , c i + k } , J ≠ k ≠ 0, receiving terminal is at the carrier wave collection C A T - R ⊆ C A T In receive the information that transmitting terminal sends, the access carrier collection of receiving terminal is C A R = { c i , c i + j ′ , . . . , c i + k ′ } , J ' ≠ k ' ≠ 0, the idle carrier wave collection of transmitting terminal is C C T = { c 1 , c i , . . . , c N } , N 〉=0, the idle carrier wave collection of receiving terminal is C C R = { c 1 , c i ′ , . . . , c N ′ } , N ' 〉=0, the carrier number that transmitting terminal, receiving terminal are finally selected to insert is respectively n t, n r, n T-rCan receive the carrier number of transmitting terminal information for receiving terminal.
The beneficial effect that the present invention has is: in unauthorized network system, when unauthorized interstitial content was less than available number of sub carrier wave, each unauthorized user node can insert a plurality of subcarriers simultaneously by the mode that OFDM inserts; Owing to the uncertainty of authorized user activity, unauthorized system does not have fixing control channel to be used for exchange of control information, so the pattern of agreement employing on-fixed control channel, has improved the utilance of system spectral resources; In the link establishment process, formulated rational multi-user's access mechanism at the selection of access link, reduce the conflict that unauthorized user causes in the competition available subcarrier, shorten the time that data link is set up, improve effective access probability of whole system channel; Each unauthorized user node adopts the structure of single-transceiver simultaneously, and is compatible strong.
Description of drawings
Fig. 1 is the state transition diagram of unauthorized user;
Fig. 2 is opportunistic cognitive multi-carrier link layer access protocol (Opportunity SensingMulti-channel Media Access Control, an OS-MMAC) agreement flow chart;
Fig. 3 be the spectral coordination request package (Spectrum Coordination Request, SC_Req), spectral coordination respond packet (Spectrum Coordination Response, SC_Req) controlling packet structure;
Fig. 4 is the successful access probability and access number of times graph of a relation of OS-MMAC, MMAC.
Embodiment
The cut-in method of opportunistic cognitive multi-carrier link layer protocol comprises the steps:
1) each unauthorized user all is equipped with a semiduplex transceiver, and dynamically switched carrier realizes intercepting carrier wave or transmission information; Each unauthorized user in adding unauthorized system, the idle condition of all carrier waves in the perception frequency range, and obtain the duration that unauthorized user uses carrier wave;
2) when having listened to data need receive the time, this unauthorized user just receives data; If this unauthorized user need send data, to determine the carrier number n that the user inserts according to unauthorized each user's of system business demand, unauthorized user selects n carrier wave of probability maximum to insert according to the access probability table, after each access is finished, upgrade the access probability table according to access probability table update algorithm;
3) on n carrier wave, send the spectral coordination request package, carried the duration of carrier number, available carrier wave collection and the frame data transmission of selecting access in the bag, receiving terminal receives the spectral coordination request package of transmitting terminal on own available subcarrier, in conjunction with the available carrier wave situation of oneself, determine the carrier wave of both sides' joint communications, and the carrier number that will finally determine, carrier wave collection and duration feed back to transmit leg with the form of spectral coordination respond packet; Seize same carrier wave if a plurality of users occur in the process of exchange harmony messages, spectral coordination request package or the spectral coordination respond packet between the user bumps at this moment, in case bump, is considered as this access failure; Receiving-transmitting sides is determined to begin transmitting data information behind the communication link, and transfer of data adopts the access way of OFDM.
Described step 1) is: the identifying information in each unauthorized user packet header is made up of two parts, one is non-authoring system identification, one is the unauthorized user sign, the attribute information of system has partly been carried in unauthorized system identification, and being used to indicate this bag is authoring system transmission package or unauthorized system transmissions bag; A new unauthorized user after entering unauthorized system, guarantee with the synchronous situation of other unauthorized users under, the user begins the current unauthorized system of perception place frequency range intercarrier and takies situation; If the carrier wave free time then is denoted as 0,, then be denoted as 1 if carrier wave is busy; Node determines by intercepting the header packet information of each busy carrier wave whether this carrier wave is that authorized user takies, if not, then intercept the duration of this bag transmission and the destination address of transmission, and check whether need reception with the matching addresses of oneself.
Described step 2) be: obtain current available number of sub carrier wave and the current unauthorized user number that is in active state by perception, unauthorized user i determines the carrier number n that own needs insert according to the business demand of self iEach unauthorized user all has an access probability table, represents the access probability of this user to all available subcarriers; The initial value of access probability is selected the probable value of carrier wave at random in the table for the user; The user brings in constant renewal in the access probability table of oneself by access probability table update algorithm; The access probability table updating method is:
A) determine the access carrier number n of node according to user's business demand i
B) access probability of the unauthorized node of initialization, access way is for inserting at random; To a certain user i, access probability is n i/ N, wherein, n iAccess carrier number for user i; p i=[n i/ N n i/ N ... n i/ N];
C) user i selects the n of access probability maximum from the access probability table iIndividual available carrier wave inserts, and when the carrier wave probability of selecting to insert is identical, selects the carrier wave of corresponding number to insert at random;
D) when having only a user i access carrier j, then user i has successfully inserted carrier wave j, the p in the corresponding access probability table I, jAdd and upgrade step-length step;
E) as a plurality of user i, i+n ..., when i+m competed carrier wave j simultaneously, a plurality of users' controlling packet can clash, and produced collision, each node in access probability table separately with the p of correspondence I, j, p I+n, j..., p I+m, jDeduct and upgrade step-length step;
F) finish access after, each unauthorized user all obtains the access probability table that upgraded, i.e. a P=p i=[p I, 0p I, 1... p I, N-1], step a) is returned in access next time again;
Described step 3) is: receiving-transmitting sides does not have public control channel to be used for exchange control signaling when transmitting and receive data, transmitting terminal selects carrier wave to receiving terminal spectral coordination request package according to the access probability table, carry transmitting terminal in the bag and select the carrier number of transmission, the duration of idle carrier wave collection of transmitting terminal and frame data transmission, receiving terminal is after intercepting the spectral coordination request package on the idle carrier wave of self node, controlling packet is received, and by all idle carrier wave of receiving terminal selection both sides, and carrier wave selection information and duration are confirmed in the feedback of transmission spectral coordination respond packet on the final carrier wave of selecting, the shared each other carrier link of notice transmitting terminal tells neighbor node to upgrade the virtual carrier sensing in wireless network communication sign simultaneously;
Receiving terminal determines that the step of access carrier is as follows:
G) the receiving terminal carrier wave that at first will receive transmitting terminal information is listed access carrier collection C in A RIf receive the number n of information carrier T-rEqual transmitting terminal and select the carrier number n of access t, then C A R = C A T , Transmitting terminal is at n T-rSend feedback information spectral coordination respond packet on the carrier wave of individual correspondence;
H) if receiving terminal is received the number n of information carrier T-rLess than n tThe time, it is also not exclusively available at receiving terminal that promptly transmitting terminal is selected the carrier wave of access, and then receiving terminal will contrast the idle carrier wave collection C of transmitting terminal C R, from set { C ⊆ C A R , C ⊂⃒ C A T - R } The middle n that selects t-n T-rIndividual probability maximum and the carrier wave of transmitting terminal free time insert;
I) if the carrier number of public free time of both sides is lower than n t, then select the carrier waves of all public free time, number is n r, and on the carrier wave of these selections, send spectral coordination respond packet information;
Wherein, transmitting terminal access carrier collection is C A T = { c i , c i + j , . . . , c i + k } , J ≠ k ≠ 0, receiving terminal is at the carrier wave collection C A T - R ⊆ C A T In receive the information that transmitting terminal sends, the access carrier collection of receiving terminal is C A R = { c i , c i + j ′ , . . . , c i + k ′ } , J ' ≠ k ' ≠ 0, the idle carrier wave collection of transmitting terminal is C C T = { c 1 , c i , . . . , c N } , N 〉=0, the idle carrier wave collection of receiving terminal is C C R = { c 1 , c i ′ , . . . , c N ′ } , N ' 〉=0, the carrier number that transmitting terminal, receiving terminal are finally selected to insert is respectively n t, n r, n T-rCan receive the carrier number of transmitting terminal information for receiving terminal.
Embodiment
As shown in Figure 1, all there are three kinds of states in each unauthorized node, and perception inserts and transmission, and three kinds of states all have the regular time expense, is respectively T s, T a, T tNode is the channel information that can use of perception at first, enters access state after perceiving available channel, and begins transmission send data behind successful competitive channel, otherwise waits for next perception time slot.
As shown in Figure 2, in the process of link negotiation, A and B are a pair of transmitting-receiving node, and C is the adjacent node of B.At detecting period T sIn, node A and B perceive a plurality of available idle sub-carrier; When node A need be when Node B sends data, node A is n according to the number of sub carrier wave that the business demand ratio obtains competing access tSubsequently, (Access Probability List, APL) table is selected maximum n to node A according to the access probability table tIndividual channel inserts, and the SC_Req that sends control information wraps to Node B, and each in the bag inserts subcarrier number of all having carried A selection access on the subcarrier and the available carrier wave that A perceives.Node B is after receiving the SC_Req bag that node A sends, in conjunction with the APL table of self, at all available n of both sides on the part carrier wave rFeed back SC_Rsp on the individual carrier wave.After node A is receiving the feedback information that Node B sends, confirm the subcarrier that both sides can insert jointly.Therefore the C node listens to the SC_Rsp controlling packet of B node owing to there are not data to need to send, and the transmission duration of record B packet.Control information by twice is mutual, not only can effectively avoid the problem of concealed terminal, the more important thing is the utilization of resources that has realized time-frequency two-dimensional.
If A and B do not have public available subcarrier, A can not send data to B in current sending time slots the inside so, but must wait until the perception again of next transmission cycle, consults to set up transmission link with B again.
Provided transmission spectral coordination request package SC_Req among Fig. 3 respectively, the structure of spectral coordination respond packet SC_Rsp.Wherein, the carrier number of the access carrier number among the SC_Req for selecting through transmitting terminal after the pro rate to insert, available carrier wave collection are the available carrier wave set that transmitting terminal perceives.The access carrier number that access carrier number among the SC_Rsp is determined for receiving terminal after receiving SC_Req, available carrier wave collection are the available carrier wave set that transmitting terminal perceives.
The renewal step-length that obtains the APL probability tables according to simulation result is 0.05 o'clock, the probability maximum that system successfully inserts.The transmitting-receiving node of unauthorized user is 10 pairs in the emulation, and the idle available carrier wave number that perceives in the unauthorized system is 100, and the renewal step-length of APL probability tables is 0.05; Each user's allocation of carriers ratio can be provided with arbitrarily, and each user competes carrier wave at random when initially inserting, and under current channel perception result's situation, 300 transmission time slots is arranged, and each time slot user competes carrier wave again.
Access probability table update algorithm step:
1) generates 10 users' allocation of carriers ratio at random, according to 100 idle sub-carrier of allocation of carriers pro rate of user, the access carrier number n of node i iThe initial access probability of unauthorized node is access probability p at random i=[n i/ N n i/ N ... n i/ N] | N=100, n iBe the access carrier number of user i, n i/ N inserts the probability of a carrier wave at random for user i;
2) user i selects the n of access probability maximum from the APL table iIndividual available carrier wave inserts.When the carrier wave probability of selecting to insert is identical, select the carrier wave of corresponding number to insert at random;
3) when having only a user i access carrier j, then user i has successfully inserted carrier wave j, the p among the corresponding A PL I, jAdd step-length 0.05;
4) as a plurality of user i, i+n ..., when i+m competed carrier wave j simultaneously, a plurality of users' controlling packet can clash, and produced collision, and each node deducts 0.05 with corresponding carrier wave probable value among the APL;
5) finish once insert after, each unauthorized user all obtains an APL who upgraded and shows P '=p i=[p I, 0p I, 1... p I, N-1].Access next time comes back to step 1).
The access probability table of unauthorized user is illustrated under the situation that authorized user do not take subcarrier, unauthorized user inserts the preference probability of a certain carrier wave, taken by user i if carrier wave j is current, to insert the priority of being used by user i continuation just high so next time, and the probability of user's access carrier j is height just; And if carrier wave j is low for fear of the probability of collision user i access j by the long-term use of the neighbours user of user i or by a plurality of neighbours users' competitions of i, the probability of each user's access carrier tends towards stability at last.
Show by Computer Simulation, contrast Jungmin So and Nitin Vaidya has proposed the MMAC agreement in " Multi-ChannelMAC for Ad Hoc Networks:Handling Multi-Channel Hidden Terminals Using Asingle Transceiver ", multicarrier of the present invention is selected to insert has convergence rate and very high successful access probability quickly, can significantly improve the throughput of system.The MMAC agreement is divided into height with available carrier wave, in, low three kinds of states, the state jumping characteristic that carrier wave is selected for use is more intense, is difficult to reasonably describe the multi-user and competes the conflict that carrier wave causes.The OS-MAC agreement inserts probability of successful and tends to be steady soon then by describe the probability of unauthorized user access carrier ladderingly, and this is very suitable for using in the unauthorized system that authorized user arrives at any time; Simultaneously, this agreement is also a lot of greatly than MMAC agreement at the probability of successful access carrier, has improved the successful access probability and the throughput of system largely, demonstrates great advantage.

Claims (4)

1. the cut-in method of an opportunistic cognitive multi-carrier link layer protocol is characterized in that comprising the steps:
1) each unauthorized user all is equipped with a semiduplex transceiver, and dynamically switched carrier realizes intercepting carrier wave or transmission information; Each unauthorized user in adding unauthorized system, the idle condition of all carrier waves in the perception frequency range, and obtain the duration that unauthorized user uses carrier wave;
2) when having listened to data need receive the time, this unauthorized user just receives data; If this unauthorized user need send data, to determine the carrier number n that the user inserts according to unauthorized each user's of system business demand, unauthorized user selects n carrier wave of probability maximum to insert according to the access probability table, after each access is finished, upgrade the access probability table according to access probability table update algorithm;
3) on n carrier wave, send the spectral coordination request package, carried the duration of carrier number, available carrier wave collection and the frame data transmission of selecting access in the bag, receiving terminal receives the spectral coordination request package of transmitting terminal on own available subcarrier, in conjunction with the available carrier wave situation of oneself, determine the carrier wave of both sides' joint communications, and the carrier number that will finally determine, carrier wave collection and duration feed back to transmit leg with the form of spectral coordination respond packet; Seize same carrier wave if a plurality of users occur in the process of exchange harmony messages, spectral coordination request package or the spectral coordination respond packet between the user bumps at this moment, in case bump, is considered as this access failure; Receiving-transmitting sides is determined to begin transmitting data information behind the communication link, and transfer of data adopts the access way of OFDM.
2. the cut-in method of a kind of opportunistic cognitive multi-carrier link layer protocol according to claim 1, it is characterized in that described step 1) is: the identifying information in each unauthorized user packet header is made up of two parts, one is non-authoring system identification, one is the unauthorized user sign, the attribute information of system has partly been carried in unauthorized system identification, and being used to indicate this bag is authoring system transmission package or unauthorized system transmissions bag; A new unauthorized user after entering unauthorized system, guarantee with the synchronous situation of other unauthorized users under, the user begins the current unauthorized system of perception place frequency range intercarrier and takies situation; If the carrier wave free time then is denoted as 0,, then be denoted as 1 if carrier wave is busy; Node determines by intercepting the header packet information of each busy carrier wave whether this carrier wave is that authorized user takies, if not, then intercept the duration of this bag transmission and the destination address of transmission, and check whether need reception with the matching addresses of oneself.
3. the cut-in method of a kind of opportunistic cognitive multi-carrier link layer protocol according to claim 1, it is characterized in that described step 2) be: obtain current available number of sub carrier wave and the current unauthorized user number that is in active state by perception, unauthorized user i determines the carrier number n that own needs insert according to the business demand of self iEach unauthorized user all has an access probability table, represents the access probability of this user to all available subcarriers; The initial value of access probability is selected the probable value of carrier wave at random in the table for the user; With
The access probability table of oneself is brought in constant renewal at the family by access probability table update algorithm; The access probability table updating method is:
A) determine the access carrier number n of node according to user's business demand i
B) access probability of the unauthorized node of initialization, access way is for inserting at random; To a certain user i, access probability is n i/ N, wherein, n iAccess carrier number for user i; p i=[n i/ N n i/ N ... n i/ N];
C) user i selects the n of access probability maximum from the access probability table iIndividual available carrier wave inserts, and when the carrier wave probability of selecting to insert is identical, selects the carrier wave of corresponding number to insert at random;
D) when having only a user i access carrier j, then user i has successfully inserted carrier wave j, the p in the corresponding access probability table I, jAdd and upgrade step-length step;
E) as a plurality of user i, i+n ..., when i+m competed carrier wave j simultaneously, a plurality of users' controlling packet can clash, and produced collision, each node in access probability table separately with the p of correspondence I, j, p I+n, j..., p I+m, jDeduct and upgrade step-length step;
F) finish access after, each unauthorized user all obtains the access probability table that upgraded, i.e. a P=p i=[p I, 0p I, 1... p I, N-1], step a) is returned in access next time again;
4. the cut-in method of a kind of opportunistic cognitive multi-carrier link layer protocol according to claim 1, it is characterized in that described step 3) is: receiving-transmitting sides does not have public control channel to be used for exchange control signaling when transmitting and receive data, transmitting terminal selects carrier wave to receiving terminal spectral coordination request package according to the access probability table, carry transmitting terminal in the bag and select the carrier number of transmission, the duration of idle carrier wave collection of transmitting terminal and frame data transmission, receiving terminal is after intercepting the spectral coordination request package on the idle carrier wave of self node, controlling packet is received, and by all idle carrier wave of receiving terminal selection both sides, and carrier wave selection information and duration are confirmed in the feedback of transmission spectral coordination respond packet on the final carrier wave of selecting, the shared each other carrier link of notice transmitting terminal tells neighbor node to upgrade the virtual carrier sensing in wireless network communication sign simultaneously;
Receiving terminal determines that the step of access carrier is as follows:
G) the receiving terminal carrier wave that at first will receive transmitting terminal information is listed access carrier collection C in A RIf receive the number n of information carrier T-rEqual transmitting terminal and select the carrier number n of access t, then C A R = C A T , Transmitting terminal is at n T-rSend feedback information spectral coordination respond packet on the carrier wave of individual correspondence;
H) if receiving terminal is received the number n of information carrier T-rLess than n tThe time, it is also not exclusively available at receiving terminal that promptly transmitting terminal is selected the carrier wave of access, and then receiving terminal will contrast the idle carrier wave collection C of transmitting terminal C R, from set { C ⊆ C A R , C ⊂⃒ C A T - R } The middle n that selects t-n T-rIndividual probability maximum and the carrier wave of transmitting terminal free time insert;
I) if the carrier number of public free time of both sides is lower than n t, then select the carrier waves of all public free time, number is n r, and on the carrier wave of these selections, send spectral coordination respond packet information;
Wherein, transmitting terminal access carrier collection is C A T = { c i , c i + j , . . . , c i + k } , J ≠ k ≠ 0, receiving terminal is at the carrier wave collection C A T - R ⊆ C A T In receive the information that transmitting terminal sends, the access carrier collection of receiving terminal is C A R = { c i , c i + j ′ , . . . , c i + k ′ } , J ' ≠ k ' ≠ 0, the idle carrier wave collection of transmitting terminal is C C T = { c 1 , c i , . . . , c N } , N 〉=0, the idle carrier wave collection of receiving terminal is C C R = { c 1 , c i ′ , . . . , c N ′ } , N ' 〉=0, the carrier number that transmitting terminal, receiving terminal are finally selected to insert is respectively n t, n r, n T-rCan receive the carrier number of transmitting terminal information for receiving terminal.
CN200910155857XA 2009-12-29 2009-12-29 Access method of opportunistic cognitive multi-carrier link layer protocol Expired - Fee Related CN101754242B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910155857XA CN101754242B (en) 2009-12-29 2009-12-29 Access method of opportunistic cognitive multi-carrier link layer protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910155857XA CN101754242B (en) 2009-12-29 2009-12-29 Access method of opportunistic cognitive multi-carrier link layer protocol

Publications (2)

Publication Number Publication Date
CN101754242A true CN101754242A (en) 2010-06-23
CN101754242B CN101754242B (en) 2012-03-28

Family

ID=42480456

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910155857XA Expired - Fee Related CN101754242B (en) 2009-12-29 2009-12-29 Access method of opportunistic cognitive multi-carrier link layer protocol

Country Status (1)

Country Link
CN (1) CN101754242B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013159552A1 (en) * 2012-04-23 2013-10-31 中兴通讯股份有限公司 Radio frame receiving method and device
WO2014100932A1 (en) * 2012-12-24 2014-07-03 华为技术有限公司 Resource competition method, and method and device for using resource competition
CN104219679A (en) * 2014-09-10 2014-12-17 西安电子科技大学 Improved method for assigning channels in cognitive radio networks
WO2015131694A1 (en) * 2014-08-22 2015-09-11 中兴通讯股份有限公司 Sending method, device, and access point for occupying an unlicensed carrier
WO2016045349A1 (en) * 2014-09-25 2016-03-31 中兴通讯股份有限公司 Carrier resource processing method and device for unlicensed carriers, and transmission node
CN106255208A (en) * 2015-09-01 2016-12-21 北京智谷睿拓技术服务有限公司 Resource allocation methods, transmission method and device thereof
US10405350B2 (en) 2015-04-10 2019-09-03 Zte Corporation Unlicensed carrier contention method and apparatus
CN110291733A (en) * 2017-03-20 2019-09-27 株式会社Ntt都科摩 Without authorized transmissions method, user terminal and base station
WO2020015469A1 (en) * 2018-07-20 2020-01-23 中兴通讯股份有限公司 Carrier sharing method, device and system, and storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100373980C (en) * 2006-04-26 2008-03-05 电子科技大学 Parallel frequency spectrum distribution method for preventing interference in cognitive radio system
CN1878027B (en) * 2006-06-30 2011-12-07 西安电子科技大学 Multiuser resource allocation method based on cognitive radio system
CN101330461B (en) * 2008-06-18 2011-05-18 中国科学技术大学 Method for implementing frequency spectrum cavity-pocket efficient utilization based on existing honeycomb communication signaling transmission

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013159552A1 (en) * 2012-04-23 2013-10-31 中兴通讯股份有限公司 Radio frame receiving method and device
US9883530B2 (en) 2012-04-23 2018-01-30 Zte Corporation Radio frame receiving method and device
WO2014100932A1 (en) * 2012-12-24 2014-07-03 华为技术有限公司 Resource competition method, and method and device for using resource competition
US10419941B2 (en) 2014-08-22 2019-09-17 Zte Corporation Sending method, device, and access point for occupying an unlicensed carrier
WO2015131694A1 (en) * 2014-08-22 2015-09-11 中兴通讯股份有限公司 Sending method, device, and access point for occupying an unlicensed carrier
CN104219679B (en) * 2014-09-10 2017-12-29 西安电子科技大学 A kind of improved method for channel allocation in cognitive radio networks
CN104219679A (en) * 2014-09-10 2014-12-17 西安电子科技大学 Improved method for assigning channels in cognitive radio networks
WO2016045349A1 (en) * 2014-09-25 2016-03-31 中兴通讯股份有限公司 Carrier resource processing method and device for unlicensed carriers, and transmission node
US10321482B2 (en) 2014-09-25 2019-06-11 Zte Corporation Method and device for processing carrier resource of unlicensed carrier and transmission node
US10405350B2 (en) 2015-04-10 2019-09-03 Zte Corporation Unlicensed carrier contention method and apparatus
CN106255208A (en) * 2015-09-01 2016-12-21 北京智谷睿拓技术服务有限公司 Resource allocation methods, transmission method and device thereof
US10349409B2 (en) 2015-09-01 2019-07-09 Beijing Rui Tuo Tech Co., Ltd. Method and system for transmission schedule instruction for allocating resources in an unlicensed spectrum
CN110291733A (en) * 2017-03-20 2019-09-27 株式会社Ntt都科摩 Without authorized transmissions method, user terminal and base station
US11310839B2 (en) 2017-03-20 2022-04-19 Ntt Docomo, Inc. Grant-free transmission method, user equipment and base station
WO2020015469A1 (en) * 2018-07-20 2020-01-23 中兴通讯股份有限公司 Carrier sharing method, device and system, and storage medium

Also Published As

Publication number Publication date
CN101754242B (en) 2012-03-28

Similar Documents

Publication Publication Date Title
CN101754242B (en) Access method of opportunistic cognitive multi-carrier link layer protocol
Deng et al. IEEE 802.11 ax: Highly efficient WLANs for intelligent information infrastructure
CN107251472B (en) Signaling method for multi-user transmission, and wireless communication terminal and wireless communication method using the same
Cormio et al. A survey on MAC protocols for cognitive radio networks
CN104185217B (en) Parallel data transmission processing method and processing device
CN102113254B (en) Method and device for allocating resources in multiple frequency band system
US9717096B2 (en) Method and apparatus for a mobile selection based initial access scheme in a multicarrier system
US11930535B2 (en) Trigger-based random access for wireless device
So et al. McMAC: A multi-channel MAC proposal for ad-hoc wireless networks
CN104205987A (en) Compatible channel for efficient coexistence of voice and data traffic
US20230224996A1 (en) Method and apparatus for performing link reconfiguration between mlds in wireless lan system
CN104871613A (en) Method for obtaining synchronization for device-to-device communication outside of coverage area in a wireless communication system and apparatus for same
CN102036389B (en) Multichannel diversity-based cognitive medium access control realizing method
JP2010527551A (en) Improved network capacity usage
CN102123514A (en) Method for realizing multiple accesses in wireless local area network and wireless local area network system
CN102804683A (en) Operating method for a WPAN device
KR101783482B1 (en) Self scheduling apparatus and method in wireless communication system
CN108337297A (en) Operating method in point to point wireless communication network and its communication equipment
Shah et al. DDH-MAC: a novel dynamic de-centralized hybrid mac protocol for cognitive radio networks
Huang et al. SAM-MAC: An efficient channel assignment scheme for multi-channel ad hoc networks
CN104837211B (en) A kind of multi-channel multi-address access method based on MIMO transmission mechanism
Lei et al. Survey of multi-channel MAC protocols for IEEE 802.11-based wireless Mesh networks
CN103517421B (en) Transfer control method and relevant apparatus and communication system
US20240107371A1 (en) Method and apparatus for transmitting bsr information for another link on basis of a-control field in wireless lan system
Luvisotto et al. RCFD: A frequency-based channel access scheme for full-duplex wireless networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120328

Termination date: 20121229