Communication method and device, equipment, chip and storage medium

Abstract

The embodiment of the invention provides a communication method, and the method comprises the steps: receiving first information from a first network element, the first information being used for indicating at least one second node meeting the condition of executing a VFL task; and determining at least one participating node participating in the VFL task from the at least one second node. In the method, a first node initiating a VFL task can receive first information from a first network element, and can acquire at least one second node meeting a condition for executing the VFL task through the first information, so as to ensure that the first node can find a proper node to perform the VFL task.

Description

Communication method, device, equipment, chip and storage medium Technical Field

[0001] The embodiments of the present application relate to the field of communication technology, and specifically to a communication method, apparatus, device, chip, and storage medium. Background Art

[0002] Vertical Federated Learning (VFL) allows artificial intelligence systems to efficiently and accurately use local data from multiple nodes while meeting data privacy, security, and regulatory requirements. This breaks down data silos and enables cross-domain, multi-node data sharing while ensuring privacy and security.

[0003] However, there is currently no solution that reveals how existing network architectures (such as 5G network architectures) can support cross-domain vertical federated learning.

[0004] Summary of the Invention

[0005] Embodiments of the present application provide a communication method, apparatus, device, chip, and storage medium.

[0006] In a first aspect, an embodiment of the present application provides a communication method, applied to a first node, the method comprising: receiving first information from a first network element, the first information being used to indicate at least one second node that meets the conditions for executing a VFL task; and determining at least one participating node participating in the VFL task from the at least one second node.

[0007] In the second aspect, an embodiment of the present application provides a communication method applied to a second node, the method comprising: sending capability information of the second node to a first network element, the capability information of the second node being used to determine whether the second node meets the conditions for performing a vertical federated learning VFL task.

[0008] In a third aspect, an embodiment of the present application provides a communication method applied to a first network element, the method comprising: obtaining capability information of at least one second node, the capability information of the second node being used to determine whether the second node meets the conditions for performing a vertical federated learning VFL task.

[0009] In a fourth aspect, an embodiment of the present application provides a communication device, comprising: a first receiving module, configured to receive first information from a first network element, the first information being used to indicate at least one second node that meets the conditions for performing a vertical federated learning (VFL) task; and a determination module, configured to determine at least one participating node participating in the VFL task from at least one second node.

[0010] In the fifth aspect, an embodiment of the present application provides a communication device, which includes: a first sending module, configured to send capability information of the device to a first network element, and the capability information of the device is used to determine whether the device meets the conditions for performing vertical federated learning VFL tasks.

[0011] In a sixth aspect, an embodiment of the present application provides a communication device, which includes: an acquisition module, configured to obtain capability information of at least one second node, and the capability information of the second node is used to determine whether the second node meets the conditions for performing the vertical federated learning VFL task.

[0012] In the seventh aspect, an embodiment of the present application provides a communication device, which includes a memory and a processor; wherein the memory is used to store computer-executable instructions; the processor is connected to the memory and is used to implement the method described in any one of the first to third aspects by executing the computer-executable instructions.

[0013] In an eighth aspect, an embodiment of the present application provides a chip, comprising: a processor configured to call and execute a computer program from a memory, so that a device equipped with the chip executes the method described in any one of the first to third aspects.

[0014] In a ninth aspect, an embodiment of the present application provides a computer-readable storage medium storing a computer program, which implements the method described in any one of the first to third aspects when the computer program is executed by at least one processor.

[0015] In an embodiment of the present application, a first node may receive first information from a first network element, where the first information indicates at least one second node that meets the requirements for executing a VFL task. Furthermore, the first node may determine at least one participating node from the at least one second node to participate in the VFL task. This ensures that the first node can find a suitable node to perform the VFL task. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0017] FIG1 is a schematic diagram of an application scenario of an embodiment of the present application;

[0018] Figure 2 is a schematic diagram of an example of the VFL training process;

[0019] FIG3 is a schematic diagram of an example of the VFL inference process;

[0020] FIG4 is a schematic diagram of an example of a 5G network architecture;

[0021] FIG5 is a flow chart of a communication method provided in an embodiment of the present application;

[0022] FIG6 is a flow chart of another communication method provided in an embodiment of the present application;

[0023] FIG7 is a first schematic diagram of a possible implementation flow of a communication method provided in an embodiment of the present application;

[0024] FIG8 is a second schematic diagram of a possible implementation flow of the communication method provided in an embodiment of the present application;

[0025] FIG9 is a third schematic diagram of a possible implementation flow of the communication method provided in an embodiment of the present application;

[0026] FIG10 is a first structural diagram of a communication device according to an embodiment of the present application;

[0027] FIG11 is a second structural diagram of a communication device provided in an embodiment of the present application;

[0028] FIG12 is a third structural diagram of a communication device provided in an embodiment of the present application;

[0029] FIG13 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0030] FIG14 is a schematic structural diagram of a chip according to an embodiment of the present application;

[0031] FIG15 is a schematic block diagram of a communication system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0032] The following will describe the technical solutions in the embodiments of this application in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0033] FIG1 is a schematic diagram of an application scenario of an embodiment of the present application.

[0034] As shown in Figure 1, a communication system 100 may include a terminal device 110 and a network device 120. The network device 120 may communicate with the terminal device 110 via an air interface. The terminal device 110 and the network device 120 support multi-service transmission.

[0035] It should be understood that the embodiments of the present application are only illustrative of the communication system 100, but the embodiments of the present application are not limited thereto. That is, the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: Long Term Evolution (LTE) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Internet of Things (IoT) system, Narrow Band Internet of Things (NB-IoT) system, enhanced Machine-Type Communications (eMTC) system, 5G communication system (also known as New Radio (NR) communication system), or future communication systems (such as 6G communication system).

[0036] In the communication system 100 shown in Figure 1, the network device 120 may be an access network device that communicates with the terminal device 110. The access network device may provide communication coverage for a specific geographical area and may communicate with the terminal device 110 (eg, UE) located within the coverage area.

[0037] The network device 120 may be an evolved Node B (eNB or eNodeB) in a Long Term Evolution (LTE) system, or a Next Generation Radio Access Network (NG RAN) device, or a base station (gNB) in an NR system, or a wireless controller in a Cloud Radio Access Network (CRAN), or the network device 120 may be a relay station, an access point, an in-vehicle device, a wearable device, a hub, a switch, a bridge, a router, or a network device in a future evolved Public Land Mobile Network (PLMN), etc.

[0038] The terminal device 110 may be any terminal device, including but not limited to a terminal device connected to the network device 120 or other terminal devices by wire or wireless connection.

[0039] For example, the terminal device 110 may refer to an access terminal, user equipment (UE), a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user apparatus. An access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, an IoT device, a satellite handheld terminal, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network, or a terminal device in a future evolution network, etc.

[0040] The terminal device 110 can be used for device-to-device (D2D) communication.

[0041] The wireless communication system 100 may further include a core network device 130 for communicating with the network device 120 , and the core network device 130 may be a 5G core network (5G Core, 5GC) device.

[0042] Figure 1 exemplarily shows a network device, a core network device and two terminal devices. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include other numbers of terminal devices within its coverage area, which is not limited in this embodiment of the present application.

[0043] It should be noted that Figure 1 is merely an example of a system applicable to this application. Of course, the methods described in the embodiments of this application can also be applied to other systems. Furthermore, the terms "system" and "network" are often used interchangeably herein. The term "and / or" herein simply describes an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " generally indicates that the associated objects are in an "or" relationship. It should also be understood that the "indication" mentioned in the embodiments of this application can be a direct indication, an indirect indication, or an indication of an association relationship. For example, "A indicates B" can mean that A directly indicates B, for example, B can obtain information through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can obtain information through C; or it can mean that A and B have an association relationship. It should also be understood that the "correspondence" mentioned in the embodiments of this application can mean that there is a direct or indirect correspondence between two objects, or that there is an association relationship between the two objects, or a relationship between an indicator and the indicated, a configuration and the configured, and so on. It should also be understood that the “predefined” or “predefined rules” mentioned in the embodiments of the present application can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in devices (for example, including terminal devices and network devices), and the present application does not limit its specific implementation method. For example, predefined can refer to what is defined in the protocol. It should also be understood that in the embodiments of the present application, the “protocol” may refer to a standard protocol in the field of communications, such as LTE protocols, NR protocols, and related protocols used in future communication systems, and the present application does not limit this.

[0044] To generate artificial intelligence (AI) models that better meet user needs, model training requires more dimensional user data. In real-world scenarios, user data may be distributed across various nodes, including terminals, base stations, core networks, and third-party OTT (Over the Top) application servers. If model training can be performed by combining the different feature data of the same user across various nodes, the model training effect will be greatly improved, which is of great significance to model training. However, multi-domain data sharing across multiple nodes poses a significant challenge to data privacy. To this end, the VFL method can be adopted. VFL allows AI systems to efficiently and accurately use local data from multiple nodes while meeting data privacy, security, and regulatory requirements. This allows AI systems to break down data silos and achieve cross-domain multi-node data sharing while ensuring privacy and security. However, no solution currently exists to explain how existing network architectures can support cross-domain VFL.

[0045] In view of this, the present application provides a communication method, in which a first node can receive first information from a first network element, and can obtain at least one second node that meets the conditions for performing the VFL task through the first information, so as to ensure that the first node can find a suitable node to perform the VFL task.

[0046] To facilitate understanding of the technical solutions of the embodiments of the present application, the relevant technologies of the embodiments of the present application are described below. The following relevant technologies can be arbitrarily combined with the technical solutions of the embodiments of the present application as optional solutions, and they all fall within the protection scope of the embodiments of the present application.

[0047] 1. Vertical Federated Learning (VFL)

[0048] Figure 2 is a schematic diagram of the VFL training process. As shown in Figure 2, nodes A and B are in different domains, and no raw data is exchanged between nodes A and B. To enable model training using data from multiple nodes, the VFL training process can include the following steps:

[0049] S201, encrypted sample alignment.

[0050] VFL is suitable for situations where participants' training sample IDs overlap significantly but data features overlap less. In VFL, participants' samples need to be aligned to increase the feature dimension of each sample without increasing the sample ID. For example, a UE in a certain area generates different feature data at different nodes in the communication system, where the UE ID is the sample ID. In this scenario, the feature data generated by the UE at different nodes needs to be aligned (correlated).

[0051] S202, encryption model training.

[0052] After the samples are aligned, model encryption training can be performed on the aligned samples, and then a federated model with better performance can be trained based on model A obtained by node A and model B obtained by node B. As an example, step 202 may include:

[0053] S1, distribute the public key.

[0054] As shown in Figure 2, a third-party coordinator, C, can send a public key to nodes A and B to encrypt the data to be transmitted. For example, a homomorphic encryption algorithm can be used for encryption. In a homomorphic encryption algorithm, the sum of two samples, m1 and m2, is homomorphically encrypted. This is equivalent to the sum of the homomorphic encryption of m1 and the homomorphic encryption of m2. The homomorphic encryption of sample m multiplied by a constant is equivalent to the homomorphic encryption of sample m multiplied by the constant.

[0055] S2, exchange intermediate results.

[0056] In VFL, the party with the sample label can be the active party (or the demander), such as node B in Figure 2. Node A can be the passive party (or the data provider), which does not have a sample label. In this step, nodes A and B can each use their own local data to perform calculations to obtain the intermediate results of the model. Node A can encrypt the intermediate results and send them to node B. Node B can then calculate the overall output error of the model based on its own label and the model output results (intermediate results) of nodes A and B, and encrypt the output error and send it to node A.

[0057] S3, calculate the gradient.

[0058] In this step, node A and node B can respectively calculate their own encrypted gradients based on the output error in S2, and send the calculation results to coordinator C after adding a mask.

[0059] S4, update model.

