A base station may identify one or more signaling messages or pilots usable for identifying a combined PA and ET non-linearity model associated with the base station. The combined PA and ET non-linearity model may be associated with a PA circuitry and an ET circuitry. The PA circuitry and the ET circuitry may be associated with the base station. The base station may transmit, to the UE, and the UE may receive, from the base station, the one or more signaling messages or pilots. The UE may identify a combined PA and ET non-linearity model associated with the base station based on the one or more signaling messages or pilots. The UE may compensate for a distortion in one or more subsequent signals from the base station based on the identified combined PA and ET non-linearity model.

A method and an apparatus for organization and detection of homogeneous and heterogeneous swarms of devices and application of swarm intelligence using swarm intelligence framework are provided. The Swarm Intelligence Framework provides a generic platform for realizing solutions involving Swarm Intelligence Technology via flexible container-based Algorithm Plug-in Architecture which is essential to utilize Swarm Intelligence Framework for various scenarios and use cases, including dynamically loading and using the Swarm Detection Algorithm.

The present disclosure relates to a method performed by a network node (54) in a communication network (50) comprising a plurality of communication devices (51), for finding temporally connected connection patterns of the communication devices in the network. The method comprises Identifying signalling identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices. The method also comprises constructing a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the vector such that, for each component in the vector, the component value is set to “1” if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the element, and the component value is otherwise set to “0”. The method also comprises testing whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that the number of consecutive “0” element(s), if any, between any two “1” elements is less than a predefined ΔT.

Provided is a method and apparatus for processing cell interference. The method includes: acquiring spatial beam interference information between each of nodes and a surrounding node of each node; determining an interference management strategy for a service in each node according to the spatial beam interference information and resource allocation information of the surrounding node of each node, wherein the resource allocation information is information for allocating resources of a service in the surrounding node of each node, and the resources are in a time domain, a frequency domain and a space domain; and executing the interference management strategy of the service in each node. The solution above solves the problem that interference management schemes in the related art can only be used independently to manage interference in a time domain, frequency domain or space domain.

A transceiver for a wireless communication system is described. The wireless communication system provides resources to be allocated for respective transmissions in the wireless communication system. The resources include one or more bandwidth parts, BWPs, a BWP having a certain numerology and including a plurality of subcarriers in the frequency domain. At least one of the BWPs includes a plurality of resource sets for a sidelink communication, the plurality of resource sets including at least a first resource set and a second resource set, the first resource set being associated with a first criterium, the second resource set being associated with a second criterium, and the first criterium and the second criterium being different. The transceiver is configured to use resources from one or more of the plurality of resource sets within the one BWP for a communication.

In environments such as buildings in which access points are densely deployed, those access points influence each other. To provide a frequency channel allocation scheme in such densely populated environments information gathered by the access points are collected. In such a situation, relying on a list of neighboring access points, background noise, communication medium business, the beacon messages received from access points as well as their associated RSSI, may lead to a frequency channel allocation scheme that may not significantly reduce the interference between access points. The invention introduces an activity-based distance computed between at least two access points which represents a time overlap in a use of the communication medium.

In environments such as buildings in which access points are densely deployed, those access points influence each other. To provide a frequency channel allocation scheme in such densely populated environments information gathered by the access points are collected. In such a situation, relying on a list of neighboring access points, background noise, communication medium business, the beacon messages received from access points as well as their associated RSSI, may lead to a frequency channel allocation scheme that may not significantly reduce the interference between access points. The invention introduces an activity-based distance computed between at least two access points which represents a time overlap in a use of the communication medium.

A method to associate a set of first entities to a set of second entities, e.g., computing jobs to processors, agent teams to workspace resources within a physical location, or the like. The NG is seeded using a force directed graph (FDG), whose “seed” particles represents the agents and their relative interconnectedness. The FDG is first brought into an equilibrium state to define a solution space. A relative coordinate system of the FDG solution space is then translated to a number of vertices represented in the NG, and then an initial seeding of the seed particles in the NG (based on their relative positions in the FDG solution space) is carried out. A search is then performed. During the search, each seed vertex releases its embedded agents to adjacent vertices to enable the agents to search for and achieve a required count. During this process, the seed particles grow to the desired size (with their constituent first entities then located at the NG vertices) to complete the agent-to-resource allocation process.

A method to associate a set of first entities to a set of second entities, e.g., computing jobs to processors, agent teams to workspace resources within a physical location, or the like. The NG is seeded using a force directed graph (FDG), whose “seed” particles represents the agents and their relative interconnectedness. The FDG is first brought into an equilibrium state to define a solution space. A relative coordinate system of the FDG solution space is then translated to a number of vertices represented in the NG, and then an initial seeding of the seed particles in the NG (based on their relative positions in the FDG solution space) is carried out. A search is then performed. During the search, each seed vertex releases its embedded agents to adjacent vertices to enable the agents to search for and achieve a required count. During this process, the seed particles grow to the desired size (with their constituent first entities then located at the NG vertices) to complete the agent-to-resource allocation process.

In using a virtual extensible local area network (VXLAN) for stream processing, a management system allocates resources for a streaming application based on an operator graph of the streaming application. The management system assigns the resources to a group of VXLAN segments based on the operator graph of the streaming application. A first processing element of the streaming application multicasts data on the group of VXLAN segments. A second processing element on a given VXLAN segment of the group of VXLAN segments receives the data. If the second processing element is an intended recipient of the data, then the second processing element processes the data. If the second processing element is not the intended recipient of the data, then the second processing element ignores the data.