Method and apparatus for resource interaction, storage medium and electronic device

Abstract

The present disclosure provides a method, device, electronic equipment and storage medium for resource interaction, relating to the technical field of computer. The method comprises: receiving bid data for communication resources in each communication service auction sent by a resource demand node and a resource providing node; determining bidirectional bid data of each communication service auction according to the bid data; judging whether the bidirectional bid data meets a transaction condition, determining a communication service auction corresponding to the bidirectional bid data meeting the transaction condition as a to-be-settlement auction, and performing auction settlement on the to-be-settlement auction to determine a target resource demand node, a target resource providing node and a virtual resource settlement result in the to-be-settlement auction; and instructing the target resource providing node to provide the target resource demand node with communication resources in a target communication service auction. The method can provide dynamic resource matching between a large number of resource demand nodes and resource providing nodes, and ensure the authenticity, rationality and budget balance of resource interaction.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and in particular to a method and apparatus, storage medium and electronic device for resource interaction. Background Technology

[0002] With the development and widespread adoption of communication technologies and various smart terminals, the massive access of 5G / 6G wireless communication has led to a surge in demand for communication capacity. Based on this, a Near-Field Network (P-RAN) technology is proposed to improve cellular frequency reuse rates. P-RAN technology allows terminals to communicate directly with each other by sharing cell network resources, even without basic network infrastructure.

[0003] In related technologies, in near-field communication scenarios, the efficiency of terminals in matching shared network resources is low, and it is impossible to match resources for multiple terminals.

[0004] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0005] The purpose of this disclosure is to provide a method, apparatus, electronic device, and storage medium for resource interaction, which can provide dynamic resource matching between massive resource demand nodes and resource provider nodes, ensure the authenticity, rationality, and budget balance of resource interaction, and incentivize each node to actively participate in near-domain communication for network resource sharing.

[0006] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0007] According to one aspect of this disclosure, a method for resource interaction is provided, the method being applied to an operator node, comprising: receiving bidding data for communication resources in various communication service auctions sent by a resource-demanding node and a resource-providing node; determining bidirectional bidding data for each communication service auction based on the bidding data; determining whether the bidirectional bidding data meets the transaction conditions, identifying the communication service auction corresponding to the bidirectional bidding data that meets the transaction conditions as an auction to be settled, and performing auction settlement on the auction to be settled, identifying the target resource-demanding node, the target resource-providing node, and the virtual resource settlement result in the auction to be settled; instructing the target resource-providing node to provide communication resources in the target communication service auction to the target resource-demanding node, and instructing the target resource-demanding node to pay virtual resources to the target resource-providing node according to the virtual resource settlement result.

[0008] In one embodiment of this disclosure, the resource demand node, resource provider node, and operator node are all nodes on the same blockchain network. The method further includes: querying the registration information of near-domain communication services on the blockchain network where the operator node is located to obtain nodes that have registered near-domain communication services; and receiving bidding data for target resources in each communication service auction sent by the resource demand node and the resource provider node, including: in multiple auction rounds, taking turns as the current bidder in each auction round, broadcasting the auction clock data of the current bidder to the node; receiving bidding data sent by the current bidder node in response to the auction clock data of the current bidder, the bidding data including a bidding attribute value carrying the auction session identifier and node identifier of the communication service auction; wherein, when the current bidder in the auction round is the buyer, the current bidder node is the resource demand node in the node; when the current bidder in the auction round is the seller, the current bidder node is the resource provider node in the node.

[0009] In one embodiment of this disclosure, the auction clock data includes a clock identifier for indicating whether the current bidder is a buyer or a seller; the bid data is sent by the current bidding node in response to the clock identifier.

[0010] In one embodiment of this disclosure, the auction clock data includes session clock data for each communication service auction; the session clock data includes an auction session identifier and node bidding clock data for each node in the communication service auction; and determining the bidirectional bidding data for each communication service auction based on the bidding data includes: in each auction round, updating the session clock data of the current bidder based on the bidding data sent by the current bidding node to obtain the updated session clock data of the current bidder; obtaining the session clock data of the other party of the current bidder; and determining the node bidding clock data of the buyer and the node bidding clock data of the seller in each communication service auction based on the updated session clock data of the current bidder and the session clock data of the other party of the current bidder, as the bidirectional bidding data for each communication service auction.

[0011] In one embodiment of this disclosure, the auction clock data for the buyer includes the node bidding clock data of a resource-demanding node in the session clock data of each communication service auction; and the auction clock data for the seller includes the node bidding clock data of one or more resource-providing nodes in the session clock data of each communication service auction.

[0012] In one embodiment of this disclosure, the node bidding clock data includes the node bidding clock value of the node and the corresponding node identifier; and updating the session clock data of the current bidder based on the bidding data sent by the current bidding node includes: determining the auction session identifier in the bidding attribute value sent by the current bidding node as the session identifier to be updated, and determining the node identifier therein as the node identifier to be updated; in the auction clock data of the current bidder, determining the session clock data indicated by the session identifier to be updated as the session clock data to be updated; based on the session identifier to be updated and the node identifier to be updated, updating the node bidding clock value of the current bidding node in the corresponding session clock data to be updated according to the bidding attribute value of the current bidding node.

[0013] In one embodiment of this disclosure, when the auction round is round t, the current bidding node includes a first bidding node; wherein, updating the node bidding clock value of the current bidding node in the corresponding session clock data to be updated according to the bidding attribute value of the current bidding node includes: obtaining the bid acceptance condition; determining whether the bidding attribute value of the first bidding node meets the bid acceptance condition; if it meets the condition, then using the bidding attribute value of the first bidding node as the node bidding clock value of the first bidding node; if it does not meet the condition, then maintaining the node bidding clock value of the first bidding node in round t and sending a notification message that the bid has not been accepted to the first bidding node, and adjusting the bidding attribute value of the first bidding node based on a preset step size value in rounds after round t, so as to update the node bidding clock value of the first bidding node according to the adjusted bidding attribute value.

[0014] In one embodiment of this disclosure, if the first bidding node is a resource demand node, the bid acceptance conditions include: the bid attribute value of the first bidding node is less than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: decreasing the bid attribute value of the first bidding node based on the step value; if the first bidding node is a resource supply node, the bid acceptance conditions include: the bid attribute value of the first bidding node is greater than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: increasing the bid attribute value of the first bidding node based on the step value.

[0015] In one embodiment of this disclosure, the auction liquidation process for an auction to be liquidated, determining the target resource demand node, target resource supply node, and virtual resource liquidation result in the auction to be liquidated, includes: determining transaction data based on the two-way bidding data of the auction to be liquidated; determining the buyer's node bidding clock data in the transaction data as the bid price data, and determining the resource demand node corresponding to the bid price data as the target resource demand node; determining the seller's node bidding clock data in the transaction data as the sell price data, and determining the resource supply node corresponding to the sell price data as the target resource supply node; calculating the transaction price attribute value based on the bid price data, sell price data, buyer weight value, and seller weight value; and performing virtual resource liquidation based on the transaction price attribute value to obtain the virtual resource liquidation result.

