Communication method and communication apparatus

Abstract

A communication method and a communication apparatus, relating to the technical field of communications. The method comprises: a first node sends first request information, the first request information comprising identification information of a first distributed ledger and identification information of a second distributed ledger, and being used for requesting joining the second distributed ledger; and the first node receives first response information, the first response information indicating whether the first node is allowed to join the second distributed ledger. By implementing embodiments of the present application, the processes of nodes joining and exiting distributed ledgers can be simplified, the nodes are supported to flexibly join target distributed ledgers and exit source distributed ledgers, and the resource utilization of the nodes and the distributed ledgers is improved.

Description

Communication method and communication apparatus

[0001] This application claims priority to the Chinese Patent Application No. 202411271223.1, filed on September 10, 2024, entitled "Communication method and communication apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and more particularly, to a communication method and a communication apparatus. BACKGROUND

[0003] A distributed ledger (DL) is a database that is shared, replicated and synchronized among network members. The distributed ledger can record transactions between network participants, such as the exchange of assets or data. In essence, the distributed ledger is a shared database, and the data or information stored therein has the characteristics of "unforgeable", "full trace", "traceable", "transparent", "collectively maintained", etc.

[0004] Some current mainstream distributed ledgers, such as Bitcoin and Fabric, all use a hard-coded method to execute the process of adding a new node to the distributed ledger. For example, the new node queries a hard-coded address, and obtains the addresses of all nodes in the distributed ledger according to the hard-coded address. All nodes in the distributed ledger determine whether to accept the new node to join the distributed ledger. However, the above method is not flexible, and the node cannot dynamically join the distributed ledger as needed.

[0005] Therefore, how to simplify the process of flexible node joining and exiting the distributed ledger and improve the resource utilization of the node and the distributed ledger is a technical problem to be solved at present. SUMMARY

[0006] The present application provides a communication method and a communication apparatus, which can support the node to flexibly apply to join the distributed ledger, simplify the process of the node joining and exiting the distributed ledger, and improve the resource utilization of the node and the distributed ledger.

[0007] In a first aspect, a communication method is provided, comprising: sending first request information, the first request information being used for a first node to request to join a second distributed ledger, the first request information indicating identification information of a first distributed ledger to which the first node belongs and identification information of the second distributed ledger; and receiving first response information, the first response information being used for responding to the first request information, the first response information indicating whether the first node is allowed to join the second distributed ledger.

[0008] The execution subject of the scheme in the first aspect can be the first communication device, where the first communication device can be a first node, or a module, circuit or chip (such as a Modem chip, also known as a baseband chip, or a system on chip (SoC) chip or system in package (SIP) chip containing a Modem core) in the first node, or a logical node, logical module or software capable of realizing all or part of the functions of the first node, which is not limited. For ease of description, the first node is described below as an example.

[0009] In the above scheme, when the first node wants to join the second distributed ledger, the first node sends first request information to the second node, which indicates the identification information of the first distributed ledger to which the first node belongs and the identification information of the second distributed ledger that the first node wants to join. The second node determines whether to allow the first node to join the second distributed ledger based on the configuration information corresponding to the two distributed ledgers, and sends response information indicating whether to allow the first node to join the second distributed ledger.

[0010] Optionally, the first response information is used to respond to the first request information, which can be understood as: the first response information is used to indicate whether to allow the first node to join the second distributed ledger, for example, the first response information is used to indicate that the first node is allowed to join the second distributed ledger, or the first response information is used to indicate that the first node is not allowed to join the second distributed ledger, and the like. It should be understood that the second distributed ledger can represent one or multiple, that is, the first node can apply to join multiple distributed ledgers at the same time according to actual needs, which is not limited in the present application.

[0011] Through the above interaction process, the first node and the second node can interact the first distributed ledger identification information to which the first node belongs and the second distributed ledger identification information. The second node compares the configuration information of the first distributed ledger and the configuration information of the second distributed ledger, and determines whether to allow the first node to join the request of the second distributed ledger according to the comparison result. In this way, the embodiments of the present application can support the first node to more flexibly apply to join the target distributed ledger, simplify the process of the first node to join the second distributed ledger, and improve the resource utilization rate of the node and the distributed ledger.

[0012] In some implementations of the first aspect, the first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information further indicates the identification information of the second distributed ledger.

[0013] When the first node is allowed to join the second distributed ledger, the second distributed ledger is indicated by the identification information, so that the first node determines the corresponding target distributed ledger, thereby correctly executing the subsequent process of joining the second distributed ledger.

[0014] In some implementations of the first aspect, the first response information further indicates at least one of: a permission of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used by the first node to communicate with other nodes contained in the second distributed ledger after the first node joins the second distributed ledger, and the indication information being used to indicate that attribute information in the configuration information of the second distributed ledger is the same as attribute information in the configuration information of the first distributed ledger.

[0015] When the first node is allowed to join the second distributed ledger, the first node can perform corresponding functions in the second distributed ledger according to the permission of the first node in the second distributed ledger. In this way, this can support the first node to more targetedly perform business or functions or participate in the second distributed ledger. Moreover, this can improve the operation efficiency of the first distributed ledger, for example, only nodes with consensus permission participate in consensus, and nodes without consensus permission do not participate in consensus, which can shorten the time occupied by consensus and save resources; only nodes with ledger storage permission save the ledger, which can save storage resources, etc.

[0016] In addition, by indicating the configuration information of the second distributed ledger or the indication information, the first node can correctly join the second distributed ledger according to the configuration information of the second distributed ledger.

[0017] In some implementations of the first aspect, before receiving the first response information, the method further comprises: obtaining distributed ledger information, the distributed ledger information comprising identification information of one or more distributed ledgers and node information contained in the one or more distributed ledgers, the distributed ledgers comprising the first distributed ledger and the second distributed ledger, and the node information comprising addresses of one or more nodes.

[0018] The first node obtains the distributed ledger information in advance, so as to determine the identification information of the target distributed ledger to be joined and the node to be interacted with. The node can be any node in the node list of the second distributed ledger, or a node that has a telecommunication connection with the first node, so that the first node can correctly interact with the target distributed ledger.

[0019] In some implementations of the first aspect, the distributed ledger information further comprises attribute information in the configuration information of the second distributed ledger, and the attribute information in the configuration information comprises at least one of: a consensus mechanism, a security algorithm, or a ledger technology.

[0020] In this way, the first node extracts the configuration information of the second distributed ledger, and then can directly join the second distributed ledger according to the configuration information of the second distributed ledger, so that subsequent interaction of the second node with the configuration information of the second distributed ledger can be avoided, transmission resources are saved, the interaction process is simplified, and the efficiency of the first node joining the second distributed ledger is improved.

[0021] In some implementations of the first aspect, the first response information further indicates that the first distributed ledger maintains the connection with the first node, and the first response information further indicates the identification information of the first distributed ledger.

[0022] For the connection between the first distributed ledger and the first node, the first distributed ledger is also given a certain decision-making right. The first distributed ledger can decide whether to maintain the connection according to actual conditions, such as the number of nodes or the privacy of ledger data, so as to expand the application scenarios and ensure that the related business of the first distributed ledger can operate normally.

[0023] In some implementations of the first aspect, the first request information and the first response information are information transmitted between a terminal-side device and a network-side device; or the first request information and the first response information are information transmitted between network-side devices.

[0024] When the first request information and the first response information are information transmitted between devices in a communication network, the embodiments of the present application can support the introduction or application of distributed ledger technology in the communication network.

[0025] In some implementations of the first aspect, the method further includes: sending second indication information, the second indication information indicating that the first node exits the first distributed ledger, and the second indication information indicating the identification information of the first distributed ledger; or receiving third indication information, the third indication information indicating that the first node exits the first distributed ledger, and the third indication information indicating the identification information of the first distributed ledger.

[0026] In a second aspect, a communication method is provided, including: receiving first request information, the first request information being used for a first node to request to join a second distributed ledger, the first request information indicating identification information of a first distributed ledger to which the first node belongs and identification information of the second distributed ledger; and sending first response information, the first response information being used for responding to the first request information, and the first response information indicating whether the first node is allowed to join the second distributed ledger.

[0027] The execution subject of the scheme in the second aspect can be a second communication device, which can be a second node, a module, a circuit or a chip (such as a Modem chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a Modem core) in the second node, and can also be a logical node, a logical module or software capable of realizing all or part of the functions of the second node, which is not limited. For ease of description, the second node is described below as an example.

[0028] The specific description can refer to the description of the beneficial effects of the first aspect, which will not be repeated here.

[0029] In some implementations of the second aspect, before sending the first response information, the method further includes: obtaining configuration information of the first distributed ledger and configuration information of the second distributed ledger, and determining the first response information based on the configuration information of the first distributed ledger and the configuration information of the second distributed ledger.

[0030] In some implementations of the second aspect, if the attribute information in the configuration information of the first distributed ledger is the same as the attribute information in the configuration information of the second distributed ledger, or if the attribute information in the configuration information of the first distributed ledger includes all the attribute information in the configuration information of the second distributed ledger, the second node determines the first response information, and the first response information indicates that the first node is allowed to join the second distributed ledger, and the attribute information includes at least one of the following: a security algorithm, a consensus mechanism or a ledger technology.

[0031] The second node directly obtains a comparison result by comparing the configuration information of the first distributed ledger and the second distributed ledger, and then directly determines whether to allow the first node to join the second distributed ledger according to the comparison result, which is simple to implement and can effectively simplify the process of the first node joining the second distributed ledger and improve performance.

[0032] In some implementations of the second aspect, the first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information further indicates identification information of the second distributed ledger.

[0033] In some implementations of the second aspect, the first response information further indicates at least one of the following: a permission of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used for the first node to join the second distributed ledger and communicate with other nodes contained in the second distributed ledger, and the indication information being used to indicate that the attribute information in the configuration information of the second distributed ledger is the same as the attribute information in the configuration information of the first distributed ledger.

[0034] In some implementations of the second aspect, the second node sends second request information, the second request information being used to request configuration information of the first distributed ledger, the second request information further indicating the identity information of the first distributed ledger and the first node identity information; receives second response information, the second response information being used to respond to the second request information, the second response information further indicating the configuration information of the first distributed ledger.

[0035] In the above scheme, when the second node cannot directly obtain the configuration information of the first distributed ledger, the second node can obtain the configuration information of the first distributed ledger by sending a request and receiving a response to other nodes connected thereto belonging to the first distributed ledger or managing the first distributed ledger, and then make an accurate judgment on whether to allow the first node to join the second distributed ledger.

[0036] In some implementations of the second aspect, the second response information further indicates the authority of the first node in the first distributed ledger.

[0037] In some implementations of the second aspect, the second response information further indicates whether the first distributed ledger continues to maintain a connection with the first node, the second response information further indicates the identity information of the first distributed ledger, and the second response information is related to the first response information.

[0038] In the above scheme, the second node can also obtain whether the first distributed ledger continues to maintain a connection with the first node by sending a request and receiving a response, that is, the first distributed ledger has a certain decision-making right and can independently decide whether to continue to maintain a connection, which can ensure that in some extreme cases, for example, the number of nodes in the first distributed ledger is less than a threshold, the first distributed ledger will maintain a connection with the first node, and ensure that the business can still run normally.

[0039] In some implementations of the second aspect, before sending the first response information, the second node sends third request information, the third request information being used to determine whether to allow the first node to join the second distributed ledger, the third request information further indicating the identity information of the first node and the identity information of the second distributed ledger; and receives third response information, the third response information being used to respond to the third request information and used to determine the first response information.

[0040] In the above scheme, the second node, without belonging to the second distributed ledger, can forward the request information sent by the first node to other nodes connected thereto belonging to the second distributed ledger or managing the second distributed ledger, and the other nodes can make a judgment and generate the third response information, and the second node can determine the first response information according to the third response information and send the first response information to the first node to indicate whether to allow the first node to join the second distributed ledger.

[0041] Through the above process, the embodiment of the application can support the first node to establish a connection with other nodes belonging to the second distributed ledger through the second node, and determine whether to allow the first node to join the second distributed ledger.