[0060] After coordinator C decrypts the gradients sent by nodes A and B, it can send the decrypted gradients back to nodes A and B. Thus, after removing the gradient masks, nodes A and B can update their respective models based on the obtained gradients.

[0061] Figure 3 is a schematic diagram of an example of the VFL inference process. As shown in Figure 3, the VFL inference process may include:

[0062] S301: Send a model inference request.

[0063] Coordinator C may send a model inference request to node A and node B respectively. The model inference request may include the ID of the model that node A and node B need to adopt, so as to indicate the model that node A and node B need to adopt.

[0064] S302: Node A and node B calculate the model results and encrypt them.

[0065] In this step, node A and node B can respectively perform calculations based on their own data and the locally stored model to obtain an intermediate result of the model, and encrypt the intermediate result.

[0066] S303 , node A and node B send the encrypted intermediate result to coordinator C.

[0067] S304, the coordinator C aggregates the encrypted intermediate results from each node and decrypts them.

[0068] In this step, coordinator C aggregates the encrypted intermediate results of nodes A and B to obtain an encrypted model inference result. Coordinator C then decrypts the model inference result and sends the decrypted inference result to node B, the demand side.

[0069] 2. Fifth Generation (5G) Network Architecture

[0070] A key feature of the 5G network architecture is the "service-based architecture," in which core network elements (service providers) can provide specific services and make them available to other network elements (consumers) through defined application programming interfaces (APIs).

[0071] It should be understood that the "core network element" in the embodiment of the present application can also be called "core network function (NF)".

[0072] Figure 4 is a schematic diagram of an example of a 5G network architecture. As shown in Figure 4, the network architecture may include UE, access network (AN) / radio access network (RAN) and core network elements. Among them, the core network elements include: User Plane Function (UPF), Data Network (DN), Session Management Function (SMF), Access and Mobility Management Function (AMF), Network Slice Selection Function (NSSF), Authentication Server Function (AUSF), Network Exposure Function (NEF), Network Function Repository Function (NRF), Policy Control Function (PCF), Unified Data Management (UDM) and Application Function (AF).

[0073] The UE establishes an access stratum (AS) connection with the base station for exchanging access stratum messages and wireless data transmission. The UE establishes a non-access stratum (NAS) connection with the AMF for exchanging NAS messages. The AMF is responsible for managing UE mobility, and the SMF is responsible for managing UE sessions. In addition to managing the mobility of mobile terminals, the AMF is also responsible for forwarding session management-related messages between the UE and SMF. The PCF is responsible for formulating policies related to UE mobility management, session management, and billing. The UPF connects to the base station and external data network and performs data transmission.

[0074] In addition, the 5G network has added a Network Data Analytics Function (NWDAF) to the core network. This function can collect data from various network elements and network management systems in the core network and perform big data statistics, analysis, or intelligent data analysis to obtain network-side analysis and / or prediction data, thereby assisting each network element to more effectively control UE access based on the data analysis results.

[0075] The following is a brief introduction to each network element shown in FIG4 .

[0076] 1) UE: can be referred to as terminal equipment, access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device, etc. The embodiments of the present application do not limit the specific technology and specific device form used by the UE.

[0077] 2) (Radio) Access Network (R)AN) equipment: can provide authorized users in a specific area with the function of accessing the communication network, and can specifically include wireless network equipment in the 3rd Generation Partnership Project (3GPP) network and can also include access points in non-3GPP (Non-3GPP) networks. The embodiments of this application do not limit the specific technology and specific device form used by the (R)AN equipment.

[0078] 3) AMF: Mainly used for access control, mobility management, attachment and detachment functions. The AMF also serves as the anchor point for N1 signaling (i.e., signaling of the N1 interface, referred to as N1 signaling for simplicity) and N2 signaling (i.e., signaling of the N2 interface, referred to as N2 signaling for simplicity), providing routing for N1 / N2 session management (SM) messages for the SMF. The AMF also maintains and manages UE status information.

[0079] 4) SMF: Mainly used for user-plane network element selection, user-plane network element redirection, Internet Protocol (IP) address allocation for terminal devices, as well as session establishment, modification and release and QoS control.

[0080] 5) UPF: Mainly responsible for receiving and forwarding user plane data. For example, the UPF can receive user plane data from the DN and send it to the terminal device via the AN device. The UPF can also receive user plane data from the terminal device via the AN device and forward it to the DN.

[0081] 6) PCF: A unified policy framework mainly used to guide network behavior and provide policy rule information to control plane network elements (such as AMF, SMF, etc.).

[0082] 7) AF: Mainly used to provide services to the 3GPP network, such as interacting with the PCF for policy control.

[0083] 8) UDM: Primarily used for UE subscription data management, including storage and management of UE identities and UE access authorization. UDM can also generate 3GPP authentication credentials for UEs. UDM also registers and maintains network elements currently serving UEs.

[0084] 9) NEF: Mainly used to securely open the services and capabilities provided by 3GPP network functions to the outside world.

[0085] 10) DN: Operator network mainly used to provide data services to UE, such as the Internet, third-party service networks, IP Multimedia Service (IMS) network, etc.

[0086] 11)AUSF: Mainly used for user authentication, such as security authentication of UE when it accesses the network.

[0087] 12) NSSF: Mainly used to select a slice instance set for the UE, determine the AMF set and allowed network slice selection assistance information (NSSAI) (NSSAIs) for the UE.

[0088] In the network architecture shown in Figure 4, network elements can communicate with each other through the interfaces shown in the figure. Some interfaces can be implemented as service-oriented interfaces. As shown in Figure 4, the UE and AMF can communicate through the N1 interface. The RAN and AMF can communicate through the N2 interface. The RAN and UPF can communicate through the N3 interface, which can be used to transmit user plane data, etc. The SMF and UPF can communicate through the N4 interface. The UPF and DN can communicate through the N6 interface. The UPF and UPF can communicate through the N9 interface, which can be used to transmit uplink and downlink user data flows between UPFs, etc. The relationship between other interfaces and network elements is shown in Figure 4 and is not described in detail here for the sake of brevity.

[0089] It should be understood that the above naming is defined only to facilitate the distinction between different functions and should not constitute any limitation to this application. This application does not exclude the possibility of adopting other naming in 6G networks and other future networks. For example, in a 6G network, some or all of the above network elements may continue to use the terminology used in 5G, or may adopt other names.

[0090] It should also be understood that the interface names between the various network elements in Figure 4 are merely examples, and in specific implementations, the interface names may be other names, which are not specifically limited in this application. In addition, the names of the messages (or signaling) transmitted between the various network elements are merely examples and do not constitute any limitation on the functions of the messages themselves.

[0091] The above briefly explains the terms involved in this application, which will not be repeated in the following embodiments.

[0092] To facilitate understanding of the technical solutions of the embodiments of the present application, the technical solutions of the present application are described in detail below through specific embodiments. The above related technologies can be combined arbitrarily with the technical solutions of the embodiments of the present application as optional solutions, and all of them fall within the scope of protection of the embodiments of the present application. The embodiments of the present application include at least part of the following contents.

[0093] It should be understood that the first node in the embodiment of the present application represents the node that initiates the VFL task, or in other words, the first node is the initiator of the VFL task (or called the active party / demand party), that is, the VFL task in the embodiment of the present application can be initiated by the first node. Correspondingly, the second node represents a node that can participate in the VFL task as a non-initiator, or in other words, the second node can serve as the passive party of the VFL task (or called the data provider). The number of the second node can be one, or it can be multiple (two or more), and the embodiment of the present application is not limited to this.

[0094] It should also be understood that the first node of the embodiment of the present application may be, for example, a terminal device, an access network element, a core network element (core network NF) or an AF; the second node may include, for example, at least one of the following: a terminal device, an access network element, a core network element and an AF; the first network element may be, for example, an NRF. Among them, the AF may be a trusted AF (such as the operator's own AF), or it may also be an untrusted third-party AF (such as an AF from another manufacturer). Among them, whether the AF is a trusted AF can be confirmed or identified by the core network. For example, if the core network belongs to the core network deployed by operator A, the core network can confirm or identify the AF belonging to the operator A as a trusted AF, and can confirm or identify the AF that does not belong to the operator A as an untrusted third-party AF.

[0095] FIG5 shows a communication method provided by an embodiment of the present application, which may include:

[0096] S501: A first node receives first information from a first network element, where the first information is used to indicate at least one second node that meets a condition for executing a VFL task.

[0097] In one possible manner, the VFL task is initiated by the first node, so “meeting the conditions for executing the VFL task” can also be understood as meeting the conditions for executing the VFL task initiated by the first node.

[0098] As an implementation manner, the first node may initiate the VFL task by sending second information to the first network element. Exemplarily, the second information may be used to indicate at least one of the following:

[0099] 1) Execute the VFL task, or in other words, the task type initiated by the first node is a VFL task.

[0100] 2) The time period for executing the VFL task, or in other words, the time period expected by the first node to execute the VFL task, such as 9:00 to 21:00.

[0101] 3) Acting as the initiator of the VFL task, or in other words, the first node expects to act as the initiator of the VFL task;

[0102] 4) The computing power required to execute the VFL task, such as the minimum computing power required to execute the VFL task initiated by the first node;

[0103] 5) A service area for executing the VFL task, or in other words, a service area expected by the first node to execute the VFL task.

[0104] In one possible approach, after receiving the second information from the first node, the first network element may send the first information to the first node, thereby indicating to the first node at least one second node that meets the requirements for executing the VFL task. In response, the first node may receive the first information from the first network element. In this way, the first node can learn about the at least one second node that meets the requirements for executing the VFL task through the first information, thereby ensuring that the first node can find a suitable node to perform the VFL task.

[0105] As an example, the first information may carry identification and / or address information of at least one second node that meets the conditions for executing the VFL task.

[0106] In some embodiments, whether the second node meets the conditions for performing the VFL task is determined by the first network element based on the capability information of the second node, or in other words, the first network element can determine whether the second node meets the conditions for performing the VFL task based on the capability information of the second node.

[0107] Exemplarily, the capability information of the second node may be used to indicate at least one of the following:

[0108] 1) Whether the second node supports executing the VFL task. For example, the capability information of the second node may include an indication of whether the second node supports executing the VFL task, to indicate whether the second node supports executing the VFL task or does not support executing the VFL task.

[0109] 2) The time period during which the second node supports the execution of the VFL task. For example, the capability information of the second node may indicate that the second node can execute the VFL task between 9:00 and 21:00.

[0110] 3) Whether the second node can serve as the initiator of the VFL task. For example, the capability information of the second node may include an indication of whether the second node can serve as the initiator of the VFL task, indicating whether the second node can serve as the initiator of the VFL task or cannot serve as the initiator of the VFL task.

[0111] 4) The computing power of the second node, such as the highest computing power or computing power range that the second node can provide.

[0112] 5) Service area of ​​the second node: When the second node is an access network element, the service area of ​​the second node can also be understood as the signal coverage area of ​​the access network element.

[0113] For example, assuming that the second information indicates that the time period for the first node to perform the VFL task is expected to be from 9:00 to 21:00, and the service area expected to perform the VFL task is the first service area, then, after receiving the second information from the first node, the first network element can compare the capability information of each second node collected or stored by the first network element with the content of the second information, determine that it supports performing the VFL task between 9:00 and 21:00, and the service area includes at least one second node in the first service area, and carry the information of the at least one second node (such as identification and / or address information) in the first information and send it to the first node.

[0114] In some embodiments, the capability information of the second node may be carried in parameter information of the second node and sent by the second node to the first network element. In this case, the method may further include: the second node sending the parameter information of the second node to the first network element. Accordingly, the first network element may receive and store the parameter information of the second node, or in other words, the first network element may collect or determine the parameter information of the second node. The parameter information of the second node may include, for example, at least one of the following: capability information of the second node; an identifier (ID) of the second node; address information of the second node; and an identifier of an application corresponding to the second node.

