CN109890063A - 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
- CN109890063A CN109890063A CN201910373724.3A CN201910373724A CN109890063A CN 109890063 A CN109890063 A CN 109890063A CN 201910373724 A CN201910373724 A CN 201910373724A CN 109890063 A CN109890063 A CN 109890063A
- Authority
- CN
- China
- Prior art keywords
- channel
- node
- relay node
- relay
- handling capacity
- 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
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 reduce
Quantity is relayed, but there is no reductions for the cost of channel switching, and energy consumption caused by relay node movement is far longer than communication
Generated energy consumption.
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
When selecting different channels communication to transceiver (hereinafter referred to as equipment to), each side's receiving end will not receive other side's originating terminal signal.
The availability of frequency spectrum of this kind of 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；HaveA data terminal, collection are combined into；HaveIn a
After node, collection is combined into；HaveA channel, collection are combined into；Channel width is, channel
Distance is, orthogonal channel hasA, collection is combined into,
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminalAccess is just
Hand over channel beBy data terminalOther data terminals for needing to communicate are defined as its neighbour
It occupies, collection is combined into；Control 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, enables relay nodeThe channel of access is
?In secondary iteration,Control centre randomly chooses a relay node and carries out channel update, the relay node
It successively attempts to access all channels, and the channel of other relay nodes remains unchanged, and will remove relay nodeIn addition all
The channel set of relay node is denoted as, it is assumed that relay nodeAccess channelWhen,, certain is to data terminal
According to pathMaximum handling capacity can be obtained in transmission, then 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 relay nodeIt is updated
Channel, i.e.,By relay nodeSelect channelWhen can make terminal
It is rightBetween the maximum path of handling capacity as updated path, i.e.,
It is forwarded preferably, relay node is all made of DF mode, it is assumed that the data terminal as source nodeSNode as a purpose
Data terminalDBetween relay node number beY, collect and be combined into SWithDBetween transmission road
Diameter isIfSWithDBetween there is no relay node, i.e.,Its handling capacity that direct transfers is；IfSWithDBetween have relay node, i.e.,, thenSHandling capacity between first relay node isTheYA relay node withD
Handling capacity beTheA relay node andThe handling capacity of a relay node is SWithDBetween
Relay transmission handling capacity be, when terminal pairSWithDBetween the handling capacity that direct transfers be greater than
When throughput of transmissions, the terminal pairSWithDThe communication that direct transfers is selected, thenSWithDBetween handling capacity beThe sum of handling capacity between each data terminal of the whole network is
Preferably, being gulped down in above-mentioned renewal process using the jump set between any two node in shannon formula calculating network is defeated
The amount of spitting jumps throughput of transmissions including one between data terminal and relay node, relay node and relay node；One jump set is defeated to be gulped down
The amount of spitting calculation is specific as follows:
Assuming that nodeiFor originator, nodejFor receiving end, nodeiTransmission power be, nodeiAnd nodejChannel selection point
It is notWithChannel gain when the two phase selection cochannel isThen nodeiAnd nodejBetween handling capacity beWhereinFor channelWithChannel overlap degree, by nodeiSignal
Power spectral density is expressed asNodejFrequency response be expressed asChannelWithCentre frequency spacing sheet
It is shown as, then channel overlap degree can beIndicate 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 network Zhong Youyige control centre hasA data terminal, collection are combined into；HaveA relay node, collection are combined into；HaveA channel, collection are combined into；Channel width is, channel distance is, orthogonal channel hasA, collection is combined into, all data terminals and relay node only one communication interface in network, and using half
The communication mode of duplex, every hop link communication time is equal, and relay node is all made of DF mode and forwards, and ambient noise isRoad
Diameter fissipation factor is
In the DF mode forwards, it is assumed that the data terminal as source nodeSThe data terminal of node as a purposeDBetween
Relay node number beY, collect and be combined into SWithDBetween transmission path beIfSWithDBetween there is no relay node, i.e.,Its handling capacity that direct transfers is；IfSWithDIt
Between have relay node, i.e.,, thenSHandling capacity between first relay node isTheYA relay node withDGulp down
The amount of spitting isTheA relay node andThe handling capacity of a relay node is SWithDBetween
Relay transmission handling capacity is, when terminal pairSWithDBetween direct transfer handling capacity be greater than relaying
When throughput of transmissions, the terminal pairSWithDSelection direct transfers and (does not need relay node and carry out subsidiary communications), thenSWithDBetween gulp down
The amount of spitting isThe sum of handling capacity between each data terminal of the whole network is
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminalAccess is just
Hand over channel beBy data terminalOther data terminals for needing to communicate are defined as its neighbour
It occupies, collection is combined into；Control 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；It is specific as follows:
Under init state, each relay node randomly chooses a multi-channel operation, enables relay nodeThe channel of access is
?In secondary iteration,Control centre randomly chooses relay node 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 will remove relay nodeAll relayings in addition
The channel set of node is denoted as, it is assumed that relay nodeAccess channelWhen,, certain is to data terminalAccording to
PathMaximum handling capacity can be obtained in transmission, then 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 relay nodeUpdated letter
Road, i.e.,By relay nodeSelect channelWhen can make terminal pairBetween the maximum path of handling capacity as updated path, i.e.,
In above-mentioned renewal process using shannon formula calculate network in any two node (including data terminal and relaying save
Point, 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 nodeiFor originator, nodejFor receiving end, nodeiTransmission power be, nodeiAnd nodejChannel selection point
It is notWithChannel gain when the two phase selection cochannel isThen nodeiAnd nodejBetween handling capacity beWhereinFor channelWithChannel overlap degree, by nodeiLetter
Power frequency spectrum density is expressed asNodejFrequency response be expressed asChannelWithCentre frequency interval
It is expressed as, then channel overlap degree can beIndicate 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
It is wideChannel distanceThen 1,6, No. 11 channels are orthogonal channel, i.e.,
In conjunction with Fig. 2, simulating scenes are 4 data terminal dispositions at oneNetwork in, send power it is equal
ForAmbient noiseData terminalxWith data terminalyOn cochannel transmit when channel gain beWhereinFor the two physical distance,For carrier frequency, demodulation
Signal-noise ratio threshold is13 relayings are randomly dispersed in data terminal deployment region.Network topology is as shown in Figure 1, triangle
Shape indicates data terminal, and solid line is its transmission range, and dot indicates relay node.It emulates channel parameter used and refers to 802.11b,
The orthogonal channel serial number of each data terminal selection of Fig. 2 intermediate cam shape upper right corner digital representation.
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 relatively having 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 (3)
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；HaveA data terminal, collection are combined into；HaveIn a
After node, collection is combined into；HaveA channel, collection are combined into；Channel width is, channel
Distance is, orthogonal channel hasA, collection is combined into,
When work, each data terminal exists firstOne orthogonal channel work of middle random selection, enables data terminalAccess is just
Hand over channel beBy data terminalOther data terminals for needing to communicate are defined as its neighbour
It occupies, collection is combined into；Control 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, enables relay nodeThe channel of access is
?In secondary iteration,Control centre randomly chooses relay node 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 will remove relay nodeIn in addition all
Channel set after node is denoted as, it is assumed that relay nodeAccess channelWhen,, certain is to data terminalIt presses
According to pathMaximum handling capacity can be obtained in transmission, then 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 relay nodeIt is updated
Channel, i.e.,By relay nodeSelect channelWhen can make terminal
It is rightBetween the maximum path of handling capacity as updated path, i.e.,。
2. as described in claim 1 based on the multi-hop relay transmission method for the channel that partly overlaps, which is characterized in that relay node
It is all made of DF mode to forward, it is assumed that the data terminal as source nodeSThe data terminal of node as a purposeDBetween relaying
Node number isY, collect and be combined into SWithDBetween transmission path beIfSWithDBetween there is no relay node, i.e.,Its handling capacity that direct transfers is；IfSWithDIt
Between have relay node, i.e.,, thenSHandling capacity between first relay node isTheYA relay node withDGulp down
The amount of spitting isTheA relay node andThe handling capacity of a relay node is SWithDBetween
Relay transmission handling capacity is, when terminal pairSWithDBetween direct transfer handling capacity be greater than relaying
When throughput of transmissions, the terminal pairSWithDThe communication that direct transfers is selected, thenSWithDBetween handling capacity beThe sum of handling capacity between each data terminal of the whole network is。
3. as claimed in claim 2 based on the multi-hop relay transmission method for the channel that partly overlaps, which is characterized in that it is above-mentioned more
Calculate in network one between any two node using shannon formula during new and jump throughput of transmissions, including data terminal with
One between relay node, relay node and relay node jumps throughput of transmissions；The defeated throughput calculation mode of one jump set is specifically such as
Under:
Assuming that nodeiFor originator, nodejFor receiving end, nodeiTransmission power be, nodeiAnd nodejChannel selection point
It is notWithChannel gain when the two phase selection cochannel isThen nodeiAnd nodejBetween handling capacity beWhereinFor channelWithChannel overlap degree, by nodeiLetter
Power frequency spectrum density is expressed asNodejFrequency response be expressed asChannelWithCentre frequency interval
It is expressed as, then channel overlap degree can beIndicate frequency.
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 true CN109890063A (en) | 2019-06-14 |
| CN109890063B 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) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426050A (en) * | 2017-06-22 | 2017-12-01 | 普联技术有限公司 | Data relay transmission system and its construction method and wireless relay apparatus |
| CN108712746A (en) * | 2018-04-28 | 2018-10-26 | 中国人民解放军陆军工程大学 | One kind partly overlaps channel aggregation betting model and learning algorithm |
| CN109257811A (en) * | 2018-10-18 | 2019-01-22 | 吉林大学 | The wireless Mesh netword of joint Power control partly overlaps method for channel allocation |
-
2019
- 2019-05-07 CN CN201910373724.3A patent/CN109890063B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426050A (en) * | 2017-06-22 | 2017-12-01 | 普联技术有限公司 | Data relay transmission system and its construction method and wireless relay apparatus |
| CN108712746A (en) * | 2018-04-28 | 2018-10-26 | 中国人民解放军陆军工程大学 | One kind partly overlaps channel aggregation betting model and learning algorithm |
| CN109257811A (en) * | 2018-10-18 | 2019-01-22 | 吉林大学 | The wireless Mesh netword of joint Power control partly overlaps method for channel allocation |
Non-Patent Citations (2)
| Title |
|---|
| CHENG DING ET AL.: "Joint Relay Selection and Channel Allocation in Cooperative Communication: A Game Theoretic Learning Solution", 《2015 IEEE》 * |
| 陈永辉等: "部分信道交叠多跳无线网络容量渐近估计", 《计算机科学》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109890063B (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109348537B (en) | Multi-beam self-organizing network channel access control method | |
| Le et al. | Multihop cellular networks: Potential gains, research challenges, and a resource allocation framework | |
| Pabst et al. | Relay-based deployment concepts for wireless and mobile broadband radio | |
| Sreng et al. | Relayer selection strategies in cellular networks with peer-to-peer relaying | |
| Liu et al. | CoopMAC: A cooperative MAC for wireless LANs | |
| US7720020B2 (en) | Method and system for wireless communication networks using cooperative relaying | |
| Deng et al. | Optimum transmission range for wireless ad hoc networks | |
| CN103607750A (en) | Relay selection method based on terminal straight-through communication in next-generation cellular system | |
| KR20090108545A (en) | Method and system for establishing cooperative routing in wireless networks | |
| Odabası et al. | A survey on wireless mesh networks, routing metrics and protocols | |
| EP1610503B1 (en) | Controlling routing operations in communication networks | |
| Hua et al. | Maximizing the throughput of large ad hoc wireless networks | |
| Kaufman et al. | Interference aware link discovery for device to device communication | |
| Argyriou | MAC protocol for wireless cooperative physical-layer network coding | |
| CN110856231A (en) | Multi-data stream transmission method based on multi-hop network | |
| Sharma et al. | Overlapping coalition-based resource and power allocation for enhanced performance of underlaying D2D communication | |
| CN109890063B (en) | A kind of multi-hop relay transmission method based on the channel that partly overlaps | |
| Samy et al. | Full-duplex decode and forward relay-aided device-to-device communication | |
| Mousavinasab et al. | Throughput improvement by mode selection in hybrid duplex wireless networks | |
| Pereira et al. | Overlay cognitive radio in wireless mesh networks | |
| Lu et al. | Graph-based path selection and power allocation for relay-aided transmission | |
| AbdelRaheem et al. | Analytical and simulation study of the effect of secondary user cooperation on cognitive radio networks | |
| AbuAli | Enabling technologies of energy efficient cooperative M2M networks: benefits and challenges | |
| Toham et al. | Multi-interfaces and multi-channels multi-hop ad hoc networks: Overview and challenges | |
| Akhtar et al. | Power saving cooperative path routing in static wireless 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 |