[0042] In some implementations of the second aspect, the third request information further includes configuration information of the first distributed ledger and a right of the first node in the first distributed ledger.

[0043] In some implementations of the second aspect, the third response information indicates that the first node is allowed to join the second distributed ledger, and the third response information further indicates identification information of the second distributed ledger and identification information of the first node.

[0044] In some implementations of the second aspect, the third response information further indicates at least one of the following: a right of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used for the first node to join the second distributed ledger and communicate with other nodes contained in the second distributed ledger, and the indication information being used to indicate that the configuration information of the second distributed ledger is the same as the configuration information of the first distributed ledger.

[0045] In some implementations of the second aspect, the first response information further indicates whether the first distributed ledger continues to maintain a connection with the first node, and the first response information further indicates identification information of the first distributed ledger.

[0046] In some implementations of the second aspect, the first request information and the first response information are information transmitted between a terminal-side device and a network-side device; or the first request information and the first response information are information transmitted between network-side devices.

[0047] In some implementations of the second aspect, when the first response information indicates that the first node is allowed to join the second distributed ledger, the second node updates a node list of the second distributed ledger, and the updated node list contains the first node.

[0048] In some implementations of the second aspect, the second node determines that the first node exits the first distributed ledger, and updates a node list of the first distributed ledger, and the updated node list does not contain the first node.

[0049] In a third aspect, a communication device is provided, which can be a first node, or a device or a module for executing a function of the first node.

[0050] In a possible implementation, the communication apparatus can include a module or unit corresponding to each of the methods / operations / steps / actions described in the first aspect, which can be a hardware circuit, software, or a combination of hardware circuit and software.

[0051] In a fourth aspect, a communication apparatus is provided, which can be a second node, or a device or module for performing the functions of the second node.

[0052] In a possible implementation, the communication apparatus can include a module or unit corresponding to each of the methods / operations / steps / actions described in the second aspect, which can be a hardware circuit, software, or a combination of hardware circuit and software.

[0053] In a fifth aspect, a communication apparatus is provided, which includes a processor configured to cause the communication apparatus to perform the methods described in the first aspect and any possible implementation of the first aspect, or to perform the methods described in the second aspect and any possible implementation of the second aspect, by executing computer programs or instructions, or by a logic circuit.

[0054] In a possible implementation, the communication apparatus further includes a memory configured to store the computer programs or instructions.

[0055] Optionally, the memory and the processor are integrated.

[0056] In a possible implementation, the communication apparatus further includes a communication interface configured to input and / or output signals.

[0057] In a sixth aspect, a communication apparatus is provided, which includes a logic circuit and an input / output interface configured to input and / or output signals, and the logic circuit is configured to perform the methods described in the first aspect and any possible implementation of the first aspect, or to perform the methods described in the second aspect and any possible implementation of the second aspect.

[0058] In a seventh aspect, a computer readable storage medium is provided, which stores computer programs or instructions, and when the computer programs or the instructions are run on a computer, the methods described in the first aspect and any possible implementation of the first aspect are performed, or the methods described in the second aspect and any possible implementation of the second aspect are performed.

[0059] In an eighth aspect, a computer program product is provided, comprising instructions which, when executed on a computer, cause the method according to the first aspect and any possible implementation mode of the first aspect to be performed; or cause the method according to the second aspect and any possible implementation mode of the second aspect to be performed.

[0060] In a ninth aspect, a chip system is provided, comprising: a processor configured to execute computer programs or instructions in the memory, so that the chip system implements the method according to the first aspect and any possible implementation mode of the first aspect; or so that the chip system implements the method according to the second aspect and any possible implementation mode of the second aspect.

[0061] The beneficial effects of any of the third aspect to the ninth aspect can be referred to the description of the beneficial effects of the first aspect to the second aspect, and will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0062] FIG. 1 is a schematic diagram of a network architecture 100 to which embodiments of the present application are applicable.

[0063] FIG. 2 is a schematic diagram of a distributed ledger anchoring function layer 200 according to an embodiment of the present application.

[0064] FIG. 3 is a schematic diagram of another network architecture 300 to which embodiments of the present application are applicable.

[0065] FIG. 4 is a schematic diagram of a communication system 400 to which embodiments of the present application are applicable.

[0066] FIG. 5 is a schematic diagram of an interaction flow of a communication method according to an embodiment of the present application.

[0067] FIG. 6 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0068] FIG. 7 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0069] FIG. 8 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0070] FIG. 9 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0071] FIG. 10 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0072] FIG. 11 is a schematic diagram of an interaction flow of another communication method according to an embodiment of the present application.

[0073] FIG. 12 is a schematic block diagram of a communication apparatus 1200 according to an embodiment of the present application.

[0074] Fig. 13 is a schematic block diagram of a communication apparatus 1300 according to an embodiment of the present application. DETAILED DESCRIPTION

[0075] In order to facilitate the understanding of the embodiments of the present application, the following points are first explained.

[0076] I. Unless otherwise stated, the meaning of "a plurality of or at least two" is two or more.

[0077] II. If there is no special statement and no logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referred to each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0078] III. The various numerical numbers involved in the embodiments of the present application are only used for differentiation for the convenience of description, and are not used to limit the protection scope of the present application. The size of the serial numbers involved in the embodiments of the present application does not mean the execution order, and the execution order of each process should be determined according to its function and inherent logic. For example, the terms "first", "second", "third", "fourth" and other various term labels in the specification and claims of the present application and the drawings (if any) are used to distinguish similar objects, and do not have to be used to describe a specific order or sequence. Among them, the data thus used can be interchanged under appropriate circumstances, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein.

[0079] Meanwhile, any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the use of "exemplary" or "for example" is intended to present the relevant concept in a specific manner for ease of understanding.

[0080] IV. The terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device comprising a series of steps or units does not have to be limited to those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0081] V. In the embodiments of the present application, "for indicating" can be understood as "enabling", and "enabling" can include direct enabling and indirect enabling. When describing that a certain information is used to enable A, it can include that the information directly enables A or indirectly enables A, and it does not mean that A must be carried in the information.

[0082] The information enabled by the information is referred to as to-be-enabled information. In a specific implementation process, there are many ways to enable the to-be-enabled information, for example, but not limited to, the to-be-enabled information can be directly enabled, such as the to-be-enabled information itself or an index of the to-be-enabled information. The to-be-enabled information can also be indirectly enabled by enabling other information, where the other information and the to-be-enabled information have an association relationship. The to-be-enabled information can also be enabled only in part, and other parts of the to-be-enabled information are known or agreed in advance. For example, the enabling of specific information can also be achieved by means of the arrangement order of each information agreed in advance (for example, a protocol stipulates), thereby reducing the enabling overhead to a certain extent. Meanwhile, the common part of each information can also be identified and uniformly enabled to reduce the enabling overhead caused by separately enabling the same information.

[0083] Six, the "storage" or "save" involved in the embodiments of the present application can refer to saving in one or more memories. The one or more memories can be separately arranged or integrated in the encoder or decoder, processor, or communication device. The one or more memories can also be partially separately arranged and partially integrated in the decoder, processor, or communication device. The type of memory can be any form of storage medium, which is not limited.

[0084] Seven, the "protocol" involved in the embodiments of the present application can refer to a standard protocol in the communication field, which can include, for example, a fourth generation (4th generation, 4G) communication network, a fifth generation (5th generation, 5G) communication network protocol, a new radio (new radio, NR) protocol, a 5.5G communication network protocol, and a related protocol applied to a future communication system, which is not limited in the present application.

[0085] Eight, the arrows or blocks shown by dashed lines in the schematic diagrams in the drawing part of the present application specification represent optional steps or optional modules.

[0086] Nine, in the embodiments of the present application, unless otherwise specified, " / " represents that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in the present application is only a description of the association relationship of the associated objects, which means that there can be three kinds of relationships, for example, A and / or B, which can represent: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural.

[0087] Ten, in embodiments of the present application, indication includes direct indication (also known as explicit indication) and implicit indication. Direct indication of information A means that information A is included. Implicit indication of information A means that information A is indicated by the correspondence between information A and information B and direct indication of information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.

[0088] Eleven, in embodiments of the present application, information C used for determination of information D includes that information D is determined based on information C only, and includes that information D is determined based on information C and other information. In addition, information C used for determination of information D can also include the case of indirect determination, such as the case that information D is determined based on information E, and information E is determined based on information C.

[0089] Twelve, in embodiments of the present application, "apparatus A sends information A to apparatus B" can be understood as that the destination of the information A or the intermediate network element in the transmission path between the destination is apparatus B, which can include direct or indirect sending of information to apparatus B.

[0090] Thirteen, in embodiments of the present application, "apparatus B receives information A from apparatus A" can be understood as that the source of the information A or the intermediate network element in the transmission path between the source is apparatus A, which can include direct or indirect receiving of information from apparatus A. The information can be processed as necessary between the source and the destination of the information sending, for example, format change, etc., but the destination can understand the valid information from the source. Similar expressions in the present application can be understood similarly, which will not be described here.

[0091] FIG. 1 is a schematic diagram of a network architecture 100 applicable to embodiments of the present application. The network architecture 100 includes one or more distributed ledger anchor function (DLAF) network elements (one is shown), one or more terminals (one is shown) deployed with a distributed ledger enabler (DLE) or a distributed ledger client, one or more (radio, R) access network (AN) devices (one is shown) deployed with a distributed ledger enabler or a distributed ledger client, one or more user plane functions (UPF) (one is shown), and a data network (DN).

[0092] Optionally, the network architecture can further include a DLE or a DL client as a standalone core network network function, and / or one or more core network network functions (NFs) deployed with the DLE or the DL client. The DLE as a standalone core network network function can provide distributed ledger agent services for other network functions. The DL client as a standalone core network network function can provide transaction proposal services for other network function network elements.

[0093] The NF network element described above can include network elements in existing standards, such as an access and mobility function management (AMF) network element and a session management function (SMF) network element, and can also include network elements newly defined in future standards, etc., which are not limited herein. The AMF and the SMF can have other names in networks evolved after 5G, which are not limited herein. In addition, the embodiments of the present application do not make special limitations on the DN.

[0094] The number of each type of network element and terminal in the network architecture shown in FIG. 1 is not limited. The network architecture shown in FIG. 1 can be an example of the network architecture of a communication system evolved after 5G, and FIG. 1 only shows part of the network architecture. Herein, the DLE can be replaced by a distributed ledger capability. The core network element deployed with the DLE can be referred to as a core network element with (or supporting) a distributed ledger capability. The terminal deployed with the DLE can be referred to as a terminal with (or supporting) a distributed ledger capability. The access network device deployed with the DLE can be referred to as an access network device with (or supporting) a distributed ledger capability. The distributed ledger can also be a blockchain or a distributed database or other types of databases, etc., which are not limited herein.

[0095] The DLAF is an anchor point for the overall management and association of the distributed ledger, and performs functions such as management of the distributed ledger, registration management of the distributed ledger capability, creation of the distributed ledger, activation of the distributed ledger capability, and access control to the distributed ledger. The DLAF is generally deployed in the core network in the form of a network function, and can also have a hierarchical structure, for example, a sub DLAF (sub LAF) is deployed in the access network, and the sub DLAF is managed by the DLAF. Herein, the DLAF can be a core network network element or an access network device, and the DLAF hereinafter refers to a core network network element or an access network device deployed with the DLAF.

[0096] The DLE in the telecommunications network accepts the configuration and management of the DLAF, or the node (including the UE, the access network device, and the core network element) deployed with the DLE accepts the configuration and management of the DLAF, or the node (including the UE, the access network device, and the core network element) with the distributed ledger capability accepts the configuration and management of the DLAF.

[0097] In the embodiments of the present application, different node types (i.e., node types on the distributed ledger) can be distinguished according to the capabilities of the nodes. The node deployed with the DLE can have one or more of the following functions: transaction proposal, transaction endorsement / execution, deployment and execution of smart contracts, consensus, transaction / block synchronization, ledger storage, and the like. The DLE exists in various nodes in the telecommunications network, including the UE, the access network device (e.g., the base station), and the core network element. That is, the node that needs to have the distributed ledger capability can deploy the DLE. It should be noted that the DLE can not be a physical module (or a hardware entity), and the nodes in the telecommunications network can install (or deploy) the DLE through the mirror code installation package of the DLE. For example, the core network element deployed with the DLE can also serve as an independent network function to provide the distributed ledger proxy capability for other core network elements.