[0115] It can be understood that, when there are multiple second nodes, each second node can send parameter information of the second node to the first network element, and the parameter information of each second node includes at least one item of the above parameter information.

[0116] In some embodiments, each second node may send parameter information of each second node to the first network element before the first node initiates the VFL task, so that the first network element can collect parameter information of each second node before the first node initiates the VFL task. Furthermore, when the first node initiates the VFL task, the first network element may obtain capability information of each second node from the collected parameter information of each second node. Furthermore, the first network element may determine at least one second node that meets the conditions for executing the VFL task based on the capability information of each second node, and carry the information of the at least one second node (such as identification and / or address information) in the first information and send it to the first node.

[0117] S502: The first node determines at least one participating node participating in the VFL task from at least one second node.

[0118] Exemplarily, the first node may determine at least one participating node that participates in the VFL task from at least one second node that meets the conditions for executing the VFL task.

[0119] As an implementation, the first node determines at least one participating node to participate in the VFL task from at least one second node that meets the requirements for executing the VFL task, including: for a second node that agrees to participate in the VFL task initiated by the first node, determining the second node as a participating node to participate in the VFL task. In other words, if a second node meets the requirements for executing the VFL task and agrees to participate in the VFL task initiated by the first node, the first node may be determined as a participating node to participate in the VFL task.

[0120] In some embodiments, the method may further include: the first node sending data requirement information to at least one second node, wherein the data requirement information is used to determine data for performing the VFL task. Accordingly, each of the at least one second node may receive the data requirement information from the first node.

[0121] For example, data requirement information may include the type of data required to perform the VFL task and / or the validity period of the required data. The data type may include the data format (e.g., 8-bit quantization or 24-bit quantization) and the type of data content (e.g., application layer data, data related to device power consumption, data related to device communication performance, etc.).

[0122] In one possible approach, after receiving data request information from a first node, a second node can decide whether to participate in the VFL task initiated by the first node based on its local configuration or relevant policies. For example, if the second node has local data that meets the data request, it may agree to participate in the VFL task; if the second node does not have local data that meets the data request, it may refuse to participate in the VFL task. The second node can then reply to the first node with its decision on whether to participate in the VFL task.

[0123] For example, the second node may send a third message to the first node, including its decision on whether to participate in the VFL task. The method may also include the second node sending a third message to the first node, indicating whether the second node agrees to participate in the VFL task initiated by the first node. Accordingly, the first node may receive the third message from the second node. Based on the third message, the first node may determine whether the second node agrees to participate in the VFL task initiated by the first node.

[0124] FIG6 shows another communication method provided by an embodiment of the present application, which may include:

[0125] S601: A second node sends capability information of the second node to a first network element. Correspondingly, the first network element receives the capability information of the second node.

[0126] In this step, the second node may send its capability information to the first network element. The capability information of the second node may be used to characterize the second node's ability to perform VFL tasks. Based on the capability information of the second node, the first network element may determine whether the second node meets the requirements for performing VFL tasks. In other words, the first network element determines whether the second node meets the requirements for performing VFL tasks based on the capability information of the second node. Alternatively, the capability information of the second node may be used by the first network element to determine whether the second node meets the requirements for performing VFL tasks.

[0127] Exemplarily, the capability information of the second node may be used to indicate at least one of the following:

[0128] 1) Whether the second node supports executing the VFL task. For example, the capability information of the second node may include an indication of whether the second node supports executing the VFL task, to indicate whether the second node supports executing the VFL task or does not support executing the VFL task.

[0129] 2) The time period during which the second node supports the execution of the VFL task. For example, the capability information of the second node may indicate that the second node can execute the VFL task between 9:00 and 21:00.

[0130] 3) Whether the second node can serve as the initiator of the VFL task. For example, the capability information of the second node may include an indication of whether the second node can serve as the initiator of the VFL task, indicating whether the second node can serve as the initiator of the VFL task or cannot serve as the initiator of the VFL task.

[0131] 4) The computing power of the second node, such as the highest computing power or computing power range that the second node can provide.

[0132] 5) Service area of ​​the second node: When the second node is an access network element, the service area of ​​the second node can also be understood as the signal coverage area of ​​the access network element.

[0133] In some embodiments, the capability information of the second node may be carried in parameter information of the second node and sent by the second node to the first network element. In this case, the method may further include: the second node sending the parameter information of the second node to the first network element. Accordingly, the first network element may receive and store the parameter information of the second node, or in other words, the first network element may collect or determine the parameter information of the second node. The parameter information of the second node may include, for example, at least one of the following: capability information of the second node; an identifier (ID) of the second node; address information of the second node; and an identifier of an application corresponding to the second node.

[0134] It can be understood that, when there are multiple second nodes, the parameter information of each second node includes at least one item of the above parameter information.

[0135] In one example, the second node is a terminal. The terminal parameter information may include at least one of the following: terminal capability information, terminal identification, terminal address information (e.g., IP address), and terminal type (e.g., mobile phone, vehicle, etc.). The terminal capability information may indicate at least one of the following: whether the terminal supports executing VFL tasks, the time period during which the terminal supports executing VFL tasks, whether the terminal can serve as the initiator of VFL tasks, and the computing power of the terminal.

[0136] In another example, the second node is an access network element. The parameter information of the access network element may include at least one of the following: capability information of the access network element, an identifier of the access network element (e.g., a gNB ID), and address information of the access network element. The capability information of the access network element may indicate at least one of the following: whether the access network element supports executing VFL tasks, the time period during which the access network element supports executing VFL tasks, whether the access network element can serve as the initiator of VFL tasks, the computing power of the access network element, and the service area of ​​the access network element.

[0137] In another example, the second node is a core network element. The parameter information of the core network element may include at least one of the following: capability information of the core network element, address information of the core network element, and type of the core network element (such as SMF, AMF, etc.). The capability information of the core network element may be used to indicate at least one of the following: whether the core network element supports executing VFL tasks, the time period during which the core network element supports executing VFL tasks, whether the core network element can serve as the initiator of the VFL task, the computing power of the core network element, and the service area of ​​the core network element.

[0138] In another example, the second node is an AF. The AF parameter information may include at least one of the following: AF capability information, AF identification, AF address information, and identification of the application corresponding to the AF. The AF capability information may indicate at least one of the following: whether the AF supports executing VFL tasks, the time period during which the AF supports executing VFL tasks, whether the AF can serve as the initiator of VFL tasks, and the computing power of the AF.

[0139] When the second node is an AF, one possible scenario is that the second node is a trusted AF, then the second node can directly send the parameter information of the second node to the first network element. Another possible scenario is that the second node is an untrusted third-party AF, then the second node can send (forward) the parameter information of the second node to the first network element through the NEF, and accordingly, the first network element can receive the parameter information of the second node through the NEF. In this case, the second node can map the parameter information of the second node to the parameter information of a certain event (for example, recorded as the second event), or in other words, the second node can generate the parameter information of the second event based on the parameter information of the second node, and then the second node can send the parameter information of the second event to the NEF, and then the NEF forwards the parameter information of the second event to the first network element, thereby sending the parameter information of the AF to the first network element.

[0140] That is, when the second node is an untrusted third-party AF, the second node sends parameter information of the second node to the first network element, including: the second node sends parameter information of the second event to the first network element through the NEF, wherein the parameter information of the second event is generated based on the parameter information of the second node. Exemplarily, the parameter information of the second event can be used to indicate at least one of the following: whether the AF supports the execution of the second event; the time period in which the AF supports the execution of the second event; whether the AF can serve as the initiator of the second event; the computing power of the AF; and the identifier of the application corresponding to the AF; wherein the second event is associated with the VFL task. In other words, executing the second event can also be understood as executing the VFL task.

[0141] As an implementation, for each second node, the parameter information of the second node may be carried, for example, in a second registration request message. The second registration request message is registration request information sent by the second node to the first network element. In other words, the second node may register the parameter information of the second node with the first network element by sending the second registration request message to the first network element.

[0142] In some embodiments, each second node may send parameter information of each second node to the first network element before the first node initiates the VFL task. Thus, the first network element may receive the parameter information of each second node before the first node initiates the VFL task. Furthermore, when the first node initiates the VFL task, the method may also include: the first network element obtaining capability information of at least one second node. For example, the first network element may obtain capability information of each second node from the received parameter information of each second node. Furthermore, for each second node, the first network element may determine whether the second node meets the conditions for executing the VFL task based on the capability information of the second node.

[0143] In some embodiments, the first node may send (register) parameter information of the first node to the first network element. In this case, the method may further include: the first node sending the parameter information of the first node to the first network element. The parameter information of the first node may include, for example, at least one of the following: capability information of the first node; an identifier of the first node; address information of the first node; and an identifier of an application corresponding to the first node.

[0144] Exemplarily, the capability information of the first node may be used to indicate at least one of the following: whether the first node supports executing the VFL task; the time period in which the first node supports executing the VFL task; whether the first node can serve as the initiator of the VFL task; the computing power of the first node; and the service area of ​​the first node.

[0145] It should be understood that the specific meaning of each parameter information of the first node is the same as the meaning of each parameter information corresponding to the second node, and they can refer to each other, so they will not be repeated here.

[0146] When the first node is an AF, one possible scenario is that the first node is a trusted AF, then the first node can directly send the parameter information of the first node to the first network element. Another possible scenario is that the first node is an untrusted third-party AF, then the first node can send (forward) the parameter information of the first node to the first network element through the NEF, and accordingly, the first network element can receive the parameter information of the first node through the NEF. In this case, the first node can map the parameter information of the first node to the parameter information of a certain event (for example, recorded as the first event), or in other words, the first node can generate the parameter information of the first event based on the parameter information of the first node, and then the first node can send the parameter information of the first event to the NEF, and then the NEF forwards the parameter information of the first event to the first network element, thereby sending the parameter information of the AF to the first network element.

[0147] That is to say, when the first node is an untrusted third-party AF, the first node sends parameter information of the first node to the first network element, including: the first node sends parameter information of the first event to the first network element through the NEF, and the parameter information of the first event is generated based on the parameter information of the first node. Exemplarily, the parameter information of the first event is used to indicate at least one of the following: whether the AF supports the execution of the first event; the time period in which the AF supports the execution of the first event; whether the AF can be the initiator of the first event; the computing power of the AF; and the identifier of the application corresponding to the AF. Among them, the first event is associated with the VFL task. In other words, executing the first event can also be understood as executing the VFL task.

[0148] As an implementation, the parameter information of the first node may be carried in a first registration request message, for example. The first registration request message is registration request information sent by the first node to the first network element. In other words, the first node may register the parameter information of the first node with the first network element by sending the first registration request message to the first network element.

[0149] S602: A first network element sends first information to a first node. Correspondingly, the first node receives the first information.

[0150] The first information may be used to indicate at least one second node that meets the conditions for executing a VFL task, where the VFL task is initiated by the first node.

[0151] In S602, the first network element may send first information to the first node to indicate at least one second node that meets the conditions for executing the VFL task on the first node. In this way, the first node may learn of the at least one second node that meets the conditions for executing the VFL task through the first information, thereby ensuring that the first node can find a suitable node to perform the VFL task.

[0152] As an example, the first information may carry identification and / or address information of at least one second node that meets the conditions for executing the VFL task.

[0153] In some embodiments, before the first network element sends the first information to the first node, the method may further include: the first node sends second information to the first network element, where the second information is used to request the first information; accordingly, the first network element may receive the second information from the first node,

[0154] That is, when the first node needs to discover at least one second node that meets the conditions for executing a VFL task, the first node may send second information to the first network element to request the first information. After receiving the second information from the first node, the first network element may determine at least one second node that meets the conditions for executing the VFL task initiated by the first node based on the acquired capability information of each second node, and feed back the first information to the first node, thereby indicating the at least one second node to the first node.