[0016] According to another aspect of this disclosure, an apparatus for resource interaction is provided, applied to an operator node, comprising: a receiving module for receiving bidding data for communication resources in various communication service auctions sent by a resource-demanding node and a resource-providing node; a determining module for determining bidirectional bidding data for each communication service auction based on the bidding data; a clearing module for determining whether the bidirectional bidding data meets the transaction conditions, identifying the communication service auction corresponding to the bidirectional bidding data that meets the transaction conditions as an auction to be cleared, and clearing the auction to be cleared, and determining the target resource-demanding node, the target resource-providing node, and the virtual resource clearing result in the auction to be cleared; and an indicating module for instructing the target resource-providing node to provide communication resources in the target communication service auction to the target resource-demanding node, and instructing the target resource-demanding node to pay virtual resources to the target resource-providing node according to the virtual resource clearing result.

[0017] According to another aspect of this disclosure, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the above-described method for resource interaction.

[0018] According to another aspect of this disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the above-described method for resource interaction by executing the executable instructions.

[0019] The resource interaction method provided in the embodiments of this disclosure enables an operator node to act as an auction agent, receiving bidding data for communication resources in various communication service auctions sent by resource requesting nodes and resource providing nodes. The method then integrates the bidding data to obtain bidirectional bidding data for each communication service auction. Next, it determines whether the communication service auction has met the transaction conditions based on the transaction conditions, and performs auction settlement when the conditions are met. This process identifies the target resource requesting node, the target resource providing node, and the virtual resource settlement result. Finally, it instructs the target resource providing node to provide communication resources from the target communication service auction to the target resource requesting node, and instructs the target resource requesting node to pay virtual resources to the target resource providing node based on the points settlement result, thereby realizing resource interaction between the target resource requesting node and the target resource providing node. This method demonstrates that, on the one hand, it enables communication service auctions, allowing operator nodes to act as auction agents, resource-demanding nodes as buyers, and resource-providing nodes as sellers to participate in the matching of communication resources. This provides dynamic resource matching among a massive number of resource-demanding and resource-providing nodes, ensuring the authenticity, rationality, and budget balance of resource interactions. On the other hand, it facilitates resource interaction between target resource-demanding and target resource-providing nodes by instructing target resource-providing nodes to provide communication resources and instructing target resource-demanding nodes to pay for virtual resources. Furthermore, it generates actual virtual resource changes by having target resource-demanding nodes pay virtual resources to target resource-providing nodes based on points settlement results. These actual virtual resource changes incentivize nodes to actively participate in near-field communication and share communication resources, thereby promoting the autonomous evolution, self-driven construction, and operation of near-field networks and significantly improving spectrum utilization and communication capacity.

[0020] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description

[0021] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0022] Figure 1 A schematic diagram of an exemplary system architecture for resource interaction methods to which embodiments of the present disclosure can be applied is shown;

[0023] Figure 2 A flowchart illustrating a method for resource interaction according to an embodiment of this disclosure is shown;

[0024] Figure 3 A flowchart illustrating the method for resource interaction according to an embodiment of this disclosure is shown;

[0025] Figure 4 This illustration shows the structural composition of auction clock data according to an embodiment of the present disclosure;

[0026] Figure 5 A flowchart illustrating the determination of two-way bid data in a method for resource interaction according to an embodiment of this disclosure is shown.

[0027] Figure 6 A schematic diagram of the architecture for implementing a method for resource interaction according to an embodiment of the present disclosure is shown;

[0028] Figure 7 A block diagram of an apparatus for resource interaction according to an embodiment of the present disclosure is shown; and

[0029] Figure 8 A structural block diagram of a computer device for resource interaction according to an embodiment of the present disclosure is shown. Detailed Implementation

[0030] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0031] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0032] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this disclosure, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0033] In view of the technical problems existing in the above-mentioned related technologies, the present disclosure provides a method for resource interaction to solve at least one or all of the above-mentioned technical problems.

[0034] Figure 1 A schematic diagram of a network architecture for resource interaction methods that can be applied to embodiments of this disclosure is shown.

[0035] like Figure 1 As shown, the system architecture may include operator node 101, resource demand node 102, resource provider node 103 and near-field communication range 104 (also known as near-field network range or near-field communication ecosystem area).

[0036] With the widespread adoption of various smart terminals and the massive access of 5G / 6G wireless communication, the demand for communication capacity has surged. Based on this, 3GPP proposed Near Field Network (P-RAN), a technology that allows terminal devices to communicate directly by sharing cell network resources without the need for basic network infrastructure. P-RAN can improve the spectrum efficiency of communication systems and reduce battery consumption. Figure 1 The operator node 101, resource demand node 102 and resource provider node 103 can be in the same near-field communication range 104, and the resource demand node 102 can be provided with near-field network services by the base station or resource provider node 103 in the near-field communication range 104.

[0037] In an exemplary embodiment, operator node 101, resource demand node 102, and resource provider node 103 can all be nodes on the blockchain network. In an application scenario where resource demand node 102 is provided with near-field network services by resource provider node 103 in the near-field communication range 104, operator node 101 in the near-field communication range 104 can act as an auction agent to initiate and lead this process. In this process, operator node 101 can execute the auction process by running the auction agent smart contract deployed on the blockchain.

[0038] In an exemplary embodiment, the operator node 101, the resource demand node 102, and the resource provider node 103 can communicate with each other through a network. The network is a medium for providing communication links between the operator node 101, the resource demand node 102, and the resource provider node 103. The network can include various connection types, such as wired or wireless communication links or fiber optic cables, etc.

[0039] In an exemplary embodiment, the operator node 101, resource-demanding node 102, and resource-providing node 103 can all be computer devices. For example, the operator node 101 can be a computer node device or server at the edge of a base station, the resource-demanding node 102 can be a server or user terminal device that demands communication resources, and the resource-providing node 103 can be a server or user terminal device that can provide communication resources and has a relay function. The computer device can include, but is not limited to, electronic devices such as smartphones, desktop computers, tablets, laptops, smart speakers, digital assistants, AR (Augmented Reality) devices, VR (Virtual Reality) devices, and smart wearable devices. Alternatively, the client 103 can also be a personal computer, such as a laptop or desktop computer. Optionally, the operating system running on the electronic device can include, but is not limited to, Android, iOS, Linux, and Windows systems.

[0040] In some practical applications, both the resource demand node 102 and the resource provider node 103 can be user terminal devices that have registered for local area communication services. Users can choose their user terminal devices as resource demand nodes 102 to purchase the required communication resources, or as resource provider nodes 103 to sell and provide communication resources.

[0041] In an exemplary embodiment, the process by which the operator node 101 implements the method for resource interaction may be as follows: the operator node 101 receives bidding data for communication resources in each communication service auction sent by the resource requesting node and the resource providing node; the operator node 101 determines the bidirectional bidding data for each communication service auction based on the bidding data; the operator node 101 determines whether the bidirectional bidding data meets the transaction conditions, identifies the communication service auction corresponding to the bidirectional bidding data that meets the transaction conditions as a pending auction, and performs auction settlement for the pending auction, determining the target resource requesting node, the target resource providing node, and the virtual resource settlement result in the pending auction; the operator node 101 instructs the target resource providing node to provide communication resources in the target communication service auction to the target resource requesting node, and instructs the target resource requesting node to pay virtual resources to the target resource providing node based on the virtual resource settlement result.

[0042] In addition, it should be noted that, Figure 1 The example shown is merely one application environment of the resource interaction method provided in this disclosure. Figure 1 The number of operator nodes, resource demand nodes, and resource provider nodes shown in the figure is merely illustrative. Depending on actual needs, there can be any number of operator nodes, resource demand nodes, and resource provider nodes.

[0043] To enable those skilled in the art to better understand the technical solutions of this disclosure, the various steps of the method for providing resources in the exemplary embodiments of this disclosure will be described in more detail below with reference to the accompanying drawings and examples.

