# US 2024/0407027 A1 · First node and methods performed thereby for handling aggregation of messages

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0407027 A1
- Document ID: US20240407027A1
- Status: Published application
- Kind: A1
- Application number: 18/698,359
- Filed: 2022-02-21
- Published: 2024-12-05
- Earliest claimed: 2021-11-08
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Konstantinos VANDIKAS; Wenfeng HU; Martin ISAKSSON; Adriano MENDO MATEO; Erik SANDERS
- Web page: https://patentgrep.com/patent/US20240407027A1

## CPC

- H04W 76/15: Setup of multiple wireless link connections
- H04W 12/02: Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
- H04W 24/04: Arrangements for maintaining operational condition
- H04W 24/08: Testing, {supervising or monitoring} using real traffic
- H04L 2209/46: Secure multiparty computation, e.g. millionaire problem
- H04W 12/009: {specially adapted for networks, e.g. wireless sensor networks, ad-hoc networks, RFID networks or cloud networks}
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method performed by a first node for handling aggregation of messages is disclosed. The first node determines out of a plurality of nodes, which nodes are to be paired as a pair of nodes. The pairing is to pass messages to another node for aggregation of information comprised in the messages. The information is to be masked by respective masks of opposite signs. The respective masks are to prevent the another node from accessing the information while enabling their aggregation. The determining is based on a respective measure of reliability of communications of a second node and a third node in the pair of nodes being similar, according to a criterion. The first node initiates an aggregation of the messages passed from the determined pair of nodes to the another node.

## Claims

### Claim 1

A computer-implemented method performed by a first node, wherein the computer-implemented method being for handling aggregation of messages and the first node operating in a communications system comprising a plurality of nodes, the computer-implemented method comprising:
determining, out of the plurality of nodes, which nodes are to be paired as a pair of nodes to pass messages to another node for aggregation of information comprised in the messages, wherein the information is to be masked by respective masks of opposite signs to be assigned to the nodes comprised in the pair of nodes, wherein the respective masks are to prevent the another node from accessing the information respectively comprised in respective messages passed from the pair of nodes while enabling their aggregation, and wherein the determining is based on a respective measure of reliability of communications of a second node and a third node comprised in the pair of nodes being similar according to a criterion; and
initiating an aggregation of the messages passed from the determined pair of nodes to the another node, wherein the another node is a fourth node.

### Claim 2 (depends on 1)

The computer-implemented method according to claim 1, wherein the information comprises data indicating one or more aspects of a performance of the communications system, and wherein the initiating of the aggregation of the messages thereby facilitates an analysis of the performance and taking of a maintenance action in the communications system.

### Claim 3 (depends on 1)

The computer-implemented method according to claim 1, wherein at least one of:
each of the nodes in the plurality of nodes respectively comprises information on an individual node, or on a respective plurality of children nodes; and
each of the second node and the third node respectively comprises information on an individual node, or on a respective plurality of children nodes.

### Claim 4 (depends on 1)

The computer-implemented method according to claim 1, wherein the respective measure of reliability is based on one or more indications of a performance in handling transmissions.

### Claim 5

(canceled)

### Claim 6 (depends on 1)

The computer-implemented method according to claim 1, wherein the computer-implemented method further comprises:
selecting the fourth node for aggregation of the information, the selecting being based on whether the second node and the third node are to respectively comprise information on an individual node, or on a respective plurality of children nodes, the determining of which nodes are to be paired as a pair of nodes being based on the selected fourth node.

### Claim 7

(canceled)

### Claim 8 (depends on 1)

The computer-implemented method according to claim 1, wherein the aggregation of the messages comprises: negotiating the respective masks between the pair of nodes; and aggregating at the fourth node the masked information comprised in the messages passed from the second node and the third node.

### Claim 9 (depends on 6)

The computer-implemented method according to claim 6, wherein the first node is a different node from any of the second node, the third node and the fourth node, and wherein the computer-implemented method further comprises:
obtaining a set of correspondences of respective neighbor relations comprising respective relationships among the plurality of nodes from each of the second node, the third node, and the fourth node; and wherein the determining of the pair of nodes and the selecting of the fourth node is further based on the obtained sets of correspondences of respective neighbor relations.

### Claim 10 (depends on 9)

The computer-implemented method according to claim 9, wherein at least one of:
the first node is an Operation and Maintenance (OAM) node; and
the selecting of the fourth node is performed before the determining of the pair of nodes.

### Claim 11 (depends on 1)