[0155] When the first node is an AF, in one possible scenario, the first node is a trusted AF. In this case, the first node can directly send the second information to the first network element. In another possible scenario, the first node is an untrusted third-party AF. In this case, the first node can send (forward) the second information to the first network element via the NEF. Correspondingly, the first network element can receive the second information from the first node via the NEF.

[0156] Illustratively, the second information may be used to indicate at least one of the following:

[0157] 1) Execute the VFL task, or in other words, the task type initiated by the first node is a VFL task.

[0158] 2) The time period for executing the VFL task, or in other words, the time period expected by the first node to execute the VFL task, such as 9:00 to 21:00.

[0159] 3) Acting as the initiator of the VFL task, or in other words, the first node expects to act as the initiator of the VFL task;

[0160] 4) The computing power required to execute the VFL task, such as the minimum computing power required to execute the VFL task initiated by the first node;

[0161] 5) A service area for executing the VFL task, or in other words, a service area expected by the first node to execute the VFL task.

[0162] For example, assuming that the second information indicates that the time period for the first node to perform the VFL task is expected to be from 9:00 to 21:00, and the service area expected to perform the VFL task is the first service area, then, after receiving the second information from the first node, the first network element can compare the capability information of each second node stored in the first network element with the content of the second information, determine that it supports performing the VFL task between 9:00 and 21:00, and the service area includes at least one second node in the first service area, and carry the information of the at least one second node (such as identification and / or address information) in the first information and send it to the first node.

[0163] S603: The first node determines at least one participating node that participates in the VFL task.

[0164] Exemplarily, the first node may determine at least one participating node that participates in the VFL task from at least one second node that meets the conditions for executing the VFL task.

[0165] It should be understood that the "conditions for executing a VFL task" mentioned in the embodiments of this application refer to the conditions for executing a VFL task initiated by a first node. For simplicity, the "at least one second node that meets the conditions for executing a VFL task" will be referred to as "at least one second node" below. In other words, unless otherwise specified, the "at least one second node" hereafter refers to "at least one second node that meets the conditions for executing a VFL task."

[0166] As an implementation, determining at least one participating node from the at least one second node to participate in the VFL task includes: for a second node that agrees to participate in the VFL task initiated by the first node, determining the second node as a participating node to participate in the VFL task. In other words, if a second node meets the conditions for executing the VFL task and agrees to participate in the VFL task initiated by the first node, the first node may be determined as a participating node to participate in the VFL task.

[0167] In some embodiments, for each of the at least one second node, the method may further include: the second node sending third information to the first node, the third information indicating whether the second node agrees to participate in the VFL task initiated by the first node. Accordingly, the first node may receive the third information from the at least one second node. Based on the third information, the first node may determine whether each second node agrees to participate in the VFL task initiated by the first node.

[0168] In some embodiments, the method may further include: the first node sending data requirement information to at least one second node, wherein the data requirement information is used to determine data for performing the VFL task. Accordingly, each of the at least one second node may receive the data requirement information from the first node.

[0169] For example, data requirement information may include the type of data required to perform the VFL task and / or the validity period of the required data. The data type may include the data format (e.g., 8-bit quantization or 24-bit quantization) and the type of data content (e.g., application layer data, data related to device power consumption, data related to device communication performance, etc.).

[0170] For example, assuming that in the data requirement information, the type of data required to execute the VFL task is 8-bit quantized application layer data, and the validity time of the required data is the first time period, then the second node that receives the data requirement information can determine the local data of the application layer that is valid in the first time period and is of 8-bit quantized type as the data for executing the VFL task based on the data requirement information.

[0171] In one possible approach, after receiving data request information from a first node, a second node can decide whether to participate in the VFL task initiated by the first node based on its local configuration or relevant policies. For example, if the second node has local data that meets the data request, it may agree to participate in the VFL task; if the second node does not have local data that meets the data request, it may refuse to participate in the VFL task. The second node can then reply to the first node with a third message, indicating whether it agrees to participate in the VFL task.

[0172] When the first node is an AF, in one possible scenario, the first node is a trusted AF. In this case, the first node can directly send the data request information to the at least one second node. In another possible scenario, the first node is an untrusted third-party AF. In this case, the first node can send (forward) the data request information to the at least one second node via the NEF. Correspondingly, the second node can receive the data request information from the first node via the NEF.

[0173] S604: The first node sends the VFL model to the participating nodes. Correspondingly, the participating nodes receive the VFL model.

[0174] The participating node can also be understood as a second node determined as a participating node, or can also be understood as a second node that participates in a VFL task initiated by a first node. When the first node is an AF, the first node sends the VFL model to the participating nodes. This can also be understood as the server corresponding to the first node (i.e., the server corresponding to the AF) sending the VFL model to the participating nodes.

[0175] In S603, the first node may determine at least one participating node from at least one second node that is to participate in the VFL task, where each participating node may correspond to a VFL model. In S604, the first node may send the corresponding VFL model to each participating node, and the VFL model may be used to execute the VFL task. In one possible embodiment, the VFL model may include information about the corresponding participating node (e.g., identification and / or address information of the participating node).

[0176] Among them, the VFL model corresponding to a certain participating node can also be understood as the VFL model required by the participating node. The VFL model can be used as the initial model when the participating node performs the VFL task. As an implementation method, the VFL model required by the participating node can be generated by the first node. For example, the participating nodes include terminal devices, access network network elements and core network network elements, then the first node can generate the VFL model required by the terminal device for the terminal device, and can generate the VFL model required by the access network network element for the access network network element, and can generate the VFL model required by the core network network element for the core network network element. Furthermore, the first node can send the VFL model required by each participating node to the corresponding participating node.

[0177] In some scenarios, the first node cannot directly send the VFL model to the corresponding participating node. In this case, the first node may forward the VFL model corresponding to the participating node to the participating node through one (or several) intermediate devices.

[0178] For example, when the first node is an AF and the participating nodes are terminal devices or access network devices, the AF cannot directly send a VFL model to the terminal device or access network device. In this case, the first node sending the corresponding VFL model to the participating nodes may include: the first node sending the corresponding VFL model to the terminal device or access network element via a second network element. The second network element may be a single network element or may include two or more network elements, which is not limited in this embodiment of the present application. As an implementation method, after receiving the VFL model, the second network element may forward the VFL model to the corresponding participating node based on the identification and / or address information of the participating node carried in the VFL model. For example, if VFL model #1 carries the identification and address information of the terminal device, the first node may send VFL model #1 to the terminal device based on the identification and address information of the terminal device. For another example, if VFL model #2 carries the identification and address information of an access network element, the first node may send VFL model #2 to the access network element based on the identification and address information of the access network element.

[0179] It should be noted that in some scenarios, if the first node can send the VFL model directly to the corresponding participating node without forwarding it through an intermediate device, then the VFL model may not need to carry the information of the participating node (such as identification and / or address information).

[0180] In some embodiments, the method may further include: the first node sending the same association identifier to at least one participating node. The association identifier can be used to identify different execution results of the same VFL task and can also be used to aggregate different execution results of the same VFL task. Correspondingly, the second node may receive the association identifier from the first node. As an implementation method, the first node may send the VFL model and the association identifier to the corresponding participating node via the same message.

[0181] The different execution results of the same VFL task may include, for example, execution results generated when different nodes (such as the first node; or the second node determined as a participating node) execute the same VFL task.

[0182] In one possible manner, the execution result may include the model training result and the model inference result. In this case, the association identifier may include a model association identifier and a result association identifier, wherein the model association identifier can be used to identify and / or aggregate different model training results of the same VFL task, and the result association identifier can be used to identify and / or aggregate different model inference results of the same VFL task.

[0183] In an embodiment of the present application, when each participating node receives a corresponding VFL model, it may use the received VFL model as the initial model for executing the VFL task, and use the data for executing the VFL task determined based on the data requirement information in S603 as input data. Simultaneously, the first node may generate (acquire) the VFL model corresponding to the first node and may determine the local data for executing the VFL task by the first node. Furthermore, each participating node and the first node may jointly execute the VFL task initiated by the first node based on their respective VFL models and local data.

[0184] In some embodiments, after the VFL task is completed, the method may further include: each participating node (or a second node that participated in the VFL task) sending an execution result of the participating node executing the VFL task to the first node, wherein the execution result may carry an association identifier. It should be noted that when the first node is an AF, sending the execution result of the participating node executing the VFL task to the first node can also be understood as sending the execution result of the participating node executing the VFL task to the server corresponding to the first node (i.e., the server corresponding to the AF).