[0044] Figure 2 A flowchart illustrating a method for resource interaction according to an embodiment of this disclosure is shown. The method provided in this disclosure can be derived from, for example... Figure 1 The operator nodes shown are executed, but this disclosure is not limited thereto.

[0045] like Figure 2 As shown, the method for resource interaction provided in this disclosure embodiment may include the following steps.

[0046] Step S201: Receive bidding data for communication resources in each communication service auction sent by resource demand nodes and resource provider nodes.

[0047] In this step, resource-demanding nodes can be nodes that require communication resources (such as servers or user terminal devices), and resource-providing nodes can be nodes that can provide communication resources (such as servers or user terminal devices). Communication service auctions can be created in response to the communication resource demands of resource-demanding nodes. Each communication service auction can be associated with one communication resource as the subject of the auction. In some practical applications, communication resources may include computing resources, data transmission resources, etc., and resource-demanding nodes can specify attribute requirements for communication resources, such as network speed, latency, and bandwidth. Furthermore, resource-demanding nodes, resource-providing nodes, and operator nodes can all be nodes within the same local communication range.

[0048] The bidding data can be either a bid from a resource-demanding node acting as a buyer for communication resources—the price it is willing to pay for the required communication resources—or a price offer from a resource-providing node acting as a seller—the price it expects to receive for providing its available communication resources. The bidding data may include information about the number of communication service auction sessions.

[0049] Step S203: Determine the two-way bidding data for each communication service auction based on the bidding data.

[0050] In this step, after receiving the bidding data from both the resource demand node and the resource provider node, the operator node can act as an auction agent to organize the information on the communication service auction sessions in each bidding data, obtain the bidding data of the resource demand node and the quotation data of the resource provider node corresponding to each communication service auction, and then determine the two-way bidding data for each communication service auction.

[0051] Step S205: Determine whether the two-way bidding data meets the transaction conditions, identify the communication service auction corresponding to the two-way bidding data that meets the transaction conditions as the auction to be cleared, and conduct auction clearing for the auction to be cleared, and determine the target resource demand node, target resource supply node and virtual resource clearing result in the auction to be cleared.

[0052] In this step, the transaction conditions can be pre-stored in the operator node or obtained by the operator node in real time. The transaction conditions can be used to determine whether the communication service auction has met the transaction conditions. If so, the communication service auction can proceed to settlement. In some practical applications, the auction settlement in this step can identify the winning resource-demanding node (i.e., the target resource-demanding node) and the winning resource-providing node (i.e., the target resource-providing node) in the communication service auction that meets the transaction conditions. The target resource-demanding node and the target resource-providing node can communicate in subsequent steps. The auction settlement in this step can also determine the transaction price attribute value between the two parties. This transaction price attribute value can be used to perform virtual resource settlement on the target resource-demanding node, the target resource-providing node, and the operator node to obtain the virtual resource settlement result. The virtual resource settlement result may include, for example, the virtual resources that the target resource-demanding node should pay and the virtual resources that the target resource-providing node can obtain.

[0053] In some practical applications, after auction settlement, the purchase price data of the target resource demand node and the selling price data of the target resource provider node can be determined. The transaction price attribute value can be a value between the purchase price data and the selling price data. That is, at the time of the auction, there can be a price difference between the purchase price data of the target resource demand node and the transaction price attribute value, and there can also be a price difference between the selling price data of the target resource provider node and the transaction price attribute value. The sum of these two price differences can be regarded as the premium generated in this transaction, and then converted into the share that the virtual resource can be obtained by the operator node. It can be seen that through this step, virtual resource settlement can be carried out so that the transaction price attribute value is reflected in the actual point changes of both parties (resource demand node and resource provider node). The actual point changes incentivize each node to actively participate in near-field communication and share network resources, thereby promoting the autonomous evolution, self-driven construction and operation of the near-field network, and greatly improving spectrum utilization and communication capacity.

[0054] As can be seen from the above steps, by auctioning communication services, operator nodes can act as auction agents, resource-demanding nodes can act as buyers, and resource-providing nodes can act as sellers to participate in the transaction matching of communication resources. This can provide dynamic resource matching between a large number of resource-demanding nodes and resource-providing nodes, ensuring the authenticity, rationality, and budget balance of resource interaction.

[0055] Step S207 instructs the target resource provider node to provide the target resource demand node with the communication resources in the target communication service auction, and instructs the target resource demand node to pay the target resource provider node virtual resources according to the points settlement result.

[0056] In this step, virtual resources can be, for example, a node's points on the blockchain or data such as virtual currency. It is evident that this step enables resource interaction between the target resource-demanding node and the target resource-providing node by instructing the target resource-providing node to provide communication resources and instructing the target resource-demanding node to pay for virtual resources. Furthermore, it allows the target resource-demanding node to pay virtual resources to the target resource-providing node based on points settlement results, generating actual virtual resource changes. These actual virtual resource changes incentivize nodes to actively participate in near-field communication and share communication resources, thereby promoting the autonomous evolution and self-driven construction and operation of the near-field network, significantly improving spectrum utilization and communication capacity.

[0057] The resource interaction method provided in this disclosure allows an operator node to act as an auction agent, receiving bidding data for communication resources in various communication service auctions from resource-demanding nodes and resource-providing nodes. This data is then integrated to obtain bidirectional bidding data for each communication service auction. Next, based on the transaction conditions, it is determined whether the communication service auction has met the transaction conditions. If the transaction conditions are met, auction settlement is performed to identify the target resource-demanding node, the target resource-providing node, and the virtual resource settlement result. The target resource-providing node is then instructed to provide the target communication service auction's communication resources to the target resource-demanding node, and the target resource-demanding node is instructed to pay the target resource-providing node virtual resources based on the points settlement result, thereby realizing resource interaction between the target resource-demanding node and the target resource-providing node. This method demonstrates that, on the one hand, it enables communication service auctions, allowing operator nodes to act as auction agents, resource-demanding nodes as buyers, and resource-providing nodes as sellers to participate in the matching of communication resources. This provides dynamic resource matching among a massive number of resource-demanding and resource-providing nodes, ensuring the authenticity, rationality, and budget balance of resource interactions. On the other hand, it facilitates resource interaction between target resource-demanding and target resource-providing nodes by instructing target resource-providing nodes to provide communication resources and instructing target resource-demanding nodes to pay for virtual resources. Furthermore, it generates actual virtual resource changes by having target resource-demanding nodes pay virtual resources to target resource-providing nodes based on points settlement results. These actual virtual resource changes incentivize nodes to actively participate in near-field communication and share communication resources, thereby promoting the autonomous evolution, self-driven construction, and operation of near-field networks and significantly improving spectrum utilization and communication capacity.

[0058] In some embodiments, resource demand nodes, resource provider nodes, and operator nodes can all be nodes on the same blockchain network; the method for resource interaction may further include: querying the registration information of near-field communication services on the blockchain network where the operator node is located, and obtaining nodes that have registered near-field communication services.

[0059] In the above steps, the blockchain network can correspond to the local communication range of the operator node; the above steps can be executed immediately after the operator node starts running, or they can be executed once every certain period of time (such as every day, every 12 hours, every hour, etc.). By querying the local communication service registration information, the operator node can clearly identify which nodes have registered for the local communication service; when a node registers for the local communication service, it can be considered to have the right to participate in the communication service auction.

