Data transmission method, device, equipment and storage medium

Abstract

The embodiments of the present disclosure provide a data transmission method, device, equipment and storage medium, and relate to the field of wireless communication technology. In some embodiments of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted; a collaboration request is broadcast through a blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; receive the respective node information returned by multiple candidate relay nodes; select a target relay node from multiple candidate relay nodes according to the respective node information of multiple candidate relay nodes; send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract; the present disclosure selects a suitable target relay node for communication according to the node information of the candidate relay node, and improves the data transmission efficiency in the relay collaborative communication process.

Description

Technical Field

[0001] The present disclosure relates to the field of wireless communication technology, and in particular to a data transmission method, device, equipment and storage medium. Background Art

[0002] With the continuous growth of wireless network connections such as smart cars and smart homes, end users have an increasing demand for high-speed and large-capacity communications, especially in uplink transmission and D2D (Device-to-Device) scenarios. Existing studies have shown that through relay collaboration, the transmission rate can be effectively improved, energy consumption can be reduced, and the goal of green and efficient communication can be achieved.

[0003] At present, in the process of data transmission using relay cooperation, when the mobile terminal transmission power is insufficient or the transmission distance is long, a high data transmission rate cannot be obtained. Summary of the invention

[0004] The present disclosure provides a data transmission method, apparatus, device and storage medium to at least solve the problem of low data transmission rate in the existing relay cooperative communication process.

[0005] The technical solution of the present disclosure is as follows:

[0006] The present disclosure provides a data transmission method, including:

[0007] Determine the number of transmission time slots according to the current amount of data to be transmitted;

[0008] Broadcasting a collaboration request through a blockchain network, wherein the collaboration request carries the transmission time slot number, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request;

[0009] Receiving respective node information returned by the plurality of candidate relay nodes;

[0010] Selecting a target relay node from the plurality of candidate relay nodes according to the node information of each of the plurality of candidate relay nodes;

[0011] A data transmission request is sent to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

[0012] The present disclosure also provides a data transmission method, including:

[0013] After monitoring the collaboration request sent by the source node through the blockchain network, the node information of the relay node is sent to the source node, so that the source node can select a target relay node from the multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the transmission time slot number, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes;

[0014] receiving a data transmission request sent by the source node;

[0015] According to the data transmission request, collaborative data transmission is performed to the destination node in accordance with the blockchain smart contract.

[0016] The present disclosure also provides a data transmission device, including:

[0017] A determination module, used to determine the number of transmission time slots according to the current amount of data to be transmitted;

[0018] A broadcast module, used to broadcast a collaboration request through a blockchain network, wherein the collaboration request carries the transmission time slot number, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request;

[0019] A receiving module, configured to receive respective node information returned by the plurality of candidate relay nodes;

[0020] A selection module, configured to select a target relay node from a plurality of the candidate relay nodes according to respective node information of the plurality of the candidate relay nodes;

[0021] The sending module is used to send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

[0022] The present disclosure also provides a data transmission device, including:

[0023] A request monitoring module, configured to send the node information of the relay node to the source node after monitoring the collaboration request sent by the source node through the blockchain network, so that the source node can select a target relay node from the multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the transmission time slot number, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes;

[0024] A request receiving module, used for receiving a data transmission request sent by the source node;

[0025] The data transmission module is used to perform collaborative data transmission to the destination node according to the data transmission request and the blockchain smart contract.

[0026] The present disclosure also provides an electronic device, including:

[0027] processor;

[0028] a memory for storing instructions executable by the processor;

[0029] The processor is configured to execute the instructions to implement each step in the above method.

[0030] The embodiment of the present disclosure further provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, each step in the above method is implemented.

[0031] The embodiment of the present disclosure further provides a computer program product, including a computer program / instruction, which implements each step of the above method when executed by a processor.

[0032] The technical solution provided by the embodiments of the present disclosure brings at least the following beneficial effects:

[0033] In some embodiments of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted; a collaboration request is broadcast through the blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; the respective node information returned by the multiple candidate relay nodes is received; a target relay node is selected from the multiple candidate relay nodes according to the respective node information of the multiple candidate relay nodes; a data transmission request is sent to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node in accordance with the blockchain smart contract; the present disclosure selects a suitable target relay node for communication based on the node information of the candidate relay nodes, thereby improving the data transmission efficiency during relay collaborative communication.

[0034] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description are used to explain the principles of the present disclosure, and do not constitute improper limitations on the present disclosure.

[0036] Figure 1 A flowchart of a data transmission method provided for an exemplary embodiment of the present disclosure;

[0037] Figure 2 A flowchart of another data transmission method provided for an exemplary embodiment of the present disclosure;

[0038] Figure 3 A schematic diagram of an amplification and forwarding model provided for an exemplary embodiment of the present disclosure;

[0039] Figure 4 A schematic diagram of a relay cooperative transmission model provided for an exemplary embodiment of the present disclosure;

[0040] Figure 5 A schematic diagram of the structure of a data transmission device provided for an exemplary embodiment of the present disclosure;

[0041] Figure 6 A schematic diagram of the structure of a data transmission device provided for an exemplary embodiment of the present disclosure;

[0042] Figure 7 A schematic diagram of the structure of an electronic device provided for an exemplary embodiment of the present disclosure;

[0043] Figure 8 A schematic structural diagram of another electronic device provided by an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0044] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.

[0045] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure.

[0046] It should be noted that the user information involved in this disclosure includes but is not limited to: user device information and user personal information; the collection, storage, use, processing, transmission, provision and disclosure of user information in this disclosure comply with the relevant laws and regulations and do not violate public order and good morals.

[0047] In the era of the Internet of Everything, with the continuous growth of the number of terminal connections such as smart cars and smart homes, the demand for high-speed, large-capacity, and low-latency communications is becoming stronger and stronger. Through relay cooperative communication between terminal nodes, the transmission rate can be effectively improved to achieve the goals of energy conservation, emission reduction, and green communication. However, the terminals acting as relay nodes need to pay the price of energy consumption during the cooperative communication process, and the trust relationship between distributed terminals is weak. How to ensure the effectiveness, reliability, and security of relay network cooperative communication and motivate terminals to participate in cooperation through economic means has become an urgent problem to be solved.

[0048] As a decentralized distributed ledger database, blockchain overcomes the trust problem of value transfer and is widely used in scenarios such as commodity traceability, bill storage, and financial settlement. Therefore, with the help of blockchain storage technology, the enthusiasm of terminals to participate in collaborative communication can be mobilized, thereby improving the data transmission rate.

[0049] At present, in the process of data transmission using relay cooperation, when the mobile terminal transmission power is insufficient or the transmission distance is long, a high data transmission rate cannot be obtained.

