CN109905863A - The relaying cut-in method of distributed collaborative communication based on the storage of block chain - Google Patents
The relaying cut-in method of distributed collaborative communication based on the storage of block chain Download PDFInfo
- Publication number
- CN109905863A CN109905863A CN201910145952.5A CN201910145952A CN109905863A CN 109905863 A CN109905863 A CN 109905863A CN 201910145952 A CN201910145952 A CN 201910145952A CN 109905863 A CN109905863 A CN 109905863A
- Authority
- CN
- China
- Prior art keywords
- relaying
- relay
- phone user
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 title claims abstract description 21
- 239000011159 matrix material Substances 0.000 claims description 26
- 230000005540 biological transmission Effects 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 4
- 230000003321 amplification Effects 0.000 claims description 2
- 238000005265 energy consumption Methods 0.000 claims description 2
- 238000012804 iterative process Methods 0.000 claims description 2
- 238000003199 nucleic acid amplification method Methods 0.000 claims description 2
- 230000002146 bilateral effect Effects 0.000 claims 1
- 230000000052 comparative effect Effects 0.000 claims 1
- 230000001413 cellular effect Effects 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 10
- 230000000875 corresponding effect Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Abstract
The invention belongs to wireless cellular network marginal user performance optimisation technique fields, specifically the relaying cut-in method of the distributed collaborative communication based on the storage of block chain.The present invention relates to distributed collaborative communication, relaying access matching, block chains to store scheduling theory frame.Under different network sizes, compared to other relaying access schemes, the present invention can be under conditions of guaranteeing security of system and reliability, so that edge phone user and the non-edge phone user as relay node obtain higher performance benefits.Generally, the relaying cut-in method of the distributed collaborative communication based on the storage of block chain can optimize edge phone user's performance while reduce grid load.
Description
Technical field
The invention belongs to wireless cellular network marginal user performance optimisation technique fields, are specifically deposited based on block chain
The relaying cut-in method of the distributed collaborative communication of storage.The present invention relates to distributed collaborative communications, relaying access matching, block chain
Store scheduling theory frame.
Background technique
Distributed collaborative communication refers between node independent of central server centralized management but passes through D2D
(Device-to-Device) link, which cooperates with each other, carries out the communication mode of information transmission.The following 5G communication network will face high speed
The problems such as network load caused by the number of links of data transfer demands and rapid growth, particularly in cellular network edge
User, farther out from center base station due to geographical location, bad channel quality, if being directly accessed the communication party of base station using tradition
Formula will cause poor service quality (Quality-of-Sevice, QoS).To improve edge phone user QoS and reducing base station
Processing load carries out data as relaying by the non-edge phone user close to center base station and turns using D2D link technology
Hair.Above-mentioned application is brought the problem of relaying access selection, i.e., how to be different edge phone users distributes corresponding relaying section
Point is so that system performance is optimal.Traditional relaying access uses central server centralized management mostly, not only can in this way
It brings biggish delay of feedback and relay services is made to be subject to network congestion and attack for the centralization of central node
(such as Denial of Service attack), in view of the above-mentioned problems, distributed collaborative communication mode by central server due to that can not be completed
The characteristics of information interaction between nodes, is as the effective scheme for relaying access-in management.Although distributed collaborative can promote relay services
The robustness and delay performance of system, but it is the absence of Center Authentication server, the distribution of this mutual mistrust between node is logical
In communication network, it is understood that there may be how malicious node steal information or deceptive practices guarantee the lower relaying access of distributed collaborative communication
Safety, privacy and reliability be still problem to be solved.
Block chain be it is a kind of with " block " for basic data storage unit, chain type connects between " block ", and data are by institute in chain
Have the distributed storage architecture of nodes sharing, due to data in the form of block chain by distributed storage in each node, this makes
For the deceptive practices failure between the concentration attack of single node and node, and Linked Storage Structure and advanced common recognition mechanism are protected
Card system data is difficult to be tampered, historical data can inquire, in conjunction with technologies such as asymmetric encryption, digital signature, proof of work,
Block chain technology realizes the effective ways securely and reliably communicated in the distributed network as mutual mistrust between node.Block chain skill
Art is initially applied to digital cash field, after develop to the various fields such as medical data record, credit, Internet of Things, the present invention will
Block chain technology is applied in distributed collaborative communication relay access-in management, under the premise of guaranteeing the security reliability of system,
The service quality of wireless cellular network edge phone user is promoted simultaneously.
Summary of the invention
The present invention is based on block chain storage organizations, propose under wireless cellular network edge phone user's up-link scenario
Distributed collaborative communication relay access architecture, and using digital cash as relay services incentive mechanism, use bipartite matching (two-
Side matching) theoretical frame analysis solves this relaying matching problem, compared to traditional centralization relaying access-in management side
Method, the present invention can promote edge phone user correlated performance, drop simultaneously under conditions of guaranteeing security of system, reliability
Low grid load.
Distributed collaborative communication relay cut-in method based on the storage of block chain is using block chain as verification information between node
Storage architecture, using digital cash as the cost of relay services and incentive mechanism, and relayed using bipartite matching theory
Matching, guarantees the reliability and fairness of relay services.Specifically, the centrally located cellular cell in a base station is considered, wherein having
Uplink demand and the edge phone user for being located at cell edge, which gather, is denoted as S={ S1 S2 ... SK, K is edge honeycomb
Number of users；R={ R is denoted as positioned at the non-edge phone user set from base station closer location1 R2 ... RN, N is non-edge
Phone user's quantity；By distributed collaborative communication mode, edge phone user be can use in non-edge phone user conduct
After Forwards Forwarding to base station, consider that relaying matching is one-to-one matching, i.e. an edge phone user can only select a non-side
Edge phone user is as relay forwarding information, without loss of generality, N >=K. is arranged
In conjunction with block chain the relevant technologies, consider basic network setting: (1) each node of system has local storage space,
For the related data in relation to relaying access in memory block chain, a certain area of the method validation mutually examined can be passed through between node
The authenticity of information in block can also execute service by inquiring the historical information being recorded on block chain to understand a certain node
Confidence level.(2) relay services cost and incentive mechanism depend on digital cash, i.e. edge phone user passes through payout figure
Currency obtains relay services to corresponding non-edge phone user, and edge phone user is due to that can access edge cloud computing
Server has computing resource abundant, it is possible to generate the process of block by " digging mine " to obtain digital cash.
(3) identification between user uses public key (Public Key), carries out the side of identification by IP address compared to tradition
Method, public key identification allows node dynamically to change own public key after relaying access each time, in conjunction with asymmetric encryption techniques,
The safety of node and privacy are protected.
Relay forwarding is derived, a certain edge phone user S using amplification Forwards Forwarding (AF) agreement according to pertinent literaturei
∈ S selects a non-edge phone user Rj∈ R, forwarding rate ri,jIt is represented by
Wherein, B indicates channel width；Source node-relaying is allowed for, relaying-base station two stages shared resource is brought
Performance loss (such as Frequency Division Duplex FDD or Time Division Duplex TDD)；α is constant, indicates the available capacity factor, can pass through the bit error rate
PberIt calculates；γi0,γijIt respectively indicates when direct link is sent and signal-to-noise ratio when passing through relay forwarding, associated expression is such as
Under
Wherein, Pi,PjRespectively indicate the transmission rate of source node and the repeating power of relay node；hi0Indicate direct link
Channel gain parameter of the source node to base station, h when transmissionij,hj0Source node-relaying when respectively indicating relay forwarding, relaying-base
The channel gain parameter stood；σ2Indicate Background Noise Power.
Consider that relaying access is selected as bipartite matching process, i.e., edge phone user is according to corresponding pri function to non-
The relaying access performance of edge phone user does priority ranking, and non-edge phone user also can be according to corresponding priority letter
Several couples of service objects carry out priority ranking.Different edge phone users is different right from cost according to the income of relay services
The priority ranking of relay node difference, the definition of the pri function of bipartite matching process both sides can also produce sequence
Raw crucial effect, define first edge phone user select the pri function relayed for
Wherein, diIndicate edge phone user SiIntend to relay node RjThe digital cash paid i.e. service cost；rijTable
Show forwarding rate i.e. service revenue.As a certain edge phone user SiWhen selection relaying, relay node RjPri function value
It is bigger, in SiPriority list in sort it is higher.Source node priority matrix P can be obtained accordinglyS, it is K × N matrix, row generation
The different source node of table, column represent different relay nodes, matrix elementRelay node subscript is represented, indicates relay nodeIn source node SiPriority list in sequence marked as j, the label, that is, row number that sorts is higher, and corresponding priority is higher.
The pri function of non-edge phone user is defined as
Wherein, QiIndicate edge phone user SiThe data volume for needing to send,Time delay needed for forwarding is indicated, if considering
The repeating power of relay node is identical, thenIt can reflection forwarding energy consumption size of equal value.Non-edge phone user is according to priority letter
Numerical valueSize priority ranking is carried out to service object, the bigger source node sequence of pri function value is higher, can obtain
After node priority matrix PR, it is N × K matrix, row represents different relay nodes, and column represent different source nodes, matrix element
ElementSource node subscript is represented, indicates source nodeIn relay node RjPriority list in sequence marked as i, sequence mark
Number i.e. row number it is higher, corresponding priority is higher.Priority matrix based on both sides provides the Optimum Matching knot of bipartite matching
Fruit is defined as
After the pri function and priority matrix that define source node and relay node, it is as follows that bipartite matching algorithm can be performed
S1, initialization input parameter, such as bit error rate Pber, source node and relay node transmission power Pi,Pj, source node
Data volume Qi, payable digital cash biDeng
S2, relaying rate r is calculated according to formula (1), (2)ij, and pri function value is calculated by formula (3), (4), obtain source
The priority matrix P of node and relay nodeS,PR
S3, each relay node are according to priority matrix PRThe service object of highest priority is selected, and by itself label
It is sent to selected service object
S4, source node receive relay node by after access request, according to priority matrix PSCompare current relaying
Priority between selection and the relaying of request, if the relaying priority currently selected is higher than the priority of new request access relaying
Then refuse to request, otherwise, updating relay selection is new request access relaying.
S5, the relay node being rejected will be deleted from their priority matrix by source node and relay node, because
This, the priority matrix P updatedS,PRIf the relay selection result of front and back twice is consistent, stops iteration, obtain optimal
Otherwise bipartite matching is as a result, return to S3, continuation iterative process.
Technical solution of the present invention uses the relaying cut-in method of distributed collaborative communication, and block chain is combined to store skill
Art, using digital cash as the cost of relay services and incentive mechanism, when further comprehensively considering relaying rate, relay forwarding
Prolong, forward the influence of cost, define reasonable pri function for source node and relay node, guarantees the reliability and public affairs of system
Levelling completes relaying access selection eventually by bipartite matching algorithm.The beneficial effects of the present invention are: guaranteeing security of system
Under the premise of reliability, the processing delay and network load of relay management are reduced, while promoting the correlation of edge phone user
Energy.
Detailed description of the invention
Fig. 1 is I class edge phone user's average priority functional value pair that algorithms of different obtains under heterogeneous networks scale
Compare analogous diagram；Fig. 2 is II class edge phone user's average priority functional value that algorithms of different obtains under heterogeneous networks scale
Contrast simulation figure；Wherein, " BC-Enable Matching Algorithm " is proposed by the present invention based on the storage of block chain
Distributed collaborative communication relay accesses bipartite matching algorithm；" the conventional Algorithm " indicates traditional non-base
Unilateral matching algorithm is accessed in the relaying of block chain storage；" Random Algorithm " is random relaying matching algorithm.
Specific embodiment
With reference to the accompanying drawing and example, the technical schemes of the invention are described in detail:
In this example, bit error rate P is setber=10-6；It is 2Mbps, side that the data volume of different edge phone users, which obeys mean value,
The Gaussian Profile that difference is 0.5；It is P that user, which sends power setting,i=0.2W,Channel width B=
0.2MHz；Source node-relaying, relaying-base station channel gain hij,hj0Obey Lognormal shadowing it is weak+Rayleigh fading mould
Type；Background Noise Power σ2=10-3W.
Specific step is as follows:
Step 1: edge phone user sends relay request information by D2D link and gives non-edge phone user, including hair
Send the such as data volume size, payable digital cash and own public key
Step 2: after non-edge phone user receives relay request, according to own situation and source node situation, energy is determined
The source node of relay services is provided, and sends feedback information to service available source node, including available relay forwarding
Rate, the such as own public key information
Step 3: it after source node receives feedback information, is defined to obtain the priority matrix of both sides according to pri function
PS,PR, and optimal relaying is obtained by bipartite matching algorithm and accesses matching result
Step 4: source node starts " digging mine ", matching result is stored into dug block, and broadcast block to entire net
Network, after relay node confirms the authenticity of block information, open relaying access service, source node is allowed to carry out relay forwarding mistake
Journey
Step 5: being also stored into block for practical implementing result, and the posterior nodal point allowed is recorded in block by inquiry
Both sides provide performance indicator and practical execution result information, compare " contract " and execution information, authenticate the trusted of node
Degree determines relaying access selection
Through analogous diagram as can be seen that under different network sizes, compared to other relaying access schemes, the present invention can
With guaranteeing security of system and under conditions of reliability, so that edge phone user and the non-edge honeycomb as relay node
With obtaining higher performance benefits per family.Generally, the relaying cut-in method of the distributed collaborative communication based on the storage of block chain
Edge phone user's performance can be optimized while reducing grid load.
Claims (2)
1. the relaying cut-in method of the distributed collaborative communication based on the storage of block chain, the setting centrally located honeycomb in base station are small
Area, wherein having uplink demand and being denoted as S={ S positioned at the edge phone user of cell edge set1 S2 ... SK, K is
Edge phone user's quantity；R={ R is denoted as positioned at the non-edge phone user set from base station closer location1 R2 ... RN, N
For non-edge phone user's quantity；By distributed collaborative communication mode, edge phone user can use non-edge honeycomb use
Family considers that relaying matching is one-to-one matching, i.e. an edge phone user can only select as relaying Forwards Forwarding to base station
One non-edge phone user as relay forwarding information, N >=K, the specific steps of the relaying cut-in method are set are as follows:
S1: establishing model, and relay forwarding defines a certain edge phone user S using amplification Forwards Forwarding agreementi∈ S selection one is non-
Edge phone user Rj∈ R, forwarding rate ri,jIt is expressed as
Wherein, B indicates channel width；Allow for source node-relaying, relaying-base station two stages shared resource bring performance
Loss；α is constant, indicates the available capacity factor, passes through bit error rate PberIt calculates；γi0,γijRespectively indicate direct link transmission
When and signal-to-noise ratio when passing through relay forwarding, associated expression it is as follows
Wherein, Pi,PjRespectively indicate the transmission rate of source node and the repeating power of relay node；hi0Indicate that direct link is sent
When channel gain parameter of the source node to base station, hij,hj0Source node-relaying when respectively indicating relay forwarding, relaying-base station
Channel gain parameter；σ2Indicate Background Noise Power；
Define edge phone user select relay pri function for
Wherein, diIndicate edge phone user SiIntend to relay node RjThe digital cash paid i.e. service cost；rijIt indicates to turn
Rate, that is, service revenue is sent out, as a certain edge phone user SiWhen selection relaying, relay node RjPri function valueMore
Greatly, in SiPriority list in sort it is higher；Source node priority matrix P can be obtained accordinglySFor K × N matrix, row is represented
Different source nodes, column represent different relay nodes, matrix elementRelay node subscript is represented, indicates relay node
In source node SiPriority list in sequence marked as j, the label, that is, row number that sorts is higher, and corresponding priority is higher；
The pri function of non-edge phone user is defined as
Wherein, QiIndicate edge phone user SiThe data volume for needing to send,It indicates time delay needed for forwarding, enables relay node
Repeating power it is identical, thenIt can reflection forwarding energy consumption size of equal value；Non-edge phone user is according to pri function value's
Size carries out priority ranking to service object, and the bigger source node sequence of pri function value is higher, and it is excellent can to obtain relay node
First grade matrix PRFor N × K matrix, row represents different relay nodes, and column represent different source nodes, matrix elementRepresent source
Node subscript indicates source nodeIn relay node RjPriority list in sequence marked as i, the label, that is, row number that sorts is got over
Height, corresponding priority are higher；
S2: edge phone user passes through D2D link transmission relay request information first and gives non-edge phone user, including sends number
According to amount size, payable digital cash and own public key etc.；
S3: after non-edge phone user receives relay request, according to own situation and source node situation, decision can provide relaying
The source node of service, and send feedback information to service available source node, including available relay forwarding rate, itself
Public key information；
S4: it after source node receives feedback information, is defined to obtain the priority matrix P of both sides according to pri functionS,PR, and by
Bipartite matching algorithm obtains optimal relaying access matching result；Bipartite matching algorithm steps are as follows:
S41, initialization input parameter, including bit error rate Pber, source node and relay node transmission power Pi,Pj, source node
Data volume Qi, payable digital cash bi；
S42, relaying rate r is calculated according to formula (1), (2)ij, and pri function value is calculated by formula (3), (4), obtain source section
The priority matrix P of point and relay nodeS,PR；
S43, each relay node are according to priority matrix PRThe service object of highest priority is selected, and itself label is sent
To selected service object；
S44, source node receive relay node by after access request, according to priority matrix PSCompare current relay selection
Priority between the relaying of request is refused if the priority that the relaying priority currently selected is higher than new request access relaying
Request absolutely, otherwise, updating relay selection is new request access relaying；
S45, the relay node being rejected will be deleted from their priority matrix by source node and relay node, therefore,
The priority matrix P updatedS,PR；If the relay selection result of front and back twice is consistent, stop iteration, obtains optimal bilateral
Otherwise matching result returns to S43, continue iterative process.
2. the relaying cut-in method of the distributed collaborative communication according to claim 1 based on the storage of block chain, feature
It is, further comprising the steps of:
S5: after matching algorithm exports result, source node starts " digging mine ", and matching result is stored into dug block, and is broadcasted
Block is to whole network, after relay node confirms the authenticity of block information, open relaying access service, source node be allowed into
Row relay forwarding process；
S6: being also stored into block for practical implementing result, and the posterior nodal point allowed is mentioned by the both sides that inquiry is recorded in block
The performance indicator of confession and practical execution result information, Comparative indices and execution information, authenticate the trusted degree of node, in decision
It is selected after access.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910145952.5A CN109905863B (en) | 2019-02-27 | 2019-02-27 | Relay access method of distributed cooperative communication based on block chain storage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910145952.5A CN109905863B (en) | 2019-02-27 | 2019-02-27 | Relay access method of distributed cooperative communication based on block chain storage |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109905863A true CN109905863A (en) | 2019-06-18 |
| CN109905863B CN109905863B (en) | 2021-06-04 |
Family
ID=66945511
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910145952.5A Expired - Fee Related CN109905863B (en) | 2019-02-27 | 2019-02-27 | Relay access method of distributed cooperative communication based on block chain storage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109905863B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110413649A (en) * | 2019-08-01 | 2019-11-05 | 宁波富万信息科技有限公司 | A kind of financial big data processing method and its system platform based on block chain |
| CN111683373A (en) * | 2020-06-11 | 2020-09-18 | 电子科技大学 | Block chain auxiliary access control-based organization network secure communication method |
| CN112566211A (en) * | 2020-12-11 | 2021-03-26 | 安徽大学 | Cell relay cooperative communication method based on block chain intelligent contract |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103916912A (en) * | 2014-03-25 | 2014-07-09 | 南京邮电大学 | Node cooperation motivational method of wireless heterogeneous network on basis of non-cooperative game |
| CN104184510A (en) * | 2014-09-05 | 2014-12-03 | 西安电子科技大学 | Asymmetric two-way relay method based on spatial modulation |
| CN106464841A (en) * | 2014-05-28 | 2017-02-22 | 株式会社理光 | Transmission control system, transmission system, relay device selecting method, computer program product, and maintenance system |
| CN107071695A (en) * | 2017-01-17 | 2017-08-18 | 华北电力大学 | The route and dynamic spectrum resource management scheme of a kind of terminal direct connection cooperative relay network |
| CN108259594A (en) * | 2018-01-11 | 2018-07-06 | 杭州秘猿科技有限公司 | A kind of data interaction system and Relay Server based on block chain |
| CN108521590A (en) * | 2018-04-10 | 2018-09-11 | 北京息通网络技术有限公司 | A kind of method and system preventing false video data relaying |
-
2019
- 2019-02-27 CN CN201910145952.5A patent/CN109905863B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103916912A (en) * | 2014-03-25 | 2014-07-09 | 南京邮电大学 | Node cooperation motivational method of wireless heterogeneous network on basis of non-cooperative game |
| CN106464841A (en) * | 2014-05-28 | 2017-02-22 | 株式会社理光 | Transmission control system, transmission system, relay device selecting method, computer program product, and maintenance system |
| CN104184510A (en) * | 2014-09-05 | 2014-12-03 | 西安电子科技大学 | Asymmetric two-way relay method based on spatial modulation |
| CN107071695A (en) * | 2017-01-17 | 2017-08-18 | 华北电力大学 | The route and dynamic spectrum resource management scheme of a kind of terminal direct connection cooperative relay network |
| CN108259594A (en) * | 2018-01-11 | 2018-07-06 | 杭州秘猿科技有限公司 | A kind of data interaction system and Relay Server based on block chain |
| CN108521590A (en) * | 2018-04-10 | 2018-09-11 | 北京息通网络技术有限公司 | A kind of method and system preventing false video data relaying |
Non-Patent Citations (2)
| Title |
|---|
| 杨婷婷: "面向异构无人机中继网络的负载均衡:一种分层博弈方法", 《通信技术》 * |
| 潘晨: "区块链可扩展性研究:问题与方法", 《计算机研究与发展》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110413649A (en) * | 2019-08-01 | 2019-11-05 | 宁波富万信息科技有限公司 | A kind of financial big data processing method and its system platform based on block chain |
| CN111683373A (en) * | 2020-06-11 | 2020-09-18 | 电子科技大学 | Block chain auxiliary access control-based organization network secure communication method |
| CN111683373B (en) * | 2020-06-11 | 2022-03-08 | 电子科技大学 | Block chain auxiliary access control-based organization network secure communication method |
| CN112566211A (en) * | 2020-12-11 | 2021-03-26 | 安徽大学 | Cell relay cooperative communication method based on block chain intelligent contract |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109905863B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhou et al. | Blockchain-empowered secure spectrum sharing for 5G heterogeneous networks | |
| Nguyen et al. | Privacy-aware blockchain innovation for 6G: Challenges and opportunities | |
| Liao et al. | Blockchain and learning-based secure and intelligent task offloading for vehicular fog computing | |
| Guan et al. | Joint topology control and authentication design in mobile ad hoc networks with cooperative communications | |
| Jiang et al. | Joint transaction relaying and block verification optimization for blockchain empowered D2D communication | |
| CN109905863A (en) | The relaying cut-in method of distributed collaborative communication based on the storage of block chain | |
| Li et al. | To lie or to comply: Defending against flood attacks in disruption tolerant networks | |
| Machado et al. | Blockchain incentivized data forwarding in MANETs: Strategies and challenges | |
| CN107889082A (en) | A kind of D2D method for discovering equipment using social networks between user | |
| Zhang et al. | Blockchain-empowered efficient data sharing in Internet of Things settings | |
| Xu et al. | Modeling, analysis, and optimization of caching in multi-antenna small-cell networks | |
| Cao et al. | Multi‐relay selection schemes based on evolutionary algorithm in cooperative relay networks | |
| CN115361395A (en) | Internet of things data sharing method based on block chain payment channel network | |
| Qiu et al. | Subchannel assignment and power allocation for time-varying fog radio access network with NOMA | |
| Zhang et al. | Transaction transmission model for blockchain channels based on non-cooperative games | |
| Dewan et al. | Trusting routers and relays in ad hoc networks | |
| Santhanam et al. | Selfishness in mesh networks: wired multihop MANETs | |
| Garg et al. | Truclu: trust based clustering mechanism in software defined vehicular networks | |
| CN106507345A (en) | A kind of wireless relay communication method based on game theoretic safety of physical layer | |
| CN111866181B (en) | Block chain-based task unloading optimization method in fog network | |
| Xia et al. | xURLLC-Aware Service Provisioning in Vehicular Networks: A Semantic Communication Perspective | |
| CN112115499A (en) | Safe transmission method based on block chain and edge cache | |
| Yang et al. | User-centric blockchain for industry 5.0 applications | |
| Raj et al. | Secure cloud communication for effective cost management system through msbe | |
| Jenitha et al. | Distributed trust node selection for secure group communication in MANET |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210604 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |