CN109905863B - Relay access method of distributed cooperative communication based on block chain storage - Google Patents
Relay access method of distributed cooperative communication based on block chain storage Download PDFInfo
- Publication number
- CN109905863B CN109905863B CN201910145952.5A CN201910145952A CN109905863B CN 109905863 B CN109905863 B CN 109905863B CN 201910145952 A CN201910145952 A CN 201910145952A CN 109905863 B CN109905863 B CN 109905863B
- Authority
- CN
- China
- Prior art keywords
- relay
- priority
- node
- source node
- edge
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000004891 communication Methods 0.000 title claims abstract description 25
- 230000001413 cellular effect Effects 0.000 claims abstract description 63
- 239000011159 matrix material Substances 0.000 claims description 25
- 230000002146 bilateral effect Effects 0.000 claims description 13
- 230000008569 process Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000005065 mining Methods 0.000 claims description 3
- 230000003321 amplification Effects 0.000 claims description 2
- 238000005265 energy consumption Methods 0.000 claims description 2
- 230000014509 gene expression Effects 0.000 claims description 2
- 238000003199 nucleic acid amplification method Methods 0.000 claims description 2
- 230000008901 benefit Effects 0.000 abstract description 4
- 238000005457 optimization Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 5
- 238000007726 management method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000005284 excitation Effects 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000006399 behavior Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of wireless cellular network edge user performance optimization, and particularly relates to a relay access method for distributed cooperative communication based on block chain storage. The invention relates to theoretical frameworks of distributed cooperative communication, relay access matching, block chain storage and the like. Compared with other relay access schemes, the method and the device can ensure that edge cellular users and non-edge cellular users serving as relay nodes obtain higher performance benefits under the condition of ensuring the safety and reliability of the system. In general, a relay access method for distributed cooperative communication based on block chain storage can optimize edge cellular user performance while reducing system network load.
Description
Technical Field
The invention belongs to the technical field of wireless cellular network edge user performance optimization, and particularly relates to a relay access method for distributed cooperative communication based on block chain storage. The invention relates to theoretical frameworks of distributed cooperative communication, relay access matching, block chain storage and the like.
Background
Distributed cooperative communication refers to a communication mode in which nodes do not depend on centralized management of a central server and cooperate with each other through a D2D (Device-to-Device) link to transmit information. The future 5G communication network will face the problems of high-speed data transmission demand and network load caused by the rapidly increasing number of links, especially for the users at the edge of the cellular network, because the geographical location is far away from the central base station, the channel Quality is poor, and if the communication mode of the traditional direct access base station is adopted, poor Quality of service (QoS) will be caused. To improve edge cellular user QoS and reduce base station processing load, data forwarding may be performed by non-edge cellular users near the center base station as relays using D2D link technology. The above application brings the problem of relay access selection, that is, how to allocate corresponding relay nodes to different edge cellular users so that the system performance reaches the optimum. In order to solve the above problems, a distributed cooperative communication mode becomes an effective scheme for relay access management due to the characteristic that information interaction between nodes can not be completed through a central server. Although the robustness and the time delay performance of the relay service system can be improved through distributed cooperation, a central authentication server is lacked, so that malicious nodes possibly steal information or cheat behaviors in a distributed communication network in which nodes are not trusted with each other, and the problem of how to ensure the security, privacy and reliability of relay access under distributed cooperative communication still remains to be solved.
The block chain is a distributed storage structure which takes a 'block' as a basic data storage unit, the 'blocks' are in chain connection, data in the chain is shared by all nodes, as the data is stored in each node in a distributed mode in the form of the block chain, centralized attack aiming at a single node and cheating behaviors among the nodes are invalid, the chain storage structure and an advanced consensus mechanism ensure that system data are difficult to tamper, historical data can be inquired, and the block chain technology becomes an effective method for realizing safe and reliable communication in a distributed network with mutually untrustworthy nodes by combining technologies such as asymmetric encryption, digital signature, workload certification and the like. The block chain technology is applied to distributed cooperative communication relay access management, and on the premise of ensuring the safety and reliability of the system, the service quality of the wireless cellular network edge cellular user is improved.
Disclosure of Invention
Based on a block chain storage structure, the distributed cooperative communication relay access architecture is provided under the condition of an uplink of a wireless cellular network edge cellular user, digital currency is used as a relay service excitation mechanism, and a bilateral matching (two-side matching) theoretical framework is used for analyzing and solving the relay matching problem.
The distributed cooperative communication relay access method based on the block chain storage has the advantages that the block chain is used as a storage framework of verification information among nodes, digital currency is used as a cost and excitation mechanism of relay service, relay matching is carried out by using a bilateral matching theory, and reliability and fairness of the relay service are guaranteed. Specifically, consider a cell with a central bs, where the set of edge cell users with uplink transmission requirements at the cell edge is denoted as S ═ S1 S2 ... SKK is the number of edge cellular users; the set of non-edge cellular users located closer to the base station is denoted as R ═ R1 R2 ... RNN is the number of non-edge cellular users; by means of a distributed cooperative communication mode, edge cellular users can forward to a base station by using non-edge cellular users as relays, and relay matching is considered as one-to-one matching, namely, one edge cellular user can only select one non-edge cellular user as relay forwarding information, and N is set to be larger than or equal to K without loss of generality.
In conjunction with blockchain related techniques, consider the basic network setup: (1) each node of the system has a local storage space for storing relevant data related to relay access in a block chain, the authenticity of information in a certain block can be verified by a mutual check method among the nodes, and the reliability of service execution of a certain node can be known by inquiring historical information recorded on the block chain. (2) The relay service cost and incentive mechanism depends on digital currency, namely, an edge cellular user obtains the relay service by paying the digital currency to a corresponding non-edge cellular user, and the edge cellular user has abundant computing resources due to the fact that the edge cellular user can access an edge cloud computing server, so that the digital currency can be obtained through a process of mining, namely block generation. (3) Compared with the traditional method for identifying the identity through an IP address, the Public Key identity identification allows the node to dynamically change the Public Key of the node after each relay access, and the safety and the privacy of the node are guaranteed by combining an asymmetric encryption technology.
The relay forwarding adopts an amplification forward forwarding (AF) protocol, and is deduced according to related documents, and a certain edge cellular user SiSelecting a non-edge cellular user R by E SjE R, its forwarding rate Ri,jCan be expressed as
Wherein B represents a channel bandwidth;
the performance loss caused by resource sharing in two stages of source node-relay, relay-base station (such as frequency division duplex FDD or time division duplex TDD) is considered; alpha is a constant, representing the effective capacity factor, passing the bit error rate PberCalculating; gamma rayii,γijRespectively represents the signal-to-noise ratio when the direct link is transmitted and when the signal-to-noise ratio is forwarded through the relay, and the related expression is as follows
Wherein, Pi,PjRespectively representing the sending rate of a source node and the forwarding power of a relay node; h isi0Denotes the channel gain parameter, h, from the source node to the base station at the time of direct link transmissionij,hj0Respectively representing source node-relay at relay forwarding,channel gain parameters of the relay-base station; sigma2Representing the background noise power.
The relay access selection is considered as a bilateral matching process, namely, the edge cellular users prioritize the relay access performance of the non-edge cellular users according to corresponding priority functions, and the non-edge cellular users prioritize the service objects according to the corresponding priority functions. Priority ordering of relay nodes by different edge cellular users according to different benefits and costs of relay service is different, definition of priority functions of two sides in a bilateral matching process has a key influence on ordering, and the priority function of the edge cellular user selecting the relay is defined as
Wherein, biIndicating edge cellular subscriber SiIntended relay node RjThe paid digital currency is the cost of the service; r isijIndicating the forwarding rate, i.e., the service revenue. When an edge cellular subscriber SiWhen relay selection is performed, the relay node RjValue of priority function of
The larger it is at SiThe higher the ranking in the priority list. From this, a source node priority matrix P can be obtainedSA K × N matrix, rows representing different source nodes, columns representing different relay nodes, and matrix elements
Represents a relay node subscript, represents a relay node
At the source node SiThe higher the ranking index, i.e. the column number, is, the higher the corresponding priority is.
The priority function of the non-edge cellular user is defined as
Wherein Q isiIndicating edge cellular subscriber SiThe amount of data that needs to be transmitted,
that is, the delay time required for forwarding is represented, and if it is considered that the forwarding powers of the relay nodes are the same, the delay time is represented
The forwarding energy consumption can be equivalently reflected. Function value of non-edge cellular user according to priority
The priority of the service objects is sorted, the higher the priority function value is, the higher the source node is sorted, the priority matrix P of the relay node can be obtainedRIs an N × K matrix, rows represent different relay nodes, columns represent different source nodes, and matrix elements
Represents source node subscript, represents source node
At the relay node RjThe priority list of (2) has a sorting label i, and the higher the sorting label, i.e. the column number, the higher the corresponding priority. Based on the priority matrixes of the two parties, the optimal matching result giving bilateral matching is defined as
After defining the priority function and priority matrix of the source node and the relay node, the executable bilateral matching algorithm is as follows
S1, initializing input parameters, such as bit error rate PberTransmission power of source node and relay nodeRate Pi,PjData volume Q of source nodeiPayable digital currency biEtc. of
S2, calculating relay rate r according to formulas (1) and (2)ijAnd calculating priority function values by the formulas (3) and (4) to obtain a priority matrix P of the source node and the relay nodeS,PR
S3, each relay node according to the priority matrix PRSelecting the service object with highest priority and sending the self label to the selected service object
S4, after the source node receives the accessed request of the relay node, according to the priority matrix PSAnd comparing the priority between the current relay selection and the requested relay, rejecting the request if the priority of the currently selected relay is higher than the priority of the newly requested access relay, and otherwise, updating the relay selection to be the newly requested access relay.
S5, the rejected relay nodes will be deleted from their priority matrix by the source node and the relay nodes, thus, an updated priority matrix P is obtainedS,PRIf the relay selection results of the previous and subsequent two times are consistent, stopping iteration to obtain the optimal bilateral matching result, otherwise, returning to S3 and continuing the iteration process.
The technical scheme of the invention adopts a relay access method of distributed cooperative communication, combines a block chain storage technology, utilizes digital currency as a cost and excitation mechanism of relay service, further comprehensively considers the influence of relay rate, relay forwarding time delay and forwarding cost, defines a reasonable priority function for a source node and a relay node, ensures the reliability and fairness of a system, and finally completes relay access selection through a bilateral matching algorithm. The invention has the beneficial effects that: on the premise of ensuring the safety and reliability of the system, the processing time delay and network load of relay management are reduced, and meanwhile, the related performance of edge cellular users is improved.
Drawings
FIG. 1 is a comparison simulation diagram of the average priority function values of class I edge cellular users obtained by different algorithms under different network scales;
FIG. 2 is a comparison simulation diagram of the average priority function values of class II edge cellular users obtained by different algorithms under different network scales;
the 'BC-Enable Matching Algorithm' is a distributed cooperative communication relay access bilateral Matching Algorithm based on block chain storage, which is provided by the invention; the contextual Algorithm represents a traditional non-block chain storage based relay access unilateral matching Algorithm; "Random Algorithm is a Random relay matching Algorithm.
Detailed Description
The technical scheme of the invention is described in detail in the following with reference to the attached drawings and examples:
in this example, the bit error rate P is setber＝10-6(ii) a The data volume of different edge cellular users obeys Gaussian distribution with the mean value of 2Mbps and the variance of 0.5; user transmit power setting Pi＝0.2W,Pj＝0.2W,
Rj(ii) a The channel bandwidth B is 0.2 MHz; channel gain h of source node-relay, relay-base stationij,hj0Obeying a lognormal shadow attenuation and Rayleigh fading model; background noise power σ2＝10-3W.
The method comprises the following specific steps:
the method comprises the following steps: the edge cellular user sends relay request information to the non-edge cellular user through the D2D link, including sending data volume size, payable digital currency and self public key.
Step two: after receiving the relay request, the non-edge cellular user determines a source node capable of providing the relay service according to the self condition and the source node condition, and sends feedback information to the source node capable of providing the service, wherein the feedback information comprises the relay forwarding rate capable of providing, self public key information and the like.
Step three: after the source node receives the feedback information, the priority matrix P of the two parties is obtained according to the definition of the priority functionS,PRAnd obtaining the optimal relay access matching result by a bilateral matching algorithm.
Step four: and the source node starts mining, stores the matching result into the mined block, broadcasts the block to the whole network, and opens the relay access service after the relay node confirms the authenticity of the block information, so that the source node is allowed to carry out the relay forwarding process.
Step five: and storing the actual execution result into the block, so that the node can determine the relay access selection by inquiring the performance indexes provided by the two parties recorded in the block and the actual execution result information, comparing the contract with the execution information and authenticating the credibility of the node.
As can be seen from the simulation diagram, compared with other relay access schemes, the invention can ensure that the edge cellular users and the non-edge cellular users as the relay nodes obtain higher performance benefits under the condition of ensuring the system security and reliability under different network scales. In general, a relay access method for distributed cooperative communication based on block chain storage can optimize edge cellular user performance while reducing system network load.
Claims (2)
1. A relay access method of distributed cooperative communication based on block chain storage sets a cell with a base station located in the center, wherein an edge cell user set which has uplink transmission requirements and is located at the edge of the cell is recorded as S ═ S1 S2 ... SKK is the number of edge cellular users; the set of non-edge cellular users located closer to the base station is denoted as R ═ R1 R2 ... RNN is the number of non-edge cellular users; by a distributed cooperative communication mode, edge cellular users can forward to a base station by using non-edge cellular users as relays, relay matching is considered as one-to-one matching, namely, one edge cellular user can only select one non-edge cellular user as relay forwarding information, N is set to be larger than or equal to K, and the relay access method specifically comprises the following steps:
s1: establishing a model, wherein the relay forwarding adopts an amplification forward forwarding protocol, and defines a certain edge cellular user SiSelecting a non-edge cellular user R by E SjE R, its forwarding rate Ri,jIs shown as
Wherein B represents a channel bandwidth;
the performance loss caused by resource sharing of a source node, a relay and a base station is considered; α is a constant, representing the effective capacity factor, by bit error rate PberCalculating; gamma rayii,γijRespectively representing the signal-to-noise ratio when the direct link is transmitted and when the signal-to-noise ratio is forwarded through the relay, and the related expressions are as follows
Wherein, Pi,PjRespectively representing the sending rate of a source node and the forwarding power of a relay node; h isi0Denotes the channel gain parameter, h, from the source node to the base station at the time of direct link transmissionij,hj0Respectively representing channel gain parameters of a source node, a relay and a relay base station during relay forwarding; sigma2Representing the background noise power;
defining a priority function for edge cell users to select relays as
Wherein,biindicating edge cellular subscriber SiIntended relay node RjThe paid digital currency is the cost of the service; r isijIndicating the forwarding rate, i.e. the service gain, when an edge cellular subscriber SiWhen relay selection is performed, the relay node RjValue of priority function of
The larger it is at SiThe higher the ranking in the priority list of (1); from this, a source node priority matrix P can be obtainedSIs a K multiplied by N matrix, the rows represent different source nodes, the columns represent different relay nodes, and the matrix elements
Represents a relay node subscript, represents a relay node
At the source node SiThe sorting label is j in the priority list, and the higher the sorting label, namely the column number, is, the higher the corresponding priority is;
the priority function of the non-edge cellular user is defined as
Wherein Q isiIndicating edge cellular subscriber SiThe amount of data that needs to be transmitted,
that is, the time delay required by forwarding is shown, and the forwarding power of the relay node is the same, then
The forwarding energy consumption can be equivalently reflected; function value of non-edge cellular user according to priority
The priority of the service objects is sorted, the higher the priority function value is, the higher the source node is sorted, the priority matrix P of the relay node can be obtainedRIs an N x K matrix, the rows represent different relay nodes, the columns represent different source nodes, and the matrix elements
Represents source node subscript, represents source node
At the relay node RjThe priority list has a sorting label i, and the higher the sorting label, i.e. the column number, the higher the corresponding priority;
s2: the method comprises the steps that an edge cellular user firstly sends relay request information to a non-edge cellular user through a D2D link, wherein the relay request information comprises the size of sending data volume, payable digital currency, a self public key and the like;
s3: after receiving the relay request, the non-edge cellular user determines a source node capable of providing the relay service according to the self condition and the source node condition, and sends feedback information to the source node capable of providing the service, wherein the feedback information comprises the relay forwarding rate capable of providing and self public key information;
s4: after the source node receives the feedback information, the priority matrix P of the two parties is obtained according to the definition of the priority functionS,PRAnd obtaining an optimal relay access matching result by a bilateral matching algorithm; the bilateral matching algorithm comprises the following steps:
s41, initializing input parameters including error rate PberTransmission power P of source node and relay nodei,PjData volume Q of source nodeiPayable digital currency bi；
S42, calculating relay rate r according to formulas (1) and (2)ijAnd calculating priority function values by the formulas (3) and (4) to obtain a priority matrix P of the source node and the relay nodeS,PR；
S43, each relay node according to the priority matrix PRSelecting the highest priority garmentThe service object sends the label to the selected service object;
s44, after the source node receives the accessed request of the relay node, according to the priority matrix PSComparing the priority between the current relay selection and the requested relay, if the priority of the currently selected relay is higher than the priority of the newly requested access relay, rejecting the request, and if not, updating the relay selection to be the newly requested access relay;
s45, the rejected relay nodes will be deleted from their priority matrix by the source node and the relay nodes, thus, an updated priority matrix P is obtainedS,PR(ii) a And if the relay selection results of the two times are consistent, stopping iteration to obtain the optimal bilateral matching result, otherwise, returning to S43 and continuing the iteration process.
2. The relay access method for distributed cooperative communication based on blockchain storage according to claim 1, further comprising the steps of:
s5: after the matching algorithm outputs a result, the source node starts mining, stores the matching result into a mined block, broadcasts the block to the whole network, and opens the relay access service after the relay node confirms the authenticity of the block information, so that the source node is allowed to carry out a relay forwarding process;
s6: and storing the actual execution result into the block, so that the node can determine the relay access selection by inquiring the performance index and the actual execution result information provided by the two parties recorded in the block, comparing the index with the execution information and authenticating the credibility of the node.
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 CN109905863A (en) | 2019-06-18 |
| CN109905863B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110413649B (en) * | 2019-08-01 | 2020-06-12 | 深圳前海大数金融服务有限公司 | Financial big data processing method based on block chain and system platform thereof |
| CN111683373B (en) * | 2020-06-11 | 2022-03-08 | 电子科技大学 | Block chain auxiliary access control-based organization network secure communication method |
| CN112566211B (en) * | 2020-12-11 | 2022-04-15 | 安徽大学 | 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 |
|---|
| 区块链可扩展性研究:问题与方法;潘晨;《计算机研究与发展》;20181015;全文 * |
| 面向异构无人机中继网络的负载均衡:一种分层博弈方法;杨婷婷;《通信技术》;20181110;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109905863A (en) | 2019-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| He et al. | D2D communications meet mobile edge computing for enhanced computation capacity in cellular networks | |
| Liao et al. | Blockchain and learning-based secure and intelligent task offloading for vehicular fog computing | |
| Nguyen et al. | Privacy-aware blockchain innovation for 6G: Challenges and opportunities | |
| Zhao et al. | On the design of computation offloading in fog radio access networks | |
| Rahman et al. | Radio resource allocation for achieving ultra-low latency in fog radio access networks | |
| CN111800495B (en) | Task unloading method in vehicle fog calculation | |
| CN109905863B (en) | Relay access method of distributed cooperative communication based on block chain storage | |
| Xu et al. | Game theoretical secure caching scheme in multihoming edge computing-enabled heterogeneous networks | |
| CN105827410A (en) | Block chain transmission method and system with trusted node/satellite node construction | |
| CN112119620B (en) | System and method for propagating data packets in a network of nodes | |
| US20220217089A1 (en) | Path traffic allocation method, network device, and network system | |
| CN105678151A (en) | Block chain transmitting method and system for constructing trustable nodes/satellite nodes | |
| Kim | 5G Network Communication, Caching, and Computing Algorithms Based on the Two‐Tier Game Model | |
| Qiu et al. | Subchannel assignment and power allocation for time-varying fog radio access network with NOMA | |
| Liu et al. | Resource allocation for video transcoding and delivery based on mobile edge computing and blockchain | |
| Ling et al. | Hash access in blockchain radio access networks: Characterization and optimization | |
| Liu et al. | Communitychain: Toward a Scalable Blockchain in Smart Home | |
| CN111866181B (en) | Block chain-based task unloading optimization method in fog network | |
| WO2017115003A1 (en) | Radio access resource sharing | |
| CN112115499A (en) | Safe transmission method based on block chain and edge cache | |
| Alibeigi et al. | Improving secrecy rate and social welfare by NOMA technique in D2D communications network | |
| Sun et al. | Performance analysis on wireless blockchain IoT system | |
| CN116806038A (en) | Decentralizing computer data sharing method and device | |
| Du et al. | Cost‐Effective Optimization for Blockchain‐Enabled NOMA‐Based MEC Networks | |
| CN108900518A (en) | Believable software definition cloud network data distribution systems |
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 |