CN105049140B - Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity - Google Patents
Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity Download PDFInfo
- Publication number
- CN105049140B CN105049140B CN201510417241.0A CN201510417241A CN105049140B CN 105049140 B CN105049140 B CN 105049140B CN 201510417241 A CN201510417241 A CN 201510417241A CN 105049140 B CN105049140 B CN 105049140B
- Authority
- CN
- China
- Prior art keywords
- user node
- channel
- data
- convergence
- diversity
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity, when user node does not have data to need transmission, frequency hopping is carried out according to fixed frequency hopping sequence, once user node has data to send demand, so user node can carry out frequency hopping according to another fixed frequency hopping sequences, frame is sent simultaneously and carries out convergence negotiation request, and user node, which is received, to be consulted to reply negotiation information after request and wait the reception of data frame.The present invention, which overcomes, needs time or slot synchronization and the deficient shortcoming of convergence diversity in the blind assemblage method of existing multichannel, a kind of convergence diversity for not needing time or slot synchronization and ensure that maximum is provided, while the blind assemblage method of the average less multichannel of binding time.Experiment shows that the present invention is easily achieved, and reliability is high, while having certain interference free performance.
Description
Technical field
The invention belongs to cordless communication network technical field, it is related to point that a kind of cognition wireless network realizes all channel diversity
Cloth blind Channel assembly algorithms.
Background technology
With the continuous reduction of frequency spectrum resource, increase and the effective of frequency spectrum is become more and more important using seeming, cognition wireless network
As a kind of communication network of efficient utilization frequency spectrum increasingly by the concern and research of people.Conventional utilization of the people to frequency spectrum
That spectral shaping is divided into fixed frequency spectrum block one by one, frequency spectrum blocks are licensed into fixed user uses, however authorized user without
Method ensures to continue efficiently using authorized frequency spectrum blocks, frequency spectrum cavity-pocket is will result in time, due to having for frequency spectrum resource
Sex-limited, the communication requirement for other unauthorized users can not then be met.On the one hand so will result in is frequency spectrum cavity-pocket, a side
Face is the problem of no frequency spectrum can be used.Simultaneously as between the dynamic of time upper spectrum utilization and user communication negotiation must
The property wanted, it is proposed that a kind of method that information reconciliation is carried out by the blind convergence of multichannel between user in cognition wireless network.
Blind convergence is one kind of channel hopping, and it is than channel hopping more targeted and purpose.It is temporally same at present
Step characteristic, which is divided, to be broadly divided into：Time synchronized, slot synchronization and time slot are asynchronous.Time synchronized require all user nodes simultaneously from
Initial time carries out channel hopping；Slot synchronization does not require user from initial time saltus step simultaneously, it require that between user
Time slot scale close alignment, this is also what is be difficult to for current prevailing network；Time slot is asynchronous neither to require user
Simultaneously from initial time saltus step, do not require to carry out channel hopping between the alignment of time slot scale, user at any time, for logical at present yet
Communication network, it is technologically simple to implement.
The content of the invention
Time or slot synchronization are caused in actual use the need for the present invention is solved in existing assemblage method in various degree
The problem of being difficult to, while ensure that the maximum diversity and less binding time of multichannel convergence.The present invention is provided
A kind of cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity, the invention belongs to time slot asynchronous method,
Simultaneously present invention also ensure that channel convergence is multifarious maximizes, i.e., node can ensure on any available channel convergence
Success, with certain interference free performance.Moreover, the present invention can reach less convergence under conditions of convergence is ensured
Time, improve the validity of communication.
The technical scheme is that：When user node does not have data to need transmission, according to fixed frequency hopping sequence
Row carry out frequency hopping, once user node has data to send demand, then and user node can be jumped according to another fixed frequency
Become sequence and carry out frequency hopping, consult request while sending frame and carrying out convergence, user node, which receives to reply after negotiation request, to be consulted
Information and the reception for waiting data frame.
Specifically, a kind of cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity, and its feature exists
In：The minimum time T of negotiations process of the number of available channels N of each user node and completion in known cognition wireless network；
The transmitting and reception of data are carried out after user node is successfully converged, once transmission link, which is interfered, can not proceed data
During transmission, user node re-starts convergence；
State is sent when user node is in no data：When user node does not have data to send demand, user node meeting
Epicycle channel hopping list is generated, create-rule is chosen for accidental channel, while ensureing that all channels are only accessed one in a wheel
Secondary, it is (N+1) * T that time of intercept is stopped every time；
State is sent when user node is in data：Once user node has the demand that data are sent, user node can be weighed
Newly-generated random channel hopping list, the residence time is T, i.e. user node in each channel to user node on each channel
The negotiation request that frame carries out data transmission is sent after saltus step simultaneously.
In the present invention, needed before convergence (before carrying out channel hopping) by randomly ordered method generation channel
Hopping list, channel list is constant before converging successfully, that is, the channel hopping of several wheels may be carried out before converging successfully,
It will not change in the hopping list of this several wheel, once converged and successfully communicated, when converging again, random generation can jump again
Become list.
For technical scheme, citing here is illustrated：Assuming that one having 5 available channels in network.T is
Carry out the minimum used time that a successful information is exchanged.The channel of user node A available channel is marked as 1,3,4,5.So it
Available channel list be [1,3,4,5].When so it needs the data to send, channel hopping list is to believe in available channel list
Randomly ordered and cycle of track label repeats (cycle is available channel number), that is to say, that channel hopping list for [4,1,3,
5,4,1,3,5,4,1,3,5 ...], the stand-by period is T on each channel.Until converging successfully.Here 4,1,3,5 order
It is random or 3,4,1,5 etc..If that user node A does not have data transmission, that is to say, that it, which is in, receives
State, its channel hopping list is to repeat (cycle is available channel number) in the randomly ordered and cycle of available channel list,
Such as [5,1,3,4,5,1,3,4,5,1,3,4 ...], until converging successfully.Difference is, the use in reception state
The residence time is (5+1) T to family node A on each channel.
Beneficial effects of the present invention：
The present invention, which overcomes, needs time or slot synchronization and convergence diversity deficient in the blind assemblage method of existing multichannel
Shortcoming there is provided a kind of convergence diversity for not needing time or slot synchronization and ensure that maximum, while average convergence
The time blind assemblage method of less multichannel.Experiment shows that the present invention is easily achieved, and reliability is high, while having certain anti-interference
Performance.
Brief description of the drawings
Fig. 1 is the schematic diagram that present invention transmitting and receiving node channel switch.
Fig. 2 is communication scheme between user node.
Fig. 3 is assemblage method of the present invention and comparison figure of the existing typical assemblage method on average binding time.
Fig. 4, which is that channel convergence is multifarious, compares figure.
Embodiment
Below in conjunction with drawings and examples, the present invention is described further.
Fig. 1 is the channel switching method schematic diagram of transmitting-receiving node of the present invention.It is assumed that having 4 available channels, Fig. 1 in environment
(a) represent that user node A is in no data and sends state, the channel ergodic sequence of user node A generations is [2,4,3,1], i.e.,
Represent user node A and often take turns and switch channel according to 2-4-3-1 order, while the residence time is 5T (T on each channel
To complete once to consult minimum time used).User node B is in data and sends state, user node B channel ergodic sequence
For [4,3,1,2], that is, represent that user node A switches channel according to 4-3-1-2 order, while being often switched to a channel
Upper transmission once consults claim frame and waits reply (used time is T).
Fig. 2 indicates the communication process between two user nodes A, B.Wherein dash area represents channel and is interfered not
It can use.When user node A there are data to send demand in data transmission state, travel through and send once on channel 2,3,4
Consult frame, each wait 4T on channel 1,3,4 of the user node B in reception state time, when user node A, B are in channel
2 converge successfully after exchange consult frame and reply frame, proceed by data transmit-receive.Hereafter interference is sometime being received, channel 2 is not
It can use, user node A, B re-start convergence process, until converging the transmitting-receiving behaviour for successfully continuing data again on channel 1
Make.
Fig. 3 is assemblage method of the present invention and comparison of the existing typical assemblage method on average binding time.Wherein total letter
Road number is M=50, and active users K=10, each user node number of available channels accounts for total channel percentage u=0.5.The longitudinal axis in figure
Compare be K any active ues all complete convergence required for time, chronomere for complete once shake hands required for it is minimum
Time.As can be seen from the figure assembly algorithms of the invention are most short the time required to completing 10 node convergences.
Fig. 4 is that channel converges multifarious comparison.Wherein in t=1000 channel switching time slot, M=10 letter is had
Road supplies to converge between user node, it can be seen that only ACH, JS and the present invention can be completed on all 10 channels
Convergence, wherein the convergence total degree of the present invention tops the list.
The explanation of the preferred embodiment of the present invention contained above, this be in order to describe the technical characteristic of the present invention in detail, and
It is not intended to the content of the invention being limited in the concrete form described by embodiment, according to other of present invention purport progress
Modifications and variations are also protected by this patent.The purport of present invention is to be defined by the claims, rather than by embodiment
Specific descriptions are defined.
Claims (1)
1. a kind of cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity, it is characterised in that：It is known to recognize
Know the number of available channels N of each user node in wireless network and complete the minimum time T of a negotiations process；In user node
Channel hopping list is generated by randomly ordered method before convergence, channel list is constant before converging successfully；When with
Family node carries out the transmitting and reception of data after successfully converging, once transmission link, which is interfered, can not proceed data transfer
When, user node re-starts convergence；
State is sent when user node is in no data：When user node does not have data to send demand, user node can be generated
Epicycle channel hopping list, create-rule is chosen for accidental channel, while ensureing that all channels are only accessed once in a wheel, often
Secondary stop time of intercept is (N+1) * T；
State is sent when user node is in data：Once user node has the demand that data are sent, user node can give birth to again
Into random channel hopping list, the residence time is T, i.e. user node in each channel hopping to user node on each channel
Send the negotiation request that frame carries out data transmission simultaneously afterwards.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510417241.0A CN105049140B (en) | 2015-07-16 | 2015-07-16 | Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510417241.0A CN105049140B (en) | 2015-07-16 | 2015-07-16 | Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105049140A CN105049140A (en) | 2015-11-11 |
| CN105049140B true CN105049140B (en) | 2017-09-12 |
Family
ID=54455371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510417241.0A Active CN105049140B (en) | 2015-07-16 | 2015-07-16 | Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105049140B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107846733B (en) * | 2017-12-20 | 2020-02-21 | 中国人民解放军国防科技大学 | Distributed channel allocation method in high-density Internet of things |
| CN110602712B (en) * | 2019-08-13 | 2022-02-15 | 北京大学 | Frequency point switching anti-interference wireless local area network communication method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101620665A (en) * | 2009-08-10 | 2010-01-06 | 成都三零盛安信息系统有限公司 | Ultrahigh frequency passive radio frequency identification reader and frequency hopping method thereof |
| CN104168622A (en) * | 2014-09-01 | 2014-11-26 | 西安电子科技大学 | Distributed multi-channel handshaking method based on channel jumping |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9252929B2 (en) * | 2013-09-25 | 2016-02-02 | Hong Kong Baptist University | Method for achieving rendezvous for cognitive radio networks |
-
2015
- 2015-07-16 CN CN201510417241.0A patent/CN105049140B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101620665A (en) * | 2009-08-10 | 2010-01-06 | 成都三零盛安信息系统有限公司 | Ultrahigh frequency passive radio frequency identification reader and frequency hopping method thereof |
| CN104168622A (en) * | 2014-09-01 | 2014-11-26 | 西安电子科技大学 | Distributed multi-channel handshaking method based on channel jumping |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105049140A (en) | 2015-11-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10103800B2 (en) | Method and apparatus for adaptive beam hopping in multi cell multi user communication system | |
| CN103327519A (en) | AP (Access Point) and system based AP and AC (AP Controller) architecture | |
| WO2001031942A1 (en) | Method and apparatus for dynamic spectrum allocation | |
| US11026175B2 (en) | Implementation of traffic coexistence for collocated transceivers including Bluetooth transceivers | |
| CN106255037A (en) | Internet of things equipment accidental access method based on extensive MIMO technology and system thereof | |
| CN105049140B (en) | Cognition wireless network realizes the distributed blind Channel assembly algorithms of all channel diversity | |
| CN105430602A (en) | Networking method and system | |
| CN115413043B (en) | Data link self-organizing access control method based on control sequence | |
| KR101942900B1 (en) | Rendezvous Method of Unauthorized Users with Multiple Transceivers in a Cognitive Wireless Network | |
| CN104219772B (en) | A kind of channel access method and channel access device | |
| CN104066198A (en) | Method and system for selecting signal channel in wireless local area network | |
| CN103546971A (en) | Anti-interference channel switching method suitable for wireless sensor network | |
| Mittal et al. | Secured solutions for mobility in wireless body area networks | |
| CN104168622B (en) | Distributed multichannel handshake method based on channel hopping | |
| Bala | Throughput enhancement of cognitive radio networks through improved frame structure | |
| Khan | Self-forming multiple sub-nets based protocol for tactical networks consisting of sdrs | |
| Ren et al. | Opportunistic spectrum access: from stochastic channels to non-stochastic channels | |
| Nezhadal et al. | Common control channel saturation detection and enhancement in cognitive radio networks | |
| CN117813852A (en) | Techniques for enabling secure communication or energy transfer operations | |
| Kaur et al. | Simulation and investigation of Zigbee sensor network with mobility support | |
| CN106685550A (en) | Unauthorized user fully distributed type meeting method for cognitive radio network | |
| Liu et al. | A negotiation game for multichannel access in cognitive radio networks | |
| CN105101445B (en) | A kind of time scheduling method and electronic equipment | |
| Cao et al. | Multi‐slot reservation‐based multi‐channel MAC protocol for dense wireless ad‐hoc networks | |
| TW202102046A (en) | Truncated identification indicators |
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 |