[0185] In one possible scenario, a participating node can directly send the execution result of the VFL task executed by the participating node to the first node. In another possible scenario, a participating node (hereinafter referred to as participating node #1) is unable to send the execution result directly to the first node. In this case, participating node #1 can first send the execution result of participating node #1 to an intermediate node (such as participating node #2), which can then forward the execution result of participating node #1 to the first node.

[0186] Taking Participating Node #2 as an example, in the first implementation (hereinafter referred to as Implementation #1), after receiving the execution result from Participating Node #1, Participating Node #2 can send the execution result from Participating Node #1 to the first node. At the same time, Participating Node #2 can also send its own execution result to the first node. The execution results from Participating Node #1 and Participating Node #2 both carry the same association identifier.

[0187] In the second implementation (hereinafter referred to as implementation #2), participating node #2 can also aggregate the execution result of participating node #2 and the execution result received from participating node #1, and then send the obtained aggregated result to the first node. As an example, the execution results of participating node #1 and participating node #2 can carry the same association identifier. In this way, when participating node #2 aggregates the execution results, it can aggregate the execution results with the same association identifier (the execution results of participating node #1 and participating node #2), thereby ensuring that the aggregated results are the execution results of the same VFL task, thereby ensuring the correct aggregation of the execution results. The obtained aggregated result can also carry the association identifier.

[0188] In the third implementation method (hereinafter referred to as implementation method #3), in addition to receiving the execution results of participating node #1, participating node #2 can also receive the execution results of other participating nodes (hereinafter referred to as participating node #3), and can aggregate the execution results of participating node #1, participating node #2 and participating node #3, and then send the obtained aggregated results to the first node. As an example, the execution results of participating node #1, participating node #2 and participating node #3 can carry the same association identifier. In this way, when participating node #2 aggregates the execution results, it can aggregate the execution results with the same association identifier (the execution results of participating node #1, participating node #2 and participating node #3), thereby ensuring that the aggregated results are the execution results of the same VFL task, and thus ensuring the correct aggregation of the execution results. Among them, the obtained aggregated result can also carry the association identifier.

[0189] That is to say, for a second node participating in a VFL task (such as participating node #2), in the above-mentioned implementation #2 and implementation #3, the method may further include: receiving the execution result of the VFL task performed by at least one participating node (such as participating node #1 and / or participating node #3) (for example, recorded as the second execution result); sending an aggregation result to the first node, the aggregation result being obtained by aggregating the execution result of the VFL task performed by at least one participating node (that is, at least one second execution result) and the execution result of the VFL task performed by the second node (for example, recorded as the third execution result), wherein the aggregation result may carry an association identifier. In one possible embodiment, each execution result of the execution result of the VFL task performed by at least one participating node (that is, each second execution result) and the execution result of the VFL task performed by the second node (that is, the third execution result) carry the same association identifier, so that the aggregation result can be obtained by aggregation based on the same association identifier.

[0190] Accordingly, the first node may receive the execution result corresponding to the VFL task initiated by the first node (for example, recorded as the first execution result), wherein the first execution result includes: the execution result of at least one participating node executing the VFL task (for example, the execution result obtained through the above-mentioned implementation method #1, for example, recorded as the second execution result); and / or, at least one aggregation result, each aggregation result in the at least one aggregation result is obtained by aggregation based on the execution results of at least two participating nodes executing the VFL task (that is, at least two second execution results) (for example, obtained through the above-mentioned implementation method #2 or implementation method #3). Wherein, each execution result in the execution result of at least one participating node executing the VFL task (that is, each second execution result), and / or, each aggregation result in the at least one aggregation result, carries the same association identifier, and each aggregation result in the at least one aggregation result can be obtained by aggregation based on the same association identifier.

[0191] In some embodiments, the method may further include: the first node aggregating execution results corresponding to VFL tasks having the same association identifier and execution results of the VFL tasks executed by the first node.

[0192] As an example, after a first node receives the execution result corresponding to a VFL task initiated by the first node, it may aggregate the execution result corresponding to the VFL task and the execution result of the first node itself to obtain a final aggregated result. The execution result corresponding to the VFL task received by the first node and the execution result of the first node itself may both carry the same association identifier. Thus, when the first node aggregates the execution results, it may aggregate the execution results with the same association identifier (the execution result corresponding to the VFL task received by the first node and the execution result of the first node itself). This ensures that the execution results of the same VFL task are aggregated, thereby ensuring the correct aggregation of the execution results.

[0193] The above text introduces a communication method provided by an embodiment of the present application in conjunction with Figures 5 and 6. To facilitate understanding of the embodiments of the present application, the following describes a possible implementation process of the communication method provided by an embodiment of the present application in conjunction with Figures 7 to 9. For ease of explanation, it is assumed in the following examples that the first network element is NRF, the first node is AF, and the second node includes UE, RAN and core network NF (or referred to as core network network element). Among them, UE, RAN or core network NF can be one or more (two or more), and the embodiments of the present application are not limited to this.

[0194] To execute VFL, the initiating node first needs to discover nodes capable of executing VFL, or in other words, nodes that meet the requirements for executing VFL tasks. To this end, before starting VFL tasks, each node must register its information with the NRF. For example, using the AF as the initiator, the UE, RAN, and core network elements must register their VFL support capabilities with the NRF. This allows the AF to discover suitable nodes through the NRF for executing VFL tasks.

[0195] FIG7 is a schematic diagram of a possible implementation flow of the communication method provided in an embodiment of the present application. The implementation flow may include:

[0196] S701: UE sends a registration request to NRF.

[0197] The UE can register its information with the NRF by sending a registration request to the NRF. As an example, the registration request carries the UE's profile (corresponding to the parameter information of the terminal in the aforementioned embodiment). The UE's profile includes but is not limited to at least one of the following: UE ID, whether the UE can support VFL capabilities, the time period during which the UE can support VFL, the UE type, the UE's address information (such as IP address), an indication of whether the UE can support becoming a VFL initiator, and the UE's computing power information.

[0198] S702: RAN sends a registration request to NRF.

[0199] The RAN can register RAN information with the NRF by sending a registration request to the NRF. As an example, the registration request carries RAN files (corresponding to the parameter information of the access network element in the aforementioned embodiment). The RAN files include, but are not limited to, at least one of the following: RAN ID (e.g., gNB ID), RAN support for VFL capability, time period during which the RAN can support VFL, RAN address information, indication of support for becoming a VFL initiator, RAN computing power information, and RAN service area (coverage area) information.

[0200] S703, the core network NF sends a registration request to the NRF.

[0201] The core network NF can register its information with the NRF by sending a registration request to the NRF. As an example, the registration request carries the core network NF's file (corresponding to the parameter information of the core network element in the aforementioned embodiment). The core network NF's file includes but is not limited to at least one of the following: NF type, NF's ability to support VFL, NF's time period for supporting VFL, NF's address information, an indication of whether the NF can support becoming a VFL initiator, NF's computing power information, and NF's service area information.

[0202] S704: The AF sends a registration request to the NRF.

[0203] The AF can register its information with the NRF by sending a registration request to the NRF. As an example, the registration request carries the AF's file (corresponding to the AF's parameter information in the aforementioned embodiment). The AF's file includes but is not limited to at least one of the following: AF ID, AF's corresponding application ID, AF's ability to support VFL, AF's time period for supporting VFL, AF's address information, whether the AF can support becoming a VFL initiator, and AF's computing power information.

[0204] It should be noted that when AF is an untrusted third-party AF, AF can register information to NRF through NEF. For example, AF can first send AF's file to NEF, NEF generates an NEF file, and NEF registers the NEF file to NRF. NEF can map AF's information to information of an event (Event), or to an event ID, so that NEF can register the information of the event (corresponding to the parameter information of the first event in the aforementioned embodiment) as a NEF file to NRF. As an example, the information of the event includes but is not limited to at least one of the following: NEF ID, whether AF can support VFL capabilities, the application ID corresponding to AF, the time period supported by the event, an indication of whether AF can support becoming the initiator of the event, and AF's computing power information.

[0205] It should be understood that this embodiment does not limit the execution order of S701 to S704.

[0206] S705, NRF saves the files of each node.

[0207] After receiving the registration request from each node (UE, RAN, core network NF and AF), the NRF can save the file of each node and mark each node as an available valid node. Afterwards, the NRF can send a registration response to each node to reply that the registration of each node is accepted. The steps of the NRF sending a registration response to each node may include S706 to S709:

[0208] S706, the NRF sends a registration response to the core network NF.

[0209] S707: The NRF sends a registration response to the RAN.

[0210] S708: The NRF sends a registration response to the UE.

[0211] S709: The NRF sends a registration response to the AF.

[0212] It should be understood that this embodiment does not limit the execution order of S706 to S709.

[0213] Through the implementation process shown in Figure 7, each node can register its own information into NRF, so that when executing the VFL task, the node as the initiator can find the appropriate node through NRF to perform the VFL task.

[0214] FIG8 is a second schematic diagram of a possible implementation process of the communication method provided in an embodiment of the present application. As an implementation method, the implementation process shown in FIG8 can be executed after the implementation process shown in FIG6. That is, in the implementation process shown in FIG8, it can be considered that the information of each node has been registered with the NRF. As shown in FIG8, the implementation process may include:

[0215] S801: The AF sends a node discovery request to the NRF (corresponding to the second information in the aforementioned embodiment).

[0216] For example, when the AF is the initiator of a VFL task, it sends a node discovery request to the NRF to discover nodes that can execute the VFL task. The node discovery request may include, but is not limited to, at least one of the following information: an indication of executing the VFL, a desired time period for executing the VFL, an indication of the VFL initiator, and a desired service area for executing the VFL.

[0217] In some embodiments, when the AF is a third-party AF, the AF may send a node discovery request to the NRF through the NEF, and the parameters included in the node discovery request are the same.

[0218] S802: NRF authorizes AF's node discovery request.

[0219] In this step, the NRF can authorize the AF's node discovery request. As an implementation method, before authorizing the AF's node discovery request, the NRF can first determine, based on the AF's file information, whether the AF supports VFL and can support becoming a VFL initiator. Furthermore, if the AF can support VFL and can support becoming a VFL initiator, the AF's node discovery request is authorized.

[0220] S803 , the NRF sends a node discovery request response (corresponding to the first information in the aforementioned embodiment) to the AF.

[0221] Since the NRF has saved the file information of the relevant nodes, based on the information carried in the node discovery request of S801, the NRF can determine the nodes that meet the conditions for the AF (such as UE, RAN and core network NF that meet the conditions), and reply the information of the nodes that meet the conditions (such as the node ID and / or address information) to the AF through the node discovery request response.

[0222] Here, "qualified nodes" can be understood as nodes that meet the conditions included in the node discovery request, or can also be understood as nodes that meet the conditions for executing the VFL task initiated by the AF. For ease of explanation, the following assumes that the UR, RAN, and core network NF are all qualified nodes.

[0223] In some embodiments, when the AF is a third-party AF, the NRF may send a node discovery request response to the AF through the NEF.

[0224] S804: The AF sends a VFL preparation request to the NEF.

[0225] When the AF is a third-party AF, the AF can send a VFL preparation request to the NEF, and then forward the VFL preparation request to each node through the NEF. The VFL preparation request may include the type of data required to execute the VFL task and the valid time of the data (corresponding to the data requirement information in the aforementioned embodiment).

[0226] S805: NEF sends a VFL preparation request to each node.

[0227] After receiving the VFL preparation request from the AF, the NEF can send the VFL preparation request to each node that meets the conditions (as shown in Figure 8, the NEF can send the VFL preparation request to the UE, RAN and core network NF respectively), so that each node can prepare the required data for executing the VFL task in advance based on the type of data required for executing the VFL task and the validity period of the data carried in the VFL preparation request.

[0228] S806 , each node sends a VFL preparation request reply message (corresponding to the third information in the above embodiment) to the NEF.

[0229] After receiving the VFL preparation request, each node can determine whether to join the VFL task based on the local configuration and reply to the NEF with the decision of whether to agree to join. The decision can be carried in the VFL preparation request reply message, or in other words, the VFL preparation request message can be used to indicate whether each node agrees to join the VFL task initiated by the AF.

[0230] S807: NEF performs node selection.

[0231] The NEF can select VFL nodes based on the VFL preparation request reply messages fed back by each node and the AF's request. For example, the NEF can select nodes that meet the conditions for executing the VFL task initiated by the AF and agree to join the VFL task.

[0232] S808: NEF sends the node selection result to AF.

[0233] In this step, NEF may return the node selection result in S807 to AF, wherein the node selection result may include information of the selected node, such as the node ID and / or address information, so that AF can determine the selected node as a participating node participating in the VFL task.

[0234] It should be noted that S804 to S808 are exemplary explanations using the AF as a third-party AF. When the AF is a trusted AF, the AF can directly send a VFL preparation request to each node that meets the conditions (such as the UE, RAN, and core network NF). Subsequently, each node that meets the conditions can directly send a VFL preparation request reply message to the AF. The VFL preparation request message can be used to indicate whether each node agrees to join the VFL task initiated by the AF. Furthermore, the AF can determine the nodes that meet the conditions and agree to join the VFL task as participating nodes participating in the VFL task.

[0235] Through the implementation process shown in Figure 8, the AF can discover and determine suitable nodes to perform VFL tasks by sending a node discovery request to the NRF.

[0236] FIG9 is a third schematic diagram of a possible implementation process of the communication method provided in an embodiment of the present application. As an implementation method, the implementation process shown in FIG9 can be executed after the implementation process shown in FIG7 . That is, in the implementation process shown in FIG9 , it can be assumed that the AF has already determined the nodes participating in the VFL task. In the following implementation process, it is assumed that the participating nodes determined by the AF are the UE, RAN, and core network NF. As shown in FIG9 , the implementation process may include:

[0237] S901: The server corresponding to the AF sends the VFL model and association identifier corresponding to each node to the core network NF.

[0238] Among them, the VFL model corresponding to each node can be used as the initial model for each node to execute the VFL task.

[0239] In this step, the server corresponding to the AF can first send the (corresponding) VFL models required by each node participating in the VFL task (UE, RAN, core network NF) to the core network NF. Each model can carry information about the corresponding node. For example, the model required by the UE is Model #1, and the model required by the RAN is Model #2. In this case, Model #1 can carry UE information (such as the UE ID and / or address information) to indicate that Model #1 should be sent to the UE for use. Model #2 can carry RAN information (such as the RAN ID and / or address information) to indicate that Model #2 should be sent to the RAN for use.

[0240] In this step, AF can also send the same association identifier (association ID) to each node. Since VFL needs to use local models and data on different nodes for model training and result inference, and aggregate them at the initiator, in order to facilitate the association of the VFL execution results generated by each node (including the model training results and / or inference results), AF can send the same association identifier to each node. In this way, after each node calculates the VFL execution result, it can add the association identifier to the VFL execution result of the node, thereby ensuring that the results generated by the same VFL task on different nodes have the same association identifier, and further ensuring that the aggregation node correctly aggregates the VFL execution results obtained by each node. Among them, "aggregation node" can also be understood as a node that aggregates the VFL execution results of at least two nodes.

[0241] As an implementation manner, the association identifier may be carried in a VFL model corresponding to each node, for example.

[0242] S902: The core network NF sends the VFL model and association identifier corresponding to the RAN to the RAN.

[0243] After the core network NF obtains the (corresponding) VFL model and association identifier required by the RAN, it can send the VFL model and association identifier to the RAN based on the RAN information carried by the VFL model (such as the RAN ID and / or address information).

[0244] S903: The core network NF sends the VFL model and association identifier corresponding to the UE to the UE.

[0245] After the core network NF obtains the (corresponding) VFL model and association identifier required by the UE, it can send the VFL model and association identifier to the UE based on the UE information (such as the UE ID and / or address information) carried in the VFL model. As an implementation method, the VFL can send the VFL model and association identifier corresponding to the UE to the UE via the RAN.

[0246] In some embodiments, the server corresponding to the AF may also directly send the VFL model and association identifier corresponding to the UE to the UE through the application layer. In this case, the implementation process also includes S904:

[0247] S904: The server corresponding to the AF sends the VFL model and association identifier corresponding to the UE to the UE through the application layer.

[0248] It can be understood that when executing S904, the server corresponding to the AF in S901 may not need to send the VFL model corresponding to the UE to the core network NF, and in this case there is no need to execute S903.

[0249] S905: Each node executes the VFL task.

[0250] After the VFL model is delivered, each node can perform federated learning on the same task based on the association identifier. For example, during the execution of a VFL task, each node may need to exchange intermediate results (such as gradients and losses). Since the results generated by each node have the same association identifier, processing the results with the same association identifier ensures that each node is performing federated learning on the same task.

[0251] S906, the UE sends the execution result of the UE executing the VFL task to the core network NF.

[0252] After completing the VFL task, the UE may send the obtained execution result to the core network NF, and the execution result may carry the association identifier.

[0253] S907 , the RAN sends the execution result of the VFL task executed by the RAN to the core network NF.

[0254] After executing the VFL task, the RAN may send the obtained execution result to the core network NF, and the execution result may carry the association identifier.

[0255] In some embodiments, the implementation process further includes S908:

[0256] S908: Core network NF aggregation execution results.

[0257] After the core network NF receives the execution results of the VFL task from the UN and RAN, it can aggregate the execution results with the same association identifier (the execution results of the UN, RAN and the core network NF itself) based on the association identifier, and then send the aggregated results to the server corresponding to the AF in S909.

[0258] It should be understood that in some embodiments, after the core network NF receives the execution results from the UN and the RAN, it may not aggregate the execution results, but directly send the received execution results (the execution results of the UE and the RAN) and the execution results generated by the core network NF to the server corresponding to the AF.

[0259] S909: The core network NF sends the execution result corresponding to the VFL task to the server corresponding to the AF.

[0260] In one possible scenario, after the core network NF receives the execution results of the VFL task from the UN and RAN, it aggregates the execution results of each node. In this step, the execution result corresponding to the VFL task can be an aggregated result obtained by aggregating the execution results of each node, and the aggregated result carries an association identifier.

[0261] In another possible scenario, after the core network NF receives the execution results of the VFL task from the UN and RAN, it does not aggregate the execution results of each node. In this case, the execution results corresponding to the VFL task may include the execution results of each node, such as the execution results of the UN, RAN, and core network NF, and the execution results of each node carry the same association identifier.

[0262] It should be noted that, in some embodiments, the UE may also directly send the execution result of the UE to the server corresponding to the AF through the application layer, and carry the association identifier in the execution result. In this case, the implementation process may further include S710:

[0263] S910, the UE sends the execution result of the VFL task executed by the UE to the server corresponding to the AF through the application layer.

[0264] It is understandable that when executing S910, it is not necessary to execute S906, and in S908, when the core network NF aggregates the execution results of each node, it is not necessary to aggregate the execution results of the UE.

[0265] S911, the server corresponding to AF aggregates the execution results.

[0266] In this step, the server corresponding to the AF may aggregate the results generated by all nodes to obtain the final VFL result. For example, if the core network NF aggregates the execution results of the UR, RAN, and the core network NF, the server corresponding to the AF may, based on the correlation identifier, aggregate the aggregated result obtained by the core network NF with the execution result generated by the server corresponding to the AF to obtain the final VFL task execution result. The aggregated result obtained by the core network NF and the execution result generated by the server corresponding to the AF have the same correlation identifier.

[0267] Through the implementation process shown in Figure 9, AF can send the initial VFL model to each node participating in the VFL task, and can associate the execution results of the VFL task of each node through the association identifier, and then aggregate the execution results of the associated nodes to obtain the final execution result of the VFL task.

[0268] It should be understood that the AF as the initiator of the VFL task in the above process is merely exemplary. In the technical solutions of the embodiments of the present application, any node can serve as the initiator of the VFL task. As an implementation method, in actual VFL application scenarios, since the UE or AF may have a tag, the UE or AF can usually serve as the initiator of the VFL task.

[0269] The embodiment of the present application introduces the process of each node registering, the initiator discovering and determining the participating nodes, the initial model sending and the execution result aggregation, thereby realizing the network architecture's support for cross-domain vertical federated learning.

[0270] In the solution of the embodiment of the present application, first, each node can register its own information related to VFL to NRF to ensure that the initiator can find the appropriate node. Thus, the initiator can discover each node that can participate in VFL through NRF. Furthermore, the initiator can send an initial model and an association identifier to each node to ensure that each node performs the same VFL task and the results are correctly aggregated. This solution solves the following currently unresolved technical problems: 1) How does the node as the initiator (such as UE or AF) select a suitable node in other domains to perform VFL; 2) How does the initiator send the initial model to each node for model training and / or result inference; 3) How does the initiator associate the training / inference results generated by each node.

[0271] Through the solution of the embodiment of the present application, the initiator can combine nodes from multiple domains to perform vertical federated learning while preventing data from leaving the domain, thereby enabling comprehensive analysis and prediction of the research object (such as the UE experience) by combining more dimensional data, so as to optimize the research content within each domain (such as optimizing the UE experience).

[0272] Based on the aforementioned embodiments, the embodiments of the present application provide corresponding communication devices.

[0273] FIG10 is a schematic diagram of the first structure of a communication device provided in an embodiment of the present application, which is applied to a first node. As shown in FIG10 , the communication device 1000 includes:

[0274] The first receiving module 1001 is configured to receive first information from a first network element, where the first information is used to indicate at least one second node that meets the conditions for performing the VFL task; the determining module 1002 is configured to determine at least one participating node participating in the VFL task from the at least one second node.

[0275] In some embodiments, whether the second node meets the conditions for executing the VFL task is determined by the first network element based on the capability information of the second node, and the capability information of the second node is used to indicate at least one of the following: whether the second node supports executing the VFL task; the time period in which the second node supports executing the VFL task; whether the second node can serve as the initiator of the VFL task; the computing power of the second node; and the service area of ​​the second node.

[0276] In some embodiments, parameter information of at least one second node is collected or determined by the first network element, wherein, for each second node, the parameter information of the second node includes at least one of the following: capability information of the second node; identification of the second node; address information of the second node; and identification of the application corresponding to the second node.

[0277] In some embodiments, for each second node, parameter information of the second node is carried by second registration request information, and the second registration request information is registration request information sent by the second node to the first network element.

[0278] In some embodiments, the device 1000 also includes: a first sending module, configured to send parameter information of the device 1000 to the first network element before receiving the first information from the first network element, the parameter information of the device 1000 includes at least one of the following: capability information of the device 1000; an identifier of the device 1000; address information of the device 1000; and an identifier of the application corresponding to the device 1000; wherein the capability information of the device 1000 is used to indicate at least one of the following: whether the device 1000 supports executing VFL tasks; the time period in which the device 1000 supports executing VFL tasks; whether the device 1000 can serve as the initiator of the VFL task; the computing power of the device 1000; and the service area of ​​the device 1000.

[0279] In some embodiments, the device 1000 is an application function AF, and the first sending module is specifically configured to: send parameter information of the first event to the first network element through the network function opening NEF, and the parameter information of the first event is generated based on the parameter information of the device 1000; the parameter information of the first event is used to indicate at least one of the following: whether AF supports the execution of the first event; the time period in which AF supports the execution of the first event; whether AF can be the initiator of the first event; the computing power of AF; and the identifier of the application corresponding to AF; wherein, the first event is associated with the VFL task.

[0280] In some embodiments, the parameter information of the device 1000 is carried by the first registration request information, and the first registration request information is the registration request information sent by the device 1000 to the first network element.

[0281] In some embodiments, the apparatus 1000 further includes: a second sending module configured to send second information to the first network element before receiving the first information from the first network element, where the second information is used to request the first information.

[0282] In some embodiments, the apparatus 1000 is an AF, and the second sending module is specifically configured to: send the second information to the first network element through the NEF.

[0283] In some embodiments, the second information is used to indicate at least one of the following: executing the VFL task; the time period for executing the VFL task; being the initiator of the VFL task; the computing power requirement for executing the VFL task; and the service area for executing the VFL task.

[0284] In some embodiments, the determination module 1002 is specifically configured to: for a second node that agrees to participate in the VFL task, determine the second node as a participating node participating in the VFL task.

[0285] In some embodiments, the device 1000 also includes: a third sending module, configured to send data requirement information to at least one second node, the data requirement information is used to determine the data for performing the VFL task, and the data requirement information includes: the type of data required to perform the VFL task, and / or the valid time of the required data.

[0286] In some embodiments, the apparatus 1000 further includes: a second receiving module configured to receive third information from at least one second node, where the third information is used to indicate whether the second node agrees to participate in the VFL task.

[0287] In some embodiments, the apparatus 1000 is an AF, and the third sending module is specifically configured to: send data demand information to at least one second node through the NEF.

[0288] In some embodiments, the apparatus 1000 further includes: a fourth sending module configured to send a corresponding VFL model to at least one participating node, where the VFL model is used to execute the VFL task; wherein the VFL model includes the identification and / or address information of the corresponding participating node.

[0289] In some embodiments, the apparatus 1000 is an AF, the participating node is a terminal device or an access network element, and the fourth sending module is specifically configured to: send the corresponding VFL model to the terminal device or the access network element through the second network element.

[0290] In some embodiments, the apparatus 1000 further includes: a fifth sending module configured to send an association identifier to at least one participating node, where the association identifier is used to aggregate different execution results of the same VFL task.

[0291] In some embodiments, the device 1000 also includes: a third receiving module, configured to receive a first execution result corresponding to the VFL task, the first execution result including: a second execution result of at least one participating node executing the VFL task; and / or, at least one aggregation result, each aggregation result of the at least one aggregation result is obtained by aggregation based on at least two second execution results.

[0292] In some embodiments, each second execution result, and / or each aggregated result in at least one aggregated result, carries the same association identifier.

[0293] In some embodiments, each aggregated result in the at least one aggregated result is obtained by aggregation based on the same association identifier.

[0294] In some embodiments, the apparatus 1000 further includes: an aggregation module configured to aggregate execution results corresponding to VFL tasks having the same association identifier and execution results of the VFL tasks executed by the apparatus 1000 .

[0295] In some embodiments, the apparatus 1000 is a terminal device, an access network element, a core network element or an AF.

[0296] In some embodiments, the second node includes at least one of the following: a terminal device, an access network element, a core network element, and an AF.

[0297] In some embodiments, the first network element is a network storage function NRF.

[0298] FIG11 is a second schematic diagram of the structure of a communication apparatus provided in an embodiment of the present application, which is applied to a second node. As shown in FIG11 , the communication apparatus 1100 includes:

[0299] The first sending module 1101 is configured to send capability information of the device 1100 to the first network element. The capability information of the device 1100 is used to determine whether the device 1100 meets the conditions for performing the vertical federated learning (VFL) task.

[0300] In some embodiments, the capability information of device 1100 is used to indicate at least one of the following: whether device 1100 supports executing VFL tasks; the time period in which device 1100 supports executing VFL tasks; whether device 1100 can act as the initiator of VFL tasks; the computing power of device 1100; and the service area information of device 1100.

[0301] In some embodiments, the device 1100 also includes: a second sending module, configured to send parameter information of the device 1100 to the first network element, the parameter information of the device 1100 including at least one of the following: capability information of the device 1100; identification of the device 1100; address information of the device 1100; and identification of the application corresponding to the device 1100.

[0302] In some embodiments, the device 1100 is an application function AF, and the second sending module is specifically configured to: send parameter information of the second event to the first network element through the network function opening NEF, and the parameter information of the second event is generated based on the parameter information of the device 1100; the parameter information of the second event is used to indicate at least one of the following: whether AF supports the execution of the second event; the time period in which AF supports the execution of the second event; whether AF can be the initiator of the second event; the computing power of AF; and the identifier of the application corresponding to AF; wherein the second event is associated with the VFL task.

[0303] In some embodiments, the parameter information of the device 1100 is carried by the second registration request information, and the second registration request information is the registration request information sent by the device 1100 to the first network element.

[0304] In some embodiments, the device 1100 also includes: a first receiving module, configured to receive data requirement information from the first node, the data requirement information is used to determine the data for performing the VFL task, the data requirement information includes: the type of data required to perform the VFL task, and / or the effective time of the required data.

[0305] In some embodiments, the apparatus 1100 further includes: a third sending module configured to send third information to the first node, where the third information is used to indicate whether the apparatus 1100 agrees to participate in the VFL task.

[0306] In some embodiments, the first node is an AF, and the first receiving module is specifically configured to: receive data demand information from the first node through the NEF.

[0307] In some embodiments, the apparatus 1100 further includes: a second receiving module configured to receive a VFL model from the first node, the VFL model being used to perform the VFL task; wherein the VFL model corresponds to the apparatus 1100 and includes identification and / or address information of the apparatus 1100.

[0308] In some embodiments, the apparatus 1100 further includes: a third receiving module configured to receive an association identifier from the first node, where the association identifier is used to aggregate different execution results of the same VFL task.

[0309] In some embodiments, the apparatus 1100 further includes: a third sending module configured to send an execution result of the VFL task performed by the apparatus 1100 to the first node, where the execution result carries an association identifier.

[0310] In some embodiments, the device 1100 also includes: a fourth receiving module, configured to receive the second execution result of at least one participating node executing the VFL task; a fourth sending module, configured to send an aggregation result to the first node, the aggregation result being obtained by aggregating at least one second execution result and the third execution result of the device 1100 executing the VFL task, wherein the aggregation result carries an association identifier.

[0311] In some embodiments, each second execution result and the third execution result carry the same association identifier, and the aggregated result is obtained by aggregation based on the same association identifier.

[0312] In some embodiments, the first node is a terminal device, an access network element, a core network element, or an AF.

[0313] In some embodiments, the apparatus 1100 is a terminal device, an access network element, a core network element, or an AF.

[0314] In some embodiments, the first network element is a network storage function NRF.

[0315] FIG12 is a third schematic diagram of the structure of a communication apparatus provided in an embodiment of the present application, which is applied to a first network element. As shown in FIG12 , the communication apparatus 1200 includes:

[0316] The acquisition module 1201 is configured to acquire capability information of at least one second node, where the capability information of the second node is used to determine whether the second node meets the conditions for executing the vertical federated learning (VFL) task.

[0317] In some embodiments, the capability information of the second node is used to indicate at least one of the following: whether the second node supports executing the VFL task; the time period in which the second node supports executing the VFL task; whether the second node can serve as the initiator of the VFL task; the computing power of the second node; and the service area information of the second node.

[0318] In some embodiments, the device 1200 also includes: a first receiving module, configured to receive parameter information of at least one second node before obtaining the capability information of at least one second node, wherein, for each second node, the parameter information of the second node includes at least one of the following: capability information of the second node; identification of the second node; address information of the second node; and identification of the application corresponding to the second node.

[0319] In some embodiments, for each second node, parameter information of the second node is carried by second registration request information, and the second registration request information is registration request information sent by the second node to the apparatus 1200 .

[0320] In some embodiments, the device 1200 also includes: a second receiving module, configured to receive parameter information of the first node, the parameter information of the first node including at least one of the following: capability information of the first node; an identifier of the first node; address information of the first node; and an identifier of an application corresponding to the first node; wherein the capability information of the first node is used to indicate at least one of the following: whether the first node supports executing VFL tasks; the time period in which the first node supports executing VFL tasks; whether the first node can serve as the initiator of the VFL task; the computing power of the first node; and the service area of ​​the first node.

[0321] In some embodiments, the parameter information of the first node is carried by the first registration request information, and the first registration request information is the registration request information sent by the first node to the apparatus 1200 .

[0322] In some embodiments, the apparatus 1200 further includes: a sending module configured to send first information to the first node, where the first information is used to indicate at least one second node that meets the conditions for executing the VFL task.

[0323] In some embodiments, the apparatus 1200 further includes: a third receiving module configured to receive second information from the first node before sending the first information to the first node, where the second information is used to request the first information.

[0324] In some embodiments, the first node is a terminal device, an access network element, a core network element, or an application function AF.

[0325] In some embodiments, the second node includes at least one of the following: a terminal device, an access network element, a core network element, and an AF.

[0326] In some embodiments, the device 1200 is a network storage function NRF.

[0327] Those skilled in the art should understand that the relevant description of the above-mentioned communication device in the embodiment of the present application can be understood with reference to the relevant description of the communication method in the embodiment of the present application.

[0328] Figure 13 is a schematic diagram of a communication device 1300 provided in an embodiment of the present application. The communication device can be a terminal device, a network device, or a core network device. The communication device 1300 shown in Figure 13 includes a processor 1310, which can call and execute a computer program from a memory to implement the method in the embodiment of the present application.

[0329] Optionally, as shown in FIG13 , the communication device 1300 may further include a memory 1320. The processor 1310 may call and execute a computer program from the memory 1320 to implement the method in the embodiment of the present application.

[0330] The memory 1320 may be a separate device independent of the processor 1310 , or may be integrated into the processor 1310 .

[0331] Optionally, as shown in FIG13 , the communication device 1300 may further include a transceiver 1330 , and the processor 1310 may control the transceiver 1330 to communicate with other devices, specifically, to send information or data to other devices, or to receive information or data sent by other devices.

[0332] The transceiver 1330 may include a transmitter and a receiver. The transceiver 1330 may further include an antenna, and the number of antennas may be one or more.

[0333] Optionally, the communication device 1300 may specifically be the first node of the embodiment of the present application, and the communication device 1300 may implement the corresponding processes implemented by the first node in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0334] Optionally, the communication device 1300 may specifically be the second node of the embodiment of the present application, and the communication device 1300 may implement the corresponding processes implemented by the second node in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0335] Optionally, the communication device 1300 may specifically be the first network element of the embodiment of the present application, and the communication device 1300 may implement the corresponding processes implemented by the first network element in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0336] Figure 14 is a schematic structural diagram of a chip according to an embodiment of the present application. The chip 1400 shown in Figure 14 includes a processor 1410, which can call and run a computer program from a memory to implement the method according to the embodiment of the present application.