[0050] In response to the above technical problems, in some embodiments of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted; a collaboration request is broadcast through the blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; the respective node information returned by multiple candidate relay nodes is received; based on the respective node information of the multiple candidate relay nodes, a target relay node is selected from the multiple candidate relay nodes; a data transmission request is sent to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node in accordance with the blockchain smart contract; the present disclosure selects a suitable target relay node for communication based on the node information of the candidate relay node, thereby improving the data transmission efficiency during relay collaborative communication.

[0051] The technical solutions provided by various embodiments of the present disclosure are described in detail below in conjunction with the accompanying drawings.

[0052] From the source node perspective, Figure 1 The flowchart of a data transmission method provided by the exemplary embodiment of the present disclosure is as follows. Figure 1 As shown, the method includes:

[0053] S101: Determine the number of transmission time slots according to the current amount of data to be transmitted;

[0054] S102: Broadcasting a collaboration request through the blockchain network, wherein the collaboration request carries a transmission time slot number, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request;

[0055] S103: receiving node information returned by multiple candidate relay nodes;

[0056] S104: selecting a target relay node from the multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes;

[0057] S105: Send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

[0058] From the perspective of relay nodes, Figure 2 FIG. 1 is a flow chart of another data transmission method provided by an exemplary embodiment of the present disclosure. Figure 2 As shown, the method includes:

[0059] S201: after monitoring the collaboration request sent by the source node through the blockchain network, the node information of the relay node is sent to the source node, so that the source node can select a target relay node from multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the number of transmission time slots, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes;

[0060] S202: receiving a data transmission request sent by a source node;

[0061] S203: Based on the data transmission request, collaborative data transmission is performed to the destination node according to the blockchain smart contract.

[0062] In this embodiment, the source node sends the data to be transmitted to the destination node through the cooperation of the relay node, or sends the data to be transmitted directly to the destination node.

[0063] In this embodiment, the source node is a terminal with data transmission requirements.

[0064] In this embodiment, the candidate relay node may be a base station or other mobile terminals.

[0065] In this embodiment, the destination node may be a base station or other mobile terminals. The former corresponds to the uplink transmission mode, and the latter corresponds to the D2D communication mode.

[0066] In order to understand the content of the present disclosure, some terms involved in the present disclosure are explained.

[0067] Direct transmission: A common communication scenario is point-to-point direct communication, which does not require the cooperation of relay nodes. According to Shannon's theorem, the maximum transmission rate is:

[0068] C=B log 2 (1+Pγ)

[0069] Among them, B, P, and γ are channel bandwidth, transmission power, and channel gain-to-noise ratio, respectively. Generally, the longer the transmission distance, the smaller γ is. It can be seen that when the mobile terminal transmits insufficient power or the transmission distance is far, high data transmission rate cannot be achieved.

[0070] Relay cooperative communication, relay cooperative communication can effectively improve network performance by obtaining cooperative diversity gain in wireless networks. The basic idea of ​​cooperative relay network is to use some nodes in the network for relay transmission, and to achieve effective transmission of source node information through reasonable allocation of relay node resources. The source node broadcasts or multicasts its information to potential cooperative nodes, and the cooperative node acts as a relay to forward the received information to the destination node again. The composite signal received by the destination node includes the direct signal of the source node and the relay forwarding signal. This relay forwarding strategy can effectively utilize the spatial diversity of independent relay channels in the network, thereby effectively enhancing the receiving signal-to-noise ratio of the destination node, achieving the purpose of improving the communication quality of the wireless link, and thus improving the overall network performance.

[0071] The present disclosure supports terminals with cooperation requirements to match relay nodes to transmit data to base stations or other terminals, which are not limited to edge cellular users or users with low battery. The optimal cooperation mode is dynamically selected according to the relay network channel environment and node conditions to ensure a higher transmission rate and improve spectrum efficiency.

[0072] Relay forwarding methods include but are not limited to the following:

[0073] 1. Amplify and forward method.

[0074] Figure 3 A schematic diagram of an amplification and forwarding model provided by an exemplary embodiment of the present disclosure. Figure 3 As shown in Figure 1, the amplify-and-forward protocol is the simplest cooperative diversity protocol. The relay cooperative node receives the signal sent by the source node via the fading channel, then amplifies the signal with added noise, and retransmits it to the destination node. The destination receives and combines the signals from the source node and the cooperative node in a certain way (such as maximum ratio combining, equal gain combining, selective combining, and switching combining), and finally makes a decision on each bit of information sent.

[0075] 2. Decoding and forwarding method

[0076] The source node broadcasts its own signal to the relay cooperation node and the destination node at the same time. The cooperation node attempts to decode the received signal from the source node and then sends the re-encoded signal to the destination node. The destination node receives two independently faded signal samples, combines them in a certain way, and makes a final decoding decision on the combined signal. The decode-and-forward protocol can avoid the amplification of noise by the amplification-and-forward protocol. However, the cooperation node may make errors when decoding, and forwarding to the destination node causes the errors to accumulate, resulting in the destination node making an erroneous decision.

[0077] 3. Other forwarding methods: coding collaboration, compression forwarding, physical layer network coding, etc.

[0078] Resource allocation optimization problem. The optimal allocation of wireless resources in a cooperative relay system can effectively improve the overall performance of the system and is one of the key issues in the study of cooperative relay networks. Resource optimization allocation is generally based on the condition that the total resources of the entire network are certain or that a single user node is certain in time. For the power allocation problem of a single relay network, the utility function is mainly to maximize the transmission rate, minimize the transmission power, or minimize the interruption probability.

[0079] Node working mode, each node in the relay network is usually in half-duplex working state, that is, it cannot send and receive information at the same time. In order to avoid interference between the information transmission between the source node and the relay node, cooperative communication usually orthogonalizes the information transmission between the source node and the relay node, that is, uses channel resource allocation methods to avoid interference, including time division multiple access (TDMA), frequency division multiple access (FDMA) and code division multiple access (CDMA).

[0080] In this embodiment, the source node determines the number of transmission time slots based on the current amount of data to be transmitted; the source node broadcasts a collaboration request through the blockchain network, wherein the collaboration request carries the number of transmission time slots, and after listening to the collaboration request, multiple candidate relay nodes return their respective node information to the source node; the source node receives the respective node information returned by the multiple candidate relay nodes, and selects a target relay node from the multiple candidate relay nodes based on the respective node information of the multiple candidate relay nodes; the source node sends a data transmission request to the target relay node, and after the target relay node receives the data transmission request sent by the source node, the target relay node performs collaborative data transmission to the destination node in accordance with the blockchain smart contract.

[0081] It should be noted that the collaboration request includes but is not limited to the following: number of transmission time slots, location information, destination node information, willingness to share transmission among multiple nodes, maximum payable cost, and signature information. Data transmission requests include but are not limited to the following: maximum transmission power, quotation information, willingness to share transmission among multiple nodes, and signature information.