[0060] In some practical applications, communication service auctions can be bilateral Dutch auctions (DDA). DDA is an effective way to solve the matching and pricing problems in bilateral markets. Applying it to the resource interaction method proposed in this application can provide dynamic resource matching between massive resource-demanding nodes and resource-providing nodes, ensuring the authenticity, rationality, and budget balance of resource interaction. Specifically, auction service agent smart contracts can be deployed on the blockchain network to supervise the execution of each step of the communication service auction.

[0061] Based on this, Figure 3 A flowchart illustrating the method for resource interaction according to an embodiment of this disclosure, showing the receipt of bid data, is provided. Figure 3 As shown, step S201 above may include the following steps.

[0062] Step S301: In multiple auction rounds, the buyer and seller take turns as the current bidder in each auction round, and broadcast the auction clock data of the current bidder to the node.

[0063] In this step, the node refers to the previously registered local area communication service node. The auction rounds can be set based on a preset frequency. In each auction round, the operator node can broadcast the auction clock data of the current bidder to the node. The preset frequency can be, for example, an auction round every 1 minute or 30 seconds, and the preset frequency can be set in the auction service agent smart contract. By having the buyer and seller take turns as the current bidder in each auction round, the buyer and seller can bid in turn. By setting this in the auction service agent smart contract, the execution of this process can be automatically prompted and supervised, allowing the process of the operator accepting the node's bidding data to run efficiently.

[0064] Step S303: The receiving node sends bidding data in response to the auction clock data of the current bidder. The bidding data includes bidding attribute values ​​carrying the auction session identifier and node identifier of the communication service auction. Specifically, when the current bidder in the auction round is the buyer, the current bidding node is the resource demand node in the node; when the current bidder in the auction round is the seller, the current bidding node is the resource provider node in the node.

[0065] In this step, resource-demanding nodes or resource-providing nodes can bid on communication service auctions for a specified auction session in their corresponding auction rounds. For example, if it's the buyer's turn to bid in a certain auction round, the resource-demanding node in the node can bid on existing communication service auctions. In fact, in this case, all existing communication service auctions were previously initiated by the resource-demanding node acting as the buyer, and each bidding resource-demanding node can only bid on the communication service auction it initiated. Similarly, in another auction round, if it's the seller's turn to bid, the resource-providing node in the node can bid on existing communication service auctions. In some practical applications, a resource-providing node can choose to bid on any existing communication service auction in an auction round, instead of always bidding on only one. In other practical applications, a resource-providing node can also choose to bid on multiple existing communication service auctions in an auction round. These settings can be configured in the auction agent smart contract deployed on the blockchain network, and the auction agent smart contract will supervise and execute the process.

[0066] In some practical applications, the process of a resource-demanding node initiating a communication service auction can be as follows: a resource-demanding node m sends a request for communication resources with a service quality of R to the operator node in auction round t, and simultaneously sends its own bid data for that communication resource. Then, the operator node can create a new communication service auction for the demand request sent by the resource-demanding node, set an auction session identifier (e.g., P) for the newly created communication service auction, and associate and record the bidding data of the resource-demanding node m in auction session t. Subsequently, in each round of bidding by the buyer, the resource-demanding node m can bid for the communication service auction with auction session identifier P. Furthermore, the aforementioned quality of service R can be obtained by the operator node through a weighted calculation based on the quality requirements of the communication resource attributes (such as network speed, latency, bandwidth, etc.) reported by the resource-demanding node m in its demand request. The weight values ​​used in the weighted calculation can be set by the operator node. The quality of service R can be stored in association with the communication service auction and can also be stored in association with the results of a successful communication service auction for relevant analysis of the communication service results.

[0067] In some practical applications, the bid data of resource demand nodes should decrease as the auction rounds increase, while the bid data of resource supply nodes should increase as the auction rounds increase.

[0068] In some embodiments, auction clock data may include a clock identifier indicating whether the current bidder is a buyer or a seller; in this context, bid data may be sent by the current bidding node in response to the clock identifier.

[0069] In other words, the clock identifier in this embodiment can be used to indicate which node, either the buyer or the seller, can make a bid in the current round. For example, the operator node acting as the auction agent can create two Dutch clocks, namely the buyer's clock and the bidder's clock; both of these Dutch clocks can contain a clock identifier field Ψ. t Where t represents the auction round identifier, which can increment over time, Ψ t The value of Ψ can be 0 or 1. t When Ψ = 0, it indicates that the current bidder is the buyer; when Ψ = 0, it indicates that the current bidder is the buyer. t When Ψ = 1, it indicates that the current bidder is the seller. In some practical applications, an auction can begin with a bid from a buyer, then Ψ t The value can start from 0 and vary between 0-1-0-1 to reflect the alternation of buyers and sellers as the current bidder in each auction round.

[0070] Specifically, when the current bidder in an auction round is the buyer, the operator node can broadcast buyer auction clock data containing the buyer's clock identifier to the node, and then receive bidding data sent by resource-demanding nodes in response to the buyer's clock identifier. This bidding data may carry the auction session identifier of the communication service auction and the node identifier of the resource-demanding node itself. When the current bidder in an auction round is the seller, the operator node can broadcast seller auction clock data containing the seller's clock identifier to the node, and then receive quotation data sent by resource-providing nodes in response to the seller's clock identifier. This quotation data may carry the auction session identifier of the communication service auction and the node identifier of the resource-providing node itself.

[0071] As can be seen, by setting clock identifiers in the auction clock data, nodes can automatically determine whether they can bid in the current round based on their own needs or capabilities when broadcasting the auction clock data, thus enabling resource-demanding nodes and resource-providing nodes to bid in an orderly manner. For example, if a node has a need for communication resources, when the operator node broadcasts buyer auction clock data containing buyer clock identifiers in one round, the node can know that it can bid in this round; conversely, when the operator node broadcasts seller auction clock data containing seller clock identifiers in another round, the node can know that it cannot bid in this round.

[0072] In some practical applications, the auction clock data may not contain a clock identifier. Instead, other nodes may notify the operator node, resource demand node, and resource provider node which party should make a bid.

[0073] In some embodiments, auction clock data may include session clock data for each communication service auction; session clock data may include auction session identifiers and node bidding clock data for each node in that communication service auction. Node bidding clock data may include the node bidding clock value and the corresponding node identifier.

[0074] In some embodiments, the auction clock data for the buyer includes the node bidding clock data of a resource-demanding node in the session clock data of each communication service auction; and the auction clock data for the seller may include the node bidding clock data of one or more resource-providing nodes in the session clock data of each communication service auction.

[0075] Figure 4 The structural composition of auction clock data according to one embodiment of this disclosure is shown. (Reference) Figure 4 The auction clock data 401 of the seller is shown, which includes: session clock data 402, session clock data 403, node bidding clock data 404 and node bidding clock data 405.

[0076] Specifically, the seller's auction clock data 401 may include session clock data for two communication service auctions, namely session clock data 402 and session clock data 403. In session clock data 402, the auction session identifier is A. This communication service auction may include node bidding clock data for two nodes, namely node bidding clock data 404 and node bidding clock data 405. In node bidding clock data 404, the node bidding clock value can be a1, with the corresponding node identifier being 001; in node bidding clock data 405, the node bidding clock value can be a2, with the corresponding node identifier being 003. The node bidding clock value can be used to indicate the bidding records that are currently effective for the relevant node in the communication service auction.