[0337] Optionally, as shown in FIG14 , the chip 1400 may further include a memory 1420 , wherein the processor 1410 may call and execute a computer program from the memory 1420 to implement the method in the embodiment of the present application.

[0338] The memory 1420 may be a separate device independent of the processor 1410 , or may be integrated into the processor 1410 .

[0339] Optionally, the chip 1400 may further include an input interface 1430. The processor 1410 may control the input interface 1430 to communicate with other devices or chips, and specifically, may obtain information or data sent by other devices or chips.

[0340] Optionally, the chip 1400 may further include an output interface 1440. The processor 1410 may control the output interface 1440 to communicate with other devices or chips, and specifically, may output information or data to other devices or chips.

[0341] Optionally, the chip can be applied to the first node in the embodiment of the present application, and the chip can implement the corresponding processes implemented by the first node in each method of the embodiment of the present application. For the sake of brevity, it will not be repeated here.

[0342] Optionally, the chip can be applied to the second node in the embodiments of the present application, and the chip can implement the corresponding processes implemented by the second node in each method of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0343] Optionally, the chip can be applied to the first network element in the embodiment of the present application, and the chip can implement the corresponding processes implemented by the first network element in each method of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0344] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0345] An embodiment of the present application further provides a computer storage medium, which stores one or more programs. The one or more programs can be executed by one or more processors to implement the method in the embodiment of the present application.