[0082] Figure 4A schematic diagram of a relay cooperative transmission model provided by an exemplary embodiment of the present disclosure. Figure 4 As shown in the figure, a single-cell cellular network is considered. The base station is located in the center of the cell. The mobile terminal with high-speed data transmission requirements is denoted as the source node s. The data receiving destination node is denoted as d, which can be a base station or other mobile terminal. K idle terminals that can serve as relay forwarding nodes are represented as R = {R 1 ,R 2 ,…,R K}, the working mode is time division duplex, and the forwarding protocols include amplification forwarding and decoding forwarding.

[0083] Relay cooperative transmission is divided into two stages. In the first stage, the source node transmits information to the relay node and the destination node. In the second stage, the relay node processes the received information and forwards it to the destination node.

[0084] In some embodiments of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted. One achievable method is to determine the number of transmission time slots according to the channel coherence time of the transmission link between the source node and each candidate relay node, the channel coherence time of the transmission link between each candidate relay node and the destination node, and the duration of a single time slot relay cooperation.

[0085] Specifically, in a typical wireless communication scenario, the source node, relay node, and destination node usually have relative motion, which causes the propagation path to change, that is, the wireless channel exhibits time-varying properties. Channel coherence time is an important parameter used to describe the time-varying characteristics of the channel. Within the coherence time, the fading experienced by the signal has a large correlation, indicating that the channel response has not changed significantly.

[0086] The following transmission rate maximization algorithm is highly dependent on channel state information, which changes with the mutual movement between nodes. The maximum number of continuous time slots for a single relay cooperative transmission is calculated as follows:

[0087]

[0088] in means round down, τ sr,k Represents the source node s and the kth relay node R k Channel coherence time of the transmission link, τ rd,k Represents the kth relay node R k The channel coherence time of the transmission link with the destination node d, τ represents the duration of a two-stage relay cooperation in a single time slot.

[0089] If the duration of a single collaboration is set to be long, the pricing result will deviate greatly from the actual situation; if the duration of a single collaboration is set to be short, it will bring about a large signaling overhead. Therefore, considering the real-time performance of channel tracking, the accuracy of pricing results and signaling overhead, the range of the number of time slots L for a single relay collaboration transmission is:

[0090] 1≤L≤L max .

[0091] In some embodiments of the present disclosure, in order to ensure the flexibility of collaborative transmission and the accuracy of wireless channel tracking, the source node is allowed to divide the transmission process into multiple time periods, each time period containing multiple time slots, during which the relay nodes and transmission mode participating in the collaboration remain unchanged, and the collaboration mode and relay nodes can be reselected in different time periods.

[0092] In some embodiments of the present disclosure, a target relay node is selected from a plurality of candidate relay nodes according to the node information of each of the plurality of candidate relay nodes. One achievable method is to select a target relay node, a transmission power of the target relay node, and a transmission cooperation mode of the target relay node from a plurality of candidate relay nodes with the maximization of the comprehensive transmission rate as the optimization goal under the premise of the total payment cost limit; when there is no solution to the optimization equation, the direct transmission mode is used; when there is a solution to the optimization equation, the target relay node, the transmission power of the target relay node, and the transmission cooperation mode of the target relay node are selected from a plurality of candidate relay nodes.

[0093] Specifically, taking a relay cooperative transmission as an example, including L time slots, the transmission power of the source node s is defined as P s , relay node R k The transmission power is P k , the channel gain from source node s to destination node d is h sd , source node s to relay node R k The channel gain is h sr,k , relay node R k The channel gain to the destination node d is h rd,k , the channel noise power is σ 2 , the transmission channel bandwidth is B, then the channel gain-to-noise ratio from source node s to destination node d is g sd =h sd / σ 2 , source node s to relay node R k The channel gain-to-noise ratio is g sr,k =h sr,k / σ 2 , relay node R k The channel gain-to-noise ratio to the destination node d is g rd,k =h rd,k / σ2 The corresponding transmission rates when the following collaborative modes are used for transmission are described below.

[0094] 1. Single-node amplification and forwarding collaborative mode.

[0095] Assume the selected relay node is R k ∈R, that is If the forwarding mode is AF, the comprehensive transmission rate is r 1 for

[0096]

[0097] where γ k Indicates that the source node s passes through the relay node R k The signal-to-noise ratio of the link forwarded to the destination node d is

[0098]

[0099] 2. Single-node decoding and forwarding collaborative mode.

[0100] Assume the selected relay node is R k ∈R, that is The forwarding mode is decode-forward cooperative mode, then the comprehensive transmission rate r 2 for

[0101]

[0102] 3. Multi-node amplification and forwarding collaborative mode.

[0103] Suppose the selected relay node number set is The forwarding mode is the amplification and forwarding cooperative mode. In order to reduce interference, each relay uses orthogonal multiple access mode for transmission in the second stage (such as frequency division multiple access FDMA, code division multiple access CDMA, etc.), then the comprehensive transmission rate r 3 for

[0104]

[0105] Among them, γ k Indicates that the source node s passes through the relay node R k The signal-to-noise ratio of the link forwarded to the destination node d is

[0106]

[0107] Under the premise of the total payment cost limit, the source node s selects the optimal cooperative transmission mode and relay node to maximize the comprehensive transmission rate, that is, to solve the following transmission rate maximization problem. The optimization equation is as follows:

[0108]

[0109] Among them, P s,max represents the maximum transmission power of the source node s, P k,max is the candidate relay node R k Maximum transmit power, ρ k is the candidate relay node R k The reputation value, ρ min is the minimum credit value allowed for collaboration, α is the cost per unit of data, and β k is the candidate relay node R k The cost per unit of energy, θ k is the candidate relay node R k The additional economic cost required to participate in this transmission, τ represents the duration of a single time slot relay cooperation, L represents the number of time slots that this relay cooperation transmission lasts, μ max is the maximum payment cost allowed by the source node s;

[0110] The first constraint C 1 Indicates that both the source node and the candidate relay node are power-constrained communication terminals, that is, the actual transmission power used cannot exceed its maximum transmission power; the second constraint C 2 Indicates that when cooperative transmission is used, the transmission rate should be higher than that of direct transmission; the third constraint C 3 The reputation value of the candidate relay node participating in the collaborative transmission should be higher than the threshold value ρ min ; The fourth constraint C 4 It means that under the mixed pricing method consisting of the amount of transmitted data, energy consumption, and additional economic cost, the total economic cost paid by the source node is less than or equal to the target cost threshold;

[0111] Solve the above optimization equations. If there is no solution to the system of equations, the direct transmission mode is used, that is, relay cooperation is not used; if there is a solution, the selected relay node number, forwarding method, transmission power and other information are notified to the corresponding relay node through the blockchain network for collaborative transmission.