[0077] In some practical applications, during various communication service auctions, node bidding clock data can be sorted according to the magnitude of the node bidding clock values ​​to facilitate querying and statistics. For example, in the buyer's auction clock data, it can be sorted in descending order of node bidding clock values; in the seller's auction clock data, it can be sorted in ascending order of node bidding clock values.

[0078] As can be seen, the auction clock data can simultaneously record the session clock data of one or more communication service auctions. When an operator node broadcasts the auction clock data to the nodes in an auction round, it can simultaneously receive the bidding data sent by one or more nodes for these communication service auctions in that auction round. Then, it can update the auction clock data based on these bidding data to determine the two-way bidding data in each communication service auction.

[0079] Based on this, Figure 5 A flowchart illustrating the determination of two-way bid data in a method for resource interaction according to an embodiment of this disclosure is shown. Figure 5 As shown, step S203 above may include the following steps.

[0080] Step S501: In each auction round, update the clock data of each session for the current bidder based on the bidding data sent by the current bidding node, and obtain the updated clock data of each session for the current bidder.

[0081] In some practical applications, auction agent smart contracts can be configured with bid acceptance conditions. After the operator node receives bid data, it can first determine whether the bid data meets the preset bid acceptance conditions. If it does not meet the conditions, the bid data is not immediately effective and can be left unrecorded. Instead, the bid data sent by the node is adjusted, and the adjusted bid data is used as the corresponding node clock value in the auction clock data for updating and recording. If the bid acceptance conditions are met, the node's bid data can be directly used as the corresponding node clock value in the auction clock data for updating and recording. By performing this judgment and update recording for each bid data, the updated clock data for each session of the current bidder can be obtained.

[0082] Step S503: Obtain the clock data of the other party in each round of the current bid.

[0083] In this process, if the current bidder is the buyer, then the other party to the current bidder is the seller, and vice versa. Through this step, we can obtain the clock data of the other party for each session after the current bidder's clock data for each session is updated, thus obtaining the latest clock data for the buyer and seller in each communication service auction.

[0084] Step S505: Based on the updated clock data of the current bidder in each session and the clock data of the other party of the current bidder in each session, determine the node bidding clock data of the buyer and the node bidding clock data of the seller in each communication service auction, so as to serve as the two-way bidding data for each communication service auction.

[0085] Specifically, the auction session clock data of the buyer and the seller with the same auction session identifier can be used as the two-way bidding data for the communication service auction corresponding to the auction session identifier.

[0086] Through this embodiment, after receiving the bidding data in each auction round, the two-way bidding data of each communication service auction at the current moment can be integrated in a timely manner, so as to determine whether the communication service auction can be completed in subsequent steps based on the two-way bidding data.

[0087] In some embodiments, the update process in step S501, which involves "updating the clock data for each session of the current bidder based on the bid data sent by the current bidder node," may include:

[0088] The auction session identifier in the bid attribute value sent by the current bidding node is determined as the session identifier to be updated, and the node identifier therein is determined as the node identifier to be updated; in the auction clock data of the current bidder, the session clock data indicated by the session identifier to be updated is determined as the session clock data to be updated; based on the session identifier to be updated and the node identifier to be updated, the node bid clock value of the current bidding node in the corresponding session clock data to be updated is updated according to the bid attribute value of the current bidding node.

[0089] Further, in some embodiments, when the auction round is round t, the current bidding node includes the first bidding node; wherein, updating the node bidding clock value of the current bidding node in the corresponding session clock data to be updated according to the bidding attribute value of the current bidding node may include: obtaining the bid acceptance condition; determining whether the bidding attribute value of the first bidding node meets the bid acceptance condition; if it does, then using the bidding attribute value of the first bidding node as the node bidding clock value of the first bidding node; if it does not, then maintaining the node bidding clock value of the first bidding node in round t, and sending a notification to the first bidding node. Send a notification message that the bid was not accepted, and adjust the bid attribute value of the first bidding node based on a preset step value in rounds after round t, so as to update the node bid clock value of the first bidding node according to the adjusted bid attribute value; or, if neither condition is met, maintain the node bid clock value of the first bidding node in round t, send a notification message that the bid was not accepted to the first bidding node, and adjust the node bid clock value of the first bidding node in round t based on a preset step value in rounds after round t, so as to update the node bid clock value of the first bidding node.

[0090] In some practical applications, the process of adjusting the bid attribute value of the first bid node based on a preset step size value in rounds after round t can be as follows: the bid attribute value of the first bid node is determined as the attribute value to be adjusted, and the attribute value to be adjusted is adjusted based on the preset step size value in round (t+1) to obtain the adjusted attribute value, and the node bid clock value of the first bid node is updated according to the adjusted attribute value in round (t+1).

[0091] Taking the current bidder as the buyer and the first bidder as the resource demand node as an example, assuming the bid attribute value in the bid data sent by the first bidder in round t does not meet the bid acceptance condition, the operator node can refuse to accept the bid attribute value of the first bidder in round t, maintain the previous bid clock value of the first node at time t, mark the bid attribute value of the first node as the bid attribute value to be adjusted, and send a notification message to the first bidder that the bid has not been accepted; when the auction reaches round (t+1), the seller makes a bid, and the operator node can accept the bid data of the resource provider node on the one hand, and on the other hand, simultaneously adjust the bid attribute value to be adjusted of the first bidder in the previous round to obtain the adjusted attribute value. At this time, it can... Then determine whether the adjusted attribute value meets the bid acceptance condition, wherein: (1) if the adjusted attribute value meets the bid acceptance condition compared with the bid clock value at time t of the first node, the adjusted attribute value can replace the bid clock value at time t of the first node in round (t+1) to update the node bid clock value of the first bid node, and the auction clock data containing the adjusted attribute value is broadcast to the buyer in round (t+2); (2) if the adjusted attribute value does not meet the bid acceptance condition compared with the bid clock value at time t of the first node in round (t+1), the adjusted attribute value is marked as the attribute value to be adjusted a second time, the bid clock value at time t of the first node is still maintained, and the auction clock data containing the bid clock value at time t of the first node is broadcast to the buyer in round (t+2).

[0092] In some practical applications, the process of adjusting the node bid clock value of the first bidding node in round t based on a preset step size value in rounds after round t can be as follows: the node clock value of the first bidding node is determined as the attribute value to be adjusted, and the attribute value to be adjusted is adjusted based on the preset step size value in round (t+1) to obtain the adjusted clock value, and the adjusted clock value is used as the node bid clock value of the first bidding node in round (t+1).

[0093] In some embodiments, if the first bidding node is a resource demand node, the bid acceptance conditions include: the bid attribute value of the first bidding node is less than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: decreasing the bid attribute value of the first bidding node based on the step value; if the first bidding node is a resource supply node, the bid acceptance conditions include: the bid attribute value of the first bidding node is greater than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: increasing the bid attribute value of the first bidding node based on the step value.

[0094] Similarly, the process of adjusting the node bidding clock value can be referred to the above process, and will not be repeated here.

[0095] In some practical applications, the step size can be dynamically adjusted according to the actual situation. For example, increasing the step size can improve auction efficiency and enable the two-way bidding data to meet the transaction conditions as soon as possible.

[0096] In some practical applications, assuming that each communication service auction includes a first auction, the resource interaction method provided in this application further includes: when the bid clock data of a seller's node is higher than the bid clock data of a buyer's node for the first time in the two-way bid data of the first auction, it is determined that the two-way bid data of the first auction meets the transaction conditions.