[0346] FIG15 is a schematic block diagram of a communication system 1500 provided in an embodiment of the present application. As shown in FIG15 , the communication system 1500 includes a first node 1510 , a second node 1520 , and a first network element 1530 .

[0347] Among them, the first node 1510 can be used to implement the corresponding functions implemented by the first node in the above method, the second node 1520 can be used to implement the corresponding functions implemented by the second node in the above method, and the first network element 1530 can be used to implement the corresponding functions implemented by the first network element in the above method. For the sake of brevity, they will not be repeated here.

[0348] It should be understood that the processor of the embodiments of the present application may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiment can be completed by hardware integrated logic circuits in the processor or software instructions. The above processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0349] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0350] It should be understood that the above-mentioned memories are exemplary but not restrictive. For example, the memories in the embodiments of the present application may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM RAM (DR RAM), etc. In other words, the memories in the embodiments of the present application are intended to include, but are not limited to, these and any other suitable types of memories.

[0351] An embodiment of the present application also provides a computer-readable storage medium for storing a computer program.

[0352] Optionally, the computer-readable storage medium can be applied to the first node in the embodiment of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the first node in the various methods of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0353] Optionally, the computer-readable storage medium can be applied to the second node in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the second node in the various methods of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0354] Optionally, the computer-readable storage medium can be applied to the first network element in the embodiment of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the first network element in the various methods of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0355] An embodiment of the present application also provides a computer program product, including computer program instructions.

[0356] Optionally, the computer program product can be applied to the first node in the embodiment of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the first node in the various methods of the embodiment of the present application. For the sake of brevity, they are not repeated here.

[0357] Optionally, the computer program product can be applied to the second node in the embodiments of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the second node in the various methods of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0358] Optionally, the computer program product can be applied to the first network element in the embodiment of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the first network element in the various methods of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0359] The embodiment of the present application also provides a computer program.

[0360] Optionally, the computer program can be applied to the first node in the embodiments of the present application. When the computer program runs on a computer, the computer executes the corresponding processes implemented by the first node in the various methods of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0361] Optionally, the computer program can be applied to the second node in the embodiments of the present application. When the computer program runs on a computer, the computer executes the corresponding processes implemented by the second node in the various methods of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0362] Optionally, the computer program can be applied to the first network element in the embodiment of the present application. When the computer program runs on a computer, the computer executes the corresponding processes implemented by the first network element in the various methods of the embodiment of the present application. For the sake of brevity, they are not repeated here.

[0363] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0364] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0365] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0366] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0367] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0368] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0369] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A communication method, applied to a first node, the method comprising: receiving first information from a first network element, wherein the first information is used to indicate at least one second node that meets the condition for performing a VFL task; At least one participating node participating in the VFL task is determined from the at least one second node.