[0112] In some embodiments of the present disclosure, the above transmission rate maximization algorithm can be solved by the following steps. One possible implementation method is to initialize input parameters, which include: the maximum transmission power P of the source node s,max , the maximum transmission power of the candidate relay node P k,max and reputation value ρ k , the channel gain-to-noise ratio g from source node s to destination node d sd , source node s to candidate relay node R k The channel gain-to-noise ratio of the candidate relay node R k The channel gain-to-noise ratio g to the destination node d rd,k, the minimum allowed reputation value for collaboration ρ min , the maximum economic cost μ that can be paid max , the relay node sequence number set that can use multi-node cooperative transmission is Initialize the candidate relay node sequence set ω={1,2,...,K}, the candidate relay node transmit power matrix Candidate relay node cooperative transmission rate matrix Among them, the candidate relay node transmit power matrix and candidate relay node cooperative transmission rate matrix The first row in represents the single-node amplification and forwarding cooperation mode, the second row represents the single-node decoding and forwarding cooperation mode, and the columns represent the candidate relay node numbers; let k = 1, 2, ..., K, for the candidate relay node R k Loop and calculate the candidate relay nodes R k The transmission power and cooperative transmission rate in the single-node amplification and forwarding cooperative mode and the single-node decoding and forwarding cooperative mode; according to the cooperative transmission rate, select the row and column numbers of the matrix where the maximum element is located, and determine the target cooperative mode; continue to find the node number with the largest cooperative transmission rate among the remaining candidate relay nodes, and update the cooperative transmission candidate relay node number set and transmission power; determine the target relay node number set participating in the cooperative transmission, and determine the target relay node's transmission power and the target relay node's transmission cooperative mode.

[0113] In the above embodiment, the candidate relay nodes R are calculated respectively. k Transmit power and cooperative transmission rate in single-node amplification and forwarding cooperative mode and single-node decoding and forwarding cooperative mode. One possible implementation method is to set According to the second constraint C 2 , solve for the minimum transmit power

[0114]

[0115] According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, if Then the maximum transmit power like If it is not true, the binary search method is used to determine the maximum allowable power

[0116] Determine the target transmit power of candidate relay nodes in single-node amplification and forwarding cooperative mode and the corresponding cooperative transmission rate

[0117]

[0118] In the single-node decoding and forwarding cooperation mode, Use the maximum transmission power P k,max Calculating the cooperative transmission rate In the second constraint C 2 If the condition is met, the minimum transmission power

[0119]

[0120] In the second constraint C 2 If this cannot be satisfied, According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, In this case, the maximum allowable power exist If this is not true, the binary search method is used to determine the maximum allowable power

[0121] Determine the target transmit power in single-node decode-and-forward cooperative mode and the corresponding cooperative transmission rate

[0122]

[0123] In the above embodiment, the row and column numbers of the matrix where the maximum element is located are selected according to the collaborative transmission rate to determine the target collaborative mode. One achievable method is to select the row and column numbers of the matrix where the maximum element is located according to the above collaborative transmission rate to determine the optimal target collaborative mode, that is,

[0124]

[0125] The selected relay node number set is like The algorithm terminates and adopts the direct transmission mode without relay cooperation; if Then determine the target relay node sequence number set participating in the cooperative transmission, as well as the target relay node's transmission power and the target relay node's transmission cooperative mode; otherwise, continue to search for the node sequence number with the largest cooperative transmission rate among the remaining candidate relay nodes.

[0126] In the above embodiment, the node number with the highest cooperative transmission rate among the remaining candidate relay nodes is continuously searched, and the cooperative transmission candidate relay node number set and transmission power are updated. One achievable method is to continuously search for the node number with the highest cooperative transmission rate among the remaining candidate relay nodes, that is,

[0127]

[0128] like Then determine the target relay node sequence number set participating in the cooperative transmission, as well as the target relay node transmission power and the target relay node transmission cooperation mode; otherwise, use the binary search method to solve the constraint condition C 4 Relay Node Maximum permissible transmit power p * .

[0129]

[0130] Then update the cooperative transmission relay node sequence number set and transmission power

[0131] Repeat the process to continue searching for the node number with the largest cooperative transmission rate among the remaining candidate relay nodes until the cooperative transmission rate stops increasing.

[0132] In the above embodiment, the target relay node sequence number set participating in the cooperative transmission is determined, and the target relay node transmission power and the transmission cooperation mode of the target relay node are determined. One achievable way is that the relay node sequence number set participating in the cooperative transmission is like The decode-and-forward cooperative transmission mode is adopted, and the transmission power is Otherwise, the amplify-and-forward cooperative transmission mode is used, and the transmission power is

[0133] In some embodiments of the present disclosure, the monetary benefit of each target relay node is determined according to the contribution degree of each target relay node; and the reputation value of each target relay node is updated according to the monetary benefit of each target relay node. The target relay node receives the current reputation value of the relay node sent by the source node; and updates the reputation value of the relay node to the current reputation value. Construct terminal user reputation evaluation rules to enhance network collaboration trust relationships and ensure service experience. Add flexible pricing modes to allow a single terminal to exclusively use or multiple terminals to share relay services, and set different billing modes, which are reflected in the form of smart contracts to enhance collaboration opportunities and improve network resource utilization.

[0134] Specifically, after the collaborative transmission is completed, each relay node participating in the collaboration Get corresponding monetary benefits μ according to contribution k , and use this to update the corresponding reputation value, that is:

[0135] ρ k =ρ k +μ k

[0136] in,

[0137]

[0138] The disclosed embodiment provides adaptive collaborative transmission mode switching. The relay node supports two forwarding protocols, namely, amplification and forwarding and decoding and forwarding. It supports the selection of multiple relay nodes for collaborative transmission at the same time, which fully meets the requirements of low-latency and high-rate communication. By slicing the transmission process in time, different time segments allow the relay node and transmission mode to be adjusted to adapt to changes in the channel environment, thereby obtaining higher collaborative flexibility and transmission rate.

[0139] In some embodiments of the present disclosure, the candidate relay node monitors the blockchain network information and verifies the authenticity of the collaborative transmission request information through the source node public key. After confirmation, the candidate relay node sends the node information of the relay node to the source node.

[0140] In some embodiments of the present disclosure, after the source node completes data transmission, the destination node verifies the data integrity and writes the transaction information into the blockchain network to complete the accounting.

[0141] In the above method embodiment of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted; a collaboration request is broadcast through the blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes return their respective node information after listening to the collaboration request; the respective node information returned by the multiple candidate relay nodes is received; based on the respective node information of the multiple candidate relay nodes, a target relay node is selected from the multiple candidate relay nodes; a data transmission request is sent to the target relay node, so that the target relay node performs collaborative data transmission to the destination node according to the blockchain smart contract; the present disclosure selects a suitable target relay node for communication based on the node information of the candidate relay node, thereby improving the data transmission efficiency during relay collaborative communication.

[0142] Figure 5 FIG. 5 is a schematic diagram of a data transmission device 50 provided by an exemplary embodiment of the present disclosure. Figure 5 As shown, the data transmission device 50 includes: a determination module 51, a broadcast module 52, a receiving module 53, a selection module 54 and a sending module 55.

[0143] Wherein, the determination module 51 is used to determine the number of transmission time slots according to the current amount of data to be transmitted;