[0097] The above method can be used to determine whether the two-way bidding data of the first auction meets the transaction conditions.

[0098] In some embodiments, the auction to be liquidated is conducted to determine the target resource demand node, target resource supply node, and virtual resource liquidation result in the auction to be liquidated, including: determining transaction data based on the two-way bidding data of the auction to be liquidated; determining the buyer's node bidding clock data in the transaction data as the bid price data, and determining the resource demand node corresponding to the bid price data as the target resource demand node; determining the seller's node bidding clock data in the transaction data as the ask price data, and determining the resource supply node corresponding to the ask price data as the target resource supply node; calculating the transaction price attribute value based on the bid price data, ask price data, buyer weight value, and seller weight value; and performing virtual resource liquidation based on the transaction price attribute value to obtain the virtual resource liquidation result.

[0099] These steps can be executed automatically by calling the auction agent smart contract.

[0100] Furthermore, taking points on a blockchain network as an example of virtual resources, the process of clearing virtual resources based on the transaction price attribute value can include:

[0101] The pending payment points for the target resource demand node, the first pending points for the target resource supply node, and the second pending points for the operator node are calculated based on the transaction price attribute value, purchase price data, and sale price data, and used as the virtual resource settlement result. There can be a proportional conversion relationship between the price attribute value, purchase price data, sale price data, and points.

[0102] In some practical applications, when an auction is completed, there may be a price difference between the purchase price data of the target resource demand node and the transaction price attribute value, and there may also be a price difference between the selling price data of the target resource supply node and the transaction price attribute value. The sum of these two price differences can be regarded as the premium generated in this transaction, and then converted into the second points to be obtained by the virtual resource as the operator node.

[0103] Based on this, instructing the target resource demand node to pay virtual resources to the target resource provider node according to the virtual resource settlement result may include: reducing the resource demand node's points on the blockchain according to the points to be paid, increasing the resource provider node's points on the blockchain according to a first points to be obtained, and increasing the operator node's points on the blockchain according to a second points to be obtained, thereby realizing a partial transfer of virtual resources between the target resource demand node and the target resource provider node.

[0104] In this embodiment, the operator node can perform points clearing and execute transactions according to the auction agent smart contract, so that the resource requesting node pays points (points to be paid) and the resource providing node receives revenue points (first points to be obtained). The premium generated in this transaction can be paid to the operator node as an incentive share (second points to be obtained) to offset the cost of its broadcast information.

[0105] Figure 6 A schematic diagram of the architecture for implementing a method for resource interaction according to an embodiment of this disclosure is shown, such as... Figure 6 As shown, the architecture includes: operator node 601, resource demand node 602, resource provider node 603, auction agent smart contract 604, buyer clock 605, and seller clock 606.

[0106] The operator node 601 can run the auction agent smart contract 604 to execute the auction process. During the auction process, the operator node 601 can maintain the buyer's clock 605 for the resource request node 602 and the seller's clock 606 for the resource provider node 603. It can broadcast the corresponding clocks to the resource request node 602 or the resource provider node 603 and receive the bidding data from the resource request node 602 or the resource provider node 603. It can also judge the bids of both parties based on the auction agent smart contract 604 to determine when the transaction ends. When the transaction ends, the operator node 601 can calculate the virtual resources that the resource request node 602 should pay, the virtual resources that the resource provider node 603 should obtain, and the virtual resources that the operator node 601 should obtain, and instruct the resource provider node 603 to provide communication resources to the resource request node 602.

[0107] It should be noted that the above figures are merely illustrative of the processes included in the method according to exemplary embodiments of the present invention, and are not intended to be limiting. It is readily understood that the processes shown in the above figures do not indicate or limit the temporal order of these processes. Furthermore, it is readily understood that these processes may, for example, be executed synchronously or asynchronously in multiple modules.

[0108] Figure 7 This diagram illustrates a block diagram of a device 700 for resource interaction according to a fifth embodiment of this disclosure, which is applied to an operator node; as shown Figure 7 As shown, it includes:

[0109] The receiving module 701 is used to receive bidding data for communication resources in each communication service auction sent by resource demand nodes and resource provider nodes; the determining module 702 is used to determine the two-way bidding data for each communication service auction based on the bidding data; the clearing module 703 is used to determine whether the two-way bidding data meets the transaction conditions, determine the communication service auction corresponding to the two-way bidding data that meets the transaction conditions as the auction to be cleared, and clear the auction to be cleared, and determine the target resource demand node, target resource provider node and virtual resource clearing result in the auction to be cleared; the instructing module 704 is used to instruct the target resource provider node to provide the communication resources in the target communication service auction to the target resource demand node, and instruct the target resource demand node to pay the virtual resources to the target resource provider node according to the points clearing result.

[0110] In some embodiments, the resource demand node, resource provider node, and operator node are all nodes on the same blockchain network; the device 700 for resource interaction further includes: a query module 705 and a broadcast module 706; the query module 705 is used to query the registration information of the near-field communication service on the blockchain network where the operator node is located, and to obtain the nodes that have registered near-field communication services; and the receiving module 701 receives the bidding data for the target resources in each communication service auction sent by the resource demand node and the resource provider node, including: the broadcast module 706, in multiple auction rounds, takes the buyer and seller as the current bidder in each auction round, and broadcasts the auction clock data of the current bidder to the node; the receiving module 701 receives the bidding data sent by the current bidder node in response to the auction clock data of the current bidder, the bidding data including the bidding attribute value carrying the auction session identifier and node identifier of the communication service auction; wherein, when the current bidder in the auction round is the buyer, the current bidder node is the resource demand node in the node; when the current bidder in the auction round is the seller, the current bidder node is the resource provider node in the node.

[0111] The device for resource interaction provided in this disclosure allows an operator node to act as an auction agent, receiving bidding data for communication resources in various communication service auctions from resource-demanding nodes and resource-providing nodes. It then integrates the bidding data to obtain bidirectional bidding data for each communication service auction. Next, it determines whether the communication service auction has met the transaction conditions based on the transaction conditions, and performs auction settlement when the conditions are met. This process identifies the target resource-demanding node, the target resource-providing node, and the virtual resource settlement result. Finally, it instructs the target resource-providing node to provide the communication resources in the target communication service auction to the target resource-demanding node, and instructs the target resource-demanding node to pay virtual resources to the target resource-providing node based on the points settlement result, thereby realizing resource interaction between the target resource-demanding node and the target resource-providing node. This method demonstrates that, on the one hand, it enables communication service auctions, allowing operator nodes to act as auction agents, resource-demanding nodes as buyers, and resource-providing nodes as sellers to participate in the matching of communication resources. This provides dynamic resource matching among a massive number of resource-demanding and resource-providing nodes, ensuring the authenticity, rationality, and budget balance of resource interactions. On the other hand, it facilitates resource interaction between target resource-demanding and target resource-providing nodes by instructing target resource-providing nodes to provide communication resources and instructing target resource-demanding nodes to pay for virtual resources. Furthermore, it generates actual virtual resource changes by having target resource-demanding nodes pay virtual resources to target resource-providing nodes based on points settlement results. These actual virtual resource changes incentivize nodes to actively participate in near-field communication and share communication resources, thereby promoting the autonomous evolution, self-driven construction, and operation of near-field networks and significantly improving spectrum utilization and communication capacity.

[0112] In some embodiments, the auction clock data includes a clock identifier indicating whether the current bidder is a buyer or a seller; the bid data is sent by the current bidding node in response to the clock identifier.