[0098] The DL client accepts the configuration and management of the DLAF, performs the generation and transmission of the distributed ledger transaction, or the node (including the UE, the access network device, and the core network element) deployed with the DL client accepts the configuration and management of the DLAF. The DL client exists in various nodes in the telecommunications network, including the UE, the access network device (e.g., the base station), and the core network element. It should be noted that the DL client can not be a physical module (or a hardware entity), and the nodes in the telecommunications network can install (or deploy) the DL client through the mirror code installation package of the DL client. For example, the core network element deployed with the DL client can also serve as an independent network function to provide the transaction proposal service for other core network elements.

[0099] In a possible implementation manner, part of the DLAF is deployed in the core network, and the other part of the DLAF is deployed in the access network. The DLAF deployed in the access network can be named as a sub-DLAF (sub DLAF), and the DLAF deployed in the core network can manage and configure the sub-DLAF. The DLAF can be a core network element in the core network, and the sub-DLAF can be an access network device in the access network.

[0100] When the DLAF is deployed in the access network, the DLAF has a hierarchical feature, i.e., the DLAF deployed in the core network is at a high layer, can manage and configure a lower layer sub-DLAF (e.g., a sub-DLAF in the access network), the sub-DLAF can manage and configure the DLE and / or the DL client of the connected access network node, and can also manage and configure the DLE and / or the DL client of the terminal device, at this time, the access network node and the terminal device governed (or managed) by the sub-DLAF are called the "sub-domain" to which the sub-DLAF belongs, i.e., the sub-domain associated with the sub-DLAF. The sub-domain can refer to all nodes (including terminal devices and access network devices) governed by the sub-DLAF and deployed with the DLE and / or the DL client. One DLAF can set one or more nodes (access network devices or terminal devices) deployed with the DLE and / or the DL client, or one or more sub-domains, or one or more nodes deployed with the DLE and / or the DL client and one or more sub-domains. For example, after the DLAF sets the sub-domain, the DLAF does not directly manage the nodes deployed with the DLE and / or the DL client in the sub-domain, and does not need to be aware of the specific information thereof, but only needs to issue instructions to the sub-DLAF in units of the entire sub-domain, which can reduce the workload of the DLAF.

[0101] FIG. 2 is a schematic diagram of a distributed ledger anchoring function hierarchy 200 according to an embodiment of the present application. The example shown in FIG. 2 can be part of (not shown) of FIG. 1. As shown in FIG. 2, a DLAF in a core network (CN) is provided with a node deploying a DLE, a node deploying a DL client, a sub-DLAF 1 (i.e., sub DLAF1 in FIG. 2) and a sub-DLAF 2 (i.e., sub DLAF2 in FIG. 2), the sub-DLAF 1 governs a sub-domain 1 including multiple nodes (only three are shown, deploying DLE#1, DLE#2 and DL client#1 respectively), and the sub-DLAF 2 governs a sub-domain 2 including multiple nodes (only three are shown, deploying DLE#3, DLE#4 and DL client#2 respectively). The nodes in a sub-domain can be access network devices or terminal devices. For example, a sub-domain includes multiple access network devices governed by a sub-DLAF and multiple terminal devices accessing the core network through the access network devices in the sub-domain. For another example, a sub-domain includes multiple integrated access & backhaul (IAB) nodes governed by a sub-DLAF and multiple terminal devices accessing the core network through the IAB nodes in the sub-domain. A sub-domain can exist in a situation of super cell, where one access network device (e.g., a base station) deploys a DLAF to manage multiple access network devices. In a possible implementation, an access network can have a hierarchical architecture, i.e., there are multiple layers of DLAFs in the access network, and a DLAF at a higher layer can manage and configure a DLAF at a lower layer.

[0102] Figure 3 is a schematic diagram of another network architecture (or system architecture) 300 to which embodiments of the present application can be applied. The network architecture 300 includes one or more DLAF network elements (two are shown, DLAF1 and DLAF2), and one or more nodes in which DLEs or DLclients are deployed. Among them, DLE0 and DLE1 belong to the same distributed ledger (i.e., DL1), and all nodes in DL1 accept the configuration and management of DLAF1; DLE2 belongs to another distributed ledger (i.e., DL2), and all nodes in DL2 accept the configuration and management of DLAF2. There can be inherent telecommunications network connections between DLE nodes of different DLs, for example, a telecommunications network connection between DLE1 and DLE2, which can be a connection between UEs, base stations, and NFs. DLEs in the same distributed ledger can establish not only telecommunications network connections but also peer-to-peer (P2P) connections, for example, a P2P connection between DLE0 and DLE1, and data, transactions, blocks, etc. of the distributed ledger can be transmitted based on the connection. When DLE0 successfully joins DL2, a P2P connection between DLE0 and DLE2 will also be established.

[0103] The number of each type of network element and terminal in the network architecture shown in Figure 3 is not limited, and Figure 3 only shows some of the network elements in the network architecture. It should be noted that DL1 and DL2 shown in Figure 3 belong to the management and control of DLAF1 and DLAF2, respectively, and in another possible scenario, DL1 and DL2 can belong to the management and control of the same DLAF, for example, the management and control of DLAF1 or DLAF2. In addition, DLAF1 and DLAF2 can be different network domains of the same operator or belong to different operators, and the connection between DLAFs is the connection between core network elements, for example, the connection between NFs, and the connection between operators, i.e., the connection between DLAF1 and DLAF2 through a security edge protection proxy (SEPP).

[0104] In a possible implementation, the initial state is that DLE0 is in DL1, and DLE1 is connected, there is an existing connection between DLE1 and DLE2, which can be a connection of a telecommunications network, and there can also be a connection between DLE0 and DLE2, which can be a connection of a telecommunications network. When DLE0 moves (for example, DLE2 broadcasts DLE2 identification (ID), DL2 ID, and DLE0 receives and determines that the signal strength of DLE2 is greater than a preset threshold), the demand of DLE0 changes (for example, DL2 has stronger capability than DL1, or DL2 has more node quantity, a more reliable operator network to which the DLE0 belongs, faster consensus, or the like), or the home organization of DLE0 changes (for example, an operator A to which DL1 belongs shares a base station, a network device, or the like with an operator B to which DL2 belongs, and needs all DLE nodes included in DL1 to join DL2 corresponding to the operator B), DLE0 can join DL2 through DLE1 or DLE2, and optionally exit DL1. After DLE0 successfully joins DL2, a higher layer connection (that is, a P2P connection) between DLE0 and DLE2 is established.

[0105] In the embodiments of the present application, the terminal equipment can also be referred to as user equipment (UE), access terminal, subscriber unit, user station, mobile station, mobile station (MS), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device.

[0106] The terminal device can be a device that provides a wireless communication function, for example, a handheld device with a wireless connection function, a vehicle-mounted device, and the like. Currently, some examples of terminal devices are: a mobile phone, a satellite mobile terminal, a cellular phone, a smart phone, a tablet computer, a notebook computer, a palm computer, a mobile internet device (MID), a wearable device (for example, a smart watch, a smart bracelet, a pedometer, smart glasses, and the like), a vehicle-mounted device (for example, a car, a bicycle, an electric vehicle, an airplane, a ship, a train, a high-speed rail, and the like), a satellite terminal, a virtual reality (VR) device, an augmented reality (AR) device, a smart point of sale (POS) machine, a customer-premises equipment (CPE), a light user equipment (light UE), a reduced capability UE (REDCAP UE), a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home (for example, a refrigerator, a television, an air conditioner, an electricity meter, and the like), a smart robot, a mechanical arm, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with a wireless communication function, a computing device, or another processing device connected to a wireless modem, a flight device (for example, a smart robot, a hot air balloon, a drone, an airplane), a terminal device in a 5G network, or a terminal device in a future evolved public land mobile network (PLMN), and the like, and the present embodiments are not limited thereto.The terminal device can also be a vehicle device, for example, a whole vehicle device, a vehicle-mounted module, a vehicle-mounted chip, an on board unit (OBU), a telematics box (T-BOX), or the like. As an example but not limitation, in the embodiments of the present application, the terminal device can also be a mobile termination (MT) in an IAB node. When the IAB node faces its parent node, it can be regarded as a terminal device, at this time, the IAB node plays the role of MT.

[0107] In the embodiments of the present application, the device for implementing the function of the terminal device can be a terminal device, or a device capable of supporting the terminal device to implement the function, for example, a chip system, which can be installed in the terminal device or used in matching with the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices. In the embodiments of the present application, only the device for implementing the function of the terminal device is taken as an example for description, and the scheme of the embodiments of the present application is not limited.

[0108] The access network device in the embodiments of the present application can be a device for communicating with the terminal device, and the access network device can also be referred to as a network device or a radio access network device. The access network device in the embodiments of the present application can refer to a radio access network (RAN) node (or device) for accessing the terminal device to a wireless network.

[0109] In a possible scenario, the access network device can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next generation NodeB (gNB), a base station in a future mobile communication system, a satellite, or an access point (AP) in a WiFi system, an integrated access and backhaul (IAB) node, an access network device in a non-terrestrial network (NTN) communication system, i.e., can be deployed in a high-altitude platform or a satellite, etc. The access network device can be a macro base station, a micro base station, or an indoor station, a relay node or a donor node, or a wireless controller in a cloud radio access network (CRAN) scenario. The access network device can also be a device assuming a base station function in device to device (D2D) communication, vehicle-to-everything (V2X) communication, unmanned aerial vehicle (UAV) communication, or machine communication. Alternatively, the access network device can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in V2X technology can be a road side unit (RSU). An IAB node integrates a mobile termination (MT) and a distributed unit (DU). When the IAB node faces its parent node, it can be regarded as a terminal, at this time, the IAB node plays the role of the MT; when the IAB node faces its child node (the child node can be a terminal or an MT of another IAB node), the IAB node can be regarded as an access network device. An IAB node can establish a backhaul connection between the MT part and at least one parent node of the IAB node. The DU part of an IAB node can provide access services for the MT part of a terminal or another IAB node.

[0110] In another possible scenario, a terminal accesses a wireless network by cooperation of multiple access network devices, and different access network devices implement part of functions of a base station. For example, an access network device can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately configured, or can be included in a same network element, for example, a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). It can be understood that the access network device can be a CU node, or a DU node, or a device including the CU node and the DU node. In addition, the CU can be divided into an access network device in a radio access network (RAN), or the CU can be divided into an access network device in a core network (CN), which is not limited here.

[0111] In different systems, the CU (or CU-CP and CU-UP), the DU, or the RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, the CU-CP, the CU-UP, the DU, and the RU are taken as examples for description in this application. Any one of the CU (or the CU-CP, the CU-UP), the DU, and the RU in this application can be implemented by a software module, a hardware module, or a combination of the software module and the hardware module. The embodiments of this application do not limit the specific technology and the specific device form of the access network device.

[0112] To solve the technical problems as described in the background, the application provides a communication method and a communication device, which can simplify the process of joining and exiting the distributed ledger by the node, and improve the resource utilization rate of the node, i.e., the distributed ledger.

[0113] For the convenience of description and understanding, the following describes from the aspects of a communication system, a communication method, and a communication device, respectively.

[0114] I. Communication system

[0115] FIG. 4 is a schematic diagram of a communication system 400 to which embodiments of the present application are applied. The communication system 400 includes a first node and a second node, and a first distributed ledger and a second distributed ledger, wherein the first distributed ledger includes the first node, and the second distributed ledger includes at least one node. Optionally, the first distributed ledger and the second distributed ledger further include more nodes.

[0116] In the communication system 400, the first node and the second node are nodes supporting distributed ledger function, or in other words, the first node and the second node can be nodes deploying DLE or DLC.

[0117] In one possible implementation, the first node can be a DLE, and the second node can also be a DLE; or the first node is a DLE, and the second node is a DLAF, etc.