[0144] A broadcast module 52 is used to broadcast a collaboration request through a blockchain network, wherein the collaboration request carries a transmission time slot number so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request;

[0145] The receiving module 53 is used to receive the node information returned by multiple candidate relay nodes;

[0146] A selection module 54, configured to select a target relay node from a plurality of candidate relay nodes according to respective node information of the plurality of candidate relay nodes;

[0147] The sending module 55 is used to send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

[0148] Optionally, after sending a data transmission request to a target relay node for the target relay node to perform collaborative data transmission to a destination node according to a blockchain smart contract, the sending module 55 may also be used to:

[0149] Determine the monetary benefit of each target relay node based on the contribution of each target relay node;

[0150] According to the monetary benefits of each target relay node, the reputation value of each target relay node is updated.

[0151] Optionally, when determining the number of transmission time slots according to the current amount of data to be transmitted, the determination module 51 is configured to:

[0152] The number of transmission time slots is determined according to the channel coherence time of the transmission link between the source node and each candidate relay node, the channel coherence time of the transmission link between each candidate relay node and the destination node, and the duration of relay cooperation in a single time slot.

[0153] Optionally, when selecting a target relay node from a plurality of candidate relay nodes according to the node information of each of the plurality of candidate relay nodes, the selection module 54 is configured to:

[0154] Under the premise of the total payment cost limit, the target relay node, the transmission power of the target relay node and the transmission cooperation mode of the target relay node are selected from multiple candidate relay nodes with the maximization of the comprehensive transmission rate as the optimization goal; the optimization equation is as follows:

[0155]

[0156] Among them, P s,max represents the maximum transmission power of the source node s, P k,max is the candidate relay node R k Maximum transmit power, ρk is the candidate relay node R k The reputation value, ρ min is the minimum credit value allowed for collaboration, α is the cost per unit of data, and β k is the candidate relay node R k The cost per unit of energy, θ k is the candidate relay node R k The additional economic cost required to participate in this transmission, τ represents the duration of a single time slot relay cooperation, L represents the number of time slots that this relay cooperation transmission lasts, μ max is the maximum payment cost allowed by the source node s; the first constraint C 1 Indicates that both the source node and the candidate relay node are power-constrained communication terminals, that is, the actual transmission power used cannot exceed its maximum transmission power; the second constraint C 2 Indicates that when cooperative transmission is used, the transmission rate should be higher than that of direct transmission; the third constraint C 3 The reputation value of the candidate relay node participating in the collaborative transmission should be higher than the threshold value ρ min ; The fourth constraint C 4 It means that under the mixed pricing method consisting of the amount of transmitted data, energy consumption, and additional economic cost, the total economic cost paid by the source node is less than or equal to the target cost threshold;

[0157] When there is no solution to the optimization equation, the direct transfer mode is used;

[0158] When the optimization equation has a solution, a target relay node, a transmission power of the target relay node, and a transmission cooperation mode of the target relay node are selected from a plurality of candidate relay nodes.

[0159] Optionally, the optimization equation solving method comprises the following steps:

[0160] Initialize input parameters, including: source node maximum transmit power P s,max , the maximum transmission power of the candidate relay node P k,max and reputation value ρ k , the channel gain-to-noise ratio g from source node s to destination node d sd , source node s to candidate relay node R k The channel gain-to-noise ratio of the candidate relay node R k The channel gain-to-noise ratio g to the destination node d rd,k , the minimum allowed reputation value for collaboration ρ min , the maximum economic cost μ that can be paid max , the relay node sequence number set that can use multi-node cooperative transmission is

[0161] Initialize the candidate relay node sequence set ω={1,2,...,K}, the candidate relay node transmit power matrix Candidate relay node cooperative transmission rate matrix Among them, the candidate relay node transmit power matrix and candidate relay node cooperative transmission rate matrix The first row in represents the single-node amplification and forwarding cooperation mode, the second row represents the single-node decoding and forwarding cooperation mode, and the columns represent the candidate relay node numbers;

[0162] Assume k = 1, 2, ..., K, for the candidate relay node R k Loop and calculate the candidate relay nodes R k Transmit power and cooperative transmission rate in single-node amplify-and-forward cooperative mode and single-node decode-and-forward cooperative mode;

[0163] According to the cooperative transmission rate, the row and column numbers of the matrix where the maximum element is located are selected to determine the target cooperative mode, that is,

[0164] Continue to search for the node number with the largest cooperative transmission rate among the remaining candidate relay nodes, and update the cooperative transmission candidate relay node number set and transmission power;

[0165] A set of target relay node sequence numbers participating in cooperative transmission is determined, as well as a transmission power of the target relay node and a transmission cooperative mode of the target relay node.

[0166] Optionally, the selection module 44 calculates the candidate relay nodes R k The transmit power and cooperative transmission rate in the single-node amplification and forwarding cooperative mode and the single-node decoding and forwarding cooperative mode are used for:

[0167] In the single-node amplification and forwarding collaboration mode, According to the second constraint C 2 , solve for the minimum transmit power

[0168]

[0169] According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, if Then the maximum transmit power like If it is not true, the binary search method is used to determine the maximum allowable power

[0170] Determine the target transmit power of candidate relay nodes in single-node amplification and forwarding cooperative mode and the corresponding cooperative transmission rate

[0171]

[0172] In the single-node decoding and forwarding cooperation mode, Use the maximum transmission power P k,max Calculating the cooperative transmission rate In the second constraint C 2 If the condition is met, the minimum transmission power

[0173]

[0174] In the second constraint C 2 If this cannot be satisfied, According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, In this case, the maximum allowable power exist If this is not true, the binary search method is used to determine the maximum allowable power

[0175] Determine the target transmit power in single-node decode-and-forward cooperative mode and the corresponding cooperative transmission rate

[0176]

[0177] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0178] Figure 6 FIG. 6 is a schematic diagram of a data transmission device 60 provided by an exemplary embodiment of the present disclosure. Figure 6 As shown, the data transmission device 60 includes: a request monitoring module 61, a request receiving module 62 and a data transmission module 63.

[0179] Among them, the request monitoring module 61 is used to send the node information of the relay node to the source node after monitoring the collaboration request sent by the source node through the blockchain network, so that the source node can select a target relay node from multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the number of transmission time slots, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes;

[0180] A request receiving module 62, configured to receive a data transmission request sent by a source node;

[0181] The data transmission module 63 is used to perform collaborative data transmission to the destination node according to the data transmission request and the blockchain smart contract.

[0182] Optionally, the data transmission module 63 may also be used to: receive the current reputation value of the relay node sent by the source node; and update the reputation value of the relay node to the current reputation value.

[0183] Figure 7 FIG. 1 is a schematic diagram of a structure of an electronic device provided by an exemplary embodiment of the present disclosure. Figure 7 As shown, the electronic device includes: a memory 71 and a processor 72. In addition, the electronic device also includes a power supply component 73 and a communication component 74.