[0113] In some embodiments, the auction clock data includes session clock data for each communication service auction; the session clock data includes the auction session identifier and the node bidding clock data of each node in the communication service auction; and the determining module 702 determines the bidirectional bidding data for each communication service auction based on the bidding data, including: in each auction round, updating the session clock data of the current bidder based on the bidding data sent by the current bidding node to obtain the updated session clock data of the current bidder; obtaining the session clock data of the other party of the current bidder; and determining the node bidding clock data of the buyer and the node bidding clock data of the seller in each communication service auction based on the updated session clock data of the current bidder and the session clock data of the other party of the current bidder, as the bidirectional bidding data for each communication service auction.

[0114] In some embodiments, the auction clock data for the buyer includes the node bidding clock data of a resource-demanding node in the session clock data of each communication service auction; and the auction clock data for the seller includes the node bidding clock data of one or more resource-providing nodes in the session clock data of each communication service auction.

[0115] In some embodiments, the node bidding clock data includes the node bidding clock value and the corresponding node identifier; and the determining module 702 updates the session clock data of the current bidder based on the bidding data sent by the current bidding node, including: determining the auction session identifier in the bidding attribute value sent by the current bidding node as the session identifier to be updated, and determining the node identifier therein as the node identifier to be updated; in the auction clock data of the current bidder, determining the session clock data indicated by the session identifier to be updated as the session clock data to be updated; based on the session identifier to be updated and the node identifier to be updated, updating the node bidding clock value of the current bidding node in the corresponding session clock data to be updated according to the bidding attribute value of the current bidding node.

[0116] In some embodiments, when the auction round is round t, the current bidding node includes the first bidding node; wherein, the determining module 702 updates the node bidding clock value of the current bidding node in the corresponding session clock data to be updated according to the bidding attribute value of the current bidding node, including: obtaining the bid acceptance condition; determining whether the bidding attribute value of the first bidding node meets the bid acceptance condition; if it meets the condition, then using the bidding attribute value of the first bidding node as the node bidding clock value of the first bidding node; if it does not meet the condition, then maintaining the node bidding clock value of the first bidding node in round t and sending a notification message that the bid has not been accepted to the first bidding node, and adjusting the bidding attribute value of the first bidding node based on a preset step size value in rounds after round t, so as to update the node bidding clock value of the first bidding node according to the adjusted bidding attribute value.

[0117] In some embodiments, if the first bidding node is a resource demand node, the bid acceptance condition includes: the bid attribute value of the first bidding node is less than or equal to the node bid clock value of the first bidding node; the determining module 702 adjusts the bid attribute value of the first bidding node based on a preset step value, including: decreasing the bid attribute value of the first bidding node based on the step value; if the first bidding node is a resource supply node, the bid acceptance condition includes: the bid attribute value of the first bidding node is greater than or equal to the node bid clock value of the first bidding node; the determining module 702 adjusts the bid attribute value of the first bidding node based on a preset step value, including: increasing the bid attribute value of the first bidding node based on the step value.

[0118] In some embodiments, the clearing module 703 performs auction clearing for the auction to be cleared, determining the target resource demand node, the target resource supply node, and the virtual resource clearing result in the auction to be cleared, including: determining transaction data based on the two-way bidding data of the auction to be cleared; determining the buyer's node bidding clock data in the transaction data as the bid price data, and determining the resource demand node corresponding to the bid price data as the target resource demand node; determining the seller's node bidding clock data in the transaction data as the sell price data, and determining the resource supply node corresponding to the sell price data as the target resource supply node; calculating the transaction price attribute value based on the bid price data, sell price data, buyer weight value, and seller weight value; and performing virtual resource clearing based on the transaction price attribute value to obtain the virtual resource clearing result.

[0119] Figure 7 Other aspects of the embodiments can be referred to in the other embodiments described above, and will not be repeated here.

[0120] Those skilled in the art will understand that various aspects of the present invention can be implemented as systems, methods, or program products. Therefore, various aspects of the present invention can be specifically implemented in the following forms: entirely hardware implementations, entirely software implementations (including firmware, microcode, etc.), or implementations combining hardware and software aspects, collectively referred to herein as “circuits,” “modules,” or “systems.”

[0121] Figure 8 This diagram illustrates a structural block diagram of a computer device for resource interaction according to an embodiment of the present disclosure. It should be noted that the illustrated electronic device is merely an example and should not be construed as limiting the functionality or scope of the embodiments of the present invention.

[0122] The following reference Figure 8 To describe an electronic device 800 according to this embodiment of the present invention. Figure 8 The electronic device 800 shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.

[0123] like Figure 8 As shown, the electronic device 800 is manifested in the form of a general-purpose computing device. The components of the electronic device 800 may include, but are not limited to: at least one processing unit 810, at least one storage unit 820, and a bus 830 connecting different system components (including storage unit 820 and processing unit 810).

[0124] The storage unit stores program code that can be executed by the processing unit 810, causing the processing unit 810 to perform the steps described in the "Exemplary Methods" section of this specification according to various exemplary embodiments of the present invention. For example, the processing unit 810 can perform actions such as... Figure 2 The method shown.

[0125] Storage unit 820 may include a readable medium in the form of a volatile storage unit, such as random access memory (RAM) 8201 and / or cache memory 8202, and may further include a read-only memory (ROM) 8203.

[0126] The storage unit 820 may also include a program / utility 8204 having a set (at least one) of program modules 8205, including but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of these examples may include an implementation of a network environment.

[0127] Bus 830 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0128] Electronic device 800 can also communicate with one or more external devices 900 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 800, and / or with any device that enables electronic device 800 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 850. Furthermore, electronic device 800 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 860. As shown, network adapter 860 communicates with other modules of electronic device 800 via bus 830. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0129] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the methods described above is stored. In some possible embodiments, various aspects of the invention may also be implemented as a program product comprising program code that, when the program product is run on a terminal device, causes the terminal device to perform the steps of the various exemplary embodiments of the invention described in the "Exemplary Methods" section of this specification.

[0130] According to embodiments of the present invention, a program product for implementing the above-described method may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto. In this document, a readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, apparatus, or device.

[0131] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0132] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of sending, propagating, or transmitting programs for use by or in conjunction with an instruction execution system, apparatus, or device.

[0133] The program code contained on the readable medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0134] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0135] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0136] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.

[0137] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0138] According to one aspect of this disclosure, a computer program product or computer program is provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the methods provided in various optional implementations of the above embodiments.

[0139] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims.

Claims