[0118] In another possible implementation, the first node and the second node are terminals deploying DLE or DLclient; or the first node and the second node are access network devices deploying DLE or DLclient; or the first node and the second node are NFs deploying DLE or DLclient; or the first node and the second node are respectively a terminal and an access network device deploying DLE or DLclient, etc., which are not limited.

[0119] The second distributed ledger can be a distributed ledger to which the first node is allowed to join or the first node wants to join. For ease of description, when the first node is allowed to join the second distributed ledger, the following description is given by taking the first node being allowed to join the second distributed ledger as an example.

[0120] The first node is a node applying to join the second distributed ledger, and the second node is a node related to whether the first node is allowed to join the second distributed ledger, or the second node is a node having a function or capability of judging or determining whether the first node is allowed to join the second distributed ledger.

[0121] An example:

[0122] The first node applies to join the second distributed ledger, the second node is a trusted node or a normal node in the second distributed ledger, and the second node determines whether the first node is allowed to join the second distributed ledger.

[0123] Another example:

[0124] The first node applies to join the second distributed ledger, the second node manages one or more distributed ledgers (such as a DLAF), the one or more distributed ledgers include the second distributed ledger, and the second node determines whether the first node is allowed to join the second distributed ledger.

[0125] When the first node is allowed to join the second distributed ledger, one example, the first node is allowed to join the second distributed ledger, the attribute information in the configuration information of the first distributed ledger is the same as the attribute information in the configuration information of the second distributed ledger, for example, the consensus mechanism, security algorithm, ledger technology supported by the first distributed ledger and the second distributed ledger are the same, or the attribute information in the configuration information of the first distributed ledger includes all the attribute information in the configuration information of the second distributed ledger, that is, the range corresponding to the attribute information in the configuration information of the first distributed ledger is greater than the range corresponding to the attribute information in the configuration information of the second distributed ledger.

[0126] The first node has a connection relationship with the second node, for example, the first node is directly connected with the second node, or the first node establishes a connection with the second node through other nodes (taking the third node as an example). Among them, the first node and the third node can belong to the same distributed ledger, that is, the first distributed ledger, or the third node does not belong to any distributed ledger, but the third node and the first node are nodes of the same operator, and the first node can establish a connection with the second node through the third node and communicate.

[0127] When the first node connects with the second node through the third node, the third node can save a distributed ledger list, the distributed ledger list including one or more distributed ledgers, and the third node forwards the information about the request to join the second distributed ledger from the first node to the second node according to the distributed ledger list, the second node being a node in the second distributed ledger.

[0128] When the first node wants to apply to join the second distributed ledger, the first node sends request information to the second node, the request information including or indicating the identification information of the first distributed ledger to which the first node belongs and the identification information of the second distributed ledger. The second node obtains the configuration information of the first distributed ledger and the configuration information of the second distributed ledger according to the identification information of the first distributed ledger and the identification information of the second distributed ledger sent by the first node, and then determines whether to allow the first node to join the second distributed ledger based on the configuration information of the two, and sends response information to the first node, the response information being used to indicate whether to allow the first node to join the second distributed ledger.

[0129] In summary, the first node and the second node can interact with identification information of a source distributed ledger (the first distributed ledger) and a target distributed ledger (the second distributed ledger), the second node obtains corresponding configuration information according to the identification information of the source distributed ledger and the target distributed ledger, and determines whether to allow the first node to join the target distributed ledger according to the request based on the obtained configuration information. Through the above process, the embodiment of the present application can support the first node to join the target distributed ledger more flexibly, and simplify the process of the first node exiting the source distributed ledger and joining the target distributed ledger.

[0130] II. Communication method

[0131] For ease of understanding and description, the communication method of the embodiment of the present application is described below by taking the interaction between the first node and the second node as an example, but this should not constitute a limitation on the execution subject of the communication method. For example, the method executed by the node (such as the first node and / or the second node) can also be executed by the module (such as a circuit, a chip, or a chip system, etc.) of the node, and can also be implemented by a logical node, a logical module, or software that can implement all or part of the functions of the node.

[0132] FIG. 5 is an interaction flow diagram of the communication method of the embodiment of the present application. As shown in FIG. 5, the communication method includes:

[0133] S501, the first node sends first request information to the second node. Correspondingly, the second node receives the first request information.

[0134] The first request information is used for the first node to request to join the second distributed ledger, and the first request information indicates identification information of the first distributed ledger to which the first node belongs and identification information of the second distributed ledger. Wherein, the first request information indicates that the first node requests to join the second distributed ledger, for example, the first distributed ledger to which the first node belongs before cannot meet the business requirements of the first node, the first node has the demand to request to join the second distributed ledger, or the first node needs to switch the operator network, the first node has the demand to request to join the second distributed ledger, and at the same time, the identification information of the first distributed ledger and the identification information of the second distributed ledger indicated by the first request information are used to determine the source distributed ledger corresponding to the first node and the target distributed ledger to which the first node requests to join.

[0135] In one possible implementation, the first node obtains distributed ledger information, the distributed ledger information including identification information of one or more distributed ledgers and node information contained in the one or more distributed ledgers, the distributed ledgers including the first distributed ledger and the second distributed ledger, and the node information including addresses of one or more nodes.

[0136] Specifically, the first node pre-acquires distributed ledger information, the acquired distributed ledger can be managed by the same DLAF or by different DLAFs, after acquiring the information, the first node saves it to a distributed ledger list. In a possible implementation, the distributed ledger list can include one or more of the following information: the identity of the distributed ledger, the type of the distributed ledger, the node list information of the distributed ledger, and the configuration information of the distributed ledger. For a description of the distributed ledger list, see Table 1. The content shown in Table 1 is only an example and is not the final limitation.

[0137] Table 1

[0138] As shown in Table 1, the distributed ledger list includes the following information:

[0139] Distributed ledger 1, identified as identity 1, type 1, node list including node 1 and node 4, configuration information as configuration information 1;

[0140]

[0141] Distributed ledger 2, identified as identity 2, type 1, node list including node 2 and node 3, configuration information as configuration information 2;

[0142]

[0143] Distributed ledger 3, identified as identity 3, type 2, node list including node 2, node 3 and node 4, configuration information as configuration information 3.

[0144]

[0145] Among them, there can be multiple different distributed ledgers belonging to or corresponding to the same type, which is not limited, in addition, for the node list corresponding to each distributed ledger, which also includes the identity information or address (such as internet protocol (IP) address) information of each node (not shown in Table 1).

[0146] ​​​Optionally, the configuration information corresponding to each distributed ledger can include attribute information supported by the distributed ledger, such as consensus mechanism, security algorithm, ledger technology, etc. Among them, the consensus mechanism information indicates the consensus mechanism supported by the distributed ledger, for example, one of proof of work (PoW) algorithm, proof of stake (PoS) algorithm, delegated proof of stake (DPoS) algorithm, practical byzantine fault tolerance (PBFT), etc. The security algorithm information indicates the security algorithm supported by the distributed ledger, for example, hash algorithm, signature algorithm, encryption algorithm, etc. The ledger technology information indicates the ledger structure supported by the distributed ledger, for example, whether to support editable capability, whether to adopt privacy protection, etc.

[0147] The first node can obtain the above-mentioned distributed ledger list in the following ways:

[0148] Obtained through the homepage of the operator;

[0149] Obtained from other nodes (such as the second node) through request and response processes, etc.;

[0150] Obtained from other nodes (such as the second node) through subscription and notification processes, etc.;

[0151] Obtained from other nodes (such as the second node) through processes of exposing information (such as: carrying the distributed ledger list in the broadcast message), etc.

[0152] When the first node determines the distributed ledger list, the first node selects a distributed ledger to be joined (i.e. the second distributed ledger) from the distributed ledger list, and indicates the second node in the second distributed ledger that the first node wants to join the distributed ledger through the way of indicating the identification information and / or type information of the distributed ledger. Among them, the second node can also obtain the distributed ledger information through the above-mentioned ways and store it to the distributed ledger list, so that this can support the first node to apply to join the distributed ledger it wants to join.

[0153] It should be understood that when the first node is directly connected with the second node, the first node directly sends the first request information to the second node. When the first node is not directly connected with the second node, the first node sends the first request information to the second node through the third node.

[0154] S502, the second node determines the first response information.

[0155] The first response information is a response to the first request information. For example, the first response information indicates that the first node is not allowed to join the second distributed ledger, or the first response information indicates that the first node is allowed to join the second distributed ledger.

[0156] Optionally, when the first response information indicates that the first node is allowed to join the second distributed ledger, the first response information can further indicate identification information of the second distributed ledger.

[0157] In a possible implementation, when attribute information in the configuration information of the first distributed ledger is the same as attribute information in the configuration information of the second distributed ledger, or the attribute information in the configuration information of the first distributed ledger includes all attribute information in the configuration information of the second distributed ledger, the first response information indicates that the first node is allowed to join the second distributed ledger (which can carry identification information of the second distributed ledger).

[0158] For example, the first node belongs to the first distributed ledger, and when attribute information such as a security algorithm, a consensus mechanism, and a ledger technology in the configuration information of the first distributed ledger is completely consistent with a second distributed ledger, it is considered that the first node has the ability to join the second distributed ledger, or the attribute information in the configuration information of the first distributed ledger includes all attribute information in the configuration information of the second distributed ledger, in other words, the attribute information in the configuration information of the second distributed ledger is a subset of the attribute information in the configuration information of the first distributed ledger. For example, the security algorithm in the configuration information of the first distributed ledger is post-quantum cryptography (PQC), the consensus mechanism is RAFT, and the ledger technology is editable, and the security algorithm in the configuration information of the second distributed ledger is PQC, the consensus mechanism is RAFT, and the ledger technology is non-editable. At this time, it can be considered that all attribute information in the configuration information of the second distributed ledger is contained in the first distributed ledger, and the first node has the ability to join the second distributed ledger. The first node can join the second distributed ledger according to the identification information of the second distributed ledger.

[0159] In another possible implementation, when attribute information in the configuration information of the first distributed ledger is different from attribute information in the configuration information of the second distributed ledger, or the attribute information in the configuration information of the first distributed ledger does not completely include all attribute information in the configuration information of the second distributed ledger, that is, the attribute information in the configuration information of the second distributed ledger is not a subset of the attribute information in the configuration information of the first distributed ledger, the first response information indicates that the first node is not allowed to join the second distributed ledger.

[0160] In yet another possible implementation, the first request information sent by the first node further indicates capability information of the first node, the capability information including at least one of a security algorithm, a consensus mechanism, and a ledger capability supported by the first node, and the second node determines the first response information based on the capability information and configuration information of the second distributed ledger.

[0161] Specifically, the second node compares the received capability information of the first node with the configuration information of the second distributed ledger, and if the attribute information in the configuration information of the second distributed ledger is a subset of the capability information of the first node, it is considered that the distributed ledger capability of the first node matches the second distributed ledger, the first node has the capability to join the second distributed ledger, and the determined first response information indicates that the first node is allowed to join the second distributed ledger; if the attribute information in the configuration information of the second distributed ledger is not a subset of the capability information of the first node, it is considered that the distributed ledger capability of the first node does not match the second distributed ledger, the first node does not have the capability to join the second distributed ledger, and the determined first response information indicates that the first node is not allowed to join the second distributed ledger.

[0162] In the embodiments of the application, the second node can determine the first response information by itself or through interaction with other nodes.

[0163] Taking that the second node determines the first response information by itself as an example:

[0164] Mode a1:

[0165] The second node belongs to the second distributed ledger, and the first request information includes identification information of the first distributed ledger to which the first node belongs and identification information of the second distributed ledger. Since the first node sends the first request information to the second node, the second node can determine that the first node requests to join the second distributed ledger, and the second node compares the configuration information of the first distributed ledger and the configuration information of the second distributed ledger, or determines whether the first node is allowed to join the second distributed ledger according to the comparison of the capability information of the first node and the configuration information of the second distributed ledger. Correspondingly, the second node determines the first response information according to the comparison result.

[0166] Mode a2:

[0167] The second node manages one or more distributed ledgers (including the first distributed ledger and the second distributed ledger), and the first request information includes identification information of the first distributed ledger and identification information of the second distributed ledger. The second node compares the configuration information of the first distributed ledger and the configuration information of the second distributed ledger, and determines whether the first node is allowed to join the second distributed ledger. Correspondingly, the second node determines the first response information according to the comparison result.

[0168] Taking that the second node determines the first response information through interaction between the second node and other nodes as an example:

[0169] The mode b1 includes the following steps:

[0170] The second node belongs to the first distributed ledger, the first request information includes identification information of the second distributed ledger, since the first node sends the first request information to the second node, the second node can determine that the first node requests to join the second distributed ledger, the second node has a distributed ledger list, the second node finds the node of the second distributed ledger from the distributed ledger list to send the first request information, and the first response information is determined by the node in the second distributed ledger.

[0171] S503, the second node sends the first response information to the first node. Correspondingly, the first node receives the first response information.

[0172] When the first node is directly connected with the second node, the second node directly sends the first response information to the first node. When the first node is not directly connected with the second node, the second node sends the first response information to the first node through the third node.

[0173] Through the above process, the embodiment of the application can support the first node to more flexibly apply to join the distributed ledger, simplify the process of the first node to join the target distributed ledger, and improve the resource utilization rate of the first node and the distributed ledger.

[0174] One possible implementation, the method can further include:

[0175] S504, the first node sends the third response information to the second node. Correspondingly, the second node receives the third response information.

[0176] When the first node is directly connected with the second node, the first node directly sends the third response information to the second node. When the first node is not directly connected with the second node, the first node sends the third response information to the second node through the third node.

[0177] When the first response information indicates that the first node is allowed to join the second distributed ledger, the third response information indicates that the first node successfully joins the second distributed ledger, or the third response information indicates that the first node fails to successfully join the second distributed ledger.

[0178] When the third response information indicates that the first node successfully joins the second distributed ledger, the second node can update a node list of the second distributed ledger, e.g., the second node adds the first node into the node list of the second distributed ledger (the second node belongs to the second distributed ledger, or the second node manages the second distributed ledger). When the third response information indicates that the first node fails to successfully join the second distributed ledger, the second node can ignore the request of the first node to join the second distributed ledger.

[0179] In the embodiments of the present application, the role of the node in the distributed ledger can include a full node, a light node, a micro node, a client, etc. The role of the node in the distributed ledger is used to limit different permissions of the node in the distributed ledger. For example, the full node has the following permissions: querying / reporting transactions, generating blocks, participating in consensus, writing a ledger, and saving a ledger; the light node has the following permissions: querying / reporting transactions, generating a distributed ledger, participating in consensus, and writing a ledger; the micro node has the following permissions: querying / reporting transactions and generating a distributed ledger; and the client has the following permissions: querying / reporting transactions.

[0180] In one possible embodiment, the first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information can also indicate the permission or role of the first node in the second distributed ledger. The permission or role of the first node in the second distributed ledger can be determined according to the distributed ledger capability of the first node and the current state of the second distributed ledger, or the permission or role of the first node in the first distributed ledger is referred to.

[0181] For example, the first node supports strong computing capability, and the permission assigned to the first node supports the consensus mechanism. If more than half of the consensus nodes already exist in the second distributed ledger, the permission assigned to the first node does not support the consensus mechanism.

[0182] For another example, the first node has storage space and a secure storage environment, and the permission assigned to the first node is to allow saving distributed ledger data, etc. Or, the permission assigned to the first node in the first distributed ledger is to participate in consensus and write a ledger, and the permission assigned to the first node supports the consensus mechanism and supports writing a ledger.

[0183] The permission of the first node in the second distributed ledger can be configured by the second node itself, can be configured by the second node and other nodes in the second distributed ledger, or can be configured by the DLAF, and the present application is not limited in this regard.

[0184] The aforementioned permission can also be understood as a role. For example, configuring the permission of the first node in the second distributed ledger can be understood as configuring the role of the first node in the second distributed ledger, or when the first node determines the permission in the second distributed ledger, the first node can determine the role in the second distributed ledger, or when the first node determines the role in the second distributed ledger, the first node can determine the permission in the second distributed ledger, and the like, which is not limited. Therefore, the aforementioned permission can also be replaced by the role.

[0185] In one possible embodiment, the first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information can also indicate configuration information of the second distributed ledger, which is used for the first node to correctly join the second distributed ledger.

[0186] The configuration information of the second distributed ledger can be configured by the second node itself, or can be configured by the second node and other nodes in the second distributed ledger, or can be configured by the DLAF, which is not limited.

[0187] Exemplarily, the configuration information of the second distributed ledger includes but is not limited to: a security algorithm, a consensus mechanism, a ledger technology adopted by the second distributed ledger, a node list of the second distributed ledger, and the like. Correspondingly, the second node selects the corresponding security algorithm, consensus mechanism, ledger technology, and the like to join the second distributed ledger.

[0188] By indicating the configuration information of the second distributed ledger, the first node can correctly join the second distributed ledger according to the configuration information of the second distributed ledger.

[0189] In one possible embodiment, the first response information can also indicate indication information, which is used to indicate that the configuration information of the first distributed ledger is the same as the configuration information of the second distributed ledger.

[0190] Correspondingly, the first node determines the configuration information of the second distributed ledger according to the indication information, and then can correctly join the second distributed ledger according to the configuration information of the second distributed ledger.

[0191] Optionally, in the embodiments of the present application, the type of the distributed ledger can include but is not limited to: a distributed ledger for saving certificates and identities, a distributed ledger for resource sharing, a distributed ledger for log auditing, and the like.

[0192] In one possible embodiment, the first request information also indicates the identity information of the first node, such as identification information or address information, and the like. The second node completes the verification of the first node according to the identity information of the first node.

[0193] For example, the second node performs bidirectional authentication with the first node to obtain a verification result corresponding to the first node.

[0194] For example, the second node obtains the verification result corresponding to the first node from other nodes, and the like, which is not limited.

[0195] By indicating the identity information of the first node, this can support the second node to complete the identity verification of the first node, thereby improving the security when allowing the first node to join the distributed ledger.

[0196] The determination process of the first response information in FIG. 5 is further described below in combination with FIGS. 6-8.

[0197] FIG. 6 is an interaction flow diagram of another communication method according to an embodiment of the present application. In FIG. 6, the first node belongs to a first distributed ledger, the second node belongs to a second distributed ledger, and the third node belongs to the first distributed ledger or manages one or more distributed ledgers (including the first distributed ledger). The second node directly connects with the first node, and the second node determines the first response information by interacting with other nodes in the first distributed ledger. As shown in FIG. 6, the communication method includes:

[0198] S601, the first node sends first request information to the second node. Correspondingly, the second node receives the first request information.

[0199] Specifically, the first request information includes the identity information of the first distributed ledger and the identity information of the second distributed ledger, and the second node queries the locally saved distributed ledger list to determine that the first node belongs to the first distributed ledger and itself belongs to the second distributed ledger, and the first distributed ledger includes the third node or the third node manages the first distributed ledger.

[0200] S602, the second node sends second request information to the third node. Correspondingly, the third node receives the second request information.

[0201] Specifically, when the second node cannot obtain the configuration information of the first distributed ledger or the distributed ledger capability information of the first node, and lacks the basis for making an accurate judgment on whether to allow the first node to join the second distributed ledger, it can obtain the relevant information (i.e., the configuration information of the first distributed ledger or the distributed ledger capability information of the first node) by means of the third node, and then sends the second request information to the third node. The second request information carries the identity information of the first distributed ledger and the identity information of the first node.

[0202] S603, the third node determines second response information.

[0203] Specifically, the third node determines the second response information based on the identification information of the first distributed ledger and the identification information of the first node, the second response information being used for responding to the second request information, and the second response information indicating configuration information of the first distributed ledger.

[0204] In a possible implementation, the second response information can further indicate the permission of the first node in the first distributed ledger.

[0205] Specifically, in the process of the first node joining the second distributed ledger, in order to quickly complete the permission allocation of the first node, the second node can allocate the permission of the first node in the second distributed ledger with reference to the permission of the first node in the first distributed ledger.

[0206] In another possible implementation, the second response information further indicates whether the first distributed ledger continues to maintain the connection with the first node, and the second response information further indicates the identification information of the first distributed ledger.

[0207] Specifically, the third node can determine whether to maintain the connection with the first node according to the real-time situation of the first distributed ledger. For example, when the current number of nodes of the first distributed ledger is less than a first threshold (for example, in order to execute a Byzantine Fault Tolerance (BFT) consensus algorithm, at least 3 nodes are required, and the first threshold can be set to 3), the connection between the first distributed ledger and the first node needs to be maintained; or when the current number of nodes of the first distributed ledger is greater than the first threshold, and the ledger data is private data, the connection between the first distributed ledger and the first node does not need to be maintained.

[0208] Further, the third node sends the determination result to the second node through the second response information, the second response information indicating that the first distributed ledger maintains the connection with the first node, or the second response information indicating that the first distributed ledger does not maintain the connection with the first node.

[0209] S604, the third node sends the second response information to the second node. Correspondingly, the second node receives the second response information.

[0210] The second node can determine the first response information according to the second response information, or the first response information is related to the second response information, or the first response information includes all or part of the content indicated by the second response information, which is not limited.

[0211] S605, the second node sends the first response information to the first node. Correspondingly, the first node receives the first response information.

[0212] In a possible implementation, after obtaining the configuration information of the first distributed ledger, the second node compares the configuration information of the first distributed ledger with the configuration information of the second distributed ledger, obtains a comparison result, for example, the attribute information of the configuration information of the first distributed ledger is the same as the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, the comparison result indicates that the first node has the capability to join the second distributed ledger, the first node is allowed to join the second distributed ledger, and then the comparison result is cached. When the second node receives the request information sent by other nodes in the first distributed ledger and the request information carries the identification information of the first distributed ledger and the identification information of the second distributed ledger, the second node does not need to obtain the configuration information of the first distributed ledger again (for example, by obtaining the configuration information of the first distributed ledger from the third node through the second request information), but directly determines, according to the cached comparison result, that the nodes included in the first distributed ledger all have the capability to join the second distributed ledger, and directly sends response information to the nodes, indicating that the nodes are allowed to join the second distributed ledger.

[0213] It can be understood that the second node can cache the comparison result after the first comparison, so that in the subsequent request processing process, for the case that the nodes belonging to the same source distributed ledger request to join the same target distributed ledger, it is not necessary to judge all the nodes respectively, but the cached comparison result can be directly used to make a response. In this way, the operation complexity of the second node can be reduced (from logn to log1, n represents the number of nodes that request to join the same target distributed ledger and belong to the same source distributed ledger), the performance of the second node is greatly improved, and the resource utilization rate is improved.

[0214] In another possible implementation, the first response information further indicates configuration information of the second distributed ledger, and the second node can send the configuration information of the consensus mechanism, the security algorithm, the ledger technology, etc. to the first node according to the permission assigned to the first node in the second distributed ledger. The first node compares the configuration information of the second distributed ledger received with the configuration information of the first distributed ledger, and if the attribute information in the configuration information of the second distributed ledger is the same as the attribute information in the configuration information of the first distributed ledger, the first node updates the current configuration file, modifies the permission to the permission configured by the second distributed ledger, and modifies the node list to the node list in the second distributed ledger, so as to join the second distributed ledger. If the attribute information in the configuration information of the second distributed ledger is not the same as the attribute information in the configuration information of the first distributed ledger, for example, the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, the first node starts a new program (for example, starts a new container) according to the configuration information of the second distributed ledger to join the second distributed ledger.

[0215] In another possible implementation, the first response information further indicates indication information, which is used to indicate that the configuration information of the first distributed ledger is the same as the configuration information of the second distributed ledger. After receiving the indication information, the first node can directly update the current configuration file, modify the permission to the permission configured by the second distributed ledger, and modify the node list to the node list in the second distributed ledger, so as to join the second distributed ledger.