[0184] The memory 71 is used to store computer programs and can be configured to store various other data to support operations on the electronic device. Examples of such data include instructions for any application or method operating on the electronic device.

[0185] The memory 71 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.

[0186] The communication component 74 is used for data transmission with other devices.

[0187] The processor 72 can execute computer instructions stored in the memory 71 to: determine the number of transmission time slots based on the current amount of data to be transmitted; broadcast a collaboration request through the blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; receive the respective node information returned by multiple candidate relay nodes; select a target relay node from multiple candidate relay nodes based on the respective node information of the multiple candidate relay nodes; send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node in accordance with the blockchain smart contract.

[0188] Accordingly, the present disclosure also provides a computer-readable storage medium storing a computer program. When the computer-readable storage medium stores the computer program and the computer program is executed by one or more processors, the one or more processors execute Figure 1 Each step in the method embodiment.

[0189] Accordingly, the present disclosure also provides a computer program product, the computer program product includes a computer program / instruction, the computer program / instruction is executed by a processor Figure 1 Each step in the method embodiment.

[0190] Figure 8 FIG. 1 is a schematic diagram of another electronic device provided by an exemplary embodiment of the present disclosure. Figure 8 As shown, the electronic device includes: a memory 81 and a processor 82. In addition, the electronic device also includes a power supply component 83 and a communication component 84.

[0191] The memory 81 is used to store computer programs and can be configured to store various other data to support operations on the electronic device. Examples of such data include instructions for any application program or method operating on the electronic device.

[0192] The memory 81 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.

[0193] The communication component 84 is used for data transmission with other devices.

[0194] The processor 82 can execute computer instructions stored in the memory 81, so as to: after monitoring the collaboration request sent by the source node through the blockchain network, send the node information of the relay node to the source node, so that the source node can select the target relay node from multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the number of transmission time slots, the number of transmission time slots is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes; receive the data transmission request sent by the source node; according to the data transmission request, perform collaborative data transmission to the destination node in accordance with the blockchain smart contract.

[0195] Accordingly, the present disclosure also provides a computer-readable storage medium storing a computer program. When the computer-readable storage medium stores the computer program and the computer program is executed by one or more processors, the one or more processors execute Figure 2 Each step in the method embodiment.

[0196] Accordingly, the present disclosure also provides a computer program product, the computer program product includes a computer program / instruction, the computer program / instruction is executed by a processor Figure 2 Each step in the method embodiment.

[0197] Above Figure 7 and Figure 8 The communication component in is configured to facilitate wired or wireless communication between the device where the communication component is located and other devices. The device where the communication component is located can access a wireless network based on a communication standard, such as WiFi, 2G, 3G, 4G / LTE, 5G and other mobile communication networks, or a combination thereof. In an exemplary embodiment, the communication component receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component also includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technologies.

[0198] Above Figure 7 and Figure 8 The power supply component in the device provides power to various components of the device where the power supply component is located. The power supply component may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power to the device where the power supply component is located.

[0199] The electronic device also includes a display screen and an audio component.

[0200] The display screen includes a screen, and the screen may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation.

[0201] The audio component may be configured to output and / or input audio signals. For example, the audio component includes a microphone (MIC), and when the device where the audio component is located is in an operating mode, such as a call mode, a recording mode, and a speech recognition mode, the microphone is configured to receive an external audio signal. The received audio signal may be further stored in a memory or sent via a communication component. In some embodiments, the audio component also includes a speaker for outputting an audio signal.

[0202] In the above-mentioned device, storage medium and computer program product embodiments of the present disclosure, the number of transmission time slots is determined according to the current amount of data to be transmitted; a collaboration request is broadcast through the blockchain network, wherein the collaboration request carries the number of transmission time slots, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; the respective node information returned by multiple candidate relay nodes is received; based on the respective node information of the multiple candidate relay nodes, a target relay node is selected from the multiple candidate relay nodes; a data transmission request is sent to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract; the present disclosure selects a suitable target relay node for communication based on the node information of the candidate relay node, thereby improving the data transmission efficiency during relay collaborative communication.

[0203] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0204] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0205] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0206] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0207] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0208] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0209] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0210] It should be noted that, in this article, relational terms such as "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0211] The above are only specific embodiments of the present disclosure, so that those skilled in the art can understand or implement the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein can be implemented in other embodiments without departing from the spirit or scope of the present disclosure. Therefore, the present disclosure will not be limited to these embodiments herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A data transmission method, It is characterized in that include: Determine the number of transmission time slots according to the current amount of data to be transmitted, including: determine the number of transmission time slots according to the channel coherence time of the transmission link between the source node and each candidate relay node, the channel coherence time of the transmission link between each candidate relay node and the destination node, and the duration of the relay cooperation of a single time slot, wherein the source node divides the transmission process into multiple time periods, each time period includes multiple time slots, during which the relay nodes and transmission mode participating in the cooperation remain unchanged, and the cooperation mode and relay nodes can be reselected in different time periods; Broadcasting a collaboration request through a blockchain network, wherein the collaboration request carries the transmission time slot number, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; Receiving respective node information returned by the plurality of candidate relay nodes; Selecting a target relay node from the plurality of candidate relay nodes according to the node information of each of the plurality of candidate relay nodes, including: under the premise of a total payment cost limit, taking maximization of the comprehensive transmission rate as an optimization goal, selecting a target relay node, a transmission power of the target relay node, and a transmission cooperation mode of the target relay node from the plurality of candidate relay nodes; A data transmission request is sent to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

2. The method according to claim 1, It is characterized in that After sending a data transmission request to the target relay node so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract, the method further includes: Determining the monetary benefit of each of the target relay nodes according to the contribution degree of each of the target relay nodes; The reputation value of each target relay node is updated according to the monetary income of each target relay node.

3. The method according to claim 1, It is characterized in that The selecting a target relay node from the plurality of candidate relay nodes according to the respective node information of the plurality of candidate relay nodes comprises: Under the premise of the total payment cost limit, with the maximization of the comprehensive transmission rate as the optimization goal, a target relay node, the transmission power of the target relay node and the transmission cooperation mode of the target relay node are selected from the multiple candidate relay nodes; the optimization equation is as follows: s.t.C 1 :0<P s ≤P s,max ,0<P k ≤P k,max C 2 :r>Blog 2 (1+P s g sd ) Among them, r represents the comprehensive transmission rate of different cooperation modes, r n represents the comprehensive transmission rate r of the single-node amplification and forwarding cooperation mode 1 , the comprehensive transmission rate r of the single-node decoding and forwarding cooperation mode 2 , the comprehensive transmission rate r of the multi-node amplification and forwarding cooperation mode 3 Any one of them, n = 1, 2, 3, φ represents the selected relay node sequence set, and the transmission power of the source node s is P s , relay node R k The transmission power is P k , the transmission channel bandwidth is B, and the channel gain-to-noise ratio from source node s to destination node d is g sd , P s,max represents the maximum transmission power of the source node s, P k,max is the candidate relay node R k Maximum transmit power, ρ k is the candidate relay node R k The reputation value, ρ min is the minimum credit value allowed for collaboration, α is the cost per unit of data, and β k is the candidate relay node R k The cost per unit of energy, θ k is the candidate relay node R k The additional economic cost required to participate in this transmission, τ represents the duration of a single time slot relay cooperation, L represents the number of time slots that this relay cooperation transmission lasts, μ max is the maximum payment cost allowed by the source node s; the first constraint C 1 Indicates that both the source node and the candidate relay node are power-constrained communication terminals, that is, the actual transmission power used cannot exceed its maximum transmission power; the second constraint C 2 Indicates that when cooperative transmission is used, the transmission rate should be higher than that of direct transmission; the third constraint C 3 The reputation value of the candidate relay node participating in the collaborative transmission should be higher than the threshold value ρ min ; The fourth constraint C 4 It means that under the mixed pricing method consisting of the amount of transmitted data, energy consumption, and additional economic cost, the total economic cost paid by the source node is less than or equal to the target cost threshold; When there is no solution to the optimization equation, a direct transmission mode is used; When the optimization equation has a solution, a target relay node, a transmission power of the target relay node, and a transmission cooperation mode of the target relay node are selected from the plurality of candidate relay nodes.

4. The method according to claim 3, It is characterized in that The optimization equation solving method comprises the following steps: Initialize input parameters, including: source node maximum transmit power P s,max , the maximum transmission power of the candidate relay node P k,max and reputation value ρ k , the channel gain-to-noise ratio g from the source node s to the destination node d sd , the source node s to the candidate relay node R k The channel gain-to-noise ratio g sr,k , the candidate relay node R k The channel gain-to-noise ratio g to the destination node d rd,k , the minimum allowed reputation value for collaboration ρ min , the maximum payment cost μ max , the relay node sequence number set that can use multi-node cooperative transmission is Initialize the candidate relay node sequence set ω={1,2,...,K}, the candidate relay node transmit power matrix Candidate relay node cooperative transmission rate matrix Among them, the candidate relay node transmit power matrix and the candidate relay node cooperative transmission rate matrix The first row in represents the single-node amplification and forwarding cooperation mode, the second row represents the single-node decoding and forwarding cooperation mode, and the columns represent the candidate relay node numbers; Assume k = 1, 2, ..., K, for the candidate relay node R k Loop and calculate the candidate relay nodes R k Transmit power and cooperative transmission rate in the single-node amplify-and-forward cooperative mode and the single-node decode-and-forward cooperative mode; According to the collaborative transmission rate, selecting the row and column numbers of the matrix where the maximum element is located, and determining the target collaborative mode; Continue to search for the node number with the largest cooperative transmission rate among the remaining candidate relay nodes, and update the cooperative transmission candidate relay node number set and transmission power; A set of target relay node sequence numbers participating in cooperative transmission is determined, as well as a transmission power of the target relay node and a transmission cooperative mode of the target relay node.

5. The method according to claim 4, It is characterized in that The candidate relay nodes R are calculated respectively. k The transmission power and the cooperative transmission rate in the single-node amplification and forwarding cooperative mode and the single-node decoding and forwarding cooperative mode include: In the single-node amplification and forwarding collaboration mode, According to the second constraint C 2 , solve for the minimum transmit power According to the fourth constraint condition C 4 , using the maximum transmission power P k,max To calculate, if Then the maximum transmit power like If it is not true, the binary search method is used to determine the maximum allowable power In the single-node amplification and forwarding cooperation mode, determining the target transmission power of the candidate relay node and the corresponding cooperative transmission rate In the single-node decoding and forwarding cooperation mode, Use the maximum transmission power P k,max Calculating the cooperative transmission rate In the second constraint C 2 If the condition is met, the minimum transmission power In the second constraint C 2 If this cannot be satisfied, According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, In this case, the maximum allowable power exist If this is not true, the binary search method is used to determine the maximum allowable power Determine the target transmit power in single-node decode-and-forward cooperative mode and the corresponding cooperative transmission rate Among them, the transmission power of the source node s is defined as P s , the channel gain-to-noise ratio from source node s to destination node d is g sd , source node s to relay node R k The channel gain-to-noise ratio is g sr,k , r 1 represents the comprehensive transmission rate of the single-node amplification and forwarding cooperation mode, β k is the candidate relay node R k The cost per unit of energy, r 2 Indicates the comprehensive transmission rate of the single-node decoding and forwarding cooperation mode.

6. A data transmission method, It is characterized in that include: After monitoring the collaboration request sent by the source node through the blockchain network, the node information of the relay node is sent to the source node, so that the source node can select a target relay node from multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the number of transmission time slots, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes. The source node divides the transmission process into multiple time periods, each of which contains multiple time slots. During this period, the relay nodes and transmission mode participating in the collaboration remain unchanged, and the collaboration mode and relay nodes can be reselected in different time periods; receiving a data transmission request sent by the source node; According to the data transmission request, collaborative data transmission is performed to the destination node in accordance with the blockchain smart contract.

7. The method according to claim 6, It is characterized in that The method further comprises: Receiving the current reputation value of the relay node sent by the source node; The reputation value of the relay node is updated to the current reputation value.

8. A data transmission device, It is characterized in that include: A determination module, used to determine the number of transmission time slots according to the current amount of data to be transmitted, including: determining the number of transmission time slots according to the channel coherence time of the transmission link between the source node and each candidate relay node, the channel coherence time of the transmission link between each candidate relay node and the destination node, and the duration of the relay cooperation of a single time slot, wherein the source node divides the transmission process into multiple time periods, each time period includes multiple time slots, during which the relay nodes and transmission mode participating in the cooperation remain unchanged, and the cooperation mode and relay nodes can be reselected in different time periods; A broadcast module, used to broadcast a collaboration request through a blockchain network, wherein the collaboration request carries the transmission time slot number, so that multiple candidate relay nodes can return their respective node information after listening to the collaboration request; A receiving module, configured to receive respective node information returned by the plurality of candidate relay nodes; A selection module is used to select a target relay node from the plurality of candidate relay nodes according to the node information of each of the plurality of candidate relay nodes, including: under the premise of a total payment cost limit, taking maximization of the comprehensive transmission rate as an optimization goal, selecting a target relay node, a transmission power of the target relay node and a transmission cooperation mode of the target relay node from the plurality of candidate relay nodes; The sending module is used to send a data transmission request to the target relay node, so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract.

9. The device according to claim 8, It is characterized in that After the sending module sends a data transmission request to the target relay node so that the target relay node can perform collaborative data transmission to the destination node according to the blockchain smart contract, the sending module is further used to: Determining the monetary benefit of each of the target relay nodes according to the contribution degree of each of the target relay nodes; The reputation value of each target relay node is updated according to the monetary income of each target relay node.