1. A method for resource interaction, characterized in that, Applied to operator nodes, including: Query the registration information of the near-field communication service on the blockchain network where the operator node is located to obtain the nodes that have registered for the near-field communication service; The system receives bidding data for communication resources in various communication service auctions from resource demand nodes and resource provider nodes; wherein the resource demand nodes, resource provider nodes, and operator nodes are all nodes on the same blockchain network. The two-way bidding data for each communication service auction is determined based on the bidding data. Determine whether the two-way bidding data meets the transaction conditions, identify the communication service auction corresponding to the two-way bidding data that meets the transaction conditions as a pending auction, and conduct auction settlement for the pending auction to determine the target resource demand node, target resource supply node and virtual resource settlement result in the pending auction. The system instructs the target resource provider node to provide communication resources in the target communication service auction to the target resource requesting node, and instructs the target resource requesting node to pay virtual resources to the target resource provider node based on the virtual resource clearing results. This includes receiving bidding data from resource-demanding nodes and resource-providing nodes for target resources in each communication service auction, including: In multiple auction rounds, the buyer and seller take turns as the current bidder in each auction round, broadcasting the auction clock data of the current bidder to the node; receiving bidding data sent by the current bidding node in response to the auction clock data of the current bidder, the bidding data including bidding attribute values ​​carrying the auction session identifier and node identifier of the communication service auction; wherein, when the current bidder in the auction round is the buyer, the current bidding node is the resource demand node in the node; when the current bidder in the auction round is the seller, the current bidding node is the resource supply node in the node; The auction clock data includes the node bidding clock value of each node; when the auction round is round t, the current bidding node includes the first bidding node; the method further includes: In round t, the bid acceptance condition is obtained; it is determined whether the bid attribute value of the first bidding node meets the bid acceptance condition; if it does, the bid attribute value of the first bidding node is used as the node bid clock value of the first bidding node; if it does not, the node bid clock value of the first bidding node is maintained in round t, and a notification message that the bid has not been accepted is sent to the first bidding node; and in rounds after round t, the bid attribute value of the first bidding node is adjusted based on a preset step value, so as to update the node bid clock value of the first bidding node according to the adjusted bid attribute value. Wherein, if the first bidding node is a resource demand node, the bid acceptance conditions include: the bid attribute value of the first bidding node is less than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: decreasing the bid attribute value of the first bidding node based on the step value; if the first bidding node is a resource supply node, the bid acceptance conditions include: the bid attribute value of the first bidding node is greater than or equal to the node bid clock value of the first bidding node; adjusting the bid attribute value of the first bidding node based on a preset step value includes: increasing the bid attribute value of the first bidding node based on the step value.

2. The method according to claim 1, characterized in that, The auction clock data includes a clock identifier used to indicate whether the current bidder is a buyer or a seller; The bid data is sent by the current bidding node in response to the clock identifier.

3. The method according to claim 1, characterized in that, The auction clock data includes session clock data for each communication service auction; the session clock data includes the auction session identifier and the node bidding clock data of each node in the communication service auction. And, based on the bidding data, determine the two-way bidding data for each communication service auction, including: In each auction round, the clock data of the current bidder in each session is updated according to the bidding data sent by the current bidding node, so as to obtain the updated clock data of the current bidder in each session. Obtain the clock data for each session of the other party of the current bidder; Based on the updated clock data of the current bidder and the clock data of the other party in each session, the node bidding clock data of the buyer and the node bidding clock data of the seller in each communication service auction are determined as the two-way bidding data for each communication service auction.

4. The method according to claim 3, characterized in that, In the buyer's auction clock data, each session clock data of a communication service auction contains node bidding clock data for a resource demand node; in the seller's auction clock data, each session clock data of a communication service auction contains node bidding clock data for one or more resource supply nodes.

5. The method according to claim 3, characterized in that, The node bidding clock data includes the node bidding clock value and the corresponding node identifier; And, updating the session clock data of the current bidder based on the bid data sent by the current bidder node, including: The auction session identifier in the bid attribute value sent by the current bidding node is determined as the session identifier to be updated, and the node identifier therein is determined as the node identifier to be updated. In the auction clock data of the current bidder, the clock data of the session indicated by the session identifier to be updated is determined as the clock data of the session to be updated; Based on the session identifier to be updated and the node identifier to be updated, the node bid clock value of the current bid node in the corresponding session clock data to be updated is updated according to the bid attribute value of the current bid node.

6. The method according to claim 3, characterized in that, The auction to be liquidated is liquidated to determine the target resource demand node, target resource supply node, and virtual resource liquidation result in the auction to be liquidated, including: The transaction data is determined based on the two-way bidding data of the auction to be liquidated; The buyer's node bid clock data in the transaction data is determined as the purchase price data, and the resource demand node corresponding to the purchase price data is determined as the target resource demand node; The seller's node bid clock data in the transaction data is determined as the selling price data, and the resource providing node corresponding to the selling price data is determined as the target resource providing node; The transaction price attribute value is calculated based on the purchase price data, the sale price data, the buyer's weight value, and the seller's weight value; and, The virtual resources are liquidated based on the transaction price attribute value to obtain the virtual resource liquidation result.

7. A device for resource interaction, characterized in that, Applied to operator nodes, including: The query module is used to query the registration information of the near-field communication service on the blockchain network where the operator node is located, and to obtain the nodes that have registered near-field communication services. The receiving module is used to receive bidding data for communication resources in various communication service auctions sent by resource demand nodes and resource provider nodes; wherein the resource demand nodes, resource provider nodes and operator nodes are all nodes on the same blockchain network; The determining module is used to determine the two-way bidding data for each communication service auction based on the bidding data; The clearing module is used to determine whether the two-way bidding data meets the transaction conditions, identify the communication service auction corresponding to the two-way bidding data that meets the transaction conditions as an auction to be cleared, and clear the auction to be cleared to determine the target resource demand node, the target resource supply node and the virtual resource clearing result in the auction to be cleared. The instruction module is used to instruct the target resource providing node to provide communication resources in the target communication service auction to the target resource demanding node, and to instruct the target resource demanding node to pay virtual resources to the target resource providing node according to the virtual resource clearing result; The device further includes a broadcast module, and the receiving module receives bidding data for target resources in each communication service auction sent by resource demand nodes and resource provider nodes, including: In multiple auction rounds, the broadcast module takes turns designating the buyer and seller as the current bidder in each round, broadcasting the auction clock data of the current bidder to the node. The receiving module receives bidding data sent by the current bidder node in response to the auction clock data of the current bidder. The bidding data includes bidding attribute values ​​carrying the auction session identifier and node identifier of the communication service auction. Wherein, when the current bidder in the auction round is the buyer, the current bidder node is the resource demand node in the node; when the current bidder in the auction round is the seller, the current bidder node is the resource supply node in the node. Wherein, the auction clock data includes the node bidding clock value of each node; when the auction round is the t-th round, the current bidding node includes the first bidding node; the determining module is further used for: In round t, the bid acceptance condition is obtained; it is determined whether the bid attribute value of the first bidding node meets the bid acceptance condition; if it does, the bid attribute value of the first bidding node is used as the node bid clock value of the first bidding node; if it does not, the node bid clock value of the first bidding node is maintained in round t, and a notification message that the bid has not been accepted is sent to the first bidding node; and in rounds after round t, the bid attribute value of the first bidding node is adjusted based on a preset step value, so as to update the node bid clock value of the first bidding node according to the adjusted bid attribute value. Wherein, if the first bidding node is a resource demand node, the bid acceptance condition includes: the bid attribute value of the first bidding node is less than or equal to the node bid clock value of the first bidding node; the determining module adjusts the bid attribute value of the first bidding node based on a preset step value, including: reducing the bid attribute value of the first bidding node based on the step value; if the first bidding node is a resource supply node, the bid acceptance condition includes: the bid attribute value of the first bidding node is greater than or equal to the node bid clock value of the first bidding node; the determining module adjusts the bid attribute value of the first bidding node based on a preset step value, including: increasing the bid attribute value of the first bidding node based on the step value.

8. A computer-readable storage medium having a computer program stored thereon, the program, when executed by a processor, implementing the method for resource interaction as described in any one of claims 1 to 6.

9. An electronic device, characterized in that, include: One or more processors; A storage device for storing one or more programs, which, when executed by one or more processors, cause the one or more processors to implement the method for resource interaction as described in any one of claims 1 to 6.

Images