CN106535358B - A kind of service channel method for building up suitable for time asynchronous cognitive nodes - Google Patents
A kind of service channel method for building up suitable for time asynchronous cognitive nodes Download PDFInfo
- Publication number
- CN106535358B CN106535358B CN201611079876.5A CN201611079876A CN106535358B CN 106535358 B CN106535358 B CN 106535358B CN 201611079876 A CN201611079876 A CN 201611079876A CN 106535358 B CN106535358 B CN 106535358B
- Authority
- CN
- China
- Prior art keywords
- channel
- message
- cognitive nodes
- service channel
- source node
- 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
- H04W76/00—Connection management
- H04W76/10—Connection setup
Abstract
The invention proposes a kind of service channel method for building up suitable for time asynchronous cognitive nodes.Mainly solve the problem of that cognitive nodes establish service channel in multiple shared control channels in distributed wireless networks.The present invention, which is used, constructs cognitive nodes channel hopping sequence based on jump and fixed channel subsequence combination, and devises more sub-slots information and repeat the channel of transmitting-receiving and cross time slot format.The present invention is suitable for time asynchronous distributed cognition wireless network environment, channel can be completed on multiple shared control channels for the symmetrical cognitive nodes of multiple identity to cross and information exchange, service channel is established, and supports and realizes that cognitive nodes environment sensing information exchange and Traffic Channel are negotiated.
Description
Technical field
The present invention relates to one of the distributed cognition field of wireless time, the service channel of asynchronous cognitive nodes is built
Vertical mechanism, especially suitable in time asynchronous distributed network environment, multiple symmetrical cognitive nodes are in multiple candidate controls
Service channel is established on channel, support realizes that environment sensing information exchange and Traffic Channel are negotiated.
Background technique
In centralized network, there are master controller, cognitive nodes by competition random multi-access channel channel realize with
The intercommunication of master controller, and further negotiate in the Traffic Channel completed under the guidance of master controller between cognitive nodes.
In traditional distributed network, there is also the biographies that a dedicated common control channel, cognitive nodes pass through the competition control channel
Defeated resource realizes that the perception information between cognitive nodes is interactive and Traffic Channel is negotiated.However, once multiple cognitive nodes are competing simultaneously
When the transfer resource or dedicated common control channel for striving dedicated common control channel are interfered, channel generation will lead to
Congestion or paralysis, and then seriously affect the information exchange between cognitive nodes and greatly reduce the whole efficiency of network.Therefore, existing
In distributed cognition wireless network, multiple shared control channels are usually set, chance that Lai Tigao cognitive nodes interact increases
The robustness of strong network.
In the distributed wireless networks with multiple shared control channels, cognitive nodes need multiple control channels it
Between jumped to guarantee to can be realized between cognitive nodes and cross.C.Cormio is in Ad Hoc Networks, and 2010,8,
430-438: " Common Control Channel Design for Cognitive Radio Wireless Ad Hoc
Networks Using Adaptive Frequency Hopping " the shared control of cognitive nodes random access is proposed in a text
The method of channel processed, but do not ensure that crossing between completing cognitive nodes in a specified time.S.Krishnamurthy exists
Computer Networks, 2008 (52), 831-849: " Time-Efficient Distributed Layer-2Auto-
Configuration for Cognitive Radio Networks " propose in a text it is a kind of based on traversal broadcast mechanism
Channel hopping mechanism, but can be only applied to the scene of the complete time synchronization of all cognitive nodes.K.Bian in MobiCom,
2009: " A Quorum-Based Framework for Establishing Control Channels in Dynamic
Spectrum Access Networks " time synchronization based on Quorum system is proposed in a text and time asynchronous channel is jumped
Variable mechanism, however the time asynchronous channel jump mechanism proposed is only applicable in system that there are two shared control channels.
In addition, channel hopping crosses, mechanism only guarantees that multiple cognitive nodes can access identical control channel simultaneously, and
Successfully to realize information exchange, it is necessary to guarantee that only a cognitive nodes are in transmission state when channel crosses, remaining institute
There are cognitive nodes to be in reception state.MarkD.Silvius is in IEEE Milicom, and 2009: " Rendezvous mac
Protocols for use in cognitive radio networks " propose that use is " back-to-back " to repeat plan in a text
Time slot design method slightly, however the algorithm does not ensure that time asynchronous cognitive nodes cross in channel completes information in time slot
Interaction.
Summary of the invention
It is an object of the invention to propose a kind of service channel method for building up suitable for time asynchronous cognitive nodes.Each
Cognitive nodes generate multiple jump channel subsequences using the method based on triangular number, and carry out with multiple fixed channel subsequences
Random combine sequence generates complete channel hopping sequences, and each cognitive nodes are jumped according to the channel sequence that itself is generated.Together
When, channel cross time slot design in, divided multiple sub-slots, using information send with information receive repeat mechanism, guarantee
Time asynchronous reception sends cognitive nodes and completes information exchange in the time slot that crosses.The present invention is suitable for point asynchronous in the time
In cloth environment of cognitive radio network, solves the symmetrical cognitive nodes of multiple identity and complete channel on multiple shared control channels
It crosses and information exchange, and then completes service channel and establish.The present invention can effectively shorten service channel settling time, and for point
Cognitive nodes carry out environment sensing information exchange in cloth cognition wireless network and Traffic Channel negotiates to provide reliable and stable duty
Business channel.
The technical solution adopted by the present invention are as follows:
A kind of service channel method for building up suitable for time asynchronous cognitive nodes, which comprises the following steps:
The service channel establishment process of source node:
(1) each source node generates multiple jump channel subsequences according to the shared control channel number of systems organization respectively
With multiple fixed channel subsequences, multiple jump channel subsequences and multiple fixed channel subsequences are subjected to randomly ordered combination
At a complete channel hopping sequences；Wherein, source node is the cognitive nodes with data sending request；
(2) source node is linked into first channel in the complete channel hopping sequences of itself generation；
(3) source node listens to current channel condition, if channel busy, only receives channel massage, if channel idle, uses
Request time slot format broadcast transmission service channel establishes request message and receives channel massage；
(4) source node demodulates the channel massage received, if the channel massage received is from purpose section
The service channel of point establishes response message, then source node, which is garrisoned in the channel and sends service channel to destination node, establishes notice
Message；Otherwise, source node is linked into next channel by complete channel hopping sequences sequence, using subsequent channels as current letter
Road jumps to (3)；
The service channel establishment process of destination node:
(5) each destination node generates the sub- sequence of multiple jump channels according to the shared control channel number of systems organization respectively
Multiple jump channel subsequences and multiple fixed channel subsequences are carried out randomly ordered group by column and multiple fixed channel subsequences
Synthesize a complete channel hopping sequences；Wherein, destination node is that the data of source node send object aware node；
(6) destination node is linked into first channel in the complete channel hopping sequences of itself generation；
(7) destination node receives message and is demodulated on present channel, disappears if receiving service channel and establishing request
It ceases and the destination address of message is this node, then destination node is garrisoned in the channel；Otherwise, destination node is jumped by complete channel
Sequence order is linked into next channel and receives message and demodulated, and establishes request message until receiving service channel and disappears
The destination address of breath is this node；
(8) destination node is sent service channel and established and rung using response time slot format on the channel garrisoned to source node
Message is answered, until receiving the service channel from source node establishes notification message.
The step of wherein described (1) specifically includes the following steps:
(101) each cognitive nodes building length is N'sA jump channel subsequence, N is distributed cognition
The shared control channel number of wireless network enablesJ=1 ..., N, then j-th of i-th of jump subsequence
Element is (Ti+ j-1) modN, whereinFor the triangular number of i；
(102) N number of fixed channel subsequence that each cognitive nodes building length is N, enables k=1 ..., and N then consolidates for k-th
All N number of elements for determining channel subsequence are k；
(103) each cognitive nodes are as unit of subsequence, by generationA jump channel subsequence and N number of
The progress of fixed channel subsequence is randomly ordered, and building length isComplete channel hopping sequences.
In the step of wherein described (3) request time slot format design it is as follows: by the entire time slot of system be evenly dividing for
10 sub-slots repeat transmission service channel in the 1-3 sub-slots and establish request message, work as in the 4-5 sub-slots reception
Preceding channel massage sends service channel in the 6th sub-slots and establishes request message, receives present channel in the 7-10 sub-slots
Message.
In the step of wherein described (8) response time slot format design it is as follows: by the entire time slot of system be evenly dividing for
10 sub-slots receive present channel message in the 1-4 sub-slots, send service channel in the 5th sub-slots and establish response
Message receives present channel message in the 6-7 sub-slots, sends service channel foundation response in the 8-10 sub-slots and disappears
Breath.
Wherein, after step (8) further include:
(9) source node and destination node are on the service channel of foundation, using the RTS/CTS method based on 802.11 agreements
It completes respective environment sensing information exchange and Traffic Channel is negotiated.
The present invention has following major advantage compared to background technique:
1, the complete channel hopping sequences that construct of the present invention by multiple jump channel subsequences and fixed channel subsequence with
Machine sequence composition can guarantee that each cognitive nodes carry out jump according to the sequence oneself generated and realize between multiple cognitive nodes
Crossing on multiple shared control channels.
2, the channel time slot that crosses is divided into multiple sub-slots by the present invention, and is devised information and sent to receive with information and repeat
The time slot format that crosses, can guarantee time asynchronous transmission, receive cognitive nodes and complete information in the channel time slot that crosses
Interaction.
3, the present invention uses channel hopping mechanism and the duplicate time slot design scheme that crosses of more sub-slots information transmit-receives, can
Realize that service channel is established in selection between multiple shared candidate control channels between cognitive nodes, can effectively support cognitive nodes
Between environment sensing information exchange and Traffic Channel negotiate.
Detailed description of the invention
Fig. 1 is cognitive nodes service channel Establishing process of the present invention.
Specific embodiment
The principle of the present invention and technical solution are further described below.
Referring to Fig.1, implementation process of the invention includes the following:
The service channel establishment process of source node:
The each source node of step 1 generates the sub- sequence of multiple jump channels according to the shared control channel number of systems organization respectively
Multiple jump channel subsequences and multiple fixed channel subsequences are carried out randomly ordered group by column and multiple fixed channel subsequences
Synthesize a complete channel hopping sequences；Specific steps are as follows:
(1.1) each source node building length is N'sA jump channel subsequence, N be distributed cognition without
The shared control channel number of gauze network, enables i=1 ...,J=1 ..., N, then j-th of i-th of jump subsequence
Element is (Ti+ j-1) modN, whereinFor the triangular number of i；
(1.2) N number of fixed channel subsequence that each source node building length is N, enables k=1 ..., N, then k-th of fixation
All N number of elements of channel subsequence are k；
(1.3) each source node is as unit of subsequence, by generationA jump channel subsequence and N number of solid
It is randomly ordered to determine the progress of channel subsequence, building length isComplete channel hopping sequences.
Citing: for a distributed cognition wireless network with 4 shared control channels, i.e. N=4, if shared control
Channel number processed is { 0,1,2,3 }.Each source node needs to generate 6 jump channel subsequences and 4 fixed channel subsequences.
The 1st corresponding triangular number of jump channel subsequence is T1=1, then the 1st jump channel subsequence is { 1,2,3,0 }, successively
Analogize, the 2nd~6 jump channel subsequence be respectively as follows: { 3,0,1,2 }, { 2,3,0,1 }, { 2,3,0,1 }, { 3,0,1,2 }, 1,
2,3,0}.4 fixed channel subsequences are respectively { 0,0,0,0 }, { 1,1,1,1 }, { 2,2,2,2 }, { 3,3,3,3 }.To jump
Channel subsequence and fixed channel subsequence carry out it is randomly ordered, available following complete channel hopping sequences 1,2,3,0,
3,0,1,2,2,3,0,1,2,3,0,1,3,0,1,2,1,2,3,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3}。
Step 2 source node is linked into first channel in the complete channel hopping sequences of itself generation；Wherein, source node
For the cognitive nodes with data sending request.
Step 3 source node listens to current channel condition, if channel busy, only receives channel massage, if channel idle, adopts
Request message is established with request time slot format transmission service channel and receives channel massage；Wherein request time slot format designs such as
Under: the entire time slot of system is evenly dividing as 10 sub-slots, repeats to send service channel foundation in the 1-3 sub-slots and ask
Message is sought, present channel message is received in the 4-5 sub-slots, sends service channel in the 6th sub-slots and establish request message,
Present channel message is received in the 7-10 sub-slots.
Step 4 source node demodulates the channel massage received, if the channel massage received is from purpose
The service channel of node establishes response message, then source node is garrisoned in the channel and sends service channel to destination node and establish and leads to
Know message；Otherwise, source node is linked into next channel by complete channel hopping sequences sequence, using subsequent channels as current letter
Road jumps to step 3.
The service channel establishment process of destination node:
The each destination node of step 5 generates multiple jump channel according to the shared control channel number of systems organization respectively
Sequence and multiple fixed channel subsequences carry out multiple jump channel subsequences and multiple fixed channel subsequences randomly ordered
It is combined into a complete channel hopping sequences；Source node of the detailed process with step 1；
Step 6 destination node is linked into first channel in the complete channel hopping sequences of itself generation；Wherein, purpose
Node is that the data of source node send object aware node.
Step 7 destination node receives message and is demodulated on present channel, if receiving service channel establishes request
The destination address of message and message is this node, then destination node is garrisoned in the channel；Otherwise, destination node is jumped by complete channel
Become sequence order and be linked into next channel and receive message and demodulated, until receive service channel establish request message and
The destination address of message is this node.
Step 8 destination node sends service channel to source node using response time slot format and establishes on the channel garrisoned
Response message, until receiving the service channel from source node establishes notification message；Wherein the design of response time slot format is as follows:
The entire time slot of system is evenly dividing as 10 sub-slots, present channel message is received in the 1-4 sub-slots, at the 5th
Sub-slots send service channel and establish response message, present channel message are received in the 6-7 sub-slots, in the 8-10 period of the day from 11 p.m. to 1 a.m
Gap sends service channel and establishes response message.
Step 9 source node and destination node are on the service channel of foundation, using the RTS/CTS machine based on 802.11 agreements
System completes respective environment sensing information exchange and Traffic Channel is negotiated, and data transmission is completed in the Traffic Channel consulted.
Claims (4)
1. a kind of service channel method for building up suitable for time asynchronous cognitive nodes, which comprises the following steps:
The service channel establishment process of source node:
(1) each source node is according to the shared control channel number of systems organization, generates multiple jump channel subsequences and more respectively
A fixed channel subsequence carries out multiple jump channel subsequences and multiple fixed channel subsequences randomly ordered to be combined into one
A complete channel hopping sequences；Wherein, source node is the cognitive nodes with data sending request；
(2) source node is linked into first channel in the complete channel hopping sequences of itself generation；
(3) source node listens to current channel condition, if channel busy, only receives channel massage, if channel idle, using request
Time slot format sends service channel and establishes request message and receive channel massage；
(4) source node demodulates the channel massage received, if the channel massage received is from destination node
Service channel establishes response message, then source node is garrisoned in the channel and sends service channel foundation notice to destination node and disappears
Breath；Otherwise, source node is linked into next channel by complete channel hopping sequences sequence, using subsequent channels as present channel,
Jump to (3)；
The service channel establishment process of destination node:
(5) each destination node is according to the shared control channel number of systems organization, generate respectively multiple jump channel subsequences and
Multiple jump channel subsequences and multiple fixed channel subsequences are carried out randomly ordered be combined by multiple fixed channel subsequences
One complete channel hopping sequences；Wherein, destination node is that the data of source node send object aware node；
(6) destination node is linked into first channel in the complete channel hopping sequences of itself generation；
(7) destination node receives message and is demodulated on present channel, if receive service channel establish request message and
The destination address of message is this node, then destination node is garrisoned in the channel；Otherwise, destination node presses complete channel hopping sequences
Sequence is linked into next channel and receives message and demodulated, until receiving service channel establishes request message and message
Destination address is this node；
(8) destination node sends service channel foundation response to source node using response time slot format and disappears on the channel garrisoned
Breath, until receiving the service channel from source node establishes notification message；
The step (1) and step (5) specifically includes the following steps:
(201) each cognitive nodes building length is N'sA jump channel subsequence, N are distributed cognition wireless network
The shared control channel number of network enablesJ=1 ..., N, then i-th jump subsequence j-th of element be
(Ti+ j-1) mod N, whereinFor the triangular number of i；
(202) N number of fixed channel subsequence that each cognitive nodes building length is N, enables k=1 ..., N, then k-th of fixed letter
All N number of elements of road subsequence are k；
(203) each cognitive nodes are as unit of subsequence, by generationA jump channel subsequence and N number of fixation
The progress of channel subsequence is randomly ordered, and building length isComplete channel hopping sequences.
2. a kind of service channel method for building up suitable for time asynchronous cognitive nodes according to claim 1, feature
It is, the request time slot format design in the step (3) is as follows: the entire time slot of system is evenly dividing as 10 period of the day from 11 p.m. to 1 a.m
Gap repeats transmission service channel in the 1-3 sub-slots and establishes request message, receives present channel in the 4-5 sub-slots and disappear
Breath sends service channel in the 6th sub-slots and establishes request message, receives present channel message in the 7-10 sub-slots.
3. a kind of service channel method for building up suitable for time asynchronous cognitive nodes according to claim 1, feature
It is, the response time slot format design in the step (8) is as follows: the entire time slot of system is evenly dividing as 10 period of the day from 11 p.m. to 1 a.m
Gap receives present channel message in the 1-4 sub-slots, sends service channel in the 5th sub-slots and establish response message, the
6-7 sub-slots receive present channel message, send service channel in the 8-10 sub-slots and establish response message.
4. a kind of service channel method for building up suitable for time asynchronous cognitive nodes according to claim 1, feature
It is, after step (8) further include:
(9) source node and destination node are completed on the service channel of foundation using the RTS/CTS method based on 802.11 agreements
Respective environment sensing information exchange and Traffic Channel are negotiated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611079876.5A CN106535358B (en) | 2016-11-30 | 2016-11-30 | A kind of service channel method for building up suitable for time asynchronous cognitive nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611079876.5A CN106535358B (en) | 2016-11-30 | 2016-11-30 | A kind of service channel method for building up suitable for time asynchronous cognitive nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106535358A CN106535358A (en) | 2017-03-22 |
| CN106535358B true CN106535358B (en) | 2019-06-28 |
Family
ID=58354217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611079876.5A Active CN106535358B (en) | 2016-11-30 | 2016-11-30 | A kind of service channel method for building up suitable for time asynchronous cognitive nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106535358B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102307392A (en) * | 2011-08-17 | 2012-01-04 | 东南大学 | Relevance-based access method of frequency-hopping communication system |
| CN104168622A (en) * | 2014-09-01 | 2014-11-26 | 西安电子科技大学 | Distributed multi-channel handshaking method based on channel jumping |
| CN105208661A (en) * | 2015-11-04 | 2015-12-30 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel distribution method and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8693520B2 (en) * | 2009-10-01 | 2014-04-08 | Qualcomm Incorporated | Channel hopping based content protection having an out-of-band communication band |
| US9584291B2 (en) * | 2013-09-24 | 2017-02-28 | Qualcomm Incorporated | Control signaling for enabling two-hop orthogonalization for device-to-device broadcasts |
-
2016
- 2016-11-30 CN CN201611079876.5A patent/CN106535358B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102307392A (en) * | 2011-08-17 | 2012-01-04 | 东南大学 | Relevance-based access method of frequency-hopping communication system |
| CN104168622A (en) * | 2014-09-01 | 2014-11-26 | 西安电子科技大学 | Distributed multi-channel handshaking method based on channel jumping |
| CN105208661A (en) * | 2015-11-04 | 2015-12-30 | 浪潮(北京)电子信息产业有限公司 | Wireless network channel distribution method and system |
Non-Patent Citations (1)
| Title |
|---|
| 分布式天线系统中的资源优化;闫继垒;《中国博士学位论文全文数据库 信息科技辑》;20150515;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106535358A (en) | 2017-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6625641B2 (en) | Traffic Advertisement in Neighbor Aware Network (NAN) Data Path | |
| CN105144761B (en) | System and method for the mark in neighborhood aware network | |
| US7343162B2 (en) | Wireless communication method, wireless communication apparatus, and wireless communication system | |
| CN104185217B (en) | Parallel data transmission processing method and processing device | |
| CN107211373A (en) | Trigger-type target recovery time is operated | |
| CN1333563C (en) | Medium-access control protocol hierarchical module and method for transmitting and receiving frame of medium-access control protocol hierarchical module | |
| JP5389801B2 (en) | Wireless communication system, communication terminal, management terminal, communication method, and integrated circuit | |
| MX2007011224A (en) | Reducing beacon slot acquisition time in a distributed media access control network. | |
| KR101349182B1 (en) | Wireless sensor network and method for communicating thereof | |
| CN108834182B (en) | Token ring based wireless ad hoc network MAC layer channel access and resource reservation method | |
| US20230224996A1 (en) | Method and apparatus for performing link reconfiguration between mlds in wireless lan system | |
| CN105935001A (en) | Redundant scheduling information for direct communication | |
| EP3231241A1 (en) | Traffic advertisement in neighbor aware network (nan) data path | |
| US20130064166A1 (en) | System and Method for Direct Multi-User Transmission | |
| CN105704821A (en) | Channel mapping based MAC protocol of multi-channel distribution method | |
| Wu et al. | Large-scale access scheduling in wireless mesh networks using social centrality | |
| US20220210631A1 (en) | Method and device for device discovery using uwb | |
| CN106936557B (en) | Wireless channel resource allocation method | |
| CN106535358B (en) | A kind of service channel method for building up suitable for time asynchronous cognitive nodes | |
| Li et al. | Channel access proposal for enabling quick discovery for D2D wireless networks | |
| WO2009129669A1 (en) | Method and device for data routing and bandwidth reservation in small scale distributed networks | |
| CN106465130B (en) | A kind of method and relevant device for carrying out data transmission in neighbouring sensing network | |
| CN102123010A (en) | Data transmission method for medium access control (MAC) layer in wireless local area network | |
| KR101890499B1 (en) | D2d communication method and apparatus based on channel hopping | |
| WO2014029353A1 (en) | Method for establishing association in wireless local area network, access point and station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |