CN112566211B - Cell relay cooperative communication method based on block chain intelligent contract - Google Patents
Cell relay cooperative communication method based on block chain intelligent contract Download PDFInfo
- Publication number
- CN112566211B CN112566211B CN202011439311.XA CN202011439311A CN112566211B CN 112566211 B CN112566211 B CN 112566211B CN 202011439311 A CN202011439311 A CN 202011439311A CN 112566211 B CN112566211 B CN 112566211B
- Authority
- CN
- China
- Prior art keywords
- relay
- information
- source
- node
- cooperative communication
- 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
Images
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/1082—Resource delivery mechanisms involving incentive schemes
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a cell relay cooperative communication method based on a block chain intelligent contract, which overcomes the defect that a trust relationship is difficult to establish between a cooperative communication terminal and a relay node compared with the prior art. The invention comprises the following steps: establishing a relay cooperative communication system model; and carrying out relay cooperative communication. According to the invention, the block generation and consensus process is utilized, so that fair transaction between terminals is ensured, and the safety level of data transmission is improved; in the relay selection process of the information source in the cooperative communication, the optimal sending power and the pricing algorithm are adopted to select the relay, so that the communication quality of the terminal under low power is guaranteed.
Description
Technical Field
The invention relates to the technical field of wireless cellular communication, in particular to a cellular cell relay cooperative communication method based on a block chain intelligent contract.
Background
With the development of software and hardware of the intelligent terminal, the improvement of network speed and the development of multimedia application, the data flow of the mobile terminal is increased in an explosive manner, so that the energy consumption of the mobile terminal is increased more and more. Energy saving and green communication are one of the important subjects of wireless communication, and the battery performance of the intelligent terminal is not improved at present, so how to reduce the energy consumption of the terminal is a key problem to be solved. Research has shown that cooperative communication is one of the effective methods to reduce the energy consumption of the mobile terminal MT. However, these researches are all established on the premise that the information source and the relay are completely trusted, however, in practice, it is difficult for the distributed terminals to directly establish a mutual trust relationship, and if an effective economic behavior is lacking as an energy sharing incentive condition, the terminals are unlikely to participate in the relay forwarding process, so an effective cooperative incentive mechanism is needed to encourage the terminals to participate in cooperation.
The blockchain technology uses a data structure of a decentralized distributed ledger, and the distributed ledger is used for storing data related to mutual interaction behaviors among users, such as virtual currency transaction behaviors, commodity information source tracing behaviors, health medical data storage records and the like. Unlike traditional database management models, participants can only add new data to the blockchain without having the right to modify and delete historical data. Therefore, the technology can overcome the problem of distrust among terminal nodes and form an effective cooperative incentive mechanism.
How to introduce the blockchain technology into cooperative communication to solve the distrust problem between MTs has become an urgent technical problem to be solved
Disclosure of Invention
The invention aims to solve the defect that a trust relationship is difficult to establish between a cooperative communication terminal and a relay node in the prior art, and provides a cell relay cooperative communication method based on a block chain intelligent contract to solve the problem.
In order to achieve the purpose, the technical scheme of the invention is as follows:
a cell relay cooperative communication method based on block chain intelligent contracts is characterized in that a wireless access point is located in the center of a cell and is recorded as an information sink d, a mobile terminal MT with an uplink transmission requirement is recorded as an information source s, J idle terminal nodes are used as relays and are respectively recorded as rj(J ∈ {1, 2.., J }); when the electric quantity of the information source s is low or the quality of an uplink channel is poor, the information source s forwards data for the information source s by using an idle terminal node; after the data are completely forwarded to the wireless access point, the information source s pays the electronic money to the relay; transaction information of electronic money and credit values of terminal nodes are written into blocks, and block information is stored in each node of the network, so that the terminals are stimulated to participate in cooperation, cheat of the terminals is prevented, and a trust basis of cooperation among the terminal nodes is established transparently; the whole process of cooperative communication is written into an intelligent contract of the blockchain and automatically executed, wherein the intelligent contract is an electronic protocol, namely a program automatically executed when a trigger condition is met, the contract comprises rights and obligations of each node, and the rights and obligations are stored in each node of the blockchain network in an electronic mode and automatically executed;
the cell relay cooperative communication method based on the block chain intelligent contract comprises the following steps:
11) establishing a relay cooperative communication system model: establishing a system model of relay cooperative communication based on a block chain intelligent contract;
12) and carrying out relay cooperative communication: and on the basis of the relay cooperative communication model, carrying out relay cooperative communication based on a block chain intelligent contract.
The method for establishing the relay cooperative communication system model comprises the following steps:
21) setting information source s to broadcast and transmit information, relay rjAnd the wireless access point d receives data;
22) relay rjIf the mode of amplifying and forwarding AF is adopted, the data is multiplied by an amplification factor after being normalized, and then the data is forwarded to the reachable rate of the wireless access point d, d
Is defined as:
if the information source does not use the relay to forward the data, the data is transmitted to the wireless access point d by adopting the mode of direct transmission DTDTIs defined as:
QDT＝log2(1+γsd)； (2)
wherein, γsd、
Respectively representing the signal-to-noise ratio of a signal directly sent to a wireless access point d by a signal source s and the signal-to-noise ratio of a cooperative branch for forwarding data by the aid of a relay; the expression is as follows:
γsd＝αsdps， (3)
wherein the content of the first and second substances,
representing source s to relay r separatelyjRelay rjThe ratio of the square of the channel modulus to the sink d, the source s to the sink d, and the noise variance;
ps,
representing source s and relay rjThe transmit power of (a);
23) definition of Source s and Relay rjThe energy consumption cost and the minimum optimization problem of (a) are expressed as follows:
wherein, UjRepresents the sum of the energy consumption costs of the source and the relay,
cost xi representing unit energy of source s batterysAnd the current battery power BsXi relation ofmaxRepresents the maximum cost value, BmaxRepresents a maximum battery charge;
for relay rjIs provided with
Wherein
Represents the cost per unit energy of the relay battery,
indicating the current battery power of the relay;
optimization Condition C1The equation shows that the achievable rate is equal to the expected value Q when the relay is used for cooperative transmission, and the equation is expressed by the formula (1)
Simplifying and obtaining;
condition C2Indicates that the relay r is satisfiedjThe expected benefit is not less than epsilonj，εjNot less than 0 is a fixed value, pijRepresents a relay rjWhen the information source s is helped to carry out cooperative transmission, the information source s needs to transmit to the relay rjThe electronic money to be paid is,
representing the energy consumption cost of the relay,
represents a relay rjThe overall profit of (c);
condition C3Indicating source s selects relay rjProvided that the cost of the source s in cooperative communication is less than the cost of energy consumption in direct transmission to the desired rate, where ξspsRepresents the energy consumption cost of the source s, and pij+ξspsRepresenting the total expenditure of the source s in cooperative communication;
the expression on the right side of the inequality is Q expressed by the formula (2)DTQ is derived
Then multiplied by a cost value xisObtaining, which represents the energy consumption cost of the information source s during direct transmission;
condition C4Denotes a maximum limit of transmission power, where pmaxRepresents the maximum transmit power;
24) the expression defining the credit value of the MT node is as follows:
wherein, REPi,j、REPi-1,jRespectively representing the credit value of the current evaluation and the credit value of the last evaluation of the corresponding node,
represents the energy consumption cost of the relay in the whole cooperative transmission
As source s and relay rjThe sum of energy consumption costs of;
Ud＝ξs*(2Q-1)/αsdthe energy consumption cost of the information source s in direct transmission is represented, the coefficient 0.5 represents the weight occupied by each part, the lambda represents the frequency of information tampering of the node, and the credit value of the node serving as relay forwarding data is deducted by 1 when the information tampering occurs.
The relay cooperative communication includes the following steps:
31) initializing a relay cooperative communication system: setting a mobile terminal MT which is newly added into a network in each period of time in the cellular network, wherein information related to a block of the network is not stored in the mobile terminal MT before;
the mobile terminal MT participating in the intelligent contract becomes a legal MT node after the registration of the trusted wireless access point, and the node MTjIncluding wallet address WjCredit value REPjElectronic money pij(ii) a Back node MTjSending request information for adding a block chain to surrounding nodes, replying the nodes after being received by a wireless access point and other terminal nodes in a cell, wherein the replying information comprises latest block information, and the block information is stored in a local node after being received by the nodes;
32) information source cooperationRelay selection in communication: information source s broadcasts cooperation request information, idle nodes meeting conditions reply information to the information source s, and s selects proper relay r according to the total energy consumption cost valuejI.e. solving the optimization problem (5) and then informing the selected relay and wireless access point;
33) collaborative transmission and electronic money transactions: electronic money pi in s-walletjIs locked, relayed rjThe cooperation s forwards data, and the wireless access point d verifies the integrity of the received data and returns information to s and rjAfter that the electronic money locked in s is pijWill be directly transferred into rjThe wallet of (1);
34) block generation and consensus process: after each transaction, all nodes update the credit value REP according to the node credit value expression (6)jAnd broadcasting the transaction records and node credit values, wherein the MT node with the largest credit value is responsible for accounting, namely generating the block;
when the MT node with the largest credit value is in billing, generating an account book and a credit value table, writing the information into a block, and performing whole-network broadcast verification; and adding the checked block into the block chain by a new chain, and informing all nodes of saving the block chain by the wireless access point.
The relay selection when the information sources carry out cooperative communication comprises the following steps:
41) the information source s broadcasts cooperation request information, and the cooperation request information comprises the address of the wallet, the size of data to be sent and the current electric quantity of the information source s;
42) the idle node meeting the condition replies a message to the s;
for each free node rjAnd J belongs to {1, 2.,. J }, firstly, screening relay nodes with lower credit values in the network, and solving the optimal p for each screened relay nodes,
πj,UjThat is, the optimal p is obtained by solving the optimization problem (7) by using the optimal sending power and pricing algorithms,
And corresponding pijAnd Uj；
If (7) has no solution, then all rjThe message is not replied to s, and s is converted into a direct sending mode;
if (7) has a solution and the amount of money remaining in the wallet is sufficient to pay the transaction price pijFree node rjReplying information to information source s to indicate that s is agreed to be relayed, wherein the replying information comprises ps,
And corresponding pijAnd Uj；
43) s after receiving all the reply messages of the idle nodes, selecting UjMinimum relaying, i.e. further seeking for all relays
Notifying the selected relay and wireless access point.
The optimal transmit power and pricing algorithm solving an optimization problem (7) comprises the steps of:
51) initialization
52) Let i equal 1,2,3, 10, go through a cycle, the specific steps in each cycle are as follows:
521) order to
522) Calculate the correspondence of each i
Therein
Substituting formula (3) and formula (4) into condition C in formula (7)1Elimination of primordial qi psGet eta 22Q-1；
53) After the circulation is finished, calculating UjAt the smallest
Namely, it is
And calculate correspondences
54) Judgment Condition C2C3C4Whether or not:
if satisfied, the optimal solution is ps,
As a result of (1), the transaction at that time is priced as
The total energy consumption has a cost value of
If all rjIf none of them is satisfied, (7) no solution is obtained.
Advantageous effects
Compared with the prior art, the cell relay cooperative communication method based on the intelligent block chain contract ensures fair transaction between terminals and improves the safety level of data transmission by utilizing the block generation and consensus processes; in the relay selection process of the information source in the cooperative communication, the optimal sending power and the pricing algorithm are adopted to select the relay, so that the communication quality of the terminal under low power is guaranteed.
The invention also has the following advantages:
(1) the block chain is introduced into the cooperative communication, so that the defect that trust relationships are difficult to establish between a cooperative communication terminal and a plurality of relay nodes is overcome;
(2) the block generation and consensus process is utilized, so that fair transaction between terminals is guaranteed, and the safety level of data transmission is improved;
(3) in the relay selection process of the information source in the cooperative communication, the optimal sending power and the pricing algorithm are adopted to select the relay, so that the communication quality of the terminal under low power is guaranteed, namely, the energy consumption cost in the network can be effectively reduced under the condition of guaranteeing fair transaction and safe data transmission of the terminal;
(4) the initiative of the user in cooperation can be improved, the participation of malicious nodes is avoided, and the relay cooperation communication scheme is safe and energy-saving.
Drawings
FIG. 1 is a sequence diagram of the method of the present invention;
FIG. 2 is a diagram of a cellular network in an embodiment of the present invention;
FIG. 3 is a diagram of a cooperative communication model of a single cell in an embodiment of the present invention;
fig. 4 is a flowchart of cell relay cooperative communication based on a block chain intelligent contract according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a storage space of a single terminal node according to the present invention;
FIG. 6 is a block diagram of the present invention, wherein (a) shows the structure of a block and (b) shows the MT credit table in the block;
FIG. 7 is a comparison graph of the change of energy consumption cost with the number of relays for various schemes in the embodiment of the present invention;
FIG. 8 is a graph comparing the cost of energy consumption versus bandwidth rate for various schemes in an embodiment of the invention;
FIG. 9 is a comparison graph of energy consumption cost versus power of the source for various schemes in an embodiment of the present invention;
FIG. 10 is a graph comparing the cost of energy consumption versus maximum transmit power for various schemes in an embodiment of the invention;
fig. 11(a) is a statistical graph of the number of billing times of each node when malicious node tampering information is not set in the embodiment of the present invention, and fig. 11(b) is a statistical graph of the number of node billing times after the MT nodes 5 and 6 in fig. 11(a) that have higher billing times, that is, higher credit values, are set as the malicious node tampering information.
Detailed Description
So that the manner in which the above recited features of the present invention can be understood and readily understood, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings, wherein:
as shown in fig. 2 and 3, in a cell, a wireless access point is located at the center of the cell and is denoted as a signal sink d, a mobile terminal MT with uplink transmission requirement is denoted as a signal source s, J idle terminal nodes are used as relays and are denoted as rj(J ∈ {1, 2.., J }); when the electric quantity of the information source s is low or the quality of an uplink channel is poor, the information source s forwards data for the information source s by using an idle terminal node; after the data are completely forwarded to the wireless access point, the information source s pays the electronic money to the relay; transaction information of electronic money and credit values of terminal nodes are written into blocks, and block information is stored in each node of the network, so that the terminals are stimulated to participate in cooperation, cheat of the terminals is prevented, and a trust basis of cooperation among the terminal nodes is established transparently; the whole process of cooperative communication is written into an intelligent contract of the blockchain and automatically executed, wherein the intelligent contract is an electronic protocol, namely a program automatically executed when a trigger condition is met, and the contract comprises rights and obligations of each node, and the rights and obligations are stored in each node of the blockchain network in an electronic mode and automatically executed.
As shown in fig. 1, a method for cell relay cooperative communication based on a block chain intelligent contract according to the present invention includes the following steps:
firstly, establishing a relay cooperative communication system model: and establishing a system model for relaying cooperative communication based on the block chain intelligent contract. In a communication scenario of a mobile cellular cell, when uplink channel quality of a mobile terminal MT located at a cell edge is poor, or the MT has low electric quantity and does not have enough energy to send data to a base station, relay cooperative communication is needed to improve communication quality, reduce energy loss and achieve the purpose of data transmission. The traditional relay cooperative communication is established on the basis of complete trust of information sources and relays, and an incentive mechanism is lacked to promote terminals to participate in cooperative communication, so that blocks and intelligent contracts are introduced into a storage space of terminal nodes by the model, transaction information and credit values are recorded by the blocks, the terminals are encouraged to participate in cooperation in a public and transparent mode, cheating of the terminals is prevented, and a trust basis for cooperation between the terminal nodes is established; the whole cooperative communication process is written into an intelligent contract of the block chain, and the intelligent contract is automatically executed when the triggering condition is met. The difficulty of establishing the model lies in that a block and an intelligent contract need to be deployed in the storage space of each node, and calculation storage resources are consumed to verify the reliability of data. The specific steps for establishing the relay cooperative communication system model are as follows:
(1) setting information source s to broadcast and transmit information, relay rjAnd the wireless access point d receives the data.
(2) Relay rjIf the mode of amplifying and forwarding AF is adopted, the data is multiplied by an amplification factor after being normalized, and then the data is forwarded to the reachable rate of the wireless access point d, d
Is defined as:
if the information source does not use the relay to forward the data, the data is transmitted to the wireless access point d by adopting the mode of direct transmission DTDTIs defined as:
QDT＝log2(1+γsd)； (2)
wherein, γsd、
Respectively representing signals transmitted directly from source s to wireless access pointd and the signal-to-noise ratio of the cooperative branch for which the relay helps to forward the data; the expression is as follows:
γsd＝αsdps， (3)
wherein the content of the first and second substances,
representing source s to relay r separatelyjRelay rjThe ratio of the square of the channel modulus to the sink d, the source s to the sink d, and the noise variance;
ps,
representing source s and relay rjThe transmit power of.
(3) Definition of Source s and Relay rjThe energy consumption cost and the minimum optimization problem of (a) are expressed as follows:
wherein, UjRepresents the sum of the energy consumption costs of the source and the relay,
cost xi representing unit energy of source s batterysAnd the current battery power BsXi relation ofmaxRepresents the maximum cost value, BmaxRepresents a maximum battery charge;
for relay rjIs provided with
Wherein
Represents the cost per unit energy of the relay battery,
indicating the current battery power of the relay;
optimization Condition C1The equation shows that the achievable rate is equal to the expected value Q when the relay is used for cooperative transmission, and the equation is expressed by the formula (1)
Simplifying and obtaining;
condition C2Indicates that the relay r is satisfiedjThe expected benefit is not less than epsilonj，εjNot less than 0 is a fixed value, pijRepresents a relay rjWhen the information source s is helped to carry out cooperative transmission, the information source s needs to transmit to the relay rjThe electronic money to be paid is,
representing the energy consumption cost of the relay,
represents a relay rjThe overall profit of (c);
condition C3Indicating source s selects relay rjProvided that the cost of the source s in cooperative communication is less than the cost of energy consumption in direct transmission to the desired rate, where ξspsRepresents the energy consumption cost of the source s, and pij+ξspsIndicating that the source s is in the cooperative channelThe overall cost of the time;
the expression on the right side of the inequality is Q expressed by the formula (2)DTQ is derived
Then multiplied by a cost value xisObtaining, which represents the energy consumption cost of the information source s during direct transmission;
condition C4Denotes a maximum limit of transmission power, where pmaxIndicating the maximum transmit power.
(4) The expression defining the credit value of the MT node is as follows:
wherein, REPi,j、REPi-1,jRespectively representing the credit value of the current evaluation and the credit value of the last evaluation of the corresponding node,
represents the energy consumption cost of the relay in the whole cooperative transmission
As source s and relay rjThe sum of energy consumption costs of;
Ud＝ξs*(2Q-1)/αsdthe energy consumption cost of the information source s in direct transmission is represented, the coefficient 0.5 represents the weight occupied by each part, the lambda represents the frequency of information tampering of the node, and the credit value of the node serving as relay forwarding data is deducted by 1 when the information tampering occurs.
And step two, the relay cooperative communication method comprises the following steps: and on the basis of the relay cooperative communication model, carrying out relay cooperative communication based on a block chain intelligent contract.
In the prior art article, "relay access method for distributed cooperative communication based on block chain storage", a relay access method for distributed cooperative communication based on block chain storage is proposed, in which a data forwarding amount of an edge user and a forwarding rate of a non-edge user are preferentially considered to match an information source-relay pair, so that both an information source and a relay obtain higher performance benefits. However, the influence of the terminal power, the channel and other factors is not considered in the process of matching the source-relay pair, the transmission model is different from the invention, and the purpose of using the relay is not to save energy.
According to the cell relay cooperative communication method based on the block chain intelligent contract, provided by the invention, in relay selection during cooperative communication of the information source, a relay which enables the energy consumption cost of the terminal to be minimum is selected based on an optimal sending power and pricing algorithm, and factors such as a channel and the electric quantity of the terminal are comprehensively considered, so that the energy loss of the terminal is reduced. And the MT with the highest credit value is used for accounting, and a consensus mode that all nodes participate in verification is adopted, so that the waste of computing resources and energy caused by competition of all members in the traditional workload proving mechanism is avoided. The safety level of data transmission is improved, and the participation of the terminal in cooperative communication is promoted. According to the relay cooperative communication method provided by the invention, an intelligent contract is introduced into the storage space of a single terminal node, and new contents of the MT credit value table are added into the block structure, so that the relay cooperative communication process is deployed, the terminal is promoted to participate in cooperative communication in a public and transparent manner, and the calculation and storage resources of the terminal node are consumed. The application of the technology to cooperative communication is an immature process in an experimental stage, and the completeness of the technology is yet to be further verified in practice. The relay cooperative communication method comprises the following specific steps:
(1) initializing a relay cooperative communication system: setting a mobile terminal MT which is newly added into a network in each period of time in the cellular network, wherein information related to a block of the network is not stored in the mobile terminal MT before;
the mobile terminal MT participating in the intelligent contract becomes a legal MT node after the registration of the trusted wireless access point, and the node MTjIncluding wallet address WjCredit value REPjElectronic money pij(ii) a Back node MTjSending request information for joining block chain to surrounding nodes, wireless access point and other terminal nodes in cellAnd replying the node after receiving, wherein the reply information comprises the latest block information, and the node stores the block information into the local node after receiving.
(2) Relay selection when information sources carry out cooperative communication: information source s broadcasts cooperation request information, idle nodes meeting conditions reply information to the information source s, and s selects proper relay r according to the total energy consumption cost valuejI.e. solving the optimization problem (5) and then informing the selected relay and wireless access point. The method comprises the following specific steps:
A1) the information source s broadcasts cooperation request information, and the cooperation request information comprises the address of the wallet, the size of data to be sent and the current electric quantity of the information source s;
A2) the idle node meeting the condition replies a message to the s;
for each free node rjAnd J belongs to {1, 2.,. J }, firstly, screening relay nodes with lower credit values in the network, and solving the optimal p for each screened relay nodes,
πj,UjThat is, the optimal p is obtained by solving the optimization problem (7) by using the optimal sending power and pricing algorithms,
And corresponding pijAnd Uj；
If (7) has no solution, then all rjThe message is not replied to s, and s is converted into a direct sending mode;
if (7) has a solution and the amount of money remaining in the wallet is sufficient to pay the transaction price pijFree node rjReplying information to information source s to indicate that s is agreed to be relayed, wherein the replying information comprises ps,
And corresponding pijAnd Uj；
Here, the optimal transmit power and pricing algorithm solving the optimization problem (7) comprises the steps of:
A21) initialization
A22) Let i equal 1,2,3, 10, go through a cycle, the specific steps in each cycle are as follows:
order to
Calculate the correspondence of each i
Therein
Substituting formula (3) and formula (4) into condition C in formula (7)1Elimination of primordial qi psGet eta 22Q-1；
A23) After the circulation is finished, calculating UjAt the smallest
Namely, it is
And calculate correspondences
A24) Judgment Condition C2C3C4Whether or not:
if satisfied, the optimal solution is ps,
As a result of (1), the transaction at that time is priced as
The total energy consumption has a cost value of
If all rjIf none of the solutions is satisfied, (7) no solution is obtained;
A3) s after receiving all the reply messages of the idle nodes, selecting UjMinimum relaying, i.e. further seeking for all relays
Notifying the selected relay and wireless access point.
(3) Collaborative transmission and electronic money transactions: electronic money pi in s-walletjIs locked, relayed rjThe cooperation s forwards data, and the wireless access point d verifies the integrity of the received data and returns information to s and rjAfter that the electronic money locked in s is pijWill be directly transferred into rjThe wallet.
(4) Block generation and consensus process: after each transaction, all nodes update the credit value REP according to the node credit value expression (6)jAnd broadcasting the transaction records and node credit values, wherein the MT node with the largest credit value is responsible for accounting, namely generating the block;
when the MT node with the largest credit value is in billing, generating an account book and a credit value table, writing the information into a block, and performing whole-network broadcast verification; and adding the checked block into the block chain by a new chain, and informing all nodes of saving the block chain by the wireless access point.
In this embodiment, the noise variances of the respective links are assumed to be the same, and are taken
Channel hsd,
Satisfy the circularly symmetrical height recoveryIs a distribution of Si, and
wherein
gsdIs a channel fading characteristic and satisfies
The path loss exponent v is 4, in the example the number of relays is 10 (the number of terminal nodes is 12, the relay selects the two relay users with the lowest credit before screening out), and for each relay, the reference distance values from source to relay and from relay to wireless access point are different, where the average value of the reference distance from source to relay is given
Reference distance average of relay to wireless access point
And the reference distance value from the source to the wireless access point is dsd1.2 m. Wherein alpha issd＝|hsd|2/σ2,
Representing source s to relay r separatelyjRelay rjThe ratio of the squared channel modulus to the noise variance to the sink d, the source s to the sink d. Relay reservation gain epsilonj0.2. Maximum battery level Bmax4J, maximum cost value ximaxMaximum transmission power P of 1maxAnd the bandwidth rate Q is 0.5bps/Hz, which is 0.5 w.
The method comprises the following steps: and initializing the relay cooperative communication system. The terminal node MT newly joining the network becomes a legal MT node after the trusted wireless access point is registered and registeredjIncluding a wallet floorAddress WjCredit value REPjElectronic money pij(ii) a Back node MTjAnd sending request information for joining the block chain to surrounding nodes, replying the node after the wireless access point and other terminal nodes in the cell receive the request information, wherein the replying information comprises the latest block information, and storing the block information into the local node after the node receives the reply information.
Step two: relay selection when information sources carry out cooperative communication: information source s broadcasts cooperation request information, idle nodes meeting conditions reply information to the information source s, and s selects proper relay r according to the total energy consumption cost valuejI.e. solving the optimization problem (5) and then informing the selected relay and wireless access point.
Step three: collaborative transmission and electronic money transactions: electronic money pi in s-walletjIs locked, relayed rjThe cooperation s forwards data, and the wireless access point d verifies the integrity of the received data and returns information to s and rjAfter that the electronic money locked in s is pijWill be directly transferred into rjThe wallet.
Step four: block generation and consensus process: after each transaction, all nodes update the credit value REP according to the node credit value expression (6)jAnd broadcasting the transaction records and node credit values, wherein the MT node with the largest credit value is responsible for accounting, namely generating the block;
when the MT node with the largest credit value is in billing, generating an account book and a credit value table, writing the information into a block, and performing whole-network broadcast verification; and adding the checked block into the block chain by a new chain, and informing all nodes of saving the block chain by the wireless access point.
Fig. 3 shows a diagram of a cooperative communication model of a single cell. The process of relaying cooperative communication is completed in two time slots. In the first time slot, information source s broadcasts and sends information, relay rjAnd the wireless access point d receives the data. In the second time slot, the relay adopts an amplification forwarding AF mode, normalizes the data, multiplies the data by an amplification factor and forwards the data to the wireless access point d.
Fig. 4 shows a cell relay cooperative communication flow based on a block chain intelligent contractFigure (a). Mainly comprises the following steps (6). (1) The source s broadcasts a request message. (2) And the idle nodes meeting the conditions reply information to the s. (3) s picks the appropriate relay and informs the selected relay and wireless access point. (4) Relay rjThe collaboration s communicates. (5) s to rjPayment electronic currency pij. (6) Transaction and record information is posted to the blockchain.
Fig. 5 shows a storage space of a single node, and the storage space contains storage contents such as blocks and intelligent contracts.
Fig. 6 is a block configuration diagram in which (a) shows the configuration of a block, and contents of block authentication information such as current and next block IDs, time stamps, random numbers, transaction tickets, and MT credit tables are given. (b) A table of MT credits in the block structure is shown.
Fig. 7-10 show the variation of energy consumption cost of various schemes with corresponding independent variables, wherein the maximum minimum scheme and the harmonic mean scheme are respectively the schemes for relay selection by adopting the minimum criterion and the harmonic mean criterion, and the BC-optimal relay scheme (BC represents a block chain) is the relay cooperative communication method of the cell based on the intelligent contract of the block chain provided by the invention.
Fig. 7 shows the variation of the energy consumption cost of the six schemes as the number of relays in the cooperative communication scenario increases when the source power amount is 2J and the relay power amount is 2J. As can be seen from the figure, since the direct transmission scheme does not use relays to forward data, its energy consumption cost does not change as the number of relays changes. The fixed relay scheme uses the same relay for data forwarding each time, and the energy consumption cost is also fixed and constant along with the change of the relay number. The random relay scheme selects different relays each time, so that the energy consumption cost of the random relay scheme changes with the number of the relays and has no obvious change trend, and the energy consumption cost of the maximum and minimum scheme and the harmonic mean scheme is in a descending trend with the increase of the number of the relays. Due to the fact that the two schemes consider the channel gains of the first time slot and the second time slot of the cooperative transmission, the channel fading is relatively small. The BC-optimal relay scheme has the lowest energy consumption cost, and the energy consumption cost decreases as the number of relays increases. In addition, the difference value of the energy consumption cost of the BC-optimal relay scheme and the maximum and minimum scheme and the harmonic average scheme is larger and larger with the increase of the relay number, which shows that the BC-optimal relay scheme has more obvious effect of saving energy consumption with the increase of the relay number.
Fig. 8 shows the variation of these six schemes with increasing bandwidth rate and energy consumption cost. It is clear that these schemes have an increasing cost of energy consumption as the bandwidth rate increases. The energy consumption cost of direct transmission is far higher than that of other schemes, and the energy consumption cost of the four schemes, namely a fixed relay scheme, a random relay scheme, a maximum and minimum scheme and a harmonic mean scheme, is higher than that of a BC-optimal relay scheme when the bandwidth rate is not up to 1 bps/Hz. When the bandwidth rate reaches 1bps/Hz, the influence of the bandwidth rate on the energy consumption is much higher than other factors such as channel gain, electric quantity and the like. The difference in energy consumption costs for these several schemes will gradually decrease. It can also be seen from the above equation (5). The BC-optimal relay scheme shows the advantage of energy consumption saving compared with other schemes under the low bandwidth rate.
Fig. 9 shows the variation of the energy consumption cost of the six schemes as the power of the source increases when the relay power takes 2J. It is clear that the energy consumption cost of these schemes decreases as the source power increases. The direct transmission scheme is similar to fig. 7 and 8, and the energy consumption cost is always far higher than that of other schemes. In the remaining five schemes, the fixed relay scheme and the random relay scheme are higher than the energy consumption costs of the maximum and minimum scheme, the harmonic mean scheme and the BC-optimal relay scheme, and have large difference. The energy consumption cost of the BC-optimal relay scheme is the lowest in terms of the maximum-minimum scheme, the harmonic-mean scheme, and the BC-optimal relay scheme, and it can be seen that the difference of the energy consumption costs of the three schemes is larger in the case where the battery level is lower. The BC-optimal relay scheme plays a more significant role in reducing the energy consumption cost in the network under the condition that the power of the information source is lower.
FIG. 10 shows several of these schemesThe variation of the consumption cost with the maximum transmission power, the condition C in equation (5) given by the specification3It can be seen that the energy consumption cost of direct transmission has no direct relationship with the maximum transmission power, and therefore does not change with the change of the maximum transmission power, while the energy consumption cost curve of the fixed relay scheme and the random relay scheme changes with the change of the maximum transmission power, the energy consumption cost curve has an obvious ascending amplitude, and the energy consumption cost of the maximum and minimum schemes and the harmonic average scheme is similar to that of the BC-optimal relay scheme, but carefully analyzing the energy consumption cost of the BC-optimal relay scheme is slightly lower than that of the BC-optimal relay scheme. From the simulation results, it is concluded that the energy consumption cost of the BC-optimal relay scheme is always lower than that of other schemes in the comparison of the selected four angles.
In the simulation results of the credit values of the users in fig. 11(a) and 11(b), it is shown that the higher the credit value, the more the user obtains the accounting times, and when tampering information occurs, the credit value is greatly reduced, and the chance of being an accounting node is lost. Nor will they receive an electronic monetary reward from the system. The scheme provided by the invention can save energy and improve the safety of the system.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are merely illustrative of the principles of the invention, but that various changes and modifications may be made without departing from the spirit and scope of the invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (4)
1. A cell relay cooperative communication method based on block chain intelligent contracts is characterized in that a wireless access point is located in the center of a cell and is recorded as an information sink d, a mobile terminal MT with an uplink transmission requirement is recorded as an information source s, J idle terminal nodes are used as relays and are respectively recorded as rj(J ∈ {1, 2.., J }); when the electric quantity of the information source s is low or the quality of an uplink channel is poor, the information source s utilizes idleThe terminal node forwards data for the terminal node; after the data are completely forwarded to the wireless access point, the information source s pays the electronic money to the relay; transaction information of electronic money and credit values of terminal nodes are written into blocks, and block information is stored in each node of the network, so that the terminals are stimulated to participate in cooperation, cheat of the terminals is prevented, and a trust basis of cooperation among the terminal nodes is established transparently; the whole process of cooperative communication is written into an intelligent contract of the blockchain and automatically executed, wherein the intelligent contract is an electronic protocol, namely a program automatically executed when a trigger condition is met, the contract comprises rights and obligations of each node, and the rights and obligations are stored in each node of the blockchain network in an electronic mode and automatically executed; it is characterized in that the preparation method is characterized in that,
the cell relay cooperative communication method based on the block chain intelligent contract comprises the following steps:
11) establishing a relay cooperative communication system model: establishing a system model of relay cooperative communication based on a block chain intelligent contract; the method for establishing the relay cooperative communication system model comprises the following steps:
121) setting information source s to broadcast and transmit information, relay rjAnd the wireless access point d receives data;
122) relay rjIf the mode of amplifying and forwarding AF is adopted, the data is multiplied by an amplification factor after being normalized, and then the data is forwarded to the reachable rate of the wireless access point d, d
Is defined as:
if the information source does not use the relay to forward the data, the data is transmitted to the wireless access point d by adopting the mode of direct transmission DTDTIs defined as:
QDT＝log2(1+γsd)； (2)
wherein, γsd、
Respectively representing the signal-to-noise ratio of a signal directly sent to a wireless access point d by a signal source s and the signal-to-noise ratio of a cooperative branch for forwarding data by the aid of a relay; the expression is as follows:
γsd＝αsdps， (3)
wherein the content of the first and second substances,
representing source s to relay r separatelyjRelay rjThe ratio of the square of the channel modulus to the sink d, the source s to the sink d, and the noise variance;
ps,
representing source s and relay rjThe transmit power of (a);
123) definition of Source s and Relay rjThe energy consumption cost and the minimum optimization problem of (a) are expressed as follows:
wherein, UjRepresents the sum of the energy consumption costs of the source and the relay,
cost xi representing unit energy of source s batterysAnd the current battery power BsXi relation ofmaxRepresents the maximum cost value, BmaxRepresents a maximum battery charge;
for relay rjIs provided with
In which ξrjRepresents the cost per unit energy of the relay battery,
indicating the current battery power of the relay;
optimization Condition C1The equation shows that the achievable rate is equal to the expected value Q when the relay is used for cooperative transmission, and the equation is expressed by the formula (1)
Simplifying and obtaining;
condition C2Indicates that the relay r is satisfiedjThe expected benefit is not less than epsilonj，εjNot less than 0 is a fixed value, pijRepresents a relay rjWhen the information source s is helped to carry out cooperative transmission, the information source s needs to transmit to the relay rjThe electronic money to be paid is,
representing the energy consumption cost of the relay,
represents a relay rjThe overall profit of (c);
condition C3Indicating source s selects relay rjIs conditioned by the sources is less costly in cooperative communication than energy consumption in direct transmission to the desired rate, where ξspsRepresents the energy consumption cost of the source s, and pij+ξspsRepresenting the total expenditure of the source s in cooperative communication;
the expression on the right side of the inequality is Q expressed by the formula (2)DTQ is derived
Then multiplied by a cost value xisObtaining, which represents the energy consumption cost of the information source s during direct transmission;
condition C4Denotes a maximum limit of transmission power, where pmaxRepresents the maximum transmit power;
124) the expression defining the credit value of the MT node is as follows:
wherein, REPi,j、REPi-1,jRespectively representing the credit value of the current evaluation and the credit value of the last evaluation of the corresponding node,
represents the energy consumption cost of the relay in the whole cooperative transmission
As source s and relay rjThe sum of energy consumption costs of;
Ud＝ξs*(2Q-1)/αsdthe energy consumption cost paid by the information source s during direct transmission is represented, the coefficient 0.5 represents the weight occupied by each part, the lambda represents the frequency of node tampering information, and the credit value of the node serving as relay forwarding data is deducted by 1 when the information is tampered;
12) and carrying out relay cooperative communication: and on the basis of the relay cooperative communication model, carrying out relay cooperative communication based on a block chain intelligent contract.
2. The method of claim 1, wherein the performing relay cooperative communication comprises:
21) initializing a relay cooperative communication system: setting a mobile terminal MT which is newly added into a network in each period of time in the cellular network, wherein information related to a block of the network is not stored in the mobile terminal MT before;
the mobile terminal MT participating in the intelligent contract becomes a legal MT node after the registration of the trusted wireless access point, and the node MTjIncluding wallet address WjCredit value REPjElectronic money pij(ii) a Back node MTjSending request information for adding a block chain to surrounding nodes, replying the nodes after being received by a wireless access point and other terminal nodes in a cell, wherein the replying information comprises latest block information, and the block information is stored in a local node after being received by the nodes;
22) relay selection when information sources carry out cooperative communication: information source s broadcasts cooperation request information, idle nodes meeting conditions reply information to the information source s, and s selects proper relay r according to the total energy consumption cost valuejI.e. solving the optimization problem (5) and then informing the selected relay and wireless access point;
23) collaborative transmission and electronic money transactions: electronic money pi in s-walletjIs locked, relayed rjThe cooperation s forwards data, and the wireless access point d verifies the integrity of the received data and returns information to s and rjAfter that the electronic money locked in s is pijWill be directly transferred into rjThe wallet of (1);
24) block generation and consensus process: after each transaction, all nodes update the credit value REP according to the node credit value expression (6)jAnd broadcasting the transaction records and node credit values, wherein the MT node with the largest credit value is responsible for accounting, namely generating the block;
when the MT node with the largest credit value is in billing, generating an account book and a credit value table, writing the information into a block, and performing whole-network broadcast verification; and adding the checked block into the block chain by a new chain, and informing all nodes of saving the block chain by the wireless access point.
3. The method of claim 2, wherein the relay selection for the source to perform cooperative communication comprises the following steps:
31) the information source s broadcasts cooperation request information, and the cooperation request information comprises the address of the wallet, the size of data to be sent and the current electric quantity of the information source s;
32) the idle node meeting the condition replies a message to the s;
for each free node rjAnd J belongs to {1, 2.,. J }, firstly, screening relay nodes with lower credit values in the network, and solving the optimal p for each screened relay nodes,
πj,UjThat is, the optimal p is obtained by solving the optimization problem (7) by using the optimal sending power and pricing algorithms,
And corresponding pijAnd Uj；
If (7) has no solution, then all rjThe message is not replied to s, and s is converted into a direct sending mode;
if (7) has a solution and the amount of money remaining in the wallet is sufficient to pay the transaction price pijFree node rjReplying information to information source s to indicate that s is agreed to be relayed, wherein the replying information comprises ps,
And corresponding pijAnd Uj；
33) s after receiving all the reply messages of the idle nodes, selecting UjMinimum relaying, i.e. further seeking for all relays
Notifying the selected relay and wireless access point.
4. The method of claim 3, wherein the optimal transmit power and pricing algorithm solving the optimization problem (7) comprises the following steps:
41) initialization
42) Let i equal 1,2,3, 10, go through a cycle, the specific steps in each cycle are as follows:
421) order to
422) Calculate the correspondence of each i
Substituting formula (3) and formula (4) into condition C in formula (7)1Elimination of primordial qi psGet eta 22Q-1；
43) After the circulation is finished, calculating UjAt the smallest
Namely, it is
And calculate correspondences
44) Judgment Condition C2C3C4Whether or not:
if satisfied, the optimal solution is ps,
As a result of (1), the transaction at that time is priced as
The total energy consumption has a cost value of
If all rjIf none of them is satisfied, (7) no solution is obtained.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011439311.XA CN112566211B (en) | 2020-12-11 | 2020-12-11 | Cell relay cooperative communication method based on block chain intelligent contract |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011439311.XA CN112566211B (en) | 2020-12-11 | 2020-12-11 | Cell relay cooperative communication method based on block chain intelligent contract |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112566211A CN112566211A (en) | 2021-03-26 |
| CN112566211B true CN112566211B (en) | 2022-04-15 |
Family
ID=75060563
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011439311.XA Active CN112566211B (en) | 2020-12-11 | 2020-12-11 | Cell relay cooperative communication method based on block chain intelligent contract |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112566211B (en) |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101572654B (en) * | 2008-04-30 | 2012-02-29 | 华为技术有限公司 | Method and equipment for resource allocation |
| CN102238685B (en) * | 2010-05-06 | 2014-08-20 | 华为技术有限公司 | Method and equipment for relay node selection and power distribution in wireless relay network |
| EP2995009A1 (en) * | 2013-05-08 | 2016-03-16 | Sabanci Üniversitesi | Cooperative mac protocol with relay selection and power control |
| CN106304239A (en) * | 2016-08-12 | 2017-01-04 | 梁广俊 | The relay selection method of energy acquisition multi-relay cooperation communication system |
| CN106877919B (en) * | 2017-01-03 | 2020-06-09 | 华侨大学 | Relay safety communication method for power distribution energy collection based on optimal user selection |
| US11924322B2 (en) * | 2017-05-16 | 2024-03-05 | Arm Ltd. | Blockchain for securing and/or managing IoT network-type infrastructure |
| GB201807835D0 (en) * | 2018-05-15 | 2018-06-27 | Nchain Holdings Ltd | Computer-implemented system and method |
| CN109905863B (en) * | 2019-02-27 | 2021-06-04 | 电子科技大学 | Relay access method of distributed cooperative communication based on block chain storage |
| CN110650189B (en) * | 2019-09-20 | 2022-01-18 | 深圳供电局有限公司 | Relay-based block chain interaction system and method |
| CN111277410B (en) * | 2020-01-19 | 2023-06-06 | 江苏恒宝智能系统技术有限公司 | Enhanced blockchain key construction method |
| CN111915432A (en) * | 2020-03-27 | 2020-11-10 | 武汉大学 | Relay excitation method based on non-cost transaction output block chain network |
-
2020
- 2020-12-11 CN CN202011439311.XA patent/CN112566211B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112566211A (en) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Anderegg et al. | Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents | |
| CN107730384A (en) | Art sales method and server, server end and system based on block chain | |
| CN108470276A (en) | A kind of block chain common recognition method using agency's book keeping operation | |
| CN109978623B (en) | Vehicle networking information sharing excitation method based on block chain | |
| WO2020108147A1 (en) | Blockchain-based shared resource rental method and apparatus, and computer device | |
| CN110928951A (en) | Data sharing and arbitration method based on block chain | |
| CN109194472A (en) | Game block chain common recognition method based on bilinear map and set signature algorithm | |
| CN111526027A (en) | Group management method, device and equipment for instant messaging application and readable medium | |
| CN109472699A (en) | Automation artificial intelligence data sharing method and device on the basis of block chain | |
| CN112053271B (en) | Public service platform data evidence management method and system based on block chain | |
| CN112907082A (en) | Block chain consensus algorithm evaluation optimization method | |
| CN111582864A (en) | Block chain data volume certification consensus protocol | |
| CN113448694B (en) | Block chain consensus method for improving transaction processing capability | |
| CN112566211B (en) | Cell relay cooperative communication method based on block chain intelligent contract | |
| CN113034703B (en) | Parking space sharing method based on alliance chain mechanism | |
| CN113362067B (en) | Asynchronous consensus-based electric power transaction matching method and system | |
| CN112565370B (en) | Method and system for verifying calculation result based on wireless communication and block chain scene | |
| CN110276695A (en) | Method, apparatus, calculating equipment and the computer readable storage medium that project is deducted fees | |
| Zeng et al. | How mobile contributors will interact with each other in mobile crowdsourcing with word of mouth mode | |
| Huang et al. | Incentive assignment in hybrid consensus blockchain systems in pervasive edge environments | |
| CN112700241A (en) | Block chain resource relation matching method based on bilateral auction algorithm | |
| Liu et al. | A novel game based incentive strategy for opportunistic networks | |
| CN108391257A (en) | Resource allocation methods based on Game Theory under a kind of community network D2D scenes | |
| Ramamoorthy et al. | A Power Auction Approach For Non-Orthogonal Multiple Access Wireless Relay Communications | |
| WO2021232955A1 (en) | Smart electricity meter having blockchain function support |
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 |