2. The method according to claim 1, wherein: Whether the second node meets the condition for executing the VFL task is determined by the first network element based on capability information of the second node, where the capability information of the second node is used to indicate at least one of the following: Whether the second node supports executing the VFL task; The second node supports a time period for executing the VFL task; whether the second node can serve as the initiator of the VFL task; the computing power of the second node; and The service area of ​​the second node.

3. The method according to claim 2, wherein: The parameter information of the at least one second node is collected or determined by the first network element, wherein, for each second node, the parameter information of the second node includes at least one of the following: capability information of the second node; an identifier of the second node; address information of the second node; and An identifier of an application corresponding to the second node.

4. The method according to claim 3, wherein: For each second node, parameter information of the second node is carried by second registration request information, and the second registration request information is registration request information sent by the second node to the first network element.

5. The method according to any one of claims 1 to 4, wherein: Before receiving the first information from the first network element, the method further includes: Send parameter information of the first node to the first network element, where the parameter information of the first node includes at least one of the following: capability information of the first node; an identifier of the first node; address information of the first node; and an identifier of an application corresponding to the first node; The capability information of the first node is used to indicate at least one of the following: Whether the first node supports executing the VFL task; The first node supports a time period for executing a VFL task; Whether the first node can serve as the initiator of the VFL task; the computing power of the first node; and The service area of ​​the first node.

6. The method according to claim 5, wherein: The first node is an application function AF, and the sending parameter information of the first node to the first network element includes: Sending parameter information of a first event to the first network element through the network function open NEF, where the parameter information of the first event is generated based on the parameter information of the first node; The parameter information of the first event is used to indicate at least one of the following: whether the AF supports executing the first event; The AF supports a time period for executing the first event; whether the AF can serve as the initiator of the first event; the computing power of the AF; and The identifier of the application corresponding to the AF; wherein the first event is associated with a VFL task.

7. The method according to claim 5 or 6, wherein: The parameter information of the first node is carried by first registration request information, and the first registration request information is registration request information sent by the first node to the first network element.

8. The method according to any one of claims 1 to 7, wherein: Before receiving the first information from the first network element, the method further includes: Sending second information to the first network element, where the second information is used to request the first information.

9. The method according to claim 8, wherein: The first node is an AF, and sending the second information to the first network element includes: The second information is sent to the first network element through the NEF.

10. The method according to claim 8 or 9, wherein: The second information is used to indicate at least one of the following: Perform VFL tasks; The time period for performing VFL tasks; As the initiator of the VFL task; The computing power required to perform VFL tasks; and, The service area where the VFL task is executed.

11. The method according to any one of claims 1 to 10, wherein: The step of determining at least one participating node participating in the VFL task from the at least one second node includes: For a second node that agrees to participate in the VFL task, the second node is determined as a participating node participating in the VFL task.

12. The method according to any one of claims 1 to 11, wherein: The method further comprises: Data requirement information is sent to the at least one second node, where the data requirement information is used to determine data for executing the VFL task, and the data requirement information includes: the type of data required for executing the VFL task, and / or the validity period of the required data.

13. The method according to any one of claims 1 to 12, wherein: The method further comprises: Receive third information from the at least one second node, where the third information is used to indicate whether the second node agrees to participate in the VFL task.

14. The method according to claim 12 or 13, wherein: The first node is an AF, and the sending of data demand information to the at least one second node includes: The data requirement information is sent to the at least one second node through the NEF.

15. The method according to any one of claims 1 to 14, wherein: The method further comprises: Sending a corresponding VFL model to the at least one participating node, where the VFL model is used to execute the VFL task; wherein the VFL model includes an identification and / or address information of the corresponding participating node.

16. The method according to claim 15, wherein: The first node is an AF, the participating node is a terminal device or an access network element, and the sending of the corresponding VFL model to the participating node includes: The corresponding VFL model is sent to the terminal device or the access network element through the second network element.

17. The method according to any one of claims 1 to 16, wherein: The method further comprises: An association identifier is sent to the at least one participating node, where the association identifier is used to aggregate different execution results of the same VFL task.

18. The method according to any one of claims 1 to 17, wherein: The method further comprises: Receive a first execution result corresponding to the VFL task, the first execution result including: a second execution result of at least one participating node executing the VFL task; and / or at least one aggregation result, each aggregation result of the at least one aggregation result being aggregated based on at least two second execution results.

19. The method according to claim 18, wherein: Each second execution result, and / or each aggregated result in the at least one aggregated result, carries the same association identifier.

20. The method according to claim 18 or 19, wherein: Each of the at least one aggregation result is obtained by aggregation based on the same association identifier.

21. The method according to any one of claims 18 to 20, wherein: The method further comprises: Aggregate the execution results corresponding to the VFL tasks having the same association identifier and the execution results of the VFL tasks executed by the first node.

22. The method of any one of claims 1 to 5, 7 to 8, 10 to 13, 15 or 17 to 21, wherein The first node is a terminal device, an access network element, a core network element or an AF.

23. The method according to any one of claims 1 to 22, wherein: The second node includes at least one of the following: a terminal device, an access network element, a core network element and an AF.

24. The method according to any one of claims 1 to 23, wherein: The first network element is a network storage function NRF.

25. A communication method, applied to a second node, the method comprising: The capability information of the second node is sent to the first network element, where the capability information of the second node is used to determine whether the second node meets the conditions for executing the vertical federated learning VFL task.

26. The method according to claim 25, wherein: The capability information of the second node is used to indicate at least one of the following: Whether the second node supports executing the VFL task; The second node supports a time period for executing the VFL task; whether the second node can serve as the initiator of the VFL task; the computing power of the second node; and The service area information of the second node.

27. The method according to claim 25 or 26, wherein: The method further comprises: Send parameter information of the second node to the first network element, where the parameter information of the second node includes at least one of the following: capability information of the second node; an identifier of the second node; address information of the second node; and An identifier of an application corresponding to the second node.

28. The method according to claim 27, wherein: The second node is an application function AF, and the sending parameter information of the second node to the first network element includes: Sending parameter information of a second event to the first network element through the network function open NEF, where the parameter information of the second event is generated based on the parameter information of the second node; The parameter information of the second event is used to indicate at least one of the following: whether the AF supports executing the second event; The AF supports a time period for executing the second event; whether the AF can serve as the initiator of the second event; the computing power of the AF; and The identifier of the application corresponding to the AF; wherein the second event is associated with a VFL task.

29. The method according to claim 27 or 28, wherein: The parameter information of the second node is carried by second registration request information, and the second registration request information is registration request information sent by the second node to the first network element.

30. The method according to any one of claims 25 to 29, wherein: The method further comprises: Receive data requirement information from the first node, where the data requirement information is used to determine data for executing the VFL task, and the data requirement information includes: a type of data required for executing the VFL task, and / or a valid time of the required data.

31. The method according to any one of claims 25 to 30, wherein: The method further comprises: Sending third information to the first node, where the third information is used to indicate whether the second node agrees to participate in the VFL task.

32. The method according to claim 30 or 31, wherein: The first node is an AF, and the receiving data demand information from the first node includes: The data requirement information is received from the first node through the NEF.

33. A method according to any one of claims 25 to 32, wherein: The method further comprises: A VFL model is received from the first node, where the VFL model is used to execute the VFL task; wherein the VFL model corresponds to the second node, and the VFL model includes an identification and / or address information of the second node.

34. A method according to any one of claims 25 to 33, wherein: The method further comprises: An association identifier is received from the first node, where the association identifier is used to aggregate different execution results of the same VFL task.

35. The method of claim 34, wherein: The method further comprises: An execution result of the VFL task executed by the second node is sent to the first node, where the execution result carries the association identifier.

36. The method of claim 34, wherein: The method further comprises: Receiving a second execution result of at least one participating node executing the VFL task; An aggregation result is sent to the first node, where the aggregation result is obtained by aggregating at least one second execution result and a third execution result of the second node executing the VFL task, wherein the aggregation result carries the association identifier.

37. The method of claim 36, wherein: Each second execution result and the third execution result carry the same association identifier, and the aggregated result is obtained by aggregation based on the same association identifier.

38. A method according to any one of claims 25 to 31 or 33 to 37, wherein The first node is a terminal device, an access network element, a core network element or an AF.

39. A method according to any one of claims 25 to 27 or 29 to 38, wherein The second node is a terminal device, an access network element, a core network element or an AF.

40. The method according to any one of claims 25 to 39, wherein: The first network element is a network storage function NRF.

41. A communication method, applied to a first network element, the method comprising: Capability information of at least one second node is obtained, where the capability information of the second node is used to determine whether the second node meets the conditions for executing the vertical federated learning VFL task.

42. The method according to claim 41, wherein: The capability information of the second node is used to indicate at least one of the following: Whether the second node supports executing the VFL task; The second node supports a time period for executing the VFL task; whether the second node can serve as the initiator of the VFL task; the computing power of the second node; and The service area information of the second node.

43. The method according to claim 41 or 42, wherein: Before acquiring the capability information of at least one second node, the method further includes: Receive parameter information of the at least one second node, wherein, for each second node, the parameter information of the second node includes at least one of the following: capability information of the second node; an identifier of the second node; address information of the second node; and An identifier of an application corresponding to the second node.

44. The method of claim 43, wherein: For each second node, parameter information of the second node is carried by second registration request information, and the second registration request information is registration request information sent by the second node to the first network element.

45. The method according to any one of claims 41 to 44, wherein: The method further comprises: Receive parameter information of the first node, where the parameter information of the first node includes at least one of the following: capability information of the first node; an identifier of the first node; address information of the first node; and an identifier of an application corresponding to the first node; The capability information of the first node is used to indicate at least one of the following: Whether the first node supports executing the VFL task; The first node supports a time period for executing a VFL task; Whether the first node can serve as the initiator of the VFL task; the computing power of the first node; and The service area of ​​the first node.

46. ​​The method of claim 45, wherein: The parameter information of the first node is carried by first registration request information, and the first registration request information is registration request information sent by the first node to the first network element.

47. A method according to any one of claims 40 to 46, wherein: The method further comprises: First information is sent to the first node, where the first information is used to indicate at least one second node that meets the condition for executing the VFL task.

48. The method of claim 47, wherein: Before sending the first information to the first node, the method further includes: Second information is received from the first node, where the second information is used to request the first information.

49. The method according to any one of claims 41 to 48, wherein: The first node is a terminal device, an access network element, a core network element or an application function AF.

50. The method according to any one of claims 41 to 49, wherein: The second node includes at least one of the following: a terminal device, an access network element, a core network element and an AF.

51. The method according to any one of claims 41 to 50, wherein: The first network element is a network storage function NRF.

52. A communication device, the device comprising: A first receiving module is configured to receive first information from a first network element, where the first information is used to indicate at least one second node that meets the condition for executing the VFL task; The determination module is configured to determine at least one participating node participating in the VFL task from the at least one second node.

53. A communication device, the device comprising: The first sending module is configured to send capability information of the device to the first network element, where the capability information of the device is used to determine whether the device meets the conditions for executing the vertical federated learning VFL task.

54. A communication device, the device comprising: The acquisition module is configured to acquire capability information of at least one second node, where the capability information of the second node is used to determine whether the second node meets the conditions for executing the vertical federated learning VFL task.

55. A communication device, comprising: A memory for storing computer executable instructions; A processor, connected to the memory, for implementing the method of any one of claims 1 to 24, or the method of any one of claims 25 to 40, or the method of any one of claims 41 to 51 by executing the computer-executable instructions.

56. A chip, comprising: A processor, used to call and run a computer program from a memory so that a device equipped with the chip executes a method as described in any one of claims 1 to 24, or executes a method as described in any one of claims 25 to 40, or executes a method as described in any one of claims 41 to 51.

57. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by at least one processor, implements the method as claimed in any one of claims 1 to 24, or implements the method as claimed in any one of claims 25 to 40, or implements the method as claimed in any one of claims 41 to 51.

Images