10. The device according to claim 8, It is characterized in that When the selection module selects a target relay node from a plurality of candidate relay nodes according to the respective node information of the plurality of candidate relay nodes, the selection module is used to: The optimization equation is as follows: s.t.C 1 :0<P s ≤P s,max ,0<P k ≤P k,max C 2 :r>Blog 2 (1+P s g sd ) Among them, r represents the comprehensive transmission rate of different cooperation modes, r n represents the comprehensive transmission rate r of the single-node amplification and forwarding cooperation mode 1 , the comprehensive transmission rate r of the single-node decoding and forwarding cooperation mode 2 , the comprehensive transmission rate r of the multi-node amplification and forwarding cooperation mode 3 Any one of them, n = 1, 2, 3, φ represents the selected relay node sequence set, and the transmission power of the source node s is P s , relay node R k The transmission power is P k , the transmission channel bandwidth is B, and the channel gain-to-noise ratio from source node s to destination node d is g sd , P s,max represents the maximum transmission power of the source node s, P k,max is the candidate relay node R k Maximum transmit power, ρ k is the candidate relay node R k The reputation value, ρ min is the minimum credit value allowed for collaboration, α is the cost per unit of data, and β k is the candidate relay node R k The cost per unit of energy, θ k is the candidate relay node R k The additional economic cost required to participate in this transmission, τ represents the duration of a single time slot relay cooperation, L represents the number of time slots that this relay cooperation transmission lasts, μ max is the maximum payment cost allowed by the source node s; the first constraint C 1 Indicates that both the source node and the candidate relay node are power-constrained communication terminals, that is, the actual transmission power used cannot exceed its maximum transmission power; the second constraint C 2 Indicates that when cooperative transmission is used, the transmission rate should be higher than that of direct transmission; the third constraint C 3 The reputation value of the candidate relay node participating in the collaborative transmission should be higher than the threshold value ρ min ; The fourth constraint C 4 It means that under the mixed pricing method consisting of the amount of transmitted data, energy consumption, and additional economic cost, the total economic cost paid by the source node is less than or equal to the target cost threshold; When there is no solution to the optimization equation, a direct transmission mode is used; When the optimization equation has a solution, a target relay node, a transmission power of the target relay node, and a transmission cooperation mode of the target relay node are selected from the plurality of candidate relay nodes.

11. The device according to claim 10, It is characterized in that The optimization equation solving method comprises the following steps: Initialize input parameters, including: source node maximum transmit power P s,max , the maximum transmission power of the candidate relay node P k,max and reputation value ρ k , the channel gain-to-noise ratio g from the source node s to the destination node d sd , the source node s to the candidate relay node R k The channel gain-to-noise ratio g sr,k , the candidate relay node R k The channel gain-to-noise ratio g to the destination node d rd,k , the minimum allowed reputation value for collaboration ρ min , the maximum payment cost μ max , the relay node sequence number set that can use multi-node cooperative transmission is Initialize the candidate relay node sequence set ω={1,2,...,K}, the candidate relay node transmit power matrix Candidate relay node cooperative transmission rate matrix Among them, the candidate relay node transmit power matrix and the candidate relay node cooperative transmission rate matrix The first row in represents the single-node amplification and forwarding cooperation mode, the second row represents the single-node decoding and forwarding cooperation mode, and the columns represent the candidate relay node numbers; Assume k = 1, 2, ..., K, for the candidate relay node R k Loop and calculate the candidate relay nodes R k Transmit power and cooperative transmission rate in the single-node amplify-and-forward cooperative mode and the single-node decode-and-forward cooperative mode; According to the collaborative transmission rate, select the row and column numbers of the matrix where the maximum element is located, determine the target collaborative mode, that is, continue to find the node number with the largest collaborative transmission rate among the remaining candidate relay nodes, and update the collaborative transmission candidate relay node number set and transmission power; A set of target relay node sequence numbers participating in cooperative transmission is determined, as well as a transmission power of the target relay node and a transmission cooperative mode of the target relay node.

12. The device according to claim 11, It is characterized in that The selection module calculates the candidate relay nodes R k When the transmission power and the cooperative transmission rate in the single-node amplification and forwarding cooperative mode and the single-node decoding and forwarding cooperative mode are used to: In the single-node amplification and forwarding collaboration mode, According to the second constraint C 2 , solve for the minimum transmit power According to the fourth constraint condition C 4 , using the maximum transmission power P k,max To calculate, if Then the maximum transmit power like If it is not true, the binary search method is used to determine the maximum allowable power In the single-node amplification and forwarding cooperation mode, determining the target transmission power of the candidate relay node and the corresponding cooperative transmission rate In the single-node decoding and forwarding cooperation mode, Use the maximum transmission power P k,max Calculating the cooperative transmission rate In the second constraint C 2 If the condition is met, the minimum transmission power In the second constraint C 2 If this cannot be satisfied, According to the fourth constraint C 4 , using the maximum transmission power P k,max To calculate, In this case, the maximum allowable power exist If this is not true, the binary search method is used to determine the maximum allowable power Determine the target transmit power in single-node decode-and-forward cooperative mode and the corresponding cooperative transmission rate Among them, the transmission power of the source node s is defined as P s , the channel gain-to-noise ratio from source node s to destination node d is g sd , source node s to relay node R k The channel gain-to-noise ratio is g sr,k , r 1 represents the comprehensive transmission rate of the single-node amplification and forwarding cooperation mode, β k is the candidate relay node R k The cost per unit of energy, r 2 Indicates the comprehensive transmission rate of the single-node decoding and forwarding cooperation mode.

13. A data transmission device, It is characterized in that include: A request monitoring module is used to send the node information of the relay node to the source node after monitoring the collaboration request sent by the source node through the blockchain network, so that the source node can select a target relay node from multiple candidate relay nodes according to the node information of each of the multiple candidate relay nodes, wherein the collaboration request carries the number of transmission time slots, which is calculated by the source node according to the current amount of data to be transmitted, and the relay node is any one of the target relay nodes. The source node divides the transmission process into multiple time periods, each time period contains multiple time slots, during which the relay nodes and transmission mode participating in the collaboration remain unchanged, and the collaboration mode and relay nodes can be reselected in different time periods; A request receiving module, used for receiving a data transmission request sent by the source node; The data transmission module is used to perform collaborative data transmission to the destination node according to the data transmission request and the blockchain smart contract.

14. The device according to claim 13, It is characterized in that The data transmission module is further used for: Receiving the current reputation value of the relay node sent by the source node; The reputation value of the relay node is updated to the current reputation value.

15. An electronic device, It is characterized in that include: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement each step in the method according to any one of claims 1 to 5 or any one of claims 6 to 7.

16. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, each step of the method according to any one of claims 1 to 5 or any one of claims 6 to 7 is implemented.

17. A computer program product comprising a computer program / instructions, It is characterized in that When the computer program / instructions are executed by a processor, the steps of the method of any one of claims 1 to 5 or any one of claims 6 to 7 are implemented.

Images