The computer-implemented method according to claim 1, wherein the first node is one of the second node, the third node and the fourth node, and wherein the computer-implemented method further comprises:
determining one or more first children nodes of the first node based on a respective first set of correspondences of neighbor relations of the first node, and wherein the determining of the pair of nodes is made out of the determined one or more first children nodes; and
determining one or more second children nodes of every node in the pair of nodes, and wherein determining of a new pair of nodes is made out of the determined one or more second children nodes.

### Claim 12 (depends on 6)

The computer-implemented method according to claim 6, wherein at least one of:
the selecting of the fourth node is performed after the determining of the pair of nodes; and
determining of one or more second children nodes of another node in the pair of nodes, is performed after negotiating the respective masks between the pair of nodes and before the masked information comprised in the messages is passed from the second node and the third node to the fourth node.

### Claim 13

A first node, for handling aggregation of messages, wherein the first node to operate in a communications system comprised of a plurality of nodes, the first node comprising:
a processor; and
a memory comprising computer program code, which computer program code when executed by the processor, cause the first node to:
determine, out of the plurality of nodes, which nodes are to be paired as a pair of nodes to pass messages to another node for aggregation of information comprised in the messages, wherein the information is be masked by respective masks of opposite signs to be assigned to the nodes comprised in the pair of nodes, wherein the respective masks are to prevent the another node from accessing the information respectively comprised in the respective messages passed from the pair of nodes while enabling their aggregation, and wherein to determine is based on a respective measure of reliability of communications of a second node and a third node comprised in the pair of nodes being similar according to a criterion; and
initiate an aggregation of the messages passed from the pair of nodes to the another node, wherein the another node is a fourth node.

### Claim 14 (depends on 13)

The first node according to claim 13, wherein the information comprises data to indicate one or more aspects of a performance of the communications system, and wherein to initiate the aggregation of the messages is thereby to facilitate an analysis of the performance and taking of a maintenance action in the communications system.

### Claim 15 (depends on 13)

The first node according to claim 13, wherein at least one of:
each of the nodes in the plurality of nodes respectively comprises information on an individual node, or on a respective plurality of children nodes; and
each of the second node and the third node respectively comprises information on an individual node, or on a respective plurality of children nodes.

### Claim 16 (depends on 13)

The first node according to claim 13, wherein the respective measure of reliability is based on one or more indications of a performance in handling transmissions.

### Claim 17

(canceled)

### Claim 18 (depends on 13)

The first node according to claim 13, wherein the first node is further to:
select the fourth node for aggregation of the information, the selecting being based on whether the second node and the third node are to respectively comprise information on an individual node, or on a respective plurality of children nodes, the determining of which nodes are to be paired as a pair of nodes being based on the selected fourth node.

### Claim 19

(canceled)

### Claim 20 (depends on 13)

The first node according to claim 13, wherein the aggregation of the messages comprises: to negotiate the respective masks between the pair of nodes; and to aggregate at the fourth node the masked information comprised in the messages passed from the second node and the third node.

### Claim 21 (depends on 18)

The first node according to claim 18, wherein the first node is a different node from any of the second node the third node and the fourth node, and wherein the first node is further to:
obtain a set of correspondences of respective neighbor relations comprising respective relationships among the plurality of nodes from each of the second node, the third node, and the fourth node; and wherein to determine the pair of nodes and to select of the fourth node is further based on the sets of correspondences of respective neighbor relations that are obtained.

### Claim 22 (depends on 21)

The first node according to claim 21, wherein at least one of:
the first node is an Operation and Maintenance (OAM) node; and
to select the fourth node is to be performed before determination of the pair of nodes.

### Claim 23 (depends on 13)

The first node according to claim 13, wherein the first node is one of the second node, the third node and the fourth node, and wherein the first node is further to:
determine one or more first children nodes of the first node based on a respective first set of correspondences of neighbor relations of the first node, and wherein to determine the pair of nodes is made out of the one or more first children nodes that are determined; and
determine one or more second children nodes of every node in the pair of nodes (112, 113), and wherein to determine a new pair of nodes is made out of the one or more second children nodes that are determined.

### Claim 24 (depends on 18)

The first node according to claim 18, wherein at least one of:
to select the fourth node is performed after determination of the pair of nodes; and
to determine one or more second children nodes of another node in the pair of nodes, is performed after negotiating the respective masks between the pair of nodes and before the masked information comprised in the messages is passed from the second node and the third node to the fourth node.

### Claim at position 25

25-26. (canceled)