[0216] In another possible implementation, in the case that the first response information further indicates that the first distributed ledger does not maintain the connection with the first node, the first node closes the program for the first distributed ledger; or, in the case that the first response information further indicates that the first distributed ledger continues to maintain the connection with the first node, the first node determines that the service provided by the first distributed ledger is not needed, and the first node closes the program for the first distributed ledger; or, in the case that the first response information further indicates that the first distributed ledger continues to maintain the connection with the first node, and the first node still needs to continue to obtain the service provided by the first distributed ledger, the first node continues to run the program for the first distributed ledger.

[0217] It can be seen that, for whether to maintain the connection of the first node with the source distributed ledger (i.e., the first distributed ledger), the embodiments of the present application can take into account the willingness of the first node and the first distributed ledger, and the first node and the first distributed ledger both have certain decision-making power. On the one hand, the connection between the distributed ledger nodes is a P2P connection, which belongs to a high-level connection and is basically not limited by geographical distance. For example, the first node is a UE, the second node is a base station 2, and the third node is a base station 1. The first node and the third node belong to the first distributed ledger, and the second node belongs to the second distributed ledger. The UE initially locates within the coverage range of the base station 1. The UE moves out of the coverage range of the base station 1 and enters the coverage range of the base station 2. However, unlike the telecommunication network, although the telecommunication network connection between the UE and the base station 1 is forced to be disconnected due to the limitation of signal power, which causes the physical layer signal to be unable to be directly transmitted, the high-level connection between the UE and the base station 1 is not affected. The UE can continue to maintain the P2P connection with the base station 1 through the link "UE-base station 2-base station 1". Therefore, this provides a connection basis for the first distributed ledger to allocate decision-making power. In addition, the first distributed ledger has a demand to maintain the connection (for example, the requirement of the consensus algorithm for the number of nodes), so it is necessary to allocate certain decision-making power to the first distributed ledger to meet the actual needs of the first distributed ledger in the running process.

[0218] In the above process, the second node determines whether to allow the first node to join the second distributed ledger, and sends information to the first node indicating whether to allow the first node to join the second distributed ledger. In addition, the third node side can decide whether to keep the connection of the first distributed ledger with the first node. The connection with the first node can be determined to be maintained or not maintained according to actual needs, and the indication is forwarded to the first node through the second node. Through the above process, the embodiments of the present application can support the first node to join the second distributed ledger more flexibly, simplify the process of node joining and exiting the distributed ledger, and improve the resource utilization rate of the node and the distributed ledger.

[0219] FIG. 7 is an interaction flow diagram of another communication method according to an embodiment of the present application. In FIG. 7, the first node belongs to the first distributed ledger, the second node belongs to the first distributed ledger, and the fourth node belongs to the second distributed ledger. The second node is directly connected with the first node, and the second node determines the first response information by interacting with other nodes in the second distributed ledger. As shown in FIG. 7, the communication method comprises:

[0220] S701, the first node sends first request information to the second node. Correspondingly, the second node receives the first request information.

[0221] Specifically, the first request information includes identification information of the first distributed ledger and identification information of the second distributed ledger, the second node queries a locally saved distributed ledger list, determines that the second node itself belongs to the first distributed ledger, and the first node also belongs to the first distributed ledger, and the fourth node belongs to the second distributed ledger or the fourth node manages the second distributed ledger.

[0222] S702, the second node sends third request information to the fourth node. Correspondingly, the fourth node receives the third request information.

[0223] The third request information is related to the first request information, or the third request information is determined according to the first request information, or the third request information includes all or part of the content indicated by the first request information.

[0224] Further, by carrying the identification information of the first node and the identification information of the second distributed ledger in the third request information, the fourth node can determine that the first node requests to join the distributed ledger to which the fourth node itself belongs (that is, the second distributed ledger).

[0225] In a possible implementation, the third request information further indicates configuration information of the first distributed ledger or distributed ledger capability information of the first node, so that the fourth node can make an accurate judgment on whether to allow the first node to join the second distributed ledger based on the information. It can be understood that in this way, the fourth node can avoid repeating the step of obtaining the configuration information of the first distributed ledger or the distributed ledger capability information of the first node in the subsequent judgment process, simplify the overall process, and improve the efficiency of the first node joining the second distributed ledger.

[0226] In another possible implementation, the third request information further indicates the rights of the first node in the first distributed ledger, and the fourth node can allocate rights of the first node in the second distributed ledger according to the rights.

[0227] For example, the rights of the first node in the first distributed ledger are reading, writing, saving the ledger, participating in consensus, etc., and then the fourth node allocates the rights of the first node in the second distributed ledger as reading, writing, saving the ledger and participating in consensus. Of course, the fourth node can also allocate the rights of the first node according to the capability of the first node and the current state of the second distributed ledger, but it should be noted that the rights allocated by the fourth node to the first node are generally not more than the rights of the fourth node, for example, the fourth node supports reading and writing the ledger, but does not support consensus, then the fourth node allocates the rights of the first node as reading and writing the ledger, and does not support consensus.

[0228] S703, the fourth node determines fourth response information. The fourth response information is used to respond to the third request information.

[0229] The fourth node can determine whether to allow the first node to join the second distributed ledger according to a comparison result of the configuration information of the first distributed ledger and the configuration information of the second distributed ledger. For example, the fourth node determines that the attribute information of the configuration information of the first distributed ledger is the same as the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, and allows the first node to join the second distributed ledger. For another example, the fourth node determines that the attribute information of the configuration information of the first distributed ledger is different from the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is not a subset of the attribute information of the configuration information of the first distributed ledger, and does not allow the first node to join the second distributed ledger.

[0230] In a possible implementation, the fourth node caches the comparison result, and when receiving the same request information again, that is, when other nodes in the first distributed ledger request to join the second distributed ledger, the fourth node can use the cached comparison result to make a decision, so as to reduce complexity, improve performance, and improve resource utilization.

[0231] In another possible implementation, the fourth response information further indicates the configuration information of the second distributed ledger and the permission of the first node in the second distributed ledger. The fourth node can send the configuration information such as the consensus mechanism, the security algorithm, and the ledger technology to the second node according to the permission of the first node in the second distributed ledger.

[0232] S704, the fourth node sends fourth response information to the second node. Correspondingly, the second node receives the fourth response information.

[0233] When the fourth node determines that the attribute information of the configuration information of the first distributed ledger is the same as the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, the fourth response information indicates that the first node is allowed to join the second distributed ledger. When the fourth node determines that the attribute information of the configuration information of the first distributed ledger is different from the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is not a subset of the attribute information of the configuration information of the first distributed ledger, the fourth response information indicates that the first node is not allowed to join the second distributed ledger.

[0234] The second node determines the first response information according to the fourth response information, or the first response information is related to the fourth response information, or the first response information includes all or part of the content indicated by the fourth response information, which is not limited.

[0235] S705. The second node sends first response information to the first node. Correspondingly, the first node receives the first response information.

[0236] In a possible implementation, the first response information further indicates whether the first distributed ledger continues to maintain the connection with the first node. The second node can determine whether the first distributed ledger needs to continue to maintain the connection with the first node based on real-time conditions of the first distributed ledger (for example, the current number of nodes, whether the ledger data is private data, etc.).

[0237] Further, when the first response information indicates that the first distributed ledger does not maintain the connection with the first node, the first node closes the program for the first distributed ledger; or, when the first response information indicates that the first distributed ledger continues to maintain the connection with the first node, the first node does not need the service provided by the first distributed ledger, and the first node closes the program for the first distributed ledger; or, when the first response information indicates that the first distributed ledger continues to maintain the connection with the first node, and the first node also needs to obtain the service provided by the first distributed ledger, the first node continues to run the program of the first distributed ledger.

[0238] Through the above process, the embodiment of the present application can support the first node to join the second distributed ledger more flexibly, simplify the process of the node joining the distributed ledger, and improve the resource utilization rate of the node and the distributed ledger.

[0239] FIGS. 6 and 7 are described by taking the example of the multiple nodes jointly determining whether to allow the first node to join the second distributed ledger, and the embodiment of the present application also supports the second node directly determining whether to allow the first node to join the second distributed ledger according to the first request information of the first node, which is beneficial to reduce the interaction overhead between the nodes.

[0240] FIG. 8 is an interaction flow diagram of another communication method of the embodiment of the present application. In FIG. 8, the first node belongs to the first distributed ledger, the second node is a DLAF, the second node manages the first distributed ledger and the second distributed ledger, the second node is connected with the first node, and the second node determines the first response information by itself. As shown in FIG. 8, the communication method includes:

[0241] S801. The first node sends first request information to the second node. Correspondingly, the second node receives the first request information.

[0242] Optionally, S802. The second node determines whether the identity of the first node is trusted.

[0243] Exemplarily, when the first node is a UE, the second node can obtain an authentication result of the UE from an authentication server function (AUSF), so as to determine whether the identity of the first node is trusted.

[0244] S803, the second node determines the first response information.

[0245] The second node obtains the configuration information of the first distributed ledger and the configuration information of the second distributed ledger based on the stored distributed ledger list, compares the two, and determines to allow the first node to join the second distributed ledger if the attribute information of the configuration information of the first distributed ledger is the same as the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, and determines not to allow the first node to join the second distributed ledger if the attribute information of the configuration information of the first distributed ledger is different from the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is not a subset of the attribute information of the configuration information of the first distributed ledger, and determines the first response information according to the comparison result.

[0246] S804, the second node updates the node list of the second distributed ledger.

[0247] Optionally, the second node configures the node list saved by all nodes in the second distributed ledger by issuing control signaling, adds the IP, ID or other parameters that can uniquely identify the first node of the first node in the node list, and realizes adding the first node to the second distributed ledger.

[0248] Optionally, S805, the second node updates the node list of the first distributed ledger.

[0249] Optionally, the second node configures the node list saved by all nodes in the first distributed ledger by issuing control signaling, deletes the IP of the first node in the node list, and realizes exiting the first node from the first distributed ledger.

[0250] S806, the second node sends the first response information to the first node. Correspondingly, the first node receives the first response information.

[0251] The first response information is related to a comparison result of the configuration information of the first distributed ledger. For example, the attribute information of the configuration information of the first distributed ledger is the same as the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is a subset of the attribute information of the configuration information of the first distributed ledger, and the first response information indicates that the first node is allowed to join the second distributed ledger; for example, the attribute information of the configuration information of the first distributed ledger is different from the attribute information of the configuration information of the second distributed ledger or the attribute information of the configuration information of the second distributed ledger is not a subset of the attribute information of the configuration information of the first distributed ledger, and the first response information indicates that the first node is not allowed to join the second distributed ledger.

[0252] In a possible implementation, the first response information further indicates the rights of the first node in the second distributed ledger. Optionally, the second node can refer to the rights of the first node in the first distributed ledger to allocate the rights of the first node in the second distributed ledger.

[0253] In another possible implementation, the first response information further indicates the configuration information of the second distributed ledger. According to the rights of the first node in the second distributed ledger allocated by the second node, the second node can optionally send the configuration information such as a consensus mechanism, a security algorithm, and a ledger technology to the first node, so that the first node joins the second distributed ledger according to the configuration information. For example, the rights of the first node allocated by the second node include supporting a consensus algorithm, and then the configuration information sent can include “consensus = RAFT”; or, the rights of the first node allocated by the second node include saving a ledger, and then the configuration information sent can include “ledger technology = editable”.

[0254] Through the above process, the embodiment of the application can support the first node to quickly join the second distributed ledger, effectively reduce the interaction overhead between nodes, simplify the process of joining and exiting the distributed ledger of the node, and improve the performance and resource utilization rate of the node and the distributed ledger.

[0255] The method shown in FIG. 5 is further described below in combination with FIGS. 9 and 10.

[0256] FIG. 9 is an interaction flow diagram of another communication method according to an embodiment of the application. In FIG. 8, the first node is DLE0, the second node is DLE2, and the third node is DLE1 or DLAF1. DLE0 and DLE1 belong to the first distributed ledger, and DLE2 belongs to the second distributed ledger.

[0257] As shown in FIG. 9, the communication method includes the following steps.

[0258] S901, DLE0 obtains distributed ledger information and saves it to a distributed ledger list.

