CN109890063B - A kind of multi-hop relay transmission method based on the channel that partly overlaps - Google Patents
A kind of multi-hop relay transmission method based on the channel that partly overlaps Download PDFInfo
- Publication number
- CN109890063B CN109890063B CN201910373724.3A CN201910373724A CN109890063B CN 109890063 B CN109890063 B CN 109890063B CN 201910373724 A CN201910373724 A CN 201910373724A CN 109890063 B CN109890063 B CN 109890063B
- Authority
- CN
- China
- Prior art keywords
- channel
- node
- relay node
- handling capacity
- relay
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of multi-hop relay transmission methods based on the channel that partly overlaps.First, an orthogonal channel is distributed for each data terminal, then, the network control center executes the relaying based on optimal response-channel associated update algorithm, the repeated link between channel and each terminal that partly overlaps of relay node is updated, so that being able to carry out information exchange between terminal.The present invention can either effectively improve the availability of frequency spectrum, and can save the expense of relay node channel switching and the energy of mobile consumption.
Description
Technical field
The invention belongs to wireless communication technology fields, and in particular to a kind of multi-hop relay transmission based on the channel that partly overlaps
Method.
Background technique
In cordless communication network, due to transmission power is limited, signal transmission has loss etc., the transmission of data terminal
It is limited in scope, it can not direct communication before two terminals apart from each other.Relaying technique can effectively solve the problem that this problem.Positioned at hair
Hold link terminal between (source node) and receiving end (destination node) can by amplification forwarding (amplify-and-forward,
AF) or decoding forwards (decode-and-forward, DF) technology, is forwarded to the signal received, so that destination node
Unsuccessful demodulation signal.But in place of such method Shortcomings.Assuming that only one communication interface of each node.When only consider a source
When node, a relaying and a destination node, if source node and destination node work on the different channels, relay node needs
The first channel receiving information used in source node, then it is switched to channel forwarding information where destination node.When consider multiple source nodes,
When multiple relayings and multiple destination nodes, if source node and destination node work over multiple channels, multiple relayings need to carry out
Channel switching, to guarantee the smooth forwarding of information.In this case, the handover overhead of such method is larger.Solution it
First is that being equipped with multiple communication interfaces for relay node, but higher to hardware requirement at this time, cost is larger.When relay node is removable
When dynamic terminal (such as unmanned plane), it can use dynamic, move between a source node and a destination node, play the part of similar postman's
Role (referring to: Q.Wu, Y.Zeng and R.Zhang, " Joint Trajectory and Communication Design
for Multi-UAV Enabled Wireless Networks,”IEEE Transactions on Wireless
Communications,vol.17,no.3,pp.2109-2121,2018.).At this point it is possible to relaying quantity is reduced, but channel
There is no reductions for the cost of switching, and the mobile generated energy consumption of relay node is far longer than energy consumption caused by communication.
Optimization problem in conventional wireless communication network is mostly based on orthogonal channel (non-partially
Overlapping channel, NOC), i.e., the frequency interval between channel is remote enough, and there is no overlappings between channel, when two pairs
When transceiver (hereinafter referred to as equipment to) selects different channels communication, each side's receiving end will not receive other side's originating terminal signal.It should
The availability of frequency spectrum of kind channel division mode is lower.Partly overlap channel (partially overlapping channel,
POC) refer to that frequency spectrum has overlapping between adjacent channel, when two equipment are to adjacent channel communications are selected, each side's receiving end may be received
To other side's originating terminal signal, but received signal strength is less than intensity when selecting the same channel.Further, since in same section of frequency spectrum
For POC quantity far more than NOC, the selectable policy space of equipment in network is bigger, and the disturbed condition in network is relatively light.At present
Pass through optimization channel selection mostly based on POC technology and realize that network throughput maximizes or network interferences minimize, not yet favorably
With the relay transmission scheme of POC overlapping features.
Summary of the invention
The purpose of the present invention is to provide a kind of feasible multi-hop relay transmission methods based on the channel that partly overlaps.
In order to solve the above technical problem, the present invention provides a kind of multi-hop relay transmission sides based on the channel that partly overlaps
Method,
Assuming that network Zhong Youyige control centre；There is N number of data terminal, collection is combined intoThere is R relaying
Node, collection are combined intoThere is A channel, collection is combined intoChannel width is B, channel distance
For Δ, orthogonal channel has K, and collection is combined into
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminal n access
Orthogonal channel is mn,Other data terminals communicated are needed to be defined as its neighbour data terminal n
It occupies, collection is combined intoControl centre according to following procedure to the channel of trunk node selection each in network and each data terminal it
Between repeated link be updated:
Under init state, each relay node randomly chooses a multi-channel operation, and the channel for enabling relay node r access is
In kth time iteration, k >=1, control centre randomly chooses a relay node r and carries out channel update, the relaying section
Point is successively attempted to access all channels, and the channel of other relay nodes remains unchanged, and will be all in addition to relay node r
The channel set of relay node is denoted as a-r, it is assumed that when relay node r accesses channel a ',Certain presses data terminal n and m
According to pathMaximum handling capacity can be obtained in transmissionThen the sum of the whole network handling capacity is at this timeThe maximum channel of the sum of the whole network handling capacity will be made as the updated letter of relay node r
Road, i.e.,Relay node r is selected into channel ar(k+1) can make terminal to n when and
The maximum path of handling capacity is as updated path between m, i.e.,
Forwarded preferably, relay node is all made of DF mode, it is assumed that as source node data terminal S and as a purpose save
Relay node number between the data terminal D of point is Y, and collection is combined intoBiography between S and D
Defeated path is pSD={ 1 →...→ Y }, if not having relay node between S and D, i.e. Y=0, the handling capacity that direct transfers isIf S
There are relay node, i.e. Y >=1 between D, then the handling capacity between S and first relay node is λ1, Y relay node and D
Handling capacity be λY+1, the handling capacity of y-th of relay node and the y+1 relay node is λy+1, y≤Y-1, between S and D in
It is after throughput of transmissionsIt is passed when terminal is greater than relaying to the handling capacity that direct transfers between S and D
When defeated handling capacity, which selects the communication that direct transfers to S and D, then the handling capacity between S and D is
The sum of handling capacity between each data terminal of the whole network is
Preferably, using shannon formula to calculate the jump set in network between any two node in above-mentioned renewal process
Defeated handling capacity jumps throughput of transmissions including one between data terminal and relay node, relay node and relay node；One jump set
Defeated throughput calculation mode is specific as follows:
Assuming that node i is originator, node j is receiving end, and the transmission power of node i is pi, the channel choosing of node i and node j
Select respectively aiAnd aj, channel gain when the two phase selection cochannel is hij, then the handling capacity between node i and node j beWherein H (ai,aj) it is channel aiAnd ajChannel overlap degree, by the signal of node i
Power spectral density is expressed as Si(f), the frequency response of node j is expressed as Bj(f), channel aiAnd ajCentre frequency time interval
For τ, then channel overlap degree can beF indicates frequency.
Compared with prior art, the present invention its remarkable advantage is: (1) utilize channel overlapping features, adjacent channel it
Between can carry out information exchange, source node identification is passed to destination node in a multi-hop fashion, reduces channel by relay node
The expense of switching and position movement；(2) since the quantity of part overlapped channels under same spectrum resources is far more than orthogonal channel
Quantity, mentioned the method for the present invention greatly improve the availability of frequency spectrum.
Detailed description of the invention
Fig. 1 is orthogonal channel and the channel contrast schematic diagram that partly overlaps in the present invention.
Fig. 2 is the schematic network structure in the embodiment of the present invention.
Fig. 3 is that trunk channel selects and relay transmission path schematic diagram after algorithmic statement in the embodiment of the present invention.
Fig. 4 is learning algorithm comparison diagram in the embodiment of the present invention.
Specific embodiment
It is readily appreciated that, technical solution according to the present invention, in the case where not changing connotation of the invention, this field
Those skilled in the art can imagine numerous embodiments of the invention.Therefore, following specific embodiments and attached drawing are only
To the exemplary illustration of technical solution of the present invention, and it is not to be construed as whole of the invention or is considered as to the technology of the present invention side
The limitation or restriction of case.
In conjunction with attached drawing, it is assumed that there is N number of data terminal in network Zhong Youyige control centre, and collection is combined into
There is R relay node, collection is combined intoThere is A channel, collection is combined intoChannel width is
B, channel distance are Δ, and orthogonal channel has K, and collection is combined intoAll data terminals in network
With relay node only one communication interface, and use semiduplex communication mode, every hop link communication time is equal, relaying
Node is all made of DF mode and forwards, ambient noise N0, path-loss factor α.
In the DF mode forwards, it is assumed that data terminal S and the data terminal of node as a purpose as source nodeBetween relay node number be Y, collection be combined intoTransmission path between S and D is pSD
={ 1 →...→ Y }, if not having relay node between S and D, i.e. Y=0, the handling capacity that direct transfers is defined asIf between S and D
There are relay node, i.e. Y >=1, then the handling capacity of S and first relaying is defined as λ1, it is λ that the Y, which relays with the handling capacity of D,Y+1,
The handling capacity of y-th of relaying and the y+1 relaying is λy+1, y≤Y-1, the relay transmission handling capacity between S and D isWhen terminal is greater than relay transmission handling capacity to the handling capacity that direct transfers between S and D, the end
End can select to direct transfer and (do not need relay node and carry out subsidiary communications) to S and D, then the handling capacity between S and D is represented byThe sum of handling capacity between each data terminal of the whole network is expressed as
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminal n access
Orthogonal channel is mn,Other data terminals communicated are needed to be defined as its neighbour data terminal n
It occupies, collection is combined intoControl centre executes the relaying proposed by the present invention based on optimal response-channel associated update algorithm, to net
Repeated link in network between the channel of each trunk node selection and each data terminal is updated；It is specific as follows:
Under init state, each relay node randomly chooses a multi-channel operation, and the channel for enabling relay node r access is ar
(0),
In kth time iteration, k >=1, control centre randomly chooses a relay node r and carries out channel update, the relaying section
Point is successively attempted to access all channels, and the channel of other relay nodes remains unchanged, and will be all in addition to relay node r
The channel set of relay node is denoted as a_r, it is assumed that when relay node r accesses channel a ',Certain (saves in source data terminal n
Point) and m (destination node) according to pathMaximum handling capacity can be obtained in transmissionThen the whole network at this time
The sum of handling capacity can be expressed asThe maximum channel of the sum of the whole network handling capacity will be made to make
For the updated channel of relay node r, i.e.,Relay node r is selected into channel
ar(k+1) certain terminal can be made to the maximum path of handling capacity between n and m as updated path when, i.e.,
In above-mentioned renewal process using shannon formula calculate network in any two node (including data terminal and relaying
Node, relay node and relay node) between one jump throughput of transmissions；The defeated throughput calculation mode of one jump set is specific as follows:
Assuming that node i is originator, node j is receiving end, and the transmission power of node i is pi, the channel choosing of node i and node j
Select respectively aiAnd aj, channel gain when the two phase selection cochannel is hij, then the handling capacity between node i and node j indicates
ForWherein H (ai,aj) it is channel aiAnd ajChannel overlap degree, by the letter of node i
Power frequency spectrum density is expressed as Si(f), the frequency response of node j is expressed as Bj(f), channel aiAnd ajCentre frequency spacing sheet
It is shown as τ, then channel overlap degree is represented byF indicates frequency.
In order to intuitively illustrate beneficial effects of the present invention, following emulation experiment, system emulation have been carried out to the method for the present invention
Using Matlab software, parameter setting does not influence generality.
In conjunction with Fig. 1,11 channels, each channel strip are shared by taking the channel model that partly overlaps of 802.11b as an example, in network
Wide B=22MHz, channel distance, delta=5MHz, then 1,6, No. 11 channels are orthogonal channel, i.e.,
In conjunction with Fig. 2, simulating scenes are 4 data terminal dispositions in the network of a 14000m × 14000m, send function
Rate is 0.1W, ambient noise N0The channel gain of=- 90dBm, data terminal x and data terminal y when being transmitted on cochannel
ForWherein dxyFor the two physical distance, fc=2.4GHz is carrier frequency, demodulation letter
Making an uproar than thresholding is -4dB, and 13 relayings are randomly dispersed in data terminal deployment region.Network topology is as shown in Figure 1, triangle
Indicate data terminal, solid line is its transmission range, and dot indicates relay node.It emulates channel parameter used and refers to 802.11b, figure
The orthogonal channel serial number of each data terminal selection of 2 intermediate cam shape upper right corner digital representations.
In conjunction with Fig. 3, it is based on network environment shown in Fig. 2, control centre executes the relaying based on optimal response-channel joint
Relay node selected channel after more new algorithm reaches convergence, in the transmission path and transmission path in network between each terminal pair
As shown in Figure 3.As can be seen that each terminal can be communicated by mentioned method with neighbor terminal.Further, since multiple transmission
There is the case where sharing relaying in path, mentioned method can carry out channel switching to avoid relaying.
In conjunction with Fig. 4, simulation result is 500 and is randomly generated that (data terminal position is constant, and relay node position produces at random
It is raw) topological acquired results be averaged to obtain.As seen from Figure 4, mentioned method can restrain, and performance ratio is based on more excellent sound
The more new algorithm answered is more excellent.
In conjunction with emulation experiment as can be seen that the multi-hop relay transmission method of the present invention based on the channel that partly overlaps,
While improving the availability of frequency spectrum, the expense of relay node channel switching and the energy of mobile consumption are saved.
Claims (1)
1. a kind of multi-hop relay transmission method based on the channel that partly overlaps, which is characterized in that
Assuming that network Zhong Youyige control centre；There is N number of data terminal, collection is combined intoThere is R relay node,
Its collection is combined intoThere is A channel, collection is combined intoChannel width is B, and channel distance is Δ,
Orthogonal channel has K, and collection is combined into
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminal n access orthogonal
Channel isIt needs other data terminals communicated to be defined as its neighbour data terminal n, collects
It is combined intoControl centre is according to following procedure between the channel and each data terminal of trunk node selection each in network
Repeated link is updated:
Under init state, each relay node randomly chooses a multi-channel operation, and the channel for enabling relay node r access is
In kth time iteration, k >=1, control centre randomly chooses a relay node r and carries out channel update, the relay node according to
Secondary trial accesses all channels, and the channel of other relay nodes remains unchanged, and by all relayings in addition to relay node r
The channel set of node is denoted as a_r, it is assumed that when relay node r accesses channel a ',Certain is to data terminal n and m according to road
DiameterMaximum handling capacity can be obtained in transmissionThen the sum of the whole network handling capacity is at this timeThe maximum channel of the sum of the whole network handling capacity will be made as the updated letter of relay node r
Road, i.e.,Relay node r is selected into channel ar(k+1) can make terminal to n when and
The maximum path of handling capacity is as updated path between m, i.e.,
Relay node is all made of DF mode and forwards, it is assumed that whole as the data terminal S of source node and the data of node as a purpose
Holding the relay node number between D is Y, and collection is combined intoS,Transmission path between S and D is pSD=
{ 1 →...→ Y }, if not having relay node between S and D, i.e. Y=0, the handling capacity that direct transfers isIf there is relaying between S and D
Node, i.e. Y >=1, then the handling capacity between S and first relay node is λ1, the handling capacity of Y relay node and D is
λY+1, the handling capacity of y-th of relay node and the y+1 relay node is λy+1, y≤Y-1, the relay transmission between S and D handles up
Amount isWhen terminal is greater than relay transmission handling capacity to the handling capacity that direct transfers between S and D,
The terminal selects the communication that direct transfers to S and D, then the handling capacity between S and D isEach data of the whole network are whole
The sum of handling capacity between end is
Shannon formula is being used to calculate the jump throughput of transmissions in network between any two node, packet in above-mentioned renewal process
One included between data terminal and relay node, relay node and relay node jumps throughput of transmissions；One jumps throughput of transmissions meter
Calculation mode is specific as follows:
Assuming that node i is originator, node j is receiving end, and the transmission power of node i is pi, the channel selection difference of node i and node j
For aiAnd aj, channel gain when the two phase selection cochannel is hij, then the handling capacity between node i and node j beWherein H (ai,aj) it is channel aiAnd ajChannel overlap degree, by the signal of node i
Power spectral density is expressed as Si(f), the frequency response of node j is expressed as Bj(f), channel aiAnd ajCentre frequency time interval
For τ, then channel overlap degree can beF indicates frequency, N0Indicate ambient noise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910373724.3A CN109890063B (en) | 2019-05-07 | 2019-05-07 | A kind of multi-hop relay transmission method based on the channel that partly overlaps |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910373724.3A CN109890063B (en) | 2019-05-07 | 2019-05-07 | A kind of multi-hop relay transmission method based on the channel that partly overlaps |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109890063A CN109890063A (en) | 2019-06-14 |
| CN109890063B true CN109890063B (en) | 2019-09-27 |
Family
ID=66938442
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910373724.3A Active CN109890063B (en) | 2019-05-07 | 2019-05-07 | A kind of multi-hop relay transmission method based on the channel that partly overlaps |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109890063B (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426050B (en) * | 2017-06-22 | 2020-06-09 | 普联技术有限公司 | Data relay transmission system, construction method thereof and wireless relay equipment |
| CN108712746B (en) * | 2018-04-28 | 2023-05-30 | 中国人民解放军陆军工程大学 | Partially overlapped channel aggregation game model and learning method |
| CN109257811B (en) * | 2018-10-18 | 2021-04-02 | 吉林大学 | Wireless Mesh network partial overlapping channel allocation method based on joint power control |
-
2019
- 2019-05-07 CN CN201910373724.3A patent/CN109890063B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109890063A (en) | 2019-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pabst et al. | Relay-based deployment concepts for wireless and mobile broadband radio | |
| CN109348537B (en) | Multi-beam self-organizing network channel access control method | |
| Sreng et al. | Relayer selection strategies in cellular networks with peer-to-peer relaying | |
| Song et al. | Resource allocation in full-duplex communications for future wireless networks | |
| Le et al. | Multihop cellular networks: Potential gains, research challenges, and a resource allocation framework | |
| Tamaki et al. | Full duplex media access control for wireless multi-hop networks | |
| Hu et al. | MIMO ad hoc networks: Medium access control, saturation throughput, and optimal hop distance | |
| Guan et al. | Topology control in mobile ad hoc networks with cooperative communications | |
| US20070160014A1 (en) | Method and system for wireless communication networks using cooperative relaying | |
| Qamar et al. | A stochastically geometrical poisson point process approach for the future 5G D2D enabled cooperative cellular network | |
| CN103607750A (en) | Relay selection method based on terminal straight-through communication in next-generation cellular system | |
| Deng et al. | Optimum transmission range for wireless ad hoc networks | |
| CN102946627B (en) | On spectrum utility-synergy routing algorithm in cognitive radio systems | |
| EP1610503B1 (en) | Controlling routing operations in communication networks | |
| Huang et al. | Coverage and capacity of a wireless mesh network | |
| Hua et al. | Maximizing the throughput of large ad hoc wireless networks | |
| Zhao et al. | Dynamic and non-centric networking approach using virtual gateway platforms for low power wide area systems | |
| CN109890063B (en) | A kind of multi-hop relay transmission method based on the channel that partly overlaps | |
| CN105636115A (en) | User movement-based relay selection method in D2D communication under overlay working mode | |
| Mousavinasab et al. | Throughput improvement by mode selection in hybrid duplex wireless networks | |
| Chen et al. | Cross layer design of heterogeneous virtual MIMO radio networks with multi-optimization | |
| Pereira et al. | Overlay cognitive radio in wireless mesh networks | |
| Bhute et al. | A survey on relay selection strategies in cooperative wireless network for capacity enhancement | |
| CN103731835B (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| AbuAli | Enabling technologies of energy efficient cooperative M2M networks: benefits and challenges |
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 |