CN110381562A - Wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop - Google Patents
Wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop Download PDFInfo
- Publication number
- CN110381562A CN110381562A CN201910582629.4A CN201910582629A CN110381562A CN 110381562 A CN110381562 A CN 110381562A CN 201910582629 A CN201910582629 A CN 201910582629A CN 110381562 A CN110381562 A CN 110381562A
- Authority
- CN
- China
- Prior art keywords
- information source
- channel
- information
- node
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 230000008878 coupling Effects 0.000 title claims abstract description 15
- 238000010168 coupling process Methods 0.000 title claims abstract description 15
- 238000005859 coupling reaction Methods 0.000 title claims abstract description 15
- 230000005540 biological transmission Effects 0.000 claims abstract description 51
- 238000001514 detection method Methods 0.000 claims abstract description 17
- 230000002596 correlated effect Effects 0.000 claims abstract description 5
- 230000011664 signaling Effects 0.000 claims description 9
- 238000012804 iterative process Methods 0.000 claims description 8
- 238000004422 calculation algorithm Methods 0.000 claims description 6
- 230000006855 networking Effects 0.000 claims description 6
- 238000000342 Monte Carlo simulation Methods 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 238000012549 training Methods 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims 1
- 238000004891 communication Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 230000000875 corresponding effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000002045 lasting effect Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000003339 best practice Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless distributed contract network cut-in methods based on the double-deck loose coupling Optimal Stop.This method are as follows: first jumps the channel competition that multiple information source nodes are distributed with the when form-separating of mini-slot, relay node is by the signal-to-noise ratio and threshold value comparison under the first hop channel of triumph information source node, if being not less than threshold value, it is defeated that the first jump set then is completed using access channel, otherwise triumph information source node abandons channel, and all information source nodes start new round competition in next mini-slot；The channel access that starting second is jumped, relay node send RTS packet to information destination node, and information destination node calculates the reachable transmission rate of the second hop channel, if the second reachable maximum rate jumped jumps transmission rate not less than first, relay node is transmitted to information destination node；Otherwise, relay node is abandoned transmitting, and continues channel detection after the correlated time of channel；Above procedure is repeated, until the second hop-information is transmitted.The present invention improves the average throughput of wireless network.
Description
Technical field
The invention belongs to wireless communication technology field, especially a kind of distribution of wireless based on the double-deck loose coupling Optimal Stop
Formula contract network cut-in method.
Background technique
Continuous promotion with wireless communication technique development and user to communication requirement, available frequency spectrum resource are increasingly tight
, how better communication quality, such as the high and low delay of information rate, high reliability are provided under limited resources, is wireless group
Net one of problem in the urgent need to address.
In distributed wireless cooperative network, random competition mode is generallyd use between each user and accesses channel, competition process
Randomness and multiuser channel time variation (reasons such as communication distance changes, blocks, signal multipath), when often result in and actually connect
Enter the bad problem of user's transmission quality of channel, the user that channel quality is good does not access, and the low problem of channel utilization is tight
It is high.In order to solve this problem, communication quality is improved, main resolving ideas is to introduce relay node, passes through information source-relaying, relaying-
The double bounce auxiliary transmission of the stay of two nights, improves the communication quality of point-to-point channel；In conjunction with dynamic channel access decision-making mechanism, realize altogether
Enjoy efficient utilization of the limited channel resources of channel between multi-user.For distributed channel access, there are mainly two types of solutions at present
Certainly method, specific as follows:
The first strategy be information source-information destination node to and relay node centralized control transmission mode.Pass through information source-stay of two nights
Node realizes that all channel of relay node perceives to the Signalling exchange of limited expense, and combines the time variation of channel quality, design
Under distribution mode multiple source-information destination node to and relay node auxiliary under efficient channel cut-in method.Such methods are applicable in
It is few in relay node, it obtains under the scene that whole channel information expenses are less between information source-information destination node pair, it can be achieved that optimal
Network throughput statistical property is optimal.
Second of strategy be information source-information destination node to and trunk channel ad-hoc mode, i.e., information source-information destination node is to by having
In the case that the Signalling exchange of limit expense only obtains source-relay node channel quality, multiple source node and more relayings are proposed
Optimal dynamic access method of the node under full distributed operation.The corresponding best practice of such case be suitable for relay node compared with
More situations.When to avoid whole channel informations detection expenses are excessive from causing to be difficult to obtain information in real time and influence effective information transmission
Between, relay node is transmitted by completing the second hop-information from master mode competitive channel.
But all there is respective disadvantage in above two method:
1, information source-information destination node to and the central controlled method of relay node, limit of the applicability by junction network scale
System.And with the increase of number of nodes, the signaling overheads time is linearly increased, and network transmission efficiency is remarkably decreased.Meanwhile two
Jump set is defeated general using time division way, and information source-information destination node pair single transmission effective time is by double bounce correlated time of channel shadow
Sound halves, and signaling is occupied effect transmission time ratio and further enhanced, and efficiency of transmission is lower.
2, information source-information destination node pair haves the shortcomings that channel utilization is low with the method for relay node channel autonomous control.
Under which, multiple information source-information destination nodes to the equal autonomous operation of all relay nodes, take full advantage of the time of two hop channels
Diversity.To under distributed model, information source node, relay node only obtain the local message of own channel, the acquisition of additional information
Distributed contention process is undergone, leads to more time expense, affects efficiency of transmission.
Summary of the invention
The purpose of the present invention is to provide a kind of average throughputs that can reduce computation complexity, improve wireless cooperation network
The wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop of amount.
The technical solution for realizing the aim of the invention is as follows: a kind of based on the wireless distributed of the double-deck loose coupling Optimal Stop
Contract network cut-in method makees wireless distributed contract network model and portrays as follows: in wireless distributed contract network, depositing
In M information source-information destination node pair, method accesses channel transmission information in a distributed manner；Each information source-information destination node is single to distribution
A relay node assists information source-information destination node to communicating by decoding-forward mode；
Method includes the following steps:
The channel competition that step 1, the first M information source node of jump are distributed with the when form-separating of mini-slot, when lasting
Between δ mini-slot in, each information source node in a random basis to relay node send a RTS packet, sending probability p, Bao Changwei
τRTS；
After step 2, multi-source node successfully complete channel competition, the RTS of relay node triumph information source node based on the received
The training symbol sequence carried is wrapped, calculates triumph information source node to itself channel quality, i.e. the first hop channel gain, decision is
No access channel；Triumph information source node i obtains the signal-to-noise ratio under the first hop channel, is denoted as SNRf；
Step 3, by the Signal to Noise Ratio (SNR) under the first hop channel of triumph information source nodefWith threshold value SNR0Compare, if SNRf≥
SNR0, then it is defeated the first jump set to be completed using access channel, and feeds back CTS packet to triumph information source node and other information source nodes；If
SNRf< SNR0, then information source node of winning abandons channel, and relay node active feedback CTS packet reports the decision to information source node, and
Return step 1, all information source nodes start new round competition in next mini-slot；
Step 4 after completing the first hop count according to transmission, starts the second channel access jumped, and relay node is sent out to information destination node
RTS packet is sent, by character string in RTS packet, information destination node calculates the second hop channel quality, is indicated with up to information rate, remembers
For rg；Information destination node feeds back CTS packet to relay node simultaneously, informs the rate information；
If step 5, the second reachable maximum rate log jumped2(1+rg) transmission rate R is jumped not less than firstn, then relay
Node is with transmission rate RnIn correlated time of channel τdIt is interior to be transmitted to information destination node；Otherwise, relay node is abandoned transmitting, and is believing
Road correlation time τdAfterwards, return step 4 continue channel detection, repeat above procedure, until the second hop-information transfers
At.
Further, the channel that first M information source node of jump is distributed described in step 1 with the when form-separating of mini-slot
Competition, in the mini-slot of duration δ, each information source node sends a RTS packet to relay node in a random basis, sends general
Rate is p, Bao Changwei τRTS, it is specific as follows:
Situation 1: if all information source nodes do not send RTS packet, all information source nodes perceive on channel to be sent without information,
All information source nodes carry out new round channel competition in next mini-slot；
Situation 2: if there is two or more information source nodes send RTS packet, colliding, and collision probability is 1- (1-
p)M-Mp(1-p)M-1, then whether information source node has the response of relay node CTS packet after occurring by sensing collision, judges to send packet
It collides, repetition step 1, in next mini-slot, all information source nodes start new round channel competition；
Situation 3: if an only information source node sends RTS packet, probability is Mp (1-p)M-1, other information source nodes can
It is occupied to perceive channel, then the information source node is to compete successful information source node, is based on signaling packet length and mini-slot networking
Configuration, information source node complete the average time τ of success channel competition in a distributed fashion1Are as follows:
Wherein, τRTSAnd τCTSRespectively indicate the duration of RTS packet and CTS packet.
Further, by the Signal to Noise Ratio (SNR) under the first hop channel of triumph information source node described in step 3fWith threshold value SNR0Than
Compared with specific as follows:
Threshold value SNR0Meet
Wherein, σiIt is i-th of information source competition mini-slot duration, τ2The detection and wait that transmission process is spent are jumped for second
To time, τ2=τRTS+τCTS+τd；μiWith λ*For system parameter, λ*、μiIt is obtained by iteration；
If SNRf≥SNR0, then it is defeated to complete the first jump set using access channel, and feed back CTS packet to triumph information source node and
Other information source nodes；The symbol R carried in CTS packetnInformation indicate triumph information source node to relay node the first hop channel most
Big accessible information rate；Then information source node is with transmission rate RnIt is transmitted, transmission time is the phase of the first hop channel
Dry time τd, transmission rate Rn=log2(1+min{SNRf,μi), wherein parameter μiMeet equationτ2The detection and waiting time that transmission process is spent, and τ are jumped for second2=τRTS+τCTS+τd；
Parameter lambda*For fixed value, meet following equation:
If SNRf< SNR0, then information source node of winning abandons channel, and relay node active feedback CTS packet gives information source node report
The decision is accused, other information source nodes receive the CTS packet and learn the decision, then, return step 1, in next mini-slot
All information source nodes start new round competition.
Further, the parameter lambda*, iterative process is as follows:
Parameter lambda*It is calculated by following iterative process:
λK+1=λK+α·dk (7-1)
λ in formulaK, K=1,2 ..., ∞ are threshold series, are calculated by formula (7-1), (7-2) iterative formula, initial value λ0
It is any nonnegative number；α is iteration step length, meets condition ε≤α≤(2- ε)/(τ1+τ2+τCTS)；ε > 0 is the iteration of convergence algorithm
Precision thresholding, when | λK+1-λKWhen |≤ε, λ is obtained*=λK+1；
Expectation computing is in iterative formulaPass through the product of probability score based on channel statistic
Value is calculated, or is obtained by Monte Carlo simulation method approximation；
Threshold series λK, K=1,2 ..., ∞ converges to λ by the interative computation proof of formula (7-1)*；Iterative algorithm is by being
Number K is updated, when | λK+1-λKWhen |≤ε, convergence is completed.
Further, the parameter μi, iterative process is as follows:
For each information source node, numerical value μiBy iterative formula xl+1=Φ (xl) obtain, function representation are as follows:
X in formulal, l=1,2 ..., ∞ are threshold series, are iterated to calculate by formula (8-1), initial value x0It is one non-
Negative value, value are the number greater than 0 randomly selected；The convergence precision that numerical value calculates is η, when | xl+1-xlIteration knot when |≤η
Beam obtains μi=xl+1。
Compared with prior art, the present invention its remarkable advantage is: (1) being jumped in the second hop channel overall performance better than first
Under conditions of channel, wireless network average throughput is significantly improved；(2) first jump decisions only need once to be compared, and
Second jump decision then needs to be compared several times, reduces computation complexity tactful each time, improves network transmission efficiency.
Detailed description of the invention
Fig. 1 is the structural schematic diagram of the wireless distributed contract network system model of the present invention.
Fig. 2 is the process of the wireless distributed contract network cut-in method the present invention is based on the double-deck loose coupling Optimal Stop
Figure.
Fig. 3 is λ in the present invention*The flow diagram of iterative calculation.
Fig. 4 is μ in the present inventioniThe flow diagram of iterative calculation.
Fig. 5 is the performance schematic diagram of network average throughput in the embodiment of the present invention.
Fig. 6 is the performance schematic diagram of network average throughput in the embodiment of the present invention.
Specific embodiment
The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.
In conjunction with Fig. 1, the present invention is based on the wireless distributed contract network cut-in methods of the double-deck loose coupling Optimal Stop, to nothing
Line distributed collaboration network model is done to be portrayed as follows: in wireless distributed contract network, there are M information source-information destination node pair,
Channel transmission information is accessed in a distributed manner；Each information source-information destination node passes through decoding-forwarding mould to single relay point is distributed
Formula assists information source-information destination node to communicating.
This model does not consider information source-information destination node pair direct link situation, and all transmission data and Signalling exchange need
By relay node, realized using information source-relay node and relaying-information destination node double bounce transmission.
In conjunction with Fig. 2, a kind of wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop, including with
Lower step:
(1) source node channel competition process
Step 1: the channel competition that the first M information source node of jump is distributed with the when form-separating of mini-slot, when lasting
Between δ mini-slot in, each information source node in a random basis to relay node send a RTS packet, sending probability p, Bao Changwei
τRTS, there are following 3 kinds of situations:
Situation 1: if all information source nodes do not send RTS packet, all information source nodes perceive on channel to be sent without information,
All information source nodes carry out new round channel competition in next mini-slot；
Situation 2: if there is two or more information source nodes send RTS packet, colliding, and collision probability is 1- (1-
p)M-Mp(1-p)M-1, then whether information source node has the response of relay node CTS packet after occurring by sensing collision, judges to send packet
It collides, repetition step 1, in next mini-slot, all information source nodes start new round channel competition；
Situation 3: if an only information source node sends RTS packet, probability is Mp (1-p)M-1, other information source nodes can
It is occupied to perceive channel, then the information source node is to compete successful information source node, is based on signaling packet length and mini-slot networking
Configuration, information source node complete the average time τ of success channel competition in a distributed fashion1Are as follows:
Wherein, τRTSAnd τCTSRespectively indicate the duration of RTS packet and CTS packet.
(2) source node channel access process
Step 2: after multi-source node successfully completes channel competition, the RTS of relay node triumph information source node based on the received
The training symbol sequence carried is wrapped, calculates triumph information source node to itself channel quality, i.e. the first hop channel gain, decision is
No access channel；Triumph information source node i obtains the signal-to-noise ratio under the first hop channel, is denoted as SNRf。
Step 3: by the Signal to Noise Ratio (SNR) under the first hop channel of triumph information source nodefWith threshold value SNR0Compare, threshold value SNR0It is full
Foot:
Wherein, σiIt is i-th of information source competition mini-slot duration, τ2The detection and wait that transmission process is spent are jumped for second
To time, τ2=τRTS+τCTS+τd；μiWith λ*For system parameter, λ*Meet equation (3-2), is obtained by iterative formula (7-1).μi
It is obtained by iterative formula (8-1)；
If SNRf≥SNR0, then it is defeated to complete the first jump set using access channel, and feed back CTS packet to triumph information source node and
Other information source nodes；The symbol R carried in CTS packetnInformation indicate triumph information source node to relay node the first hop channel most
Big accessible information rate；Then information source node is with transmission rate RnIt is transmitted, transmission time is the phase of the first hop channel
Dry time τd, transmission rate Rn=log2(1+min{SNRf,μi), wherein parameter μiMeet equationτ2The detection and waiting time that transmission process is spent, and τ are jumped for second2=τRTS+τCTS+τd；
Parameter lambda*For fixed value, meet following equation:
If SNRf< SNR0, then information source node of winning abandons channel, and relay node active feedback CTS packet gives information source node report
The decision is accused, other information source nodes receive the CTS packet and learn the decision, then, return step 1, in next mini-slot
All information source nodes start new round competition.
(3) relay point channel access process
Step 4: after completing the first hop count according to transmission, the channel access that starting second is jumped, relay node is sent out to information destination node
RTS packet is sent, by the character string in RTS packet, information destination node calculates the second hop channel quality, it is indicated with up to information rate,
It is denoted as rg；Information destination node feeds back CTS packet to relay node simultaneously, informs the rate information；
Step 5: if the second reachable maximum rate log jumped2(1+rg) transmission rate R is jumped not less than firstn, then relay
Node is with transmission rate RnIn τdIt is transmitted in time to information destination node；Otherwise, relay node is abandoned transmitting, and in channel correlation
Between τdAfterwards, return step 4 continue channel detection, repeat above procedure, until the second hop-information is transmitted.It is specific next
It says, relay node is abandoned transmitting, and continues channel detection after the correlated time of channel, waits channel coherency time τdAfterwards,
The second hop channel situation of change of detection is interacted by new round RTS/CTS packet between relay node and information destination node, if detected
Second, which jumps transmission rate, jumps transmission rate R not less than firstn, then the second hop count is carried out according to transmission；Otherwise, return step 4 are continued
Channel detection is carried out, above procedure is repeated, until the second hop-information is transmitted.
In above-mentioned access procedure, need system parameter to be used can by obtaining offline, specific calculation flow chart such as Fig. 2 and
Shown in Fig. 3.Fig. 2 provides parameter lambda*Iterative process, Fig. 3 provides corresponding iteration updated value λkOptimal transmission threshold value μi。
In conjunction with Fig. 3, parameter lambda*Iterative process are as follows:
λK+1=λK+α·dk (7-1)
λ in formula0It is a non-negative initial value, value is the number greater than 0 randomly selected, such as λ0=1；α is iteration step
It is long, meet condition ε≤α≤(2- ε)/(τ1+τ2+τCTS)；ε > 0 is the iteration precision thresholding of convergence algorithm, needs to carry out by precision
Selection, typical value are 10-3；When | λK+1-λKWhen |≤ε, λ is obtained*=λK+1
Expectation computing is in iterative formulaPass through the product of probability score based on channel statistic
Value is calculated, or is obtained by Monte Carlo simulation method approximation；
Threshold series λK, K=1,2 ..., ∞ are threshold series, can be demonstrate,proved by the interative computation of formula (7-1), (7-2)
It is bright to converge to λ*；Iterative algorithm is updated by COEFFICIENT K, when | λK+1-λKWhen |≤ε, convergence is completed.
In conjunction with Fig. 4, for each information source node, numerical value μiIt can be by iterative formula xl+1=Φ (xl) obtain, function representation are as follows:
X in formulal, l=1,2 ..., ∞ are threshold series, are iterated to calculate by formula (8-1), initial value x0It is one non-
Negative value, value are the number greater than 0 randomly selected；The convergence precision that numerical value calculates is η, when | xl+1-xlIteration knot when |≤η
Beam obtains μi=xl+1。
Relatively with information source-stay of two nights to relaying focus control mode and trunk channel autonomous control mode, based on the double-deck loose coupling
Close Optimal Stop mode the advantages of be that the first jump decision only needs once to be compared, and second jump decision then need to carry out it is several
Secondary comparison.Therefore, computation complexity tactful each time is low, with number of users not existence function relationship, computation complexity O
(1), it relays focus control mode and is limited to relay network node scale, as number of nodes increases, the overhead time of signaling
Increase, network transmission efficiency may decline, and the competition impacts of more relay points of trunk channel autonomous control mode net
Network performance.
Embodiment 1
The distributed network of the present embodiment include 15 information source-information destination nodes pair, the system channel bandwidth μ s of 2MHz, δ=20,
τRTS=τCTS=40 μ s, τd=8ms, p=0.1,System emulation is as shown in Figure 5 and Figure 6.In Fig. 5, the
The average signal-to-noise ratio value of one hop channel is 0.5, and the average signal-to-noise ratio emulation section of the second hop channel is that can see from 1 to 30
It arrives, the network throughput performance of this method is significantly better than other methods, and the second detection times jumped are with average signal-to-noise ratio
Increase and reduces.In Fig. 6, the average signal-to-noise ratio value of the first hop channel is 1, and the average signal-to-noise ratio of the second hop channel emulates section
For from 8 to 26, it can be seen that this method has better throughput performance.
Since the first jump decision is made by the source node that competition is won, so only need once to be compared, and compare
Thresholding μi, i=1,2 ..., M and λ*It can be obtained by off-line calculation；Second jumps by relay point decision, it is only necessary to carry out several subthresholds
Value comparison.Since required parameter can be obtained by off-line calculation, tactful computation complexity is low each time, does not deposit with number of users
It is contacting, computation complexity is O (1).From it is theoretical and combine simulation result it is found that this method be adapted to the second jump be averaged SNR compared with
High scene.In actual use, there is the method for preferable handling capacity in conjunction with other in low SNR scene, carries out adaptive strategy choosing
It selects, SNR can be reached down to the efficient networking performance in high situation.
In conclusion the present invention efficiently utilizes radio channel resource to obtain most for wireless distributed relay network node
The problem of excellent networking performance, proposes the channel access method based on relay node double bounce (information source-relaying, relaying-purpose) transmission,
By double bounce transmission process Decoupling design, channel access efficiency is promoted.Specifically, information source jumps good channel quality in acquisition first
On the basis of, relaying waiting is carried out, jumps into row detection and assessment to second, reaches the threshold value of transmission in the second hop channel quality of acquisition
Carry out data transmission after condition, completes channel access.According to simulation result, this method jumps (relaying-purpose) channel tool second
Have under larger state of signal-to-noise, can efficiently utilize wireless channel, obtains bigger transmission handling capacity.In point based on relaying
In cloth wireless networking environment, this method can be selected in due course according to the channel quality condition of actual detection, improve wireless cooperation net
The average throughput of network.
Claims (5)
1. a kind of wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop, which is characterized in that nothing
Line distributed collaboration network model is done to be portrayed as follows: in wireless distributed contract network, there are M information source-information destination node pair,
Method accesses channel transmission information in a distributed manner；Each information source-information destination node passes through decoding-to single relay node is distributed
Forward mode assists information source-information destination node to communicating；
Method includes the following steps:
The channel competition that step 1, the first M information source node of jump are distributed with the when form-separating of mini-slot, duration δ's
In mini-slot, each information source node sends a RTS packet, sending probability p, Bao Changwei τ to relay node in a random basisRTS；
After step 2, multi-source node successfully complete channel competition, the RTS packet of relay node triumph information source node based on the received is taken
The training symbol sequence of band calculates triumph information source node to itself channel quality, i.e. the first hop channel gain decides whether to connect
Enter channel；Triumph information source node i obtains the signal-to-noise ratio under the first hop channel, is denoted as SNRf；
Step 3, by the Signal to Noise Ratio (SNR) under the first hop channel of triumph information source nodefWith threshold value SNR0Compare, if SNRf≥SNR0, then
It is defeated that the first jump set is completed using access channel, and feeds back CTS packet to triumph information source node and other information source nodes；If SNRf<
SNR0, then information source node of winning abandons channel, and relay node active feedback CTS packet reports the decision to information source node, and returns
Step 1, all information source nodes start new round competition in next mini-slot；
Step 4 after completing the first hop count according to transmission, starts the second channel access jumped, and relay node sends RTS to information destination node
Packet, by character string in RTS packet, information destination node calculates the second hop channel quality, is indicated with up to information rate, is denoted as rg；
Information destination node feeds back CTS packet to relay node simultaneously, informs the rate information；
If step 5, the second reachable maximum rate log jumped2(1+rg) transmission rate R is jumped not less than firstn, then relay node
With transmission rate RnIn correlated time of channel τdIt is interior to be transmitted to information destination node；Otherwise, relay node is abandoned transmitting, and in channel phase
Close time τdAfterwards, return step 4 continue channel detection, repeat above procedure, until the second hop-information is transmitted.
2. the wireless distributed contract network cut-in method according to claim 1 based on the double-deck loose coupling Optimal Stop,
It is characterized in that, the channel competition that first M information source node of jump is distributed described in step 1 with the when form-separating of mini-slot,
In the mini-slot of duration δ, each information source node sends a RTS packet to relay node in a random basis, and sending probability is
P, Bao Changwei τRTS, it is specific as follows:
Situation 1: if all information source nodes do not send RTS packet, all information source nodes perceive on channel to be sent without information, is owned
Information source node carries out new round channel competition in next mini-slot；
Situation 2: if there is two or more information source nodes send RTS packet, colliding, and collision probability is 1- (1-p)M-Mp
(1-p)M-1, then whether information source node has the response of relay node CTS packet after occurring by sensing collision, judges to send packet collision, weight
Multiple step 1, in next mini-slot, all information source nodes start new round channel competition；
Situation 3: if an only information source node sends RTS packet, probability is Mp (1-p)M-1, other information source nodes can perceive
Occupied to channel, then the information source node is to compete successful information source node, is configured based on signaling packet length and mini-slot networking,
Information source node completes the average time τ of success channel competition in a distributed fashion1Are as follows:
Wherein, τRTSAnd τCTSRespectively indicate the duration of RTS packet and CTS packet.
3. the wireless distributed contract network cut-in method according to claim 1 based on the double-deck loose coupling Optimal Stop,
It is characterized in that, by the Signal to Noise Ratio (SNR) under the first hop channel of triumph information source node described in step 3fWith threshold value SNR0Compare, has
Body is as follows:
Threshold value SNR0Meet
Wherein, σiIt is i-th of information source competition mini-slot duration, τ2When jumping the detection and waiting that transmission process is spent for second
Between, τ2=τRTS+τCTS+τd；μiWith λ*For system parameter, λ*、μiIt is obtained by iteration；
If SNRf≥SNR0, then it is defeated the first jump set to be completed using access channel, and feeds back CTS packet to triumph information source node and other
Information source node；The symbol R carried in CTS packetnInformation indicates that the first hop channel maximum of triumph information source node to relay node can
The information rate reached；Then information source node is with transmission rate RnTransmitted, transmission time be the first hop channel it is relevant when
Between τd, transmission rate Rn=log2(1+min{SNRf,μi), wherein parameter μiMeet equation
τ2The detection and waiting time that transmission process is spent, and τ are jumped for second2=τRTS+τCTS+τd；Parameter lambda*For fixed value, meet with
Lower equation:
If SNRf< SNR0, then information source node of winning abandons channel, and relay node active feedback CTS packet should to information source node report
It determines, other information source nodes receive the CTS packet and learn the decision, and then, return step 1 owns in next mini-slot
Information source node starts new round competition.
4. the wireless distributed contract network cut-in method according to claim 3 based on the double-deck loose coupling Optimal Stop,
It is characterized in that, the parameter lambda*, iterative process is as follows:
Parameter lambda*It is calculated by following iterative process:
λK+1=λK+α·dk (7-1)
λ in formulaK, K=1,2 ..., ∞ are threshold series, are calculated by formula (7-1), (7-2) iterative formula, initial value λ0It is to appoint
Meaning nonnegative number；α is iteration step length, meets condition ε≤α≤(2- ε)/(τ1+τ2+τCTS)；ε > 0 is the iteration precision of convergence algorithm
Thresholding, when | λK+1-λKWhen |≤ε, λ is obtained*=λK+1；
Expectation computing is in iterative formulaBy based on the probability integral numerical value of channel statistic
It obtains, or is obtained by Monte Carlo simulation method approximation；
Threshold series λK, K=1,2 ..., ∞ converges to λ by the interative computation proof of formula (7-1)*；Iterative algorithm presses COEFFICIENT K
It is updated, when | λK+1-λKWhen |≤ε, convergence is completed.
5. the wireless distributed contract network cut-in method according to claim 3 based on the double-deck loose coupling Optimal Stop,
It is characterized in that, the parameter μi, iterative process is as follows:
For each information source node, numerical value μiBy iterative formula xl+1=Φ (xl) (8-1) obtain, function representation are as follows:
X in formulal, l=1,2 ..., ∞ are threshold series, are iterated to calculate by formula (8-1), initial value x0It is one non-negative
Value, value are the number greater than 0 randomly selected；The convergence precision that numerical value calculates is η, when | xl+1-xlIteration terminates when |≤η, obtains
μi=xl+1。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910582629.4A CN110381562B (en) | 2019-06-29 | 2019-06-29 | Wireless distributed cooperative network access method based on double-layer loose coupling optimal stop |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910582629.4A CN110381562B (en) | 2019-06-29 | 2019-06-29 | Wireless distributed cooperative network access method based on double-layer loose coupling optimal stop |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110381562A true CN110381562A (en) | 2019-10-25 |
| CN110381562B CN110381562B (en) | 2020-09-11 |
Family
ID=68251423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910582629.4A Active CN110381562B (en) | 2019-06-29 | 2019-06-29 | Wireless distributed cooperative network access method based on double-layer loose coupling optimal stop |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110381562B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111511038A (en) * | 2019-12-30 | 2020-08-07 | 中国人民解放军军事科学院国防科技创新研究院 | Distributed channel intelligent sensing and access method for wireless cooperative network |
| CN112969240A (en) * | 2021-02-01 | 2021-06-15 | 中国人民解放军军事科学院国防科技创新研究院 | Heterogeneous wireless distributed network intelligent channel access method based on pure threshold decision |
| CN113115470A (en) * | 2021-03-26 | 2021-07-13 | 天津(滨海)人工智能军民融合创新中心 | Distributed channel opportunistic access method of wireless multicast network |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104378798A (en) * | 2014-10-16 | 2015-02-25 | 江苏博智软件科技有限公司 | Optimized distributed collaborative routing method based on Internet of Things |
| CN104618475A (en) * | 2015-01-28 | 2015-05-13 | 清华大学 | Horizontal direction communication method for heterogeneous SDN (self-defending network) and SDN system |
| US9363651B1 (en) * | 2003-05-08 | 2016-06-07 | Dynamic Mesh Networks, Inc. | Chirp networks |
| US20160337426A1 (en) * | 2015-05-14 | 2016-11-17 | Hola Networks Ltd. | System and Method for Streaming Content from Multiple Servers |
| WO2017062635A1 (en) * | 2015-10-06 | 2017-04-13 | Evolv Technologies, Inc. | Training artificial intelligence |
| CN109328439A (en) * | 2016-11-28 | 2019-02-12 | 华为技术有限公司 | Base station, transmitter communication equipment and the relay communications equipment communicated for honeycomb and D2D |
| CN109462858A (en) * | 2017-11-08 | 2019-03-12 | 北京邮电大学 | A kind of wireless sensor network parameter adaptive adjusting method |
-
2019
- 2019-06-29 CN CN201910582629.4A patent/CN110381562B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9363651B1 (en) * | 2003-05-08 | 2016-06-07 | Dynamic Mesh Networks, Inc. | Chirp networks |
| CN104378798A (en) * | 2014-10-16 | 2015-02-25 | 江苏博智软件科技有限公司 | Optimized distributed collaborative routing method based on Internet of Things |
| CN104618475A (en) * | 2015-01-28 | 2015-05-13 | 清华大学 | Horizontal direction communication method for heterogeneous SDN (self-defending network) and SDN system |
| US20160337426A1 (en) * | 2015-05-14 | 2016-11-17 | Hola Networks Ltd. | System and Method for Streaming Content from Multiple Servers |
| WO2017062635A1 (en) * | 2015-10-06 | 2017-04-13 | Evolv Technologies, Inc. | Training artificial intelligence |
| CN109328439A (en) * | 2016-11-28 | 2019-02-12 | 华为技术有限公司 | Base station, transmitter communication equipment and the relay communications equipment communicated for honeycomb and D2D |
| CN109462858A (en) * | 2017-11-08 | 2019-03-12 | 北京邮电大学 | A kind of wireless sensor network parameter adaptive adjusting method |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111511038A (en) * | 2019-12-30 | 2020-08-07 | 中国人民解放军军事科学院国防科技创新研究院 | Distributed channel intelligent sensing and access method for wireless cooperative network |
| CN112969240A (en) * | 2021-02-01 | 2021-06-15 | 中国人民解放军军事科学院国防科技创新研究院 | Heterogeneous wireless distributed network intelligent channel access method based on pure threshold decision |
| CN112969240B (en) * | 2021-02-01 | 2022-09-20 | 中国人民解放军军事科学院国防科技创新研究院 | Heterogeneous wireless distributed network intelligent channel access method based on pure threshold decision |
| CN113115470A (en) * | 2021-03-26 | 2021-07-13 | 天津(滨海)人工智能军民融合创新中心 | Distributed channel opportunistic access method of wireless multicast network |
| CN113115470B (en) * | 2021-03-26 | 2022-12-27 | 天津(滨海)人工智能军民融合创新中心 | Distributed channel opportunistic access method of wireless multicast network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110381562B (en) | 2020-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110381562A (en) | Wireless distributed contract network cut-in method based on the double-deck loose coupling Optimal Stop | |
| CN110290593B (en) | Wireless distributed network opportunistic channel access method based on double-hop threshold decision | |
| CN111294775B (en) | Resource allocation method based on H2H dynamic characteristics in large-scale MTC and H2H coexistence scene | |
| CN102056325B (en) | Multiple access method based on multiple-input multiple-output antenna | |
| CN111511038B (en) | Distributed channel intelligent sensing and access method for wireless cooperative network | |
| Bao et al. | A performance comparison between ad hoc and centrally controlled CDMA wireless LANs | |
| CN101277271B (en) | Access control method for distributed CDMA network medium with controllable power | |
| CN110972162B (en) | Underwater acoustic sensor network saturation throughput solving method based on Markov chain | |
| CN115102606B (en) | Centerless MF-TDMA satellite communication system and networking and resource on-demand adjustment method thereof | |
| CN110351885B (en) | Wireless distributed cooperative network opportunistic channel access method based on threshold measurement | |
| CN108632911B (en) | Self-adaptive collision avoidance real-time medium access control method based on global scheduling | |
| CN116744311B (en) | User group spectrum access method based on PER-DDQN | |
| CN106658647B (en) | A kind of relay selection algorithm based on interference perception | |
| CN110381559B (en) | Distributed wireless network spectrum access method based on global optimal threshold decision | |
| CN113099545A (en) | Multi-address scheduling method for cross-domain network | |
| CN101848032B (en) | Conflict avoidance-based dispatching method for wireless MESH network | |
| KR102209576B1 (en) | The method of link scheduling for data processing and the apparatus thereof | |
| Gau | Modeling the slotted nonpersistent CSMA protocol for wireless access networks with multiple packet reception | |
| Ren et al. | A distributed link scheduler for in-band full duplex wireless networks | |
| Cui et al. | Buffer-aware opportunistic routing for wireless sensor networks | |
| Vvedenskaya et al. | Improved performance of mobile data networks using stack algorithms and receiver capture | |
| CN114630386B (en) | Satellite relay communication method in satellite-ground integrated network | |
| Huang et al. | AoI-Aware Dynamic User Scheduling in Vehicular Networks Based on Soft Reinforcement Learning | |
| Yousefi et al. | Multicast scheduling algorithm supporting spatial mini-slot reuse for IEEE 802.16 mesh networks | |
| Ni et al. | Non-saturated performance analysis of IEEE 802.11 broadcast in 2-D mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhang Zhou Inventor after: Yan Ye Inventor after: Zhong Jian Inventor after: Deng Baosong Inventor after: Qie Zhipeng Inventor after: Hu Xianghui Inventor before: Zhang Zhou Inventor before: Yan Ye Inventor before: Zhong Jian Inventor before: Deng Baosong Inventor before: Qie Zhipeng Inventor before: Hu Xianghui |
|
| CB03 | Change of inventor or designer information |