[0259] Specifically, the pre-acquired distributed ledger information of the DLE0 includes identification information of the first distributed ledger and the second distributed ledger and node information containing addresses (e.g., IP addresses) of one or more nodes.

[0260] S902, the DLE0 sends first request information to the DLE2. Correspondingly, the DLE2 receives the first request information.

[0261] The first request information indicates that the DLE0 joins the first distributed ledger, and the first request information indicates identification information of the first distributed ledger and identification information of the second distributed ledger.

[0262] The DLE2 determines whether the DLE0 has the capability to join the second distributed ledger, for example, whether attribute information in configuration information of the first distributed ledger to which the DLE0 belongs is same as attribute information in configuration information of the second distributed ledger or whether the attribute information in the configuration information of the second distributed ledger is a subset of the attribute information in the configuration information of the first distributed ledger, etc. When the DLE2 determines that the DLE0 has the capability to join the second distributed ledger, the DLE2 determines to allow the DLE0 to join the second distributed ledger.

[0263] Optionally, S903a, the DLE2 sends second request information to the DLE1. Correspondingly, the DLE1 receives the second request information.

[0264] The description of the second request information can be referred to the description in the method embodiment shown in FIG. 6, and will not be repeated here.

[0265] Optionally, S903b, the DLE1 determines whether to maintain the connection between the DLE0 and the first distributed ledger.

[0266] Optionally, S903c, the DLE1 sends second response information to the DLE2. Correspondingly, the DLE2 receives the second response information.

[0267] The description of the second response information can be referred to the description in the method embodiment shown in FIG. 6, and will not be repeated here.

[0268] S904, the DLE2 determines the first response information.

[0269] The description of S904 can be referred to the description in the method embodiment shown in FIG. 6, and will not be repeated here.

[0270] S905, the DLE2 sends the first response information to the DLE0. Correspondingly, the DLE0 receives the first response information.

[0271] S906, the DLE0 performs joining the second distributed ledger.

[0272] Specifically, the DLE0 updates a current configuration file or starts a new program to join the second distributed ledger according to the configuration information issued by the DLE2.

[0273] Optionally, the DLE0 exits the first distributed ledger at S907.

[0274] After the DLE0 successfully joins the second distributed ledger, data about the second distributed ledger can be transmitted between the DLE0 and the DLE2. If the DLE0 is configured to be a node supporting saving the ledger, for example, a full node, the DLE2 needs to synchronize the ledger data to the DLE0.

[0275] It should be noted that in the above FIG. 9, the DLE0 can be a UE, the DLE1 can be a base station, and the DLE2 can be an NF. The DLE0 and the DLE1 can be directly connected (as shown in the above FIG. 9) or indirectly connected through other base stations or NFs (not shown in the figure). Similarly, the DLE1 and the DLE2 can be directly connected or indirectly connected through other base stations or NFs. For example, the DLE0 is a UE1, the DLE1 is a base station 1, and the DLE2 is a network element 1. The UE1 is connected to the base station 1 through a base station 2, that is, the communication between the UE1 and the base station 1 needs to be relayed through the base station 2 to be completed. In addition, there is a network element 2 between the base station 1 and the network element 1, that is, the base station 1 communicates with the network element 1 through the network element 2.

[0276] FIG. 10 is an interaction flow diagram of another communication method according to an embodiment of the present application. In FIG. 10, a first node is a DLE0, a second node is a DLE1, and a fourth node is a DLE2 or a DLAF2. The DLE0 and the DLE1 belong to a first distributed ledger, and the DLE2 belongs to a second distributed ledger. As shown in FIG. 10, the communication method comprises the following steps:

[0277] S1001, the DLE0 acquires distributed ledger information and saves it to a distributed ledger list.

[0278] S1002, the DLE0 sends first request information to the DLE1. Correspondingly, the DLE1 receives the first request information.

[0279] The first request information indicates that the DLE0 joins the second distributed ledger. The first request information indicates identification information of the first distributed ledger and identification information of the second distributed ledger.

[0280] S1003, the DLE1 sends third request information to the DLE2. Correspondingly, the DLE2 receives the third request information.

[0281] Optionally, the third request information further indicates configuration information of the first distributed ledger or distributed ledger capability information of the DLE1.

[0282] Optionally, the third request information further indicates the permission of the DLE0 in the first distributed ledger.

[0283] S1004, the DLE2 determines the fourth response information.

[0284] The description of S1004 can refer to the description of the method embodiment shown in FIG. 7, which will not be repeated here.

[0285] S1005, the DLE2 sends the fourth response information to the DLE1. Correspondingly, the DLE1 receives the fourth response information. The fourth response information indicates whether the DLE0 is allowed to join the second distributed ledger.

[0286] Optionally, the fourth response information can carry the identification information of the DLE0 and the identification information of the second distributed ledger.

[0287] Optionally, the fourth response information can further indicate the permission of the DLE0 in the second distributed ledger and the configuration information of the second distributed ledger, etc.

[0288] S1006, the DLE1 determines the first response information.

[0289] For example, the DLE1 determines the first response information according to the fourth response information. Illustratively, the fourth response information indicates that the DLE0 is allowed to join the second distributed ledger, and the first response information indicates that the DLE0 is allowed to join the second distributed ledger, or the fourth response information indicates that the DLE0 is not allowed to join the second distributed ledger, and the first response information indicates that the DLE0 is not allowed to join the second distributed ledger, etc.

[0290] Optionally, S1007, the DLE1 judges whether to maintain the connection between the DLE0 and the first distributed ledger.

[0291] S1008, the DLE1 sends the first response information to the DLE0. Correspondingly, the DLE0 receives the first response information.

[0292] Optionally, the first response information can carry the identification information of the second distributed ledger.

[0293] Optionally, the first response information can further indicate the permission of the DLE0 in the second distributed ledger and the configuration information of the second distributed ledger, etc.

[0294] S1009, the DLE0 performs joining the second distributed ledger.

[0295] Optionally, S1010, the DLE0 exits the first distributed ledger.

[0296] When the DLE0 successfully joins the first distributed ledger, the DLE0 transmits data about the first distributed ledger with a node in the second distributed ledger. If the DLE0 is configured as a full node, the node needs to synchronize the ledger data to the DLE0.

[0297] When there is no node indicated to the DLE0 to establish a connection relationship with, the DLE0 can select any node from the node list in the second distributed ledger for communication.

[0298] Optionally, the specific forms and connection relationships of the DLE0, the DLE1 and the DLE2 can refer to the related description in the above FIG. 9, and they can be directly connected or indirectly connected, which will not be described here again.

[0299] The above is about how the first node joins the distributed ledger, and the following describes how the first node exits the distributed ledger.

[0300] The first node can exit the distributed ledger according to the device usage (for example, the current other functions occupy more resources, the distributed ledger is in a low priority, and thus the part of occupied computing and storage resources need to be released), the first node movement leading to disconnection with the DLAF or other nodes of the first distributed ledger, or due to user demand, network administrator (operator) configuration and other factors, the first node decides to exit the distributed ledger. When the first node wants to exit the second distributed ledger (only as an example), the first node indicates to the second node that the first node exits the second distributed ledger, or the first node can directly exit the second distributed ledger. Optionally, the first node can also passively exit the second distributed ledger, for example, the network administrator decides to delete the second distributed ledger. Details can be referred to the content shown in FIG. 10.

[0301] FIG. 11 is an interaction flow diagram of another communication method of the embodiment of the application. As shown in FIG. 11, the communication method comprises:

[0302] Optionally, the S1101, the first node sends second indication information to the second node. Correspondingly, the second node receives the second indication information.

[0303] When the first node wants to exit the first distributed ledger, the first node can send second indication information to the second node, and the second indication information indicates that the first node exits the first distributed ledger. The second indication information can also indicate the identification information of the first distributed ledger, the identification information of the first node, etc.

[0304] S1102, the second node determines that the first node exits the first distributed ledger.

[0305] In the embodiments of the present application, the manner in which the second node determines that the first node exits the second distributed ledger can include the following manners:

[0306] Manner 1: The first node sends second indication information to the second node.

[0307] Manner 2: The second node does not receive data from the first node within a period of time.

[0308] Through the above method, the embodiments of the present application can support the second node to determine that the first node exits the second distributed ledger.

[0309] Optionally, the second node sends third indication information to the first node in S1103. Correspondingly, the first node receives the third indication information.

[0310] The third indication information is used to indicate that the first node exits the first distributed ledger. Specifically, when the first distributed ledger is deleted or the first node cannot meet the capability requirement of the first distributed ledger, the second node can instruct the first node to exit the first distributed ledger.

[0311] Optionally, the third indication information can also indicate a reason value, which is used to indicate the reason why the first node exits the first distributed ledger, etc. For example, the reason can include but is not limited to that the first distributed ledger has completed the task, or the first node cannot meet the capability requirement of the first distributed ledger, etc.

[0312] In S1104, the second node updates the node list of the first distributed ledger.

[0313] After the second node determines that the first node exits the first distributed ledger, the second node can update the node list of the first distributed ledger.

[0314] Through the above scheme, the embodiments of the present application can support establishing a mechanism for the first node to exit the distributed ledger, thereby supporting better management of the distributed ledger.

[0315] In the embodiments of the present application, the first node and the second node can both be devices in a communication network, for example, the first node is a terminal device or a network device, and the second node is a network device, etc. Correspondingly, the above information can be information transmitted between devices in the communication network, for example, the first request information and the first response information are information transmitted between a terminal device and a network device (the network device includes an access network device and a core network element, etc.), or the first request information and the first response information are information transmitted between network devices. When the first information and the second information are information transmitted between devices in the communication network, the embodiments of the present application can support introducing or applying the distributed ledger technology in the communication network.

[0316] III. Communication device

[0317] To implement the functions in the methods provided in the present application, the first node and the second node can each include hardware structures and / or software modules to implement the functions in the form of hardware structures, software modules, or hardware structures plus software modules. Whether a certain function is implemented in the form of hardware structure, software module, or hardware structure plus software module depends on specific application and design constraints of the technical solutions.

[0318] FIG. 12 is a schematic block diagram of a communication apparatus 1200 according to an embodiment of the present application. The communication apparatus 1200 includes processing circuitry 1210 and transceiver circuitry 1220, which can be connected or coupled to each other, such as through a bus 1230. The communication apparatus 1200 can be the first node or the second node.

[0319] Optionally, the communication apparatus 1200 can further include a memory 1240. The memory 1240 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read only memory (EPROM), or a compact disc read-only memory (CD-ROM). The memory 1240 is any other medium capable of storing and carrying desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto. The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing computer programs or instructions, and / or data.

[0320] The processing circuitry 1210 can be all or part of one or more processors, or be one or more processors. The processor can be a central processing unit (CPU). In the case where the processing circuitry 1210 is a CPU, the CPU can be a single core CPU, or a multi-core CPU. The processing circuitry 1210 can be a signal processor, a chip, or other integrated circuits capable of implementing the methods of the present application, or part of the foregoing processors, chips, or integrated circuits used for processing functions. In addition, the transceiver circuitry 1220 can also be a transceiver, or an input / output interface, which is used for input or output of signals or data, and can also be referred to as an input / output circuit.

[0321] When the communication apparatus 1200 is the first node, the processing circuit 1210 is configured to perform operations such as: sending the first request information and receiving the first response information, etc.

[0322] When the communication apparatus 1200 is the second node, the processing circuit 1210 is configured to perform operations such as: receiving the first request information; determining the first response information; sending the first response information, etc.

[0323] When the communication apparatus 1200 is the first node or the second node, it will be responsible for performing the methods or steps in the foregoing method embodiments related to the first node or the second node.

[0324] When the communication apparatus 1200 is the first node or the second node, the transceiver circuit 1220 can be a transceiver.

[0325] When the communication apparatus 1200 is a chip for the first node or the second node, the transceiver circuit 1220 can be an input / output circuit, a pin, etc.

[0326] The foregoing description is only an exemplary description. The specific content can refer to the content shown in the foregoing method embodiments.

[0327] The implementation of each operation in FIG. 12 can also correspond to the description of the corresponding method embodiments shown in FIGS. 5-11.

