CN107809785B - A kind of distributed relay selection method based on mutually beneficial matching game - Google Patents
A kind of distributed relay selection method based on mutually beneficial matching game Download PDFInfo
- Publication number
- CN107809785B CN107809785B CN201711083417.9A CN201711083417A CN107809785B CN 107809785 B CN107809785 B CN 107809785B CN 201711083417 A CN201711083417 A CN 201711083417A CN 107809785 B CN107809785 B CN 107809785B
- Authority
- CN
- China
- Prior art keywords
- node
- relay
- source node
- source
- relay node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention discloses a kind of distributed relay selection methods based on mutually beneficial matching game.This method are as follows: the relay selection problem in wireless relay network is modeled as to the matching betting model of part mutual benefit, the participant of model is source node and relay node in network；Source node in network comprehensively considers different relay nodes, row major sequence permutation of going forward side by side；Each source node is filed an application to the relay node of highest priority；It is unsatisfactory for the source node currently connected and proposes that access is applied to the relay node of highest priority, the source node progress priority ranking that relay node opposite direction oneself is filed an application, and according to the regular selection receiving or the request of refusal source node of exchange matching game；If application request is rejected, source node will file an application to the relay node of suboptimum, if will keep original strategy without better choice；Circulation carries out match selection, until transmission is connected up to stable state.The present invention can effectively promote the total amount performance of handling up of junction network.
Description
Technical field
The invention belongs to wireless communication technology field, especially a kind of distributed relay selection based on mutually beneficial matching game
Method.
Background technique
The research carried out for the blowout capacity requirement and high efficiency of transmission of next generation network emerges one after another.Wherein, it assists
With communication (A.Nosratinia, T.E.Hunter, and A.Hedayat, " Cooperative communication in
wireless networks,"IEEE Communications Magazine,vol.42,no.10,pp.74-80,2004.)
It is considered as a kind of transmission technology of great potential, the transmission speed and transmission effect of transmission is effectively promoted by space diversity technology
Rate.In cooperative transmission, relay node can be used to retransmit from the data that source node issues to destination node, reach promotion and pass
The purpose of defeated efficiency.However and not all relay distribution scheme can promote transmission performance.Unreasonable relay distribution side
Case, which is even transmitted, causes negative impact (C.Jun, S.Xuemin, J.W.Mark, and A.S.Alfa, " Semi-
Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay
Networks,"IEEE Transactions on Wireless Communications,vol.7,no.4,pp.1348-
1357,2008.).Therefore relay distribution problem is a major issue in relay transmission technology.
Up to the present, make every effort to solve the problems, such as relay distribution there are many method.Most of processing methods in them are
Centralized algorithm (S.Sharma, Y.Shi, Y.T.Hou, and S.Kompella, " An Optimal Algorithm for
Relay Node Assignment in Cooperative Ad Hoc Networks,"IEEE/ACM Transactions
on Networking,vol.19,no.3,pp.879-892,2011.).Centralized approach always needs a master controller
Then the information of all nodes in collection network completes the resource allocation of relaying.With wireless network popularization, optimization problem
It will become to become increasingly complex, it is excessive that this will lead to overhead.For this problem, some documents propose distributed relay distribution
Scheme (Z.Chen, T.Lin, and C.Wu, " Decentralized Learning-Based Relay Assignment for
Cooperative Communications,"IEEE Transactions on Vehicular Technology,vol.65,
No.2, pp.813-826,2016.), but this needs takes much time to learn to restrain.What distributed method faced mainly asks
Topic is the relay selection decision that source node does not know other source nodes, and which results in the unstable of relay distribution.
Suitable stable matching is found as a result, stable matching is the key concept (bibliography matched in theory of games
A.E.Roth and M.A.O.Sotomayor,"Two-Sided Matching:A Study in Game-Theoretic
Modeling and Analysis,"Cambridge University Press,1992.).Although having a series of work
Using the solution wireless communication resources assignment problem of matching game, but for traditional matching game method such as (bibliography
O.Semiari,W.Saad,S.Valentin,M.Bennis,and H.V.Poor,"Context-Aware Small Cell
Networks:How Social Metrics Improve Wireless Resource Allocation,"IEEE
Transactions on Wireless Communications, vol.14, no.11, pp.5927-5940,2015.), it is each
A user makes every effort to increase the performance of itself, but respective greedy behavior may be unfavorable for the performance of the whole network.
Summary of the invention
It is an object of the invention to provide a kind of point that total rate is transmitted towards the whole network for wireless relay network resource optimization
Cloth relay selection method makes the whole network handling capacity more approach the effect that centralized algorithm reaches.
The technical solution for realizing the aim of the invention is as follows: a kind of distributed relay selecting party based on mutually beneficial matching game
Method, comprising the following steps:
Step 1, by the relay selection problem in wireless relay network, the mutually beneficial matching betting model in part, matching are modeled as
The participant of betting model is source node and relay node in network；
Step 2, source node is according to itself communication requirement, in conjunction with the access effect and other source nodes of different relay nodes
Selection strategy, row major sequence permutation of going forward side by side is comprehensively considered to relay node；
Step 3, it is unsatisfactory for the source node currently connected and proposes access application to the relay node of highest priority, and obtain
One of received or be rejected two kinds of possible results；
Step 4, the access application of the institute's active node received is carried out priority level according to efficiency of transmission by relay node
Sequence, and according to the rule of exchange matching game, determine the access application of receiving or refusal source node；
Step 5, if the access application of source node is rejected, continue to file an application to the relay node of suboptimum, if
There is no better choice, original strategy, and return step 3 will be kept；Otherwise, the access application of source node is received, and is entered
Step 6；
Step 6, transmission is connected up to stable state, end loop.
Further, it is rich to be modeled as the mutually beneficial matching in part for the relay selection problem in wireless relay network described in step 1
Model is played chess, the betting model is defined as:
The betting modelIn include three component parts, whereinWithRespectively
It is the source node set and set of relay nodes for participating in game,Respectively indicate the matching preference of source node and relay node
Relationship, this n-th-trem relation n beWithIn binary crelation complete, with transmission characteristic and reflectivity, each policymaker benefit
It is located at the occurrence of matching other side with preference relation arrangement；The maximum quantity that policymaker can match is to match quota q, qi,qj
Respectively indicate the matching quota of source node and relay node.
Further, source node described in step 2 is imitated according to itself communication requirement in conjunction with the access of different relay nodes
The selection strategy of fruit and other source nodes comprehensively considers row major sequence permutation of going forward side by side to relay node, specific as follows:
Define source node snThe transmission rate obtained in cooperative transmission network is U (sn,rm,dk), and U (sn,rm,dk)
Definition is as shown in formula (1):
Wherein γsrIt indicates similarly obtain γ from source node s to the signal-to-noise ratio of relay node rsdAnd γrdIndicate source node and
Signal-to-noise ratio of the relay node to destination node；Source node snPass through relay node rmWith destination node dkEstablish communication link
The transmission rate reached in unit time isThe transmission reached in the relay transmission unit time is not selected
Rate isL(rm) indicate to access the source node quantity of relay node, access the source of the same relay node
Node will divide its time resource equally；
Since the relay node transmission rate for accessing different is different, preference relation formula of the source node for relay node
Are as follows:
Source node is according to obtained transmission rate to relaying node sequencing, U (si,rm,dk) and U (si,rj,dk) respectively indicate
Source node siIn relay node rm、rjUnder transmission rate.
Further, relay node described in step 4 is by the access application of the institute's active node received, according to efficiency of transmission
Priority level sequence is carried out, and according to the rule of exchange matching game, determines the access application of receiving or refusal source node, tool
Body is as follows:
Relay node will classify to the source node that oneself is filed an application when screening applicant, first is that in connection shape
Source node under state, another kind is the source node for being not in connection status:
For first kind source node, as source node snDissatisfied current hop connects rj, and to rmWhen proposing connection application,
rmTo consider to the total utility of related relay node, namely judge whether there is:
U(sn,rm)+U(si,rj) > U (si,rm)+U(sn,rj) (3)
If having exchanged overall transmission rate after occurrence to be promoted, two occurrences will exchange matching result, otherwise sn's
Matching application will be rejected；
For the second class source node, as source node snWhen currently not having the relay node being connected to, to relay node rmIt proposes
When connection application, rmOnly source node can be screened according to transmission rate, and receive best source node.
Compared with prior art, the present invention its remarkable advantage is: (1) based on matching theory of games, devising distribution
Algorithm optimization the whole network total throughout, makes the whole network handling capacity more approach the effect that centralized algorithm reaches；(2) source node selection can reach
To the relay node of peak transfer rate, algorithm can reach the whole network convergence within a reasonable time
Detailed description of the invention
Fig. 1 is relaying cooperation network diagram.
Fig. 2 is matching application flow chart proposed by the invention.
Fig. 3 is the whole network overall transmission rate comparison schematic diagram of model method and existing model method in the embodiment of the present invention.
Fig. 4 is model method convergence rate performance schematic diagram in the embodiment of the present invention.
Specific embodiment
The present invention proposes a kind of transmission total capacity of distributed relay distribution method optimization source node.Relay selection problem quilt
It is modeled as matching betting model, source node selects the relay node that can reach peak transfer rate, and the matching betting model is main
For mutually being screened between the policymaker that bilateral user collects and in other side to contradictory bilateral policymaker's modeling analysis
User's collection selects the occurrence admired.After the candidate matches item in collecting to the other user is assessed, the policymaker of a side
It can establish the preference list of itself, and the occurrence for selecting itself to have a preference for using it.
The present invention is to realize that the performance of the whole network maximizes, it will be considered that the mutually beneficial characteristic in part between user.Main thought is,
When higher performance can be reached after exchange matching between user by exchanging, single optimal matching result can be matched with others
Link switching matching result.It exchanges in matching algorithm, it, will be to better relaying if source node is unsatisfied with current matching result
Node proposes connection application.Each relay node is total after concerning two relay node exchanges when handling connection request
Value of utility, this point are different from traditional matching algorithm.Simulation result shows that mentioned model method optimizes in the whole network overall transmission rate
Aspect is better than the optimal performance close to the whole network, and algorithm can reach the whole network convergence within reasonable time.
Fig. 1 is relaying cooperation network diagram.In the network, source node selects relay node, and relay node screens source section
It puts and received source node is helped to carry out data transmission.Fig. 2 is that source node application is simultaneously in the matching game playing algorithm that is mentioned of the present invention
The flow chart being accepted or rejected.
The present invention makes the whole network transmit total rate and reaches to maximize the whole network overall transmission rate as target using distributed algorithm
The result of centralized optimization algorithm.A kind of distributed relay selection method based on mutually beneficial mechanism proposed by the present invention, including
Following steps:
Step 1, by the relay selection problem in wireless relay network, the mutually beneficial matching betting model in part, matching are modeled as
The participant of betting model is source node and relay node in network；
Step 2, source node is according to itself communication requirement, in conjunction with the access effect and other source nodes of different relay nodes
Selection strategy, row major sequence permutation of going forward side by side is comprehensively considered to relay node；
Step 3, it is unsatisfactory for the source node currently connected and proposes access application to the relay node of highest priority, and obtain
One of received or be rejected two kinds of possible results；
Step 4, the access application of the institute's active node received is carried out priority level according to efficiency of transmission by relay node
Sequence, and according to the rule of exchange matching game, determine the access application of receiving or refusal source node；
Step 5, if the access application of source node is rejected, continue to file an application to the relay node of suboptimum, if
There is no better choice, original strategy, and return step 3 will be kept；Otherwise, the access application of source node is received, and is entered
Step 6；
Step 6, transmission is connected up to stable state, end loop.
Specific implementation of the invention is as follows:
One, the relay selection problem in wireless relay network is modeled as the mutually beneficial matching game mould in part described in step 1
Type, the betting model is defined as:
The betting modelIn include three component parts, whereinWithRespectively
It is the source node set and set of relay nodes for participating in game,Respectively indicate the matching preference of source node and relay node
Relationship, this n-th-trem relation n beWithIn binary crelation complete, with transmission characteristic and reflectivity, each policymaker benefit
It is located at the occurrence of matching other side with preference relation arrangement；The maximum quantity that policymaker can match is to match quota q, qi,qj
Respectively indicate the matching quota of source node and relay node.
Two, source node described in step 2 is according to itself communication requirement, in conjunction with the access effect of different relay nodes and other
The selection strategy of source node comprehensively considers row major sequence permutation of going forward side by side to relay node, specific as follows:
Define source node snThe transmission rate obtained in cooperative transmission network is U (sn,rm,dk), and U (sn,rm,dk)
Definition is as shown in formula (1):
Wherein γsrIt indicates similarly obtain γ from source node s to the signal-to-noise ratio of relay node rsdAnd γrdIndicate source node and
Signal-to-noise ratio of the relay node to destination node；Source node snPass through relay node rmWith destination node dkEstablish communication link
The transmission rate reached in unit time isThe transmission reached in the relay transmission unit time is not selected
Rate isL(rm) indicate to access the source node quantity of relay node, access the source of the same relay node
Node will divide its time resource equally.
Since the relay node transmission rate for accessing different is different, preference relation formula of the source node for relay node
Are as follows:
Source node is according to obtained transmission rate to relaying node sequencing, U (si,rm,dk) and U (si,rj,dk) respectively indicate
Source node siIn relay node rm、rjUnder transmission rate；For source node, the relaying section of bigger transmission rate can be provided
Point will obtain bigger priority.
Three, relay node described in step 4 carries out the access application of the institute's active node received excellent according to efficiency of transmission
First rank sequence, and according to the rule of exchange matching game, determine the access application of receiving or refusal source node, specifically such as
Under:
Relay node will classify to the source node that oneself is filed an application when screening applicant, first is that in connection shape
Source node under state, another kind are the source nodes for being not in connection status.
For first kind source node, as source node snDissatisfied current hop connects rj, and to rmWhen proposing connection application,
rmTo consider to the total utility of related relay node, namely judge whether there is:
U(sn,rm)+U(si,rj) > U (si,rm)+U(sn,rj) (3)
If having exchanged overall transmission rate after occurrence to be promoted, two occurrences will exchange matching result, otherwise sn's
Matching application will be rejected.
For the second class source node, as source node snWhen currently not having the relay node being connected to, to relay node rmIt proposes
When connection application, rmOnly source node can be screened according to transmission rate, and receive best source node.
Four, the optimization aim of game: the screening of node is carried out using formula (2) and (3) as preference relation, may finally be realized
The whole network transmits shown in the optimization aim such as formula (5) of total amount:
Wherein Un(sn,rm,dk) indicate a source node snTransmission rate.Formula (5) illustrates that the game of transmission rate is excellent
Change the sum of the transmission rate that target is all users in maximization network.It is that optimization aim carries out relay selection, energy with formula (5)
Enough realize maximizes user's transmission rate.
Embodiment 1
A specific embodiment of the invention is described below, and system emulation uses Matlab software, and parameter setting does not influence
It is general.The embodiment verify mentioned model and method validity and with convergence (Fig. 3 and Fig. 4).One 2000 ×
In 2000 square metres of topological structure, there are several source nodes and relay node random distribution.Destination node is located in this area
The heart.The maximum transmission power of source node is set as 23dBm, and relay node maximum transmission power is set as 30dBm's.Assuming that system
Channel width is W=10MHz, and the Carrier To Noise Power Density of system is -174dBm/Hz.
Fig. 3 is that the network user of model method and existing model method transmits total rate schematic diagram in the embodiment of the present invention.
In simulation process, we compare mentioned method and optimal OPtimal Relay Assignment for capacity
Maximization (OPRA) algorithm (bibliography Y.Dejun, F.Xi, and X.Guoliang, " OPRA:Optimal
Relay Assignment for Capacity Maximization in Cooperative Networks,"in IEEE
International Conference on Communications (ICC), 2,011 2011, pp.1-6.) and traditional refuse
Receive algorithm absolutely to be compared.
Fig. 3 shows the value of the whole network transmission rate total amount, compares the mentioned distributed algorithm of the present invention, the optimal OPRA of centralization
Algorithm and traditional distributed DA algorithm.The result shows that the distributed algorithm proposed the whole network in different network sizes transmits
Total amount is all very close with centralized optimal algorithm, and is substantially better than traditional refusal and receives algorithm.
Fig. 4 is model method convergence rate performance schematic diagram in the embodiment of the present invention.From fig. 4, it can be seen that mentioned method
Model has relatively reasonable convergence rate performance.Mean iterative number of time increases with the increase of source node quantity.With node
Several increases, the conflict between source node also increase.However, collision finally has the upper bound, and junction network is also up to saturation shape
State.However, Fig. 4 shows that mentioned distributed method can be in a reasonable time Convergence to stable state, when network has 30
It is no more than 50 iteration when a source node and 15 relay nodes and completes convergence.Especially when source node quantity increases to from 20
50, convergence time is almost unchanged, and what this showed the algorithm extends to catenet.Simulation results show proposed
Distributed matcher convergence energy.
To sum up, distributed method proposed by the present invention optimizes the overall transmission rate of the whole network, and the performance reached is close to the whole network
Centralized optimal solution, and algorithm can reach in a reasonable convergence time the whole network overall performance optimization.
Claims (1)
1. a kind of distributed relay selection method based on mutually beneficial matching game, which comprises the following steps:
Step 1, by the relay selection problem in wireless relay network, it is modeled as the mutually beneficial matching betting model in part, matches game
The participant of model is source node and relay node in network；
Step 2, source node is according to itself communication requirement, in conjunction with the choosing of the access effect and other source nodes of different relay nodes
Strategy is selected, row major sequence permutation of going forward side by side is comprehensively considered to relay node；
Step 3, it is unsatisfactory for the source node currently connected and proposes access application to the relay node of highest priority, and obtain being connect
By or one of be rejected two kinds of possible results；
Step 4, the access application of the institute's active node received is carried out priority level row according to efficiency of transmission by relay node
Sequence, and according to the rule of exchange matching game, determine the access application for receiving or refusing source node；
Step 5, if the access application of source node is rejected, continue to file an application to the relay node of suboptimum, if do not had
Better choice will keep original strategy, and return step 3；Otherwise, the access application of source node is received, and is entered step
6；
Step 6, transmission is connected up to stable state, end loop；
By the relay selection problem in wireless relay network described in step 1, it is modeled as the mutually beneficial matching betting model in part, the game
Model is defined as:
The betting modelIn include three component parts, whereinWithIt is ginseng respectively
With the source node set and set of relay nodes of game, >i, >jThe matching preference for respectively indicating source node and relay node is closed
System, this n-th-trem relation n beWithIn binary crelation complete, with transmission characteristic and reflectivity, each policymaker utilizes
Preference relation arrangement is located at the occurrence of matching other side；The maximum quantity that policymaker can match is to match quota q, qi,qjPoint
Not Biao Shi source node and relay node matching quota；
Source node described in step 2 is saved according to itself communication requirement in conjunction with the access effect of different relay nodes and other sources
The selection strategy of point, row major sequence permutation of going forward side by side is comprehensively considered to relay node, specific as follows:
Define source node snThe transmission rate obtained in cooperative transmission network is U (sn,rm,dk), and U (sn,rm,dk) definition
As shown in formula (1):
Wherein γsrIt indicates similarly obtain γ from source node s to the signal-to-noise ratio of relay node rsdAnd γrdIndicate source node and relaying
Signal-to-noise ratio of the node to destination node；Source node snPass through relay node rmWith destination node dkEstablish communication link unit
The transmission rate reached in time isThe transmission rate reached in the relay transmission unit time is not selected
ForL(rm) indicate to access the source node quantity of relay node, access the source node of the same relay node
Its time resource will be divided equally；
Since the relay node transmission rate for accessing different is different, preference relation formula of the source node for relay node are as follows:
Source node is according to obtained transmission rate to relaying node sequencing, U (si,rm,dk) and U (si,rj,dk) respectively indicate source section
Point siIn relay node rm、rjUnder transmission rate；
Relay node described in step 4 carries out priority level by the access application of the institute's active node received, according to efficiency of transmission
Sequence, and according to the rule of exchange matching game, determine the access application of receiving or refusal source node, specific as follows:
Relay node will classify to the source node that oneself is filed an application when screening applicant, and the first kind is in connection shape
Source node under state, the second class are the source nodes for being not in connection status:
For first kind source node, as source node snDissatisfied current hop connects rj, and to rmWhen proposing connection application, rmIt will examine
Consider to the total utility of related relay node, namely judge whether there is:
U(sn,rm)+U(si,rj) > U (si,rm)+U(sn,rj) (3)
If having exchanged overall transmission rate after occurrence to be promoted, two occurrences will exchange matching result, otherwise snMatching Shen
It please will be rejected；
For the second class source node, as source node snWhen currently not having the relay node being connected to, to relay node rmIt is proposed connection
When application, rmOnly source node can be screened according to transmission rate, and receive best source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711083417.9A CN107809785B (en) | 2017-11-07 | 2017-11-07 | A kind of distributed relay selection method based on mutually beneficial matching game |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711083417.9A CN107809785B (en) | 2017-11-07 | 2017-11-07 | A kind of distributed relay selection method based on mutually beneficial matching game |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107809785A CN107809785A (en) | 2018-03-16 |
| CN107809785B true CN107809785B (en) | 2019-06-25 |
Family
ID=61583603
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711083417.9A Active CN107809785B (en) | 2017-11-07 | 2017-11-07 | A kind of distributed relay selection method based on mutually beneficial matching game |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107809785B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108882201B (en) * | 2018-06-12 | 2021-02-12 | 中国人民解放军陆军工程大学 | Energy efficiency-oriented relay transmission selection method for unmanned aerial vehicle cluster network |
| CN114071432B (en) * | 2021-11-18 | 2024-04-26 | 中国矿业大学 | Unmanned aerial vehicle relay selection method for underground space post-disaster emergency scene |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103582136A (en) * | 2012-07-27 | 2014-02-12 | 上海交通大学 | Method for efficiently allocating channels in wireless sensor network with multiple channels used |
| CN103841622A (en) * | 2014-03-12 | 2014-06-04 | 东北大学 | Relay self-adaptive selection method based on social attribute |
| CN104735796A (en) * | 2015-04-03 | 2015-06-24 | 东南大学 | Cooperation relay strategy of multisource and single relay system in wireless communication network |
-
2017
- 2017-11-07 CN CN201711083417.9A patent/CN107809785B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103582136A (en) * | 2012-07-27 | 2014-02-12 | 上海交通大学 | Method for efficiently allocating channels in wireless sensor network with multiple channels used |
| CN103841622A (en) * | 2014-03-12 | 2014-06-04 | 东北大学 | Relay self-adaptive selection method based on social attribute |
| CN104735796A (en) * | 2015-04-03 | 2015-06-24 | 东南大学 | Cooperation relay strategy of multisource and single relay system in wireless communication network |
Non-Patent Citations (1)
| Title |
|---|
| A game theoretic learning solution for distributed relay selection on throughput optimization;Cheng Ding 等;《Wireless Networks》;20170831;第23卷(第6期);第1757-1766页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107809785A (en) | 2018-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Optimizing resources allocation for fog computing-based Internet of Things networks | |
| CN105960024B (en) | User's discovery and resource allocation methods in a kind of D2D communication based on social activity perception | |
| CN104105158B (en) | A kind of relay selection method based on D2D trunking traffics | |
| Jain et al. | Impact of interference on multi-hop wireless network performance | |
| CN112737837B (en) | Method for allocating bandwidth resources of unmanned aerial vehicle cluster under high dynamic network topology | |
| CN101827418A (en) | Energy optimization-based cognitive radio multicast routing method | |
| CN106454700A (en) | D2D (Device-to-Device) communication content distribution scheme based on social network | |
| CN107809785B (en) | A kind of distributed relay selection method based on mutually beneficial matching game | |
| CN108712746A (en) | One kind partly overlaps channel aggregation betting model and learning algorithm | |
| CN105792338B (en) | A kind of low energy consumption network design method based on correlation of nodes and ONU modularization suspend mode | |
| Zhang et al. | Cooperative energy-efficient content dissemination using coalition formation game over device-to-device communications | |
| CN110753329B (en) | Power control and relay selection method for D2D relay communication in cellular network | |
| CN107820295B (en) | User demand-based distributed relay resource allocation method | |
| CN109272167B (en) | Green energy cooperation method based on UUDN and Q neural network | |
| CN106792480A (en) | D2D communication resource distribution algorithms based on cellular network | |
| Liu et al. | Distributed satisfaction‐aware relay assignment: a novel matching‐game approach | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| Zhu et al. | Efficient hybrid multicast approach in wireless data center network | |
| CN105979477A (en) | D2D communication energy consumption optimization method based on game theory | |
| Li et al. | Resource sharing for cellular-assisted D2D communications with imperfect CSI: a many-to-many strategy | |
| CN109152060A (en) | Transmitter channel distribution model and method in a kind of shortwave downlink communication | |
| CN110933684B (en) | Small world wireless sensor network construction method based on mixed mode | |
| CN114040471A (en) | Distributed topology control method and terminal based on Bluetooth network | |
| Tan et al. | Social-aware peer discovery and resource allocation for device-to-device communication | |
| Chen et al. | Intra-cluster device-to-device multicast algorithm based on small world model |
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 |