WO2024125356A2 - Procédé et appareil de traitement de tâche de détection - Google Patents

Procédé et appareil de traitement de tâche de détection Download PDF

Info

Publication number
WO2024125356A2
WO2024125356A2 PCT/CN2023/136693 CN2023136693W WO2024125356A2 WO 2024125356 A2 WO2024125356 A2 WO 2024125356A2 CN 2023136693 W CN2023136693 W CN 2023136693W WO 2024125356 A2 WO2024125356 A2 WO 2024125356A2
Authority
WO
WIPO (PCT)
Prior art keywords
node
perception
audit
task
nodes
Prior art date
Application number
PCT/CN2023/136693
Other languages
English (en)
Chinese (zh)
Other versions
WO2024125356A3 (fr
Inventor
徐浩
薛松岩
曾清海
孙飞
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2024125356A2 publication Critical patent/WO2024125356A2/fr
Publication of WO2024125356A3 publication Critical patent/WO2024125356A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
    • H04W8/24—Transfer of terminal data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements

Definitions

  • the present application relates to the field of communications, and in particular to a method and device for processing a perception task.
  • Perception technology is a basic technology in the field of wireless communications, used to perceive and identify the material world, such as spectrum sensing.
  • spectrum sensing is often used to solve the problem of inaccurate perception results caused by the perception ability of a single perception node being affected by the environment or the node itself being untrustworthy.
  • distributed collaborative sensing can achieve higher spectrum utilization.
  • the distributed collaborative perception system includes a decision node and multiple perception nodes.
  • the multiple perception nodes send their perception information to the decision node, which makes a central decision (also called centralized decision).
  • this method has security issues. If a problem occurs in one of the perception nodes, for example, pretending not to hear something or maliciously providing wrong information, the accuracy and reliability of perception will be reduced.
  • the present application provides a perception task processing method and device, which are conducive to improving the accuracy and reliability of perception, thereby improving system performance.
  • a task processing method including: a first node sends a capability query request to a second node, the capability query request is used to query whether the second node meets the capability requirements of the first node; the first node receives a capability confirmation message from the second node, the capability confirmation message includes information used to indicate that the second node meets the capability requirements of the first node; the first node sends a grouping request to the second node based on the capability confirmation message, the grouping request is used to request that the second node be included in a target group; the first node receives a group confirmation message from the second node, the group confirmation message is used to indicate whether to join the target group; if the group confirmation message is used to indicate that the second node joins the target group, the first node adds the second node to the target group.
  • the perception task processing method of the present application sends a capability query request to each node through the first node to query whether each node meets the capability requirements, and dynamically deploys the perception nodes in the system based on the capabilities of the nodes. Only when the node meets the capability requirements, the node is used as a node for processing perception tasks.
  • the embodiment of the present application performs preliminary screening and filtering on the perception nodes that process perception tasks, and can filter out nodes that do not meet the capability requirements, which is beneficial to improving the accuracy and reliability of perception, thereby improving system performance.
  • the group confirmation message may be sent in a broadcast or multicast manner.
  • the capability query request includes identification information of the perceptible target and information used to represent capability requirements of the first node for the perceptible target.
  • the identification information of the perceptible target is used to identify the perceptible target.
  • the perceptible target is the spectrum
  • the identification information of the perceptible target is the identification information of the spectrum.
  • the information used to represent the capability requirements of the first node for the perceptible target may include the number of the target frequency band and the perception performance requirements (for example, the requirements for receiver sensitivity).
  • the grouping request carries an identifier of the target group
  • the group confirmation message carries the identifier of the target group
  • the identifier of the target group may be generated sequentially according to the processing order of the services, or may be randomly generated in a specific manner, which is not limited in the embodiments of the present application.
  • the method further includes: the first node receives the head node indication information from the second node, The head node indication information is used to indicate that the second node is a head node.
  • each node in the target group can conduct an election to select a head node so that the consensus algorithm can be used to process the perception task later.
  • the head node indication information includes at least one of the following: an identifier of the second node, a communication address of the second node, or a valid duration of the second node as the head node.
  • the method further includes: the first node sending a confirmation message to the second node, for responding to the second node as the head node.
  • the confirmation message may be ACK or NACK. If a node feeds back an ACK message, it indicates that the node agrees to use the second node as the head node. If a node feeds back a NACK message, it indicates that the node does not agree to use the second node as the head node.
  • this application can prevent nodes in the system (i.e., the second node) from cheating, which is beneficial to improving the accuracy of head node election and system security.
  • the method also includes: the first node sends a perception task to the second node, the perception task includes first configuration information, the first configuration information includes at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; the first node receives a first perception result from the second node.
  • each node in the target group will generate a perception result
  • the perception result generated by the second node is the second perception result
  • the first perception result obtained by the consensus algorithm may be the same as the second perception result, or may be different from the second perception result.
  • the consensus algorithm can be, for example, the above-mentioned RAFT algorithm or PBFT algorithm, which is not limited in this embodiment of the present application.
  • the identification of the above-mentioned perception task is specifically used to identify this perception task
  • the type information of the perceptible target is used to indicate the type corresponding to this perception task (for example, spectrum perception)
  • the perception time parameter may include the time interval between each authorized use of the perceptible target (for example, the time interval between each authorized use of the target frequency band).
  • the purpose of setting the perception time parameter is to ensure that nodes use the perceptible target fairly and prohibit long-term occupancy, so that it can be sensed and used after being idle for a period of time.
  • the method also includes: the first node sends a perception task to the nodes in the target group, the perception task includes first configuration information, the first configuration information includes at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; the first node receives a second perception result from the node in the target group; the first node determines a third perception result based on the second perception result of the node in the target group.
  • the method before the first node sends the perception task, the method also includes: the first node determines whether there is a perceptible target; the first node sends the perception task, including: when the perceptible target exists, the first node sends the perception task.
  • the first node may determine whether there is a perceptible target based on existing information, and the existing information may be historical data related to the perceptible target.
  • the first node may query a database to determine whether there is a perceptible target.
  • the method further includes: the first node sending the first perception result to a trusted storage device.
  • the method further includes: the first node sending the third perception result to a trusted storage device.
  • the first node may add a signature of the first node to ensure the accuracy of the transmitted information.
  • the method also includes: the first node sends an audit task to the second node, the second node is a head node, the audit task includes second configuration information, the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; the first node receives indication information from the second node, the indication information is used to indicate that the audit task has been completed.
  • the first node can also use the target group to process audit tasks to supervise the execution process of the above-mentioned perception results.
  • the first audit result is the perception result generated by the second node.
  • the second audit result obtained by the consensus algorithm may be the same as the first audit result, or it may be different from the first audit result.
  • the consensus algorithm can be, for example, the RAFT algorithm or the PBFT algorithm mentioned above, which is not limited in the embodiments of the present application.
  • the identifier of the above-mentioned first node is specifically used to identify the first node
  • the type information of the perceptible target is used to indicate the type corresponding to this audit task (for example, an audit of nodes that use the spectrum after spectrum sensing)
  • the audit time parameters may include the single occupancy time of the perceptible target and the time interval between each authorized use of the perceptible target (for example, the time interval between each authorized use of the target frequency band).
  • the purpose of setting the audit time parameters is to ensure that nodes use the perceptible target fairly and prohibit long-term occupancy, so that competitive use can be sensed after periodic vacancy.
  • the method also includes: the first node sends an audit task to the nodes in the target group, the audit task includes second configuration information, the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; the first node receives indication information from all or part of the nodes in the target group, the indication information is used to indicate that the audit task has been completed; the first node determines whether the audit task has been completed based on the indication information of all or part of the nodes.
  • the method further includes: the first node sending the indication information to the trusted storage device.
  • the first node may add a signature of the first node to ensure the accuracy of the transmitted information.
  • the method further includes: the first node resending the capability query request to rebuild the target group.
  • the first node may resend the capability query request and re-establish the target group, that is, update the nodes in the target group.
  • the first node may also resend the capability query request to re-establish the target group, i.e., update the nodes in the target group, when the perceptible target changes and/or the capability requirement for the node changes.
  • the capability query request sent by the first node carries the identification information of the new perceptible target and/or the new requirement information for the perceptible target.
  • the first node can dynamically adjust the nodes in the group used to process perception tasks as the scenario and/or requirements change, remove nodes that do not meet the requirements from the group, and add nodes that meet the requirements to the group. This is more flexible in implementation and is conducive to improving the accuracy and reliability of perception, thereby improving system performance.
  • another task processing method including: the second node receives a capability query request from the first node, the capability query request is used to query whether the second node meets the capability requirements of the first node; the second node sends a capability confirmation message to the first node, the capability confirmation message includes information indicating that the second node meets the capability requirements of the first node; the second node receives a grouping request from the first node, the grouping request is used to request that the second node be included in a target group; the second node sends a group confirmation message to the first node, the group confirmation message is used to indicate that the second node has joined the target group.
  • the capability query request includes identification information of the perceptible target and information used to represent capability requirements of the first node for the perceptible target.
  • the grouping request carries an identifier of the target group
  • the group confirmation message carries the identifier of the target group
  • the method also includes: the second node sends a heartbeat signal to other nodes in the target group; the second node receives and counts heartbeat signals from the other nodes; the second node determines that the second node is a head node based on the number and time of heartbeat signals received by the second node; the second node sends head node indication information to the first node and the other nodes, and the head node indication information is used to indicate that the second node is a head node.
  • the head node indication information includes at least one of the following: an identifier of the second node, a communication address of the second node, or a valid duration of the second node as the head node.
  • the method further includes: the second node receiving The first node performs a perception task, wherein the perception task includes first configuration information, and the first configuration information includes at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; the second node sends the perception task to the other nodes, and performs perception based on the perception task to obtain a second perception result; the second node and the other nodes reach a consensus on the second perception result using a consensus algorithm to obtain a first perception result; the second node sends the first perception result to the first node.
  • the method also includes: the second node receives a perception task from the first node, the perception task includes first configuration information, the first configuration information includes at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; the second node performs perception based on the perception task to obtain a second perception result; and the second node sends the second perception result to the first node.
  • the method also includes: the second node receives a second perception result from the other nodes; the second node sends the second perception result of the first node and the second perception result of the other nodes to a trusted storage device.
  • the method further includes: the second node sending a second perception result of the first node to a trusted storage device.
  • the method also includes: the second node receives an audit task from the first node, the audit task includes second configuration information, and the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; the second node sends the audit task to the other nodes, and performs an audit based on the audit task to obtain a first audit result; the second node and the other nodes reach a consensus on the first audit result using a consensus algorithm to obtain a second audit result; the second node sends an indication information to the first node, and the indication information is used to indicate that the audit task has been completed.
  • the method also includes: the second node receives an audit task from the first node, the audit task includes second configuration information, the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; the second node performs an audit based on the audit task to obtain a first audit result; the second node sends an indication information to the first node, and the indication information is used to indicate that the audit task has been completed.
  • the method further includes: the second node receives a third audit result from the other nodes; and the second node sends the first audit result and the third audit result to the trusted storage device.
  • the method further includes: the second node sending the first audit result to the trusted storage device.
  • a perception task processing device which is used to execute the method in any possible implementation of the first aspect or the second aspect.
  • the device includes a module for executing the method in any possible implementation of the first aspect or the second aspect.
  • a device including a processor, the processor is coupled to a memory, and can be used to execute instructions in the memory to implement the method in any possible implementation of the first aspect or the second aspect.
  • the device also includes a memory.
  • the device also includes a communication interface, and the processor is coupled to the communication interface.
  • the device is a network device or a terminal device.
  • the communication interface may be a transceiver, or an input/output interface.
  • the device is a chip configured in a network device or a terminal device.
  • the communication interface may be an input/output interface.
  • a processor comprising: an input circuit, an output circuit, and a processing circuit.
  • the processing circuit is used to receive a signal through the input circuit and transmit a signal through the output circuit, so that the processor executes the method in any possible implementation of the first aspect or the second aspect.
  • the processor may be a chip
  • the input circuit may be an input pin
  • the output circuit may be an output pin
  • the processing circuit may be a transistor, a gate circuit, a trigger, and various logic circuits.
  • the input signal received by the input circuit may be received and input by, for example, but not limited to, a receiver
  • the signal output by the output circuit may be, for example, but not limited to, an output pin.
  • the input circuit and the output circuit may be the same circuit, which is used as the input circuit and the output circuit at different times.
  • the embodiments of the present application do not limit the specific implementation of the processor and various circuits.
  • a processing device comprising a processor and a memory.
  • the processor is used to read instructions stored in the memory, and can receive signals through a receiver and transmit signals through a transmitter to execute the method in any possible implementation of the first aspect or the second aspect.
  • the number of the processors is one or more, and the number of the memories is one or more.
  • the memory may be integrated with the processor, or the memory may be provided separately from the processor.
  • the memory can be a non-transitory memory, such as a read-only memory (ROM), which can be integrated with the processor on the same chip or can be separately set on different chips.
  • ROM read-only memory
  • the embodiments of the present application do not limit the type of memory and the setting method of the memory and the processor.
  • the relevant data interaction process can be a process of outputting indication information from a processor
  • receiving capability information can be a process of receiving input capability information from a processor.
  • the processed output data can be output to a transmitter, and the input data received by the processor can come from a receiver.
  • the transmitter and the receiver can be collectively referred to as a transceiver.
  • the processing device in the sixth aspect mentioned above can be a chip.
  • the processor can be implemented by hardware or by software.
  • the processor can be a logic circuit, an integrated circuit, etc.; when implemented by software, the processor can be a general-purpose processor, which is implemented by reading the software code stored in the memory.
  • the memory can be integrated in the processor or can be located outside the processor and exist independently.
  • a perception task processing system comprising a first node in any possible implementation of the first aspect and a second node in any possible implementation of the second aspect.
  • a computer program product comprising: a computer program (also referred to as code, or instruction), which, when executed, enables a computer to execute a method in any possible implementation of the first aspect or the second aspect.
  • a computer program also referred to as code, or instruction
  • a computer-readable storage medium which stores a computer program (also referred to as code, or instructions).
  • a computer program also referred to as code, or instructions.
  • FIG1 is a schematic diagram of a communication system applicable to an embodiment of the present application.
  • FIG2 is a schematic diagram of an application scenario of an embodiment of the present application.
  • Figure 3 is a flow chart of consensus among nodes based on the PBFT algorithm
  • FIG4 is a schematic diagram of another application scenario of an embodiment of the present application.
  • FIG5 is a schematic flow chart of a perception task processing method according to an embodiment of the present application.
  • FIG6 is a schematic flow chart of another perception task processing method according to an embodiment of the present application.
  • FIG7 is a schematic flow chart of another perception task processing method according to an embodiment of the present application.
  • FIG8 is a schematic flow chart of an audit task processing method according to an embodiment of the present application.
  • FIG9 is a schematic block diagram of a perception task processing device according to an embodiment of the present application.
  • FIG10 is a schematic block diagram of another perception task processing device according to an embodiment of the present application.
  • words such as “first” and “second” are used to distinguish the same or similar items with substantially the same functions and effects. Those skilled in the art can understand that words such as “first” and “second” do not limit the quantity and execution order, and words such as “first” and “second” do not necessarily limit the difference.
  • At least one means one or more
  • plural means two or more.
  • “And/or” describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and/or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character “/” generally indicates that the previous and next associated objects are in an “or” relationship. "At least one of the following” or similar expressions refers to any combination of these items, including any combination of single or plural items.
  • At least one of a, b and c can mean: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c, where a, b, c can be single or multiple.
  • LTE long term evolution
  • FDD frequency division duplex
  • TDD LTE time division duplex
  • UMTS universal mobile telecommunication system
  • WiMAX worldwide interoperability for microwave access
  • 5G future fifth generation
  • NR new radio
  • SCMA sparse code multiple access
  • SCMA can also be called other names in the communication field
  • the technical solutions of the embodiments of the present application can be applied to multi-carrier transmission systems using non-orthogonal multiple access technology, such as orthogonal frequency division multiplexing (OFDM), filter bank multi-carrier (FBMC), generalized frequency division multiplexing (GFDM), filtered orthogonal frequency division multiplexing (F-OFDM) system, etc.
  • OFDM orthogonal frequency division multiplexing
  • FBMC filter bank multi-carrier
  • GFDM generalized frequency division multiplexing
  • F-OFDM filtered orthogonal frequency division multiplexing
  • FIG. 1 shows a schematic diagram of a communication system 100 applicable to an embodiment of the present application.
  • the communication system 100 may include at least one network device, such as the network device 110 shown in FIG. 1; the communication system 100 may also include at least one terminal device, such as the terminal device 120 shown in FIG. 1.
  • the network device 110 and the terminal device 120 may communicate via a wireless link.
  • Each communication device, such as the network device 110 or the terminal device 120 may be configured with multiple antennas, and the multiple antennas may include at least one transmitting antenna for sending signals and at least one receiving antenna for receiving signals.
  • each communication device also additionally includes a transmitter chain and a receiver chain, and those skilled in the art can understand that they may include multiple components related to signal transmission and reception (such as processors, modulators, multiplexers, demodulators, demultiplexers or antennas, etc.). Therefore, the network device 110 and the terminal device 120 can communicate via multi-antenna technology.
  • the terminal device in the embodiment of the present application can communicate with one or more core networks via a radio access network (RAN), and the terminal device can be called an access terminal, user equipment (UE), 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.
  • RAN radio access network
  • the access terminal can be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a future 5G network, or a terminal device in a future evolved public land mobile network (PLMN), etc.
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistant
  • PLMN future evolved public land mobile network
  • the network device in the embodiments of the present application may be a device for communicating with a terminal device.
  • the network device may be a base station (base transceiver station, BTS) in a global system for mobile communications (GSM) system or a code division multiple access (CDMA) system, or a base station (NodeB, NB) in a wideband code division multiple access (WCDMA) system, or an evolved NodeB (eNB or eNodeB) in an LTE system, or a wireless controller in a cloud radio access network (CRAN) scenario, or the network device may be a relay station, an access point, an on-board device, a wearable device, a network device in a future 5G network, or a network device in a future evolved PLMN network, etc.
  • GSM global system for mobile communications
  • CDMA code division multiple access
  • NodeB, NB base station
  • WCDMA wideband code division multiple access
  • eNB or eNodeB evolved NodeB
  • CRAN
  • a gNB in an NR system or a transmission point (TRP or TP), one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, or a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (DU).
  • TRP or TP transmission point
  • BBU baseband unit
  • DU distributed unit
  • the gNB may include a centralized unit (CU) and a DU.
  • the gNB may also include a radio unit (RU).
  • the CU implements some of the functions of the gNB, and the DU implements some of the functions of the gNB, such as
  • the DU implements the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers, and the DU implements the functions of the radio link control (RLC) layer, the media access control (MAC) layer, and the physical (PHY) layer.
  • RRC radio resource control
  • PDCP packet data convergence protocol
  • RLC radio link control
  • MAC media access control
  • PHY physical
  • the network device can be a CU node, or a DU node, or a device including a CU node and a DU node.
  • the CU can be divided into a network device in the access network (radio access network, RAN), and the CU can also be divided into a network device in the core network (core network, CN), and this application does not limit this.
  • the above-mentioned network device can also refer to the general term for all devices on the network end.
  • multiple TRPs can be collectively referred to as network devices.
  • the terminal device or network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.
  • the hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and a memory (also called main memory).
  • the operating system can be any one or more computer operating systems that implement business processing through a process, such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a Windows operating system.
  • the application layer includes applications such as a browser, an address book, a word processing software, and an instant messaging software.
  • the embodiment of the present application does not specifically limit the specific structure of the execution subject of the method provided in the embodiment of the present application.
  • the execution subject of the method provided in the embodiment of the present application can be a terminal device or a network device, or a functional module in the terminal device or the network device that can call and execute a program.
  • computer-readable media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks or tapes, etc.), optical disks (e.g., compact discs (CDs), digital versatile discs (DVDs), etc.), smart cards and flash memory devices (e.g., erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.).
  • the various storage media described herein may represent one or more devices and/or other machine-readable media for storing information.
  • machine-readable medium may include, but is not limited to, wireless channels and various other media capable of storing, containing and/or carrying instructions and/or data.
  • Node is a general term for devices in the system.
  • the above-mentioned terminal devices and network devices can all be called nodes.
  • Consensus is when multiple nodes reach a consensus on something, especially when some nodes fail, network delays, or network partitions occur.
  • the consensus algorithm ensures that multiple nodes in a cluster work together so that data remains consistent when a request is received. Even if a node goes down, the entire system can still maintain service availability. In distributed systems, consensus algorithms are more used to improve the fault tolerance of the system.
  • the current consensus algorithms mainly include proof of work (POW) algorithm, proof of stake (POS) algorithm, delegated proof of stake (DPOS) algorithm, verification pool algorithm, RAFT algorithm, practical byzantine fault tolerance (PBFT) algorithm, and so on.
  • POW proof of work
  • POS proof of stake
  • DPOS delegated proof of stake
  • RAFT verification pool algorithm
  • RAFT practical byzantine fault tolerance
  • the RAFT algorithm includes three roles: follower, candidate, and leader.
  • each cluster has only one leader node, which is responsible for processing client write requests, log replication, and regularly sending heartbeat messages to follower nodes.
  • the candidate node sends a message requesting a vote to other nodes. If it wins the majority of votes, it becomes the leader node.
  • the follower node is passive and will not actively send requests under normal circumstances. If it does not receive a heartbeat message from the leader node for a certain period of time, it will become a candidate node.
  • a node in a cluster can only be in one of these three states at a time. These three roles can be They convert to each other as time and conditions change. All nodes are in follower state when they start. If they do not receive heartbeat messages from the leader node for a period of time, the nodes in follower state will switch to candidate state and initiate elections. If a node is successfully elected, it will switch to leader state. If the node finds that other nodes have been successfully elected, it will actively switch to follower state. The leader node will continuously send heartbeat messages to the follower nodes to indicate its own survival status. If the leader node fails, the follower nodes that have not received heartbeat messages from the leader node after a period of time will switch to candidate state and re-elect the leader node.
  • the RAFT algorithm decomposes the consensus problem into three sub-problems:
  • Leader election There is only one leader node. If the leader node fails, a new leader node is selected through an election mechanism.
  • Safety The safety principle is used to handle some special situations and ensure the completeness of the RAFT algorithm.
  • the core process of the RAFT algorithm can be summarized as follows: first, a leader node is selected, which is responsible for receiving external data update or deletion requests; then the log is copied to other follower nodes, and the consistency of the entire log replication is guaranteed by security criteria; if the leader node fails, the follower node will re-initiate the election of a new leader node.
  • the maximum number of fault-tolerant nodes supported by the RAFT algorithm is (N-1)/2, where N is the total number of nodes in the cluster and N is greater than or equal to 3.
  • Fig. 2 shows a schematic diagram of an application scenario 200 of an embodiment of the present application.
  • the application scenario 200 includes three nodes, namely, node 210, node 220, and node 230.
  • the three nodes can communicate with each other to obtain a consensus result through the RAFT algorithm.
  • Figure 3 shows a flowchart of consensus among nodes based on the PBFT algorithm.
  • the basic process of the PBFT algorithm mainly consists of the following five stages:
  • Phase 1 the request phase, the client broadcasts the request to node 0 (also called the primary node or head node, which can be the first node to receive the request or randomly selected from the nodes that receive the request).
  • node 0 also called the primary node or head node, which can be the first node to receive the request or randomly selected from the nodes that receive the request.
  • node 0 In the second stage, the pre-prepare stage, node 0 broadcasts perception information to other nodes.
  • the message tag will contain the current term of the master node, timestamp and the stage identifier of the pre-prepare stage. Each subsequent link will update the stage identifier to keep the consensus synchronized through the same number of terms.
  • Phase 3 the preparation phase, after receiving the perception information from node 0, nodes 1 to 3 repeat the broadcast content of node 0 to other nodes except themselves if the content of the perception information is consistent with their own perception (or decision) results, and the number of consistent messages is greater than 2f+1. If there is inconsistency but they insist on issuing different results, then the node is a Byzantine node (malicious node). Nodes 1 to 3 update their labels to "prepare" respectively.
  • Phase 4 the commit phase, all nodes receive messages from the previous phase. If the number of consistent messages received is greater than 2f+1, the content is repeated to each node to complete the commit phase.
  • Phase 5 the reply phase, when the number of consistent messages received by each node is greater than 2f+1, a reply message is sent to the client. If the client receives f+1 consistent messages, it can be considered that the message has met the consistency requirements recognized by most nodes in the PBFT consensus, and the consensus is completed.
  • FIG4 shows a schematic diagram of another application scenario 400 of an embodiment of the present application.
  • the application scenario 400 includes four nodes, namely, node 410, node 420, node 430, and node 440.
  • the four nodes can communicate with each other to obtain a consensus result through the PBFT algorithm.
  • the fault tolerance of the RAFT algorithm only supports faulty nodes, not malicious nodes.
  • a faulty node is a node that is unresponsive due to system busyness, downtime, network problems, or other abnormal conditions.
  • malicious nodes can also deliberately send wrong data, or send different data to different other nodes, so that the nodes of the entire cluster cannot reach a consensus in the end.
  • the correct nodes in the cluster are The number of nodes only needs to be 1 more than f nodes, that is, f+1 nodes, and the number of correct nodes will be greater than the number of faulty nodes, and the cluster can reach a consensus. Therefore, the maximum number of fault-tolerant faulty nodes supported by the RAFT algorithm is (N-1)/2, where N is the total number of nodes in the cluster, and N is greater than or equal to 3.
  • the PBFT algorithm In addition to supporting faulty nodes, the PBFT algorithm also needs to support faulty malicious nodes. Assume that the total number of nodes in the cluster is N, and the number of problem nodes is f. Among the f problem nodes, a node can be both a faulty node and a malicious node, or just a faulty node, or just a malicious node. Then, the following two extreme situations will occur:
  • f problem nodes are both faulty nodes and malicious nodes.
  • the number of correct nodes in the cluster only needs to be one more than f nodes, that is, f+1 nodes.
  • the number of correct nodes will be greater than the number of faulty nodes, and the cluster can reach a consensus.
  • the maximum number of fault-tolerant nodes supported in this case is (N-1)/2.
  • the faulty nodes and malicious nodes are different nodes, so there will be f malicious nodes and f faulty nodes.
  • a node When a node is found to be a malicious node, it will be excluded from the cluster, leaving f faulty nodes.
  • the number of correct nodes in the cluster only needs one more node than f nodes, that is, f+1 nodes.
  • the number of correct nodes will be greater than the number of faulty nodes, and the cluster can reach a consensus. Therefore, the number of nodes of all types (that is, f+1 correct nodes, f faulty nodes, and f malicious nodes) adds up to 3f+1.
  • the maximum number of fault-tolerant nodes supported by the PBFT algorithm is (N-1)/3.
  • the nodes shown in Figure 2 or Figure 4 above can also be called perception nodes.
  • the above consensus algorithm is often used in distributed perception scenarios, which can solve the problem of inaccurate perception results caused by the perception ability of a single perception node being affected by the environment or the node itself being untrustworthy.
  • distributed collaborative sensing can achieve higher spectrum utilization.
  • a distributed collaborative perception system includes a decision node and multiple perception nodes.
  • the multiple perception nodes can use the above consensus algorithm to obtain a consensus result and send the consensus result to the decision node.
  • the multiple perception nodes can send their own perception information to the decision node, and the decision node makes a central decision (also called centralized decision).
  • this method has security issues. If a problem occurs in one of the perception nodes, for example, pretending not to hear something or maliciously providing wrong information, the accuracy and reliability of perception will be reduced.
  • the present application proposes a perception task processing method and device, which dynamically deploys perception nodes in a distributed collaborative perception system in combination with the capabilities of the nodes. Only when the nodes meet the capability requirements will the nodes be used as nodes for processing perception tasks.
  • the embodiment of the present application performs preliminary screening and filtering on the perception nodes that process perception tasks, and can filter out nodes that do not meet the capability requirements, which is beneficial to improving the accuracy and reliability of perception, thereby improving system performance.
  • the perception task processing method and device provided by the present application will be described in detail below in conjunction with the accompanying drawings.
  • the nodes in Figure 2 or Figure 4 are called perception nodes.
  • the application scenarios may also include decision nodes, which are used to issue perception tasks and make decisions on the perception results.
  • decision nodes and perception nodes are only functional divisions.
  • the embodiments of the present application do not limit decision nodes and perception nodes to the same physical entity. In other words, a node can be just a decision node, or just a perception node, or both a decision node and a perception node. The embodiments of the present application do not limit this.
  • an embodiment of the present application is applied to the communication system 100 shown in FIG. 1
  • the perception node may specifically be the terminal device shown in FIG. 1
  • the decision node may specifically be the network device shown in FIG. 1 .
  • the embodiment of the present application can also be applied to a scenario of macro stations and micro stations, which may include one macro station and multiple micro stations.
  • the macro station can serve as a decision node and the micro station can serve as a perception node.
  • the embodiments of the present application can also be applied to the scenario where the CU and DU are separated, that is, the CU and DU are respectively independent nodes, the CU is generally responsible for the high-level protocol stack, and the DU is generally responsible for the low-level protocol stack and signal processing, etc.
  • This scenario may include one CU and multiple DUs, the CU can be used as a decision-making node, and the DU can be used as a perception node.
  • the embodiment of the present application can also be applied to an open radio access network (O-RAN) scenario, which includes a RAN intelligent controller (RIC) node.
  • the RIC node is responsible for node organization and management under the O-RAN architecture and has rich high-level protocol processing and management capabilities.
  • the scenario can also include network equipment, terminal equipment, or other nodes such as CU and DU.
  • the RIC node can serve as a decision-making node, and the network equipment, terminal equipment, or other nodes such as CU and DU can serve as a perception node.
  • the following describes an embodiment of the present application by taking the decision node as the first node and the perception nodes as the second node, the third node and the fourth node as an example, but the embodiment of the present application is not limited to this.
  • FIG5 shows a schematic flow chart of a perception task processing method 500 provided in an embodiment of the present application.
  • the method 500 comprises the following steps:
  • a first node sends a capability query request to a second node, where the capability query request is used to query whether the second node meets the capability requirement of the first node; correspondingly, the second node receives the capability query request.
  • the first node sends a capability query request to the third node, where the capability query request is used to query whether the third node meets the capability requirement of the first node; correspondingly, the third node receives the capability query request.
  • the first node sends a capability query request to the fourth node, where the capability query request is used to query whether the fourth node meets the capability requirement of the first node; correspondingly, the fourth node receives the capability query request.
  • the capability query request is sent by the first node to each node by broadcasting or multicasting.
  • the third node and the fourth node other nodes may also receive the capability query request.
  • the capability query request includes identification information of the perceptible target and information for indicating capability requirements of the first node for the perceptible target.
  • the identification information of the perceptible target is used to identify the perceptible target.
  • the perceptible target is the spectrum
  • the identification information of the perceptible target is the identification information of the spectrum.
  • the information used to represent the capability requirements of the first node for the perceptible target may include the number of the target frequency band and the perception performance requirements (for example, the requirements for receiver sensitivity).
  • the second node sends a capability confirmation message to the first node, where the capability confirmation message includes information indicating that the second node meets the capability requirement of the first node; correspondingly, the first node receives the capability confirmation message.
  • the third node sends a capability confirmation message to the first node, where the capability confirmation message includes information indicating that the third node meets the capability requirement of the first node; correspondingly, the first node receives the capability confirmation message.
  • the fourth node sends a capability confirmation message to the first node, where the capability confirmation message includes information indicating that the fourth node meets the capability requirement of the first node; correspondingly, the first node receives the capability confirmation message.
  • the second node, the third node, or the fourth node may indicate whether the capability requirement of the first node is met by 0 or 1. If the capability requirement of the first node is met, 1 is sent to the first node. If the capability requirement of the first node is not met, 0 is sent to the first node. Therefore, the information used to indicate that the capability requirement of the first node is met may be 1.
  • the first node sends a grouping request to the second node based on the capability confirmation message of the second node, where the grouping request is used to request to add the second node to a target group; correspondingly, the second node receives the grouping request.
  • the first node sends a grouping request to the third node based on the capability confirmation message of the third node, where the grouping request is used to request to add the third node to the target group; correspondingly, the third node receives the grouping request.
  • the first node sends a grouping request to the fourth node based on the capability confirmation message of the fourth node, where the grouping request is used to request to add the fourth node to the target group; correspondingly, the fourth node receives the grouping request.
  • the grouping request carries an identifier of a target group.
  • the identifier of the target group may be the number of the target group (group number).
  • the identifier of the target group may be generated sequentially according to the processing order of the services, or may be randomly generated in a specific manner, which is not limited in the embodiments of the present application.
  • the grouping request of the first node is sent to the node that meets the capability requirements of the first node, such as the node whose capability confirmation information is 1. If the capability confirmation information fed back by a node does not meet the capability requirements of the first node, such as the capability confirmation information is 0, the first node does not need to send a grouping request to the node.
  • the second node sends a group confirmation message to the first node based on the grouping request, where the group confirmation message is used to indicate whether to join the target group; correspondingly, the first node receives the group confirmation message.
  • the third node sends a group confirmation message to the first node based on the grouping request, where the group confirmation message is used to indicate whether to join the target group; correspondingly, the first node receives the group confirmation message.
  • the fourth node sends a group confirmation message to the first node based on the grouping request, where the group confirmation message is used to indicate whether to join the target group; correspondingly, the first node receives the group confirmation message.
  • the group confirmation message may be a positive acknowledgement (ACK) message or a negative acknowledgement. (non-acknowledgement, NACK) message. If the group confirmation message fed back by a node is an ACK message, it means that the node agrees to join the target group. If the group confirmation message fed back by a node is a NACK message, it means that the node refuses to join the target group.
  • ACK positive acknowledgement
  • NACK negative acknowledgement
  • the group confirmation message may be sent in a broadcast or multicast manner.
  • the group confirmation message carries an identifier of the target group.
  • the first node determines a target group based on the received group confirmation message, that is, determines the nodes included in the target group.
  • the first node adds the second node to the target group; if the group confirmation message from the third node is used to instruct the third node to join the target group, the first node adds the third node to the target group; if the group confirmation message from the fourth node is used to instruct the fourth node to join the target group, the first node adds the fourth node to the target group.
  • the embodiment of the present application only lists three nodes that meet the capability requirements and agree to join the target group.
  • the target group includes the second node, the third node and the fourth node. After determining the target group, the first node can process the perception task based on the target group.
  • the perception task processing method of the embodiment of the present application sends a capability query request to each node through the first node to query whether each node meets the capability requirements, and dynamically deploys the perception nodes in the system based on the capabilities of the nodes. Only when the node meets the capability requirements, the node is used as a node for processing perception tasks. In other words, the embodiment of the present application performs preliminary screening and filtering on the perception nodes that process perception tasks, and can filter out nodes that do not meet the capability requirements, which is beneficial to improving the accuracy and reliability of perception, thereby improving system performance.
  • each node in the target group can conduct an election to select a head node so as to subsequently process the perception task using a consensus algorithm.
  • FIG6 shows a schematic flow chart of another sensing task processing method 600 provided in an embodiment of the present application.
  • the method 600 shown in FIG6 is based on FIG5, and adds a head node election process, which specifically includes the following steps:
  • S601 to S613 are the same as S501 to S513 and will not be described again here.
  • the nodes in the target group send heartbeat signals to each other, receive heartbeat signals from other nodes, and count them.
  • Each node determines the head node based on the number and time of the received heartbeat signals.
  • the second node sends heartbeat signals to other nodes in the target group, receives and counts heartbeat signals from the other nodes; the second node determines that the second node is the head node based on the number and time of heartbeat signals received by the second node.
  • the second node determines that the second node is the head node based on the number and time of the received heartbeat signals. It can be: if the second node is the first to receive heartbeat signals greater than or equal to a first preset threshold compared to other nodes, then the second node is the head node. In other words, if the number of heartbeat signals received by the second node meets the requirements and the second node takes the shortest time to meet the requirements, then the second node is the head node.
  • the second node determines that the second node is the head node based on the number and time of the received heartbeat signals. It can be: if the second node receives the largest number of heartbeat signals compared to other nodes within a specified time period, then the second node is the head node.
  • the second node broadcasts head node indication information, where the head node indication information is used to indicate that the second node is a head node.
  • the first node, the third node, and the fourth node receive the head node indication information from the second node respectively.
  • the head node indication information includes at least one of the following: an identifier of the second node, a communication address of the second node, or a valid period of time that the second node serves as the head node.
  • the method 600 further includes the following steps:
  • S616 The first node sends a confirmation message to the second node, and correspondingly, the second node receives the confirmation message.
  • S617 The third node sends a confirmation message to the second node, and correspondingly, the second node receives the confirmation message.
  • the fourth node sends a confirmation message to the second node, and correspondingly, the second node receives the confirmation message.
  • the above confirmation message is used to respond to the second node as the head node.
  • the confirmation message can be ACK or NACK. If the confirmation message fed back by a node is an ACK message, it means that the node agrees to use the second node as the head node. If the confirmation message fed back by a node is a NACK message, it means that the node does not agree to use the second node as the head node.
  • the embodiment of the present application can prevent nodes in the system (i.e., the second node) from cheating through the above-mentioned confirmation mechanism, which is beneficial to improving the accuracy of head node election and system security.
  • the first node may use the target group to process the sensing task.
  • the embodiment of the present application may process the sensing task in a variety of different ways.
  • the method further includes:
  • the first node sends a sensing task to the second node (i.e., the head node in the target group), where the sensing task includes first configuration information, where the first configuration information includes at least one of the following: an identifier of the sensing task, an identifier of the target group, type information of the perceptible target, or a sensing time parameter; correspondingly, the second node receives the sensing task from the first node;
  • the second node sends the above-mentioned perception task to other nodes in the target group, and performs perception based on the perception task to obtain a second perception result; the second node and other nodes reach a consensus on the second perception result using a consensus algorithm to obtain a first perception result;
  • the second node sends the first perception result to the first node, and correspondingly, the first node receives the first perception result.
  • each node in the target group will generate a perception result
  • the above second perception result is the perception result generated by the second node
  • the first perception result obtained by the consensus algorithm may be the same as the second perception result, or may be different from the second perception result.
  • the consensus algorithm can be, for example, the above RAFT algorithm or PBFT algorithm, which is not limited in this embodiment of the present application.
  • the identification of the above-mentioned perception task is specifically used to identify this perception task
  • the type information of the perceptible target is used to indicate the type corresponding to this perception task (for example, spectrum perception)
  • the perception time parameter may include the time interval between each authorized use of the perceptible target (for example, the time interval between each authorized use of the target frequency band).
  • the purpose of setting the perception time parameter is to ensure that nodes use the perceptible target fairly and prohibit long-term occupancy, so that it can be sensed and used after being vacant for a period of time.
  • the first configuration information at least includes an identification of the sensing task and information on the type of the sensing target.
  • the first configuration information may also include an identification of the target group and/or a sensing time parameter.
  • the above method also includes: the first node sends the first perception result to a trusted storage device.
  • the trusted storage device here can be any device with storage media.
  • the trusted storage device can meet but is not limited to the following requirements: 1. Data encryption and decryption and persistent storage, 2. Identity and feature-based access control, data access cycle control and backup capabilities, 3. Reliable access and modification of record log capabilities.
  • the method further includes:
  • the first node sends a sensing task to a node in a target group, where the sensing task includes first configuration information, where the first configuration information includes at least one of the following: an identifier of the sensing task, an identifier of the target group, type information of the perceptible target, or a sensing time parameter; correspondingly, each node in the target group receives the sensing task;
  • the nodes in the target group respectively perform perception based on the perception task, obtain respective perception results (referred to as second perception results in the embodiment of the present application), and send respective perception results to the first node; correspondingly, the first node receives the second perception results from the nodes in the target group;
  • the first node determines a third perception result based on the second perception result of the nodes in the target group.
  • the first node is a decision-making node, and the nodes in the target group can send all perception results to the first node, and the first node makes the decision.
  • the decision result of the first node is called the third perception result.
  • the above method also includes: the first node sends the third perception result to a trusted storage device.
  • the nodes in the target group can synchronize the perception results to a trusted storage device to avoid tampering and forgery.
  • the nodes in the target group may aggregate the perception results to the second node, and the second node sends the perception results of each node in the target group to the first node.
  • the nodes in the target group may respectively send their own perception results to the first node.
  • the nodes in the target group can add the node's signature to ensure the accuracy of the transmitted information. Certainty.
  • the above method before the first node sends the perception task, the above method also includes: the first node determines whether there is a perceptible target; the first node sends the perception task, including: when there is a perceptible target, the first node sends the perception task.
  • the first node may determine whether there is a perceptible target based on existing information, and the existing information may be historical data related to the perceptible target.
  • the first node may query a database to determine whether there is a perceptible target.
  • the first node may also use the target group to process the audit task to supervise the execution process of the above-mentioned perception result.
  • the embodiment of the present application may process the audit task in a variety of different ways.
  • the method further includes: the first node sends an audit task to the second node (i.e., the head node in the target group), the audit task including second configuration information, the second configuration information including at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; correspondingly, the second node receives the audit task from the first node;
  • the second node sends the audit task to other nodes in the target group, and performs an audit based on the audit task to obtain a first audit result; the second node and other nodes use a consensus algorithm to reach a consensus on the first audit result to obtain a second audit result;
  • the second node sends indication information to the first node, where the indication information is used to indicate that the audit task has been completed; correspondingly, the first node receives the indication information from the second node.
  • the first audit result is the perception result generated by the second node.
  • the second audit result obtained by the consensus algorithm may be the same as the first audit result, or it may be different from the first audit result.
  • the consensus algorithm can be, for example, the RAFT algorithm or the PBFT algorithm mentioned above, which is not limited in the embodiments of the present application.
  • the identifier of the above-mentioned first node is specifically used to identify the first node
  • the type information of the perceptible target is used to indicate the type corresponding to this audit task (for example, an audit of nodes that use the spectrum after spectrum sensing)
  • the audit time parameters may include the single occupancy time of the perceptible target and the time interval between each authorized use of the perceptible target (for example, the time interval between each authorized use of the target frequency band).
  • the purpose of setting the audit time parameters is to ensure that nodes use the perceptible target fairly and prohibit long-term occupancy, so that competitive use can be sensed after periodic vacancy.
  • the method further includes:
  • the first node sends an audit task to a node in a target group, the audit task including second configuration information, the second configuration information including at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; correspondingly, each node in the target group receives the audit task;
  • the nodes in the target group respectively perform an audit based on the audit task, obtain respective audit results (referred to as first audit results in the embodiment of the present application), and send indication information to the first node, where the indication information is used to indicate that the audit task has been completed; correspondingly, the first node receives the indication information from the nodes in the target group;
  • the first node determines whether the audit task has been completed based on the indication information of all or part of the nodes.
  • the first node is a decision-making node, and the nodes in the target group can send all indication information about the current audit task to the first node, and the first node determines whether the audit task has been completed.
  • the above method further includes: the first node sending the indication information to a trusted storage device.
  • the nodes in the target group can synchronize the audit results to a trusted storage device to avoid tampering and forgery.
  • the nodes in the target group may summarize the audit results to the second node, and the second node sends the audit results of each node in the target group to the first node.
  • the nodes in the target group may respectively send their own audit results to the first node.
  • the nodes in the target group can add the node's signature to ensure the accuracy of the transmitted information.
  • the above method further includes: the first node resending the capability query request to rebuild the target group.
  • the first node may resend the capability query request if the reliability of the target group does not meet the requirement.
  • Re-establishing the target group means updating the nodes in the target group.
  • the first node may also resend the capability query request to re-establish the target group, i.e., update the nodes in the target group, when the perceptible target changes and/or the capability requirement for the node changes.
  • the capability query request sent by the first node carries the identification information of the new perceptible target and/or the new requirement information for the perceptible target.
  • the first node can dynamically adjust the nodes in the group used to process perception tasks as the scenario and/or requirements change, remove nodes that do not meet the requirements from the group, and add nodes that meet the requirements to the group. This is more flexible in implementation and is conducive to improving the accuracy and reliability of perception, thereby improving system performance.
  • FIG7 shows a schematic flow chart of another sensing task processing method 700 provided in an embodiment of the present application.
  • the method 700 processes spectrum sensing tasks based on the above-established target group.
  • the method 700 includes:
  • S701 The first node sends a query request to a database to query whether there is an available spectrum.
  • the available spectrum here is the perceptible target mentioned above.
  • the first node, the second node, the third node and the fourth node execute the group establishment process shown in FIG6, and perform head node election, with the second node being the head node.
  • the first node sends a sensing task to the second node, and correspondingly, the second node receives the sensing task, the sensing task includes first configuration information, the first configuration information includes an identifier of the sensing task, an identifier of the target group, frequency information of the target frequency band, and a time interval (expressed as T_gap) between each authorized use of the target frequency band.
  • the target frequency band is a frequency band in the available spectrum.
  • the second node receives the above-mentioned sensing task from the third node and the fourth node, and the second node, the third node and the fourth node respectively sense the target frequency band based on the first configuration information to obtain a sensing result.
  • the sensing result here is the second sensing result in the above-mentioned embodiment.
  • the second node, the third node and the fourth node reach a consensus on the perception result using a consensus algorithm to obtain a first perception result.
  • the RAFT consensus algorithm is adopted between the second node, the third node and the fourth node.
  • the second node sends the perception result of the second node to the third node and the fourth node, requesting confirmation whether the results are consistent.
  • the third node receives the perception result of the second node, compares the perception result of the second node with its own perception result, and replies 1 if they are consistent, and replies 0 if they are inconsistent.
  • the fourth node receives the perception result of the second node, compares the perception result of the second node with its own perception result, and replies 1 if they are consistent, and replies 0 if they are inconsistent.
  • the second node receives 1 and/or 0 from the third node and the fourth node. If the third node and the fourth node both reply 1, a consensus is reached between the nodes, and the first perception result is the perception result of the second node.
  • S706 The second node sends a first perception result to the first node, and correspondingly, the first node receives the first perception result.
  • S707 The second node sends the perception result and signature of the second node to the first node.
  • the first node receives the perception result and signature of the second node.
  • S708 The third node sends the perception result and signature of the third node to the first node.
  • the first node receives the perception result and signature of the third node.
  • the fourth node sends the perception result and signature of the fourth node to the first node, and correspondingly, the first node receives the perception result and signature of the fourth node.
  • the first node makes a decision based on the collected perception results of each node to obtain a third perception result.
  • the final perception result (ie, the first perception result or the third perception result) may include information such as the target frequency band, whether the target frequency band is available, and a timestamp.
  • the above-mentioned perception result also includes the location information of the node that determines the perception result.
  • the location information here can be any of the following: geographic location (such as longitude and latitude), national standard coordinate system location, other geographic reference coordinate system identifier
  • the location, or the network logical topology location is not limited in this embodiment of the present application.
  • the first perception result of S706 may carry the location information of the second node.
  • the perception result of S707 may carry the location information of the second node
  • the perception result of S708 may carry the location information of the third node
  • the perception result of S709 may carry the location information of the fourth node.
  • the first node may request sensing again after a first preset time, i.e., re-initiate the sensing task.
  • the first preset time is the waiting time (expressed as T_idle) between when the frequency band is occupied and when sensing is attempted again.
  • the first node can autonomously use the target frequency band within a second preset time length, where the second preset time length is a single occupation time length of the frequency band (expressed as T_slot).
  • the first node may also trigger frequency band switching, carrier aggregation, etc. based on the final perception result to reasonably arrange the use of the frequency band.
  • the final perception result is that the target frequency band is available, and "the first node triggers frequency band switching” means that the first node migrates the existing service to the new available frequency band (that is, the target frequency band perceived this time).
  • the usage time of the target frequency band reaches the above-mentioned second preset time, the first node can switch the service on the target frequency band to other available frequency bands.
  • the first node triggers carrier aggregation means that the first node distributes the existing service on carriers of multiple frequency bands including the target frequency band, thereby expanding the communication capacity.
  • the method 700 further includes:
  • a protocol data unit (PDU) session is established between the first node and the database.
  • a PDU session is established between the second node and the database.
  • the third node and the fourth node establish PDU sessions with the database respectively.
  • S712 The first node sends the final perception result to the database through the established PDU session.
  • the perception result sent by the first node to the database is the first perception result; if a centralized decision-making method is adopted, the perception result sent by the first node to the database is the third perception result.
  • each node can synchronize the sensing results to a database to prevent tampering and forgery.
  • the method 700 further includes:
  • S713 The third node sends the perception result and signature of the third node to the second node.
  • the second node receives the perception result and signature of the third node.
  • S714 The fourth node sends the perception result and signature of the fourth node to the second node.
  • the second node receives the perception result and signature of the fourth node.
  • the second node sends the perception results and signatures of each node to the database through the PDU session between the second node and the database. That is, the second node sends the perception results and signatures of the second node, the perception results and signatures of the third node, and the perception results and signatures of the fourth node to the database.
  • the database receives the perception results and signatures of each node.
  • the nodes in the target group may respectively synchronize their own perception results to the database, and the method 700 further includes:
  • the second node sends the perception result and signature of the second node to the database through the PDU session between the second node and the database, and correspondingly, the database receives the perception result and signature of the second node.
  • the third node sends the perception result and signature of the third node to the database through the PDU session between the third node and the database, and correspondingly, the database receives the perception result and signature of the third node.
  • the fourth node sends the perception result and signature of the fourth node to the database through the PDU session between the fourth node and the database, and correspondingly, the database receives the perception result and signature of the fourth node.
  • the transmission link between the messages of the present application may depend on the specific form of the node. If the message is transmitted between terminal devices, it can be through a sidelink based on device to device (D2D). If the message is transmitted between a terminal device and a network device, it can be through an uplink or a downlink. The embodiments of the present application do not limit this.
  • the sensing task processing method of the present application sends a capability query request to each node through the first node to query whether each node meets the capability requirements, dynamically deploys the sensing nodes in the system based on the capabilities of the nodes, and performs frequency based on the established sensing nodes. Spectrum sensing improves the accuracy and reliability of sensing results, thereby improving system performance.
  • FIG8 shows a schematic flow chart of an audit task processing method 800 provided in an embodiment of the present application.
  • the method 800 includes:
  • the first node sends a spectrum sensing result to a database.
  • the spectrum sensing result here is the first sensing result or the third sensing result in the above method 700. Therefore, this step is the same as the above S712.
  • the first node, the second node, the third node and the fourth node execute the group establishment process shown in FIG6 and perform head node election, with the second node being the head node.
  • S802 since the head node in the embodiment of the present application is still the second node and the nodes in the target group have not changed, S802 does not need to be executed. If the reliability of the target group does not meet the requirements, or the perceptible target changes, or the first node's requirements for the capabilities of the perceptual node change, S802 can be executed to redetermine the target group and re-elect the head node.
  • the first node sends an audit task to the second node, and correspondingly, the second node receives the audit task, the audit task includes second configuration information, and the second configuration information includes information such as the identifier of the first node, the identifier of the target group, the frequency information of the target frequency band, the single occupation time of the frequency band by the node (expressed as T_slot), the time interval between each authorized use of the frequency band (expressed as T_gap), and the duration of perception (expressed as T_max).
  • the second configuration information may also include the location of the first node.
  • T_max T_slot+2 ⁇ T_gap+T, where T is the time to start sensing.
  • the second node sends the above audit task to the third node and the fourth node, and the second node, the third node and the fourth node audit the process of the first node using the target frequency band based on the second configuration information to obtain an audit result.
  • the audit result here is the first audit result in the above embodiment.
  • the second node, the third node and the fourth node reach a consensus on the audit result using a consensus algorithm to obtain a second audit result.
  • the RAFT consensus algorithm is adopted between the second node, the third node and the fourth node.
  • the second node sends the audit result of the second node to the third node and the fourth node, requesting confirmation whether the results are consistent.
  • the third node receives the audit result of the second node, compares the audit result of the second node with its own audit result, and replies 1 if they are consistent, and replies 0 if they are inconsistent.
  • the fourth node receives the audit result of the second node, compares the audit result of the second node with its own audit result, and replies 1 if they are consistent, and replies 0 if they are inconsistent.
  • the second node receives 1 and/or 0 from the third node and the fourth node. If the third node and the fourth node both reply 1, a consensus is reached between the nodes, and the second audit result is the audit result of the second node.
  • the second node sends indication information to the first node to indicate whether the audit is completed, and correspondingly, the first node receives the indication information.
  • the second node sends the audit result and signature of the second node to the first node, and correspondingly, the first node receives the audit result and signature of the second node.
  • the third node sends the audit result and signature of the third node to the first node, and correspondingly, the first node receives the audit result and signature of the third node.
  • the fourth node sends the audit result and signature of the fourth node to the first node, and correspondingly, the first node receives the audit result and signature of the fourth node.
  • the first node makes a decision based on the collected audit results of each node to determine whether the audit is completed.
  • the above audit result also includes the location information of the node that determines the perception result.
  • the location information here can be any of the following: geographic location (such as longitude and latitude), national standard coordinate system location, location identified by other geographic reference coordinate systems, or network logical topology location (such as location obtained through additional location mapping relationships), which is not limited in the embodiments of the present application.
  • the audit result of S807 may carry the location information of the second node
  • the audit result of S808 may carry the location information of the third node
  • the audit result of S809 may carry the location information of the fourth node.
  • each node can synchronize the audit results to the database to prevent tampering and forgery.
  • the method 800 further includes:
  • the third node sends the audit result and signature of the third node to the second node, and correspondingly, the second node receives the audit result and signature of the third node.
  • the fourth node sends the audit result and signature of the fourth node to the second node, and correspondingly, the second node receives the audit result and signature of the fourth node.
  • the second node sends the audit results and signatures of each node to the database through the PDU session between the second node and the database. That is, the second node sends the audit results and signatures of the second node, the audit results and signatures of the third node, and the audit results and signatures of the fourth node to the database.
  • the database receives the audit results and signatures of each node.
  • the nodes in the target group may respectively synchronize their own audit results to the database, and the method 800 further includes:
  • the second node sends the audit result and signature of the second node to the database through the PDU session between the second node and the database, and correspondingly, the database receives the audit result and signature of the second node.
  • the third node sends the audit result and signature of the third node to the database through the PDU session between the third node and the database, and correspondingly, the database receives the audit result and signature of the third node.
  • the fourth node sends the audit result and signature of the fourth node to the database through the PDU session between the fourth node and the database, and correspondingly, the database receives the audit result and signature of the fourth node.
  • the transmission link between the messages of the present application may depend on the specific form of the node. If the message is transmitted between terminal devices, it can be through a sidelink based on device to device (D2D). If the message is transmitted between a terminal device and a network device, it can be through an uplink or a downlink. The embodiments of the present application do not limit this.
  • the execution node is a decision-making node (i.e., the first node mentioned above).
  • the execution node executes a decision (i.e., uses the target frequency band)
  • the nodes in the target group can monitor the frequency band usage process of the execution node and perform consensus fault tolerance on the monitored results to eliminate erroneous monitoring results.
  • the execution node may be another node different from the decision node, for example, the execution node and the decision node may be different network devices or terminal devices, which is not limited in the embodiments of the present application.
  • the second configuration information in the audit task sent by S803 may include an identifier of the execution node, and further, the second configuration information may also include a location of the execution node.
  • the audit task processing method of the present application sends a capability query request to each node through the first node to query whether each node meets the capability requirements, dynamically deploys the perception nodes in the system based on the capabilities of the nodes, and audits the spectrum perception results based on the established perception nodes, thereby improving the accuracy and reliability of the audit results and thus improving system performance.
  • FIG9 shows a sensing task processing device 900 provided in an embodiment of the present application.
  • the device 900 includes: a transceiver unit 910 and a processing unit 920 .
  • the device 900 may be a first node, or a chip in the first node.
  • the transceiver unit 910 is used to: send a capability query request to the second node, the capability query request is used to query whether the second node meets the capability requirements of the device; receive a capability confirmation message from the second node, the capability confirmation message includes information used to indicate that the second node meets the capability requirements of the device; based on the capability confirmation message, send a grouping request to the second node, the grouping request is used to request that the second node be included in a target group; and, receive a group confirmation message from the second node, the group confirmation message is used to indicate whether to join the target group; the processing unit 920 is used to: if the group confirmation message is used to indicate that the second node joins the target group, add the second node to the target group.
  • the capability query request includes identification information of the perceptible target and information indicating capability requirements of the device for the perceptible target.
  • the grouping request carries an identifier of the target group
  • the group confirmation message carries an identifier of the target group
  • the transceiver unit 910 is further used to: receive head node indication information from the second node, where the head node indication information is used to indicate that the second node is the head node.
  • the head node indication information includes at least one of the following: an identifier of the second node, a communication address of the second node, or a valid period of time that the second node serves as a head node.
  • the transceiver unit 910 is also used to: send a perception task to the second node, the perception task including first configuration information, the first configuration information including at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; and receive a first perception result from the second node.
  • the transceiver unit 910 is also used to: send a perception task to the nodes in the target group, the perception task including first configuration information, the first configuration information including at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; receive a second perception result from the nodes in the target group; the processing unit 920 is also used to: determine a third perception result based on the second perception result of the nodes in the target group.
  • the processing unit 920 is further used to: determine whether there is a perceptible target; the transceiver unit 910 is further used to: send the perception task when the perceptible target exists.
  • the transceiver unit 910 is further used to: send the first perception result to a trusted storage device.
  • the transceiver unit 910 is further used to: send the third perception result to a trusted storage device.
  • the transceiver unit 910 is also used to: send an audit task to the second node, where the second node is a head node, and the audit task includes second configuration information, and the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; and receive indication information from the second node, where the indication information is used to indicate that the audit task has been completed.
  • the transceiver unit 910 is also used to: send an audit task to the nodes in the target group, the audit task including second configuration information, the second configuration information including at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; receive indication information from all or part of the nodes in the target group, the indication information being used to indicate that the audit task has been completed; the processing unit 920 is also used to: determine whether the audit task has been completed based on the indication information from all or part of the nodes.
  • the transceiver unit 910 is further used to: send the indication information to the trusted storage device.
  • the transceiver unit 910 is further configured to: resend the capability query request to reestablish the target group.
  • the device 900 may be a second node, or a chip in the second node.
  • the transceiver unit 910 is used to: receive a capability query request from the first node, the capability query request is used to query whether the device meets the capability requirements of the first node; send a capability confirmation message to the first node, the capability confirmation message includes information used to indicate that the device meets the capability requirements of the first node; receive a grouping request from the first node, the grouping request is used to request that the device be included in a target group; send a group confirmation message to the first node, the group confirmation message is used to indicate that the device has joined the target group.
  • the capability query request includes identification information of the perceptible target and information indicating capability requirements of the first node for the perceptible target.
  • the grouping request carries an identifier of the target group
  • the group confirmation message carries an identifier of the target group
  • the transceiver unit 910 is also used to: send heartbeat signals to other nodes in the target group; receive and count heartbeat signals from the other nodes; the processing unit 920 is also used to: determine that the device is a head node based on the number and time of heartbeat signals received by the device; the transceiver unit 910 is also used to: send head node indication information to the first node and the other nodes, and the head node indication information is used to indicate that the device is a head node.
  • the head node indication information includes at least one of the following: an identifier of the device, a communication address of the device, or a duration for which the device serves as a head node.
  • the transceiver unit 910 is further used to: receive a perception task from the first node, the perception task including first configuration information, the first configuration information including at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; send the perception task to the other nodes, and based on the
  • the processing unit 920 is also used for: using a consensus algorithm with the other nodes to reach a consensus on the second perception result to obtain a first perception result; the transceiver unit 910 is also used for: sending the first perception result to the first node.
  • the transceiver unit 910 is also used to: receive a perception task from the first node, the perception task including first configuration information, the first configuration information including at least one of the following: an identifier of the perception task, an identifier of the target group, type information of the perceptible target, or a perception time parameter; the processing unit 920 is also used to: perform perception based on the perception task to obtain a second perception result; the transceiver unit 910 is also used to: send the second perception result to the first node.
  • the transceiver unit 910 is further used to: receive the second perception result from the other nodes; and send the second perception result of the first node and the second perception results of the other nodes to a trusted storage device.
  • the transceiver unit 910 is further used to: send the second perception result of the first node to a trusted storage device.
  • the transceiver unit 910 is also used to: receive an audit task from the first node, the audit task includes second configuration information, the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; send the audit task to the other nodes; the processing unit 920 is also used to: perform an audit based on the audit task to obtain a first audit result; reach consensus on the first audit result with the other nodes using a consensus algorithm to obtain a second audit result; the transceiver unit 910 is also used to: send an indication message to the first node, the indication message is used to indicate that the audit task has been completed.
  • the transceiver unit 910 is also used to: receive an audit task from the first node, the audit task includes second configuration information, the second configuration information includes at least one of the following: an identifier of the first node, an identifier of the target group, type information of the perceptible target, or an audit time parameter; the processing unit 920 is also used to: perform an audit based on the audit task to obtain a first audit result; and send an indication message to the first node, the indication message being used to indicate that the audit task has been completed.
  • the transceiver unit 910 is further used to: receive a third audit result from the other node; and send the first audit result and the third audit result to the trusted storage device.
  • the transceiver unit 910 is further used to: send the first audit result to the trusted storage device.
  • the device 900 here is embodied in the form of a functional unit.
  • the term "unit” here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a merged logic circuit and/or other suitable components that support the described functions.
  • ASIC application specific integrated circuit
  • the device 900 can be specifically the first node or the second node in the above-mentioned embodiment, and the device 900 can be used to execute the various processes and/or steps corresponding to the first node or the second node in the above-mentioned method embodiment. To avoid repetition, it will not be repeated here.
  • the device 900 of each of the above schemes has the function of implementing the corresponding steps performed by the first node or the second node in the above method; the function can be implemented by hardware, or by hardware executing the corresponding software implementation.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the above transceiver unit 910 may include a sending unit and a receiving unit, the sending unit can be used to implement the various steps and/or processes for performing the sending action corresponding to the above transceiver unit, and the receiving unit can be used to implement the various steps and/or processes for performing the receiving action corresponding to the above transceiver unit.
  • the sending unit can be replaced by a transmitter, and the receiving unit can be replaced by a receiver, respectively performing the sending and receiving operations and related processing operations in each method embodiment.
  • the device 900 in FIG. 9 may also be a chip or a chip system, such as a system on chip (SoC).
  • the transceiver unit 910 may be a transceiver circuit of the chip, which is not limited here.
  • FIG10 shows another sensing task processing device 1000 provided in an embodiment of the present application.
  • the device 1000 includes a processor 1010, a transceiver 1020, and a memory 1030.
  • the processor 1010, the transceiver 1020, and the memory 1030 communicate with each other through an internal connection path, the memory 1030 is used to store instructions, and the processor 1010 is used to execute the instructions stored in the memory 1030 to control the transceiver 1020 to send and/or receive signals.
  • the device 1000 may be a first node or a chip in the first node.
  • the transceiver 1020 is used to: send a capability query request to a second node, the capability query request is used to query whether the second node meets the capability requirements of the device; receive a capability confirmation message from the second node, the capability confirmation message includes information indicating that the second node meets the capability requirements of the device; based on the capability confirmation message, send a capability query request to the second node; Sending a grouping request, the grouping request is used to request that the second node be included in a target group; and receiving a group confirmation message from the second node, the group confirmation message is used to indicate whether to join the target group; the processor 1010 is used to: if the group confirmation message is used to instruct the second node to join the target group, add the second node to the target group.
  • the device 1000 may be a second node or a chip in the second node.
  • the transceiver 1020 is used to: receive a capability query request from the first node, the capability query request is used to query whether the device meets the capability requirements of the first node; send a capability confirmation message to the first node, the capability confirmation message includes information indicating that the device meets the capability requirements of the first node; receive a grouping request from the first node, the grouping request is used to request that the device be included in a target group; send a group confirmation message to the first node, the group confirmation message is used to indicate that the device joins the target group.
  • the device 1000 can be specifically the first node or the second node in the above-mentioned embodiment, and can be used to execute the various steps and/or processes corresponding to the first node or the second node in the above-mentioned method embodiment.
  • the memory 1030 may include a read-only memory and a random access memory, and provide instructions and data to the processor.
  • a part of the memory may also include a non-volatile random access memory.
  • the memory may also store information about the device type.
  • the processor 1010 may be used to execute instructions stored in the memory, and when the processor 1010 executes instructions stored in the memory, the processor 1010 is used to execute the various steps and/or processes of the above-mentioned method embodiment corresponding to the first node or the second node.
  • the transceiver 1020 may include a transmitter and a receiver, the transmitter may be used to implement the various steps and/or processes corresponding to the above-mentioned transceiver for performing the sending action, and the receiver may be used to implement the various steps and/or processes corresponding to the above-mentioned transceiver for performing the receiving action.
  • the processor of the above-mentioned device may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
  • each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software.
  • the steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software units in a processor for execution.
  • the software unit can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc.
  • the storage medium is located in a memory, and the processor executes the instructions in the memory, and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or it can be an electrical, mechanical or other form of connection.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present application.
  • 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.
  • the above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
  • the integrated unit can store In a computer-readable storage medium.
  • a computer-readable storage medium includes several instructions for enabling a computer device (which may be a personal computer, server, or 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: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program code.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Multimedia (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Debugging And Monitoring (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un procédé et un appareil de traitement de tâche de détection, qui permettent d'améliorer la précision et la fiabilité de détection, et d'améliorer ainsi les performances du système. Le procédé comprend les étapes suivantes : un premier nœud envoie une demande d'interrogation de capacité à un second nœud, la demande d'interrogation de capacité étant utilisée pour interroger si le second nœud satisfait une exigence de capacité du premier nœud ; le premier nœud reçoit un message de confirmation de capacité en provenance du second nœud, le message de confirmation de capacité comprenant des informations pour indiquer que le second nœud satisfait l'exigence de capacité du premier nœud ; le premier nœud envoie une demande de regroupement au second nœud sur la base du message de confirmation de capacité, la demande de regroupement étant utilisée pour demander au second nœud de rejoindre un groupe cible ; le premier nœud reçoit un message de confirmation de groupe en provenance du second nœud, le message de confirmation de groupe étant utilisé pour représenter si le second nœud rejoint le groupe cible ; et si le message de confirmation de groupe est utilisé pour indiquer que le second nœud rejoint le groupe cible, le premier nœud ajoute le second nœud dans le groupe cible.
PCT/CN2023/136693 2022-12-13 2023-12-06 Procédé et appareil de traitement de tâche de détection WO2024125356A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211595972.0 2022-12-13
CN202211595972.0A CN118200897A (zh) 2022-12-13 2022-12-13 感知任务处理方法和装置

Publications (2)

Publication Number Publication Date
WO2024125356A2 true WO2024125356A2 (fr) 2024-06-20
WO2024125356A3 WO2024125356A3 (fr) 2024-08-08

Family

ID=91407503

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/136693 WO2024125356A2 (fr) 2022-12-13 2023-12-06 Procédé et appareil de traitement de tâche de détection

Country Status (2)

Country Link
CN (1) CN118200897A (fr)
WO (1) WO2024125356A2 (fr)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10368232B2 (en) * 2015-08-05 2019-07-30 Qualcomm Incorporated Methods for connection capability exchange
CN109447489B (zh) * 2018-11-02 2020-10-30 华东交通大学 群智感知用户的选择方法、装置、电子设备及存储介质
US20230276381A1 (en) * 2020-08-14 2023-08-31 Beijing Xiaomi Mobile Software Co., Ltd. Processing capability request, processing capability sending, and processing capability receiving methods and apparatuses
EP4047963B1 (fr) * 2021-02-22 2024-04-10 Nokia Technologies Oy Gestion des capacités de détection de réseau dans un réseau sans fil
CN115278639A (zh) * 2022-07-22 2022-11-01 中国联合网络通信集团有限公司 感知数据获取方法、装置、设备及存储介质

Also Published As

Publication number Publication date
CN118200897A (zh) 2024-06-14
WO2024125356A3 (fr) 2024-08-08

Similar Documents

Publication Publication Date Title
US11882480B2 (en) Method and device for controlling duplicate packet transmission in wireless communication system
CN112073998B (zh) 提高无线通信系统中的服务可靠性的方法和装置
WO2021238774A1 (fr) Procédé et appareil de communication
US20190253895A1 (en) Control signaling processing method, device, and system
CN109314696B (zh) 管理网络切片的方法及其装置
US10554693B2 (en) Security configuration method for radio bearer and device
EP3616434B1 (fr) Procédé, unité centrale et unité distribuée prenant en charge un procédé de fonction de duplication pdcp
US20220264596A1 (en) Data Transmission Method and Apparatus
WO2021196697A1 (fr) Procédé et appareil de traitement tolérant aux pannes
KR20200031448A (ko) 무선 통신 시스템에서 패킷 전송 방법 및 장치
WO2024125356A2 (fr) Procédé et appareil de traitement de tâche de détection
CN110831247A (zh) 一种通信方法及装置
CN112789892A (zh) 无线通信方法、装置及系统
EP4066518B1 (fr) Procédé et appareil de gestion de groupe pour la surveillance d'événements de groupe
TW201933892A (zh) 通訊系統中控制使用者設備進行複製傳輸的方法及其設備
JP2020529148A (ja) データ複製をサポートする方法、送信側デバイスおよび受信側デバイス
CN109803015B (zh) 一种基于d2d的去中心化共享存储系统及其控制方法
WO2024067748A1 (fr) Procédé et appareil de communication
WO2020192510A1 (fr) Procédé de négociation de configuration et nœud de réseau
WO2024164277A1 (fr) Procédé et dispositif de traitement de sécurité pour communication de relais
WO2022151477A1 (fr) Procédé de rétablissement de faisceau pour système multi-trp, dispositif de communication, et support de stockage lisible
US11444805B2 (en) Secure over the air upload mechanism for wireless mesh nodes
WO2024208050A1 (fr) Procédé et appareil de transmission de demande de planification (sr), et dispositif
WO2024197944A1 (fr) Procédé et appareil de récupération de liaison
WO2024156249A1 (fr) Procédé et appareil de transmission de bloc d'informations système

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23902553

Country of ref document: EP

Kind code of ref document: A2