[0328] FIG. 13 is a schematic block diagram of a communication apparatus 1300 according to an embodiment of the present application. The communication apparatus 1300 can be a first node or a second node, and is configured to implement the methods related by the foregoing embodiments.

[0329] The communication apparatus 1300 includes a transceiver unit 1310 and a processing unit 1320. The transceiver unit 1310 can include a sending unit and a receiving unit. The sending unit is configured to perform the sending actions of the communication apparatus, and the receiving unit is configured to perform the receiving actions of the communication apparatus. For ease of description, the sending unit and the receiving unit are combined into one transceiver unit in the embodiments of the present application. This is uniformly described here, and will not be described again hereinafter.

[0330] When the communication apparatus 1300 is the first node, the transceiver unit 1310 is configured to send the first request information and receive the first response information; and the processing unit 1320 is configured to determine the first request information, etc.

[0331] When the communication apparatus 1300 is the second node, the transceiver unit 1310 is configured to: receive the first request information and send the first response information; and the processing unit 1320 is configured to determine the first response information, etc.

[0332] The communication apparatus 1300 is responsible for performing one or more of the methods or steps associated with the first node or the second node in the foregoing method embodiments when the communication apparatus 1300 is the first node or the second node.

[0333] Optionally, the communication apparatus 1300 further comprises a storage unit 1330 for storing programs or codes for implementing the foregoing methods.

[0334] The transceiver unit in FIG. 13 can correspond to the transceiver circuit in FIG. 12, and the processing unit in FIG. 13 can correspond to the processing circuit in FIG. 12.

[0335] The apparatus embodiments shown in FIG. 12 and FIG. 13 are used to implement the content described in FIG. 5 to FIG. 11. The specific execution steps of the apparatus shown in FIG. 12 and FIG. 13 can refer to the content described in the foregoing method embodiments.

[0336] The present application also provides a chip comprising a processor, which is configured to invoke and run instructions stored in a memory, so that a communication device installed with the chip performs the method in any of the examples described above. The memory can be integrated in the chip, or located outside the chip.

[0337] The present application also provides another chip comprising an input interface, an output interface, and a processing circuit, wherein the input interface, the output interface, and the processing circuit are connected through internal connection paths, and the processing circuit is configured to execute codes in a memory, and when the codes are executed, the processing circuit is configured to perform the method in any of the examples described above.

[0338] Optionally, the chip further comprises a memory for storing computer programs or codes. The input interface and the output interface can be independent of each other, or can be integrated into an input-output interface.

[0339] The processing circuit can be all or part of one or more processors, or one or more processors.

[0340] The present application also provides a processor configured to be coupled with a memory, and configured to perform the method and functions related to the network device or the terminal device in any of the embodiments described above.

[0341] In another embodiment of the present application, a computer program product comprising instructions is provided, and when the computer program product is run on a computer, the method of the foregoing embodiments is implemented.

[0342] The present application also provides a computer program, and when the computer program is run on a computer, the method of the foregoing embodiments is implemented.

[0343] In another embodiment of the present application, a computer readable storage medium is provided, which stores a computer program, and the computer program is executed by a computer to implement the method in the foregoing embodiment.

[0344] It should be understood that, in the embodiments of the present application, the processor can be a CPU, and the processor can also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor.

[0345] In addition, the processor can also include one or a combination of central processing units (CPUs), baseband processors, digital signal processors (DSPs), microprocessor units (MPUs), microcontroller units (MCUs), graphics processing units (GPUs), field programmable gate arrays (FPGAs), artificial intelligence processors (AI processors) or neural network processors (Neural Processing Units, NPUs).

[0346] It should also be understood that the memory in the embodiments of the present application can be volatile or nonvolatile memory, or can include both volatile and nonvolatile memory. The nonvolatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically EPROM (EEPROM), or flash memory. The volatile memory can be cache, random access memory (RAM), which is used as external cache. By way of example, and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous dynamic RAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM). It is noted that the memory described herein is intended to include, without being limited to, these and any other suitable types of memory.

[0347] The above-described embodiments can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented by software, the above-described embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the processes or functions described in the embodiments of the present application are wholly or partially generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable apparatus. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center through a wired or wireless (such as infrared, wireless, microwave, etc.) manner. The computer-readable storage medium can be any available medium accessible by a computer or a data storage device such as a server, data center, etc. containing one or more available medium sets. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state disk.

[0348] It should be understood that the size of the sequence number of each process described above in various embodiments of the present application does not mean the order of execution, and the execution order of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0349] Those skilled in the art can appreciate that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solutions. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application. Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described here. In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the above-described device embodiments are only schematic, for example, the division of units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0350] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, i.e. can be located in one place or can be distributed to multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiment according to actual needs. In addition, the functional units in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present alone, or two or more units can be integrated in one unit. When the above functions are realized in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or the parts that make contributions to the prior art or parts of the technical solutions can be embodied in the form of software products, which are stored in a storage medium and include a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in each embodiment of the present application. The foregoing storage medium includes: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk, and various program code storage media.

[0351] Those skilled in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized in electronic hardware, or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on specific applications and design constraints of the technical solutions. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

Claims

1. A communication method characterized by comprising: The method comprises: sending first request information, the first request information being used for a first node to request to join a second distributed ledger, the first request information indicating identity information of a first distributed ledger to which the first node belongs and identity information of the second distributed ledger; receiving first response information, the first response information being used for responding to the first request information, the first response information indicating whether the first node is allowed to join the second distributed ledger.

2. The method of claim 1, wherein, The first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information further indicates identity information of the second distributed ledger.

3. The method of claim 2, wherein, The first response information further indicates at least one of the following: a permission of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used for the first node to join the second distributed ledger and communicate with other nodes contained in the second distributed ledger, and the indication information being used for indicating that attribute information in the configuration information of the second distributed ledger is the same as attribute information in configuration information of the first distributed ledger.

4. The method according to any one of claims 1 to 3, characterized in that, Before the sending of the first request information, the method further comprises: obtaining distributed ledger information, the distributed ledger information comprising identity information of one or more distributed ledgers and node information of the one or more distributed ledgers, the distributed ledger comprising the first distributed ledger and the second distributed ledger, and the node information comprising addresses of one or more nodes.

5. The method of claim 4, wherein, The distributed ledger information further comprises attribute information in configuration information of the second distributed ledger, the attribute information in the configuration information comprising at least one of the following: a consensus mechanism, a security algorithm, or a ledger technology.

6. The method according to any one of claims 1 to 5, characterized in that, The first response information further indicates that the first distributed ledger remains connected with the first node, and the first response information further indicates identity information of the first distributed ledger.

7. The method of any one of claims 1 to 6, wherein: the first request information and the first response information are information transmitted between a terminal-side device and a network-side device; or the first request information and the first response information are information transmitted between network-side devices.

8. The method according to any one of claims 1 to 7, characterized in that, The method further comprises: sending second indication information, the second indication information indicating that the first node exits the first distributed ledger, the second indication information indicating identity information of the first distributed ledger; or receiving third indication information, the third indication information indicating that the first node exits the first distributed ledger, the third indication information indicating identity information of the first distributed ledger.

9. A communication method characterized by comprising: The method comprises: receiving first request information, the first request information being used for a first node to request to join a second distributed ledger, the first request information indicating identity information of a first distributed ledger to which the first node belongs and identity information of the second distributed ledger; sending first response information, the first response information being used for responding to the first request information, and the first response information indicating whether the first node is allowed to join the second distributed ledger.

10. The method of claim 9, wherein, Before the sending of the first response information, the method further includes: obtaining configuration information of the first distributed ledger and configuration information of the second distributed ledger; determining the first response information based on the configuration information of the first distributed ledger and the configuration information of the second distributed ledger.

11. The method of claim 10, wherein, The determining of the first response information based on the configuration information of the first distributed ledger and the configuration information of the second distributed ledger includes: if attribute information in the configuration information of the first distributed ledger is same as attribute information in the configuration information of the second distributed ledger, or if the attribute information in the configuration information of the first distributed ledger includes all attribute information in the configuration information of the second distributed ledger, determining the first response information, the first response information indicating that the first node is allowed to join the second distributed ledger, and the attribute information including at least one of the following: a security algorithm, a consensus mechanism or a ledger technology.

12. The method according to any one of claims 9 to 11, characterized in that, The first response information indicates that the first node is allowed to join the second distributed ledger, and the first response information further indicates identification information of the second distributed ledger.

13. The method of claim 12, wherein, The first response information further indicates at least one of the following: a permission of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used for the first node to join the second distributed ledger and communicate with other nodes contained in the second distributed ledger, and the indication information being used for indicating that attribute information in the configuration information of the second distributed ledger is same as attribute information in the configuration information of the first distributed ledger.

14. The method according to any one of claims 10 to 13, characterized in that, The obtaining of the configuration information of the first distributed ledger and the configuration information of the second distributed ledger includes: sending second request information, the second request information being used for requesting the configuration information of the first distributed ledger, and the second request information further indicating identification information of the first distributed ledger and identification information of the first node; receiving second response information, the second response information being used for responding to the second request information, and the second response information further indicating the configuration information of the first distributed ledger.

15. The method of claim 14, wherein, The second response information further indicates a permission of the first node in the first distributed ledger.

16. The method according to claim 14 or 15, characterized in that The second response information further indicates whether the first distributed ledger continues to maintain a connection with the first node, and the second response information further indicates identification information of the first distributed ledger, the second response information being related to the first response information.

17. The method of claim 9, wherein, Before the sending of the first response information, the method further includes: sending third request information, the third request information being used for requesting to determine whether the first node is allowed to join the second distributed ledger, and the third request information further indicating identification information of the first node and identification information of the second distributed ledger; receiving third response information, the third response information being used for responding to the third request information, the third response information being used for determining the first response information.

18. The method of claim 17, wherein, The third request information further comprises configuration information of the first distributed ledger and a right of the first node in the first distributed ledger.

19. The method of claim 17 or 18, wherein, The third response information indicates that the first node is allowed to join the second distributed ledger, and the third response information further indicates identification information of the second distributed ledger and identification information of the first node.

20. The method of claim 19, wherein, The third response information further indicates at least one of the following: a right of the first node in the second distributed ledger, configuration information of the second distributed ledger, or indication information, the configuration information of the second distributed ledger being used for the first node to join the second distributed ledger and communicate with other nodes contained in the second distributed ledger, and the indication information being used for indicating that the configuration information of the second distributed ledger is the same as the configuration information of the first distributed ledger.

21. The method according to any one of claims 17 to 20, characterized in that, The first response information further indicates whether the first distributed ledger continues to maintain a connection with the first node, and the first response information further indicates identification information of the first distributed ledger.

22. The method of any one of claims 9-21, wherein The first request information and the first response information are information transmitted between a terminal-side device and a network-side device; or The first request information and the first response information are information transmitted between network-side devices.

23. The method of any one of claims 9 to 22, wherein, The first response information indicates that the first node is allowed to join the second distributed ledger, and the method further comprises: updating a node list of the second distributed ledger, the updated node list containing the first node.

24. The method of any one of claims 9 to 23, wherein, The method further comprises: determining that the first node exits the first distributed ledger; updating a node list of the first distributed ledger, the updated node list not containing the first node.

25. A communications device, characterized by comprising a unit or module for performing the method of any one of claims 1-24.

26. A communications device, characterized by comprising a processor configured to cause the communication device to perform the method of any one of claims 1-24 by executing computer programs or instructions, and / or by a logic circuit.

27. The communication apparatus according to claim 26, wherein The communication device further comprises a memory for storing the computer programs or instructions.

28. The communication apparatus according to claim 26 or 27, wherein, The communication device further comprises a communication interface for inputting and / or outputting signals.

29. A computer-readable storage medium, characterized in that, The computer readable storage medium has stored thereon computer programs or instructions which, when executed on a computer, cause the method of any one of claims 1-24 to be performed.

30. A computer program product, characterised in that, comprising instructions which, when executed on a computer, cause the method of any one of claims 1-24 to be performed.

31. A chip, characterized by comprising a processor configured to perform the method of any one of claims 1-24.

Images