83 results about "Neighbor relation" patented technology

The invention relates to the technical field of communication, and discloses a route synchronization method, device, system and equipment among multiple SDN clusters and a medium, and the method comprises the steps: obtaining neighbor configuration information issued by a central controller based on a target BGP service; establishing a neighbor relationship between the target BGP service and other BGP services according to the neighbor configuration information; obtaining first node address information of a target SDN cluster collected by the target SDN controller based on the target BGP service, and generating first routing information; and sending the first routing information to other BGP services which establish the neighbor relationship. According to the invention, the BGP service and the SDN controller are utilized to realize the coordination of the control planes, the BGP service and the SDN controller form a double-layer control plane, and the double-layer control plane is utilized to issue the routing forwarding strategy, so that flooding on the data plane is effectively avoided, and the routing synchronization efficiency is improved.

The invention discloses a mapping knowledge domain embedding method fusing meta-information and logic rules, and relates to the technical field of computers. The method comprises the following steps: inputting a to-be-predicted knowledge graph into a knowledge graph embedding module; in the multi-granularity meta-information embedding module, for each entity to be predicted in the knowledge graph to be predicted, obtaining ontology information embedding and multi-hop neighbor relation embedding of the entity to be predicted; carrying out average pooling processing on each of the multi-hop neighbor relation embedding, and processing the neighbor relation embedding after the average pooling processing through a multi-layer perceptron and learnable parameters to obtain a hierarchical attention weight of each neighbor relation embedding; each multi-hop neighbor relation embedding comprises a plurality of neighbors; and performing weighted summation on the ontology information embedding and the multi-hop neighbor relation embedding based on the hierarchical attention weight to obtain meta-information embedding of a to-be-predicted entity in the to-be-predicted knowledge graph. According to the method, the determination precision of the meta-information embedding of the entity can be improved.

The invention relates to the technical field of smart power grids and communication, and discloses a power utilization information acquisition method and system based on dual-mode communication, and the method comprises the steps: 1, initializing a configuration network, building the neighborhood of each acquisition terminal node, carrying out the probability distribution parameterization of the channel states of a power line carrier channel and a wireless radio frequency channel, and carrying out the network configuration; according to the probability distribution parameterization, calculating a Fishi information matrix used for quantifying the information distance between different channel states; and step 2, defining a channel state geometrical relationship based on the Fishi information matrix. The probability distribution parameter space of the channel state is constructed into the information geometric manifold, the manifold Kalman filtering algorithm is adopted for state prediction, and compared with an existing channel prediction scheme adopting standard Kalman filtering or a simple time sequence model, the problem that the statistical characteristics of the channel cannot be accurately described due to model mismatch is solved, and the channel prediction accuracy is improved. Therefore, the problems of low prediction precision and incapability of effectively supporting a prospective routing decision are solved.

The invention relates to the technical field of zero-trust and evolutionary game, in particular to a multi-agent cooperative control method based on an evolutionary game theory under a zero-trust architecture, and the method comprises the steps: S1, constructing a multi-agent system of which the population scale is n; defining a strategy set for each agent; s2, each agent randomly selects one of the cooperation strategy A and the back strategy B as an initial strategy, and games with all neighbors; s3, calculating a real-time trust degree based on the historical cooperation rate and the real-time zero trust verification score; s4, calculating the fitness based on the interaction income and the neighbor relationship in the interaction result; s5, calculating a comprehensive evaluation value based on the real-time credibility and the fitness; s6, updating the strategy of each agent based on the comprehensive evaluation value difference between each agent and the neighbor; and S7, continuously selecting a strategy for updating each agent until the whole multi-agent system reaches an evolution stable state. According to the invention, the security of the multi-agent cooperative control system is improved.

Techniques discussed herein can facilitate one or more of improvements to Automatic Neighbor Relation(s) (ANR(s)) for cell(s) of a Radio Access Network (RAN), configuration of Physical-layer Cell Identifier(s) for cell(s) of the RAN, and / or end-to-end performance assurance for the RAN based on 5G QoS Identifier (5QI) targets and / or requirements. Various embodiments can employ one or more of the techniques discussed herein, for example, at a component or service of a Fifth Generation (5G) Core Network (5GC), a Third Generation Partnership Project (3GPP) Management System, or a node of a Radio Access Network (RAN).

In certain implementations, a method includes obtaining network information for a plurality of access points (APs) that are configured to provide user devices with access to a communication network, and determining, according to the network information, partitions in which to divide the APs for deploying a software update to the APs. The method includes dividing, according to a vertex coloring algorithm, the APs into the partitions. The APs correspond to vertices of the vertex coloring algorithm, and neighbor relationships of the APs correspond to edges of the vertex coloring algorithm. The method includes transmitting software update instructions to the APs to cause APs of a first partition to execute a reboot for installing the software update on the APs of the first partition at a different time than APs of a second partition execute a reboot for installing the software update on the APs of the second partition.

The invention discloses an industrial control vulnerability knowledge graph completion method based on negative sample generation, and the method comprises five modules: a vulnerability data crawling module, a named entity recognition module, a graph construction module, a sample enhancement module and a knowledge reasoning module. The vulnerability data crawling module crawls unstructured vulnerability information from a webpage; the named entity recognition module performs keyword extraction on the obtained vulnerability description information; the graph construction module combines the keywords extracted by the named entity recognition module with the information obtained in the data crawling module to construct a vulnerability graph; the sample enhancement module optimizes a data sampling process by applying a sample enhancement method based on sub-sampling, and performs information aggregation on each node of the obtained atlas according to a neighbor relation and attribute information; and finally, dynamically calculating the influence of the head entity on the tail entity by the knowledge reasoning module, and realizing graph completion according to the embedding calculation distance of the node and the relationship. According to the method, the problem of data sparsity in the vulnerability knowledge graph is solved.

Aspects of the subject disclosure may include, for example, connecting a user equipment (UE) to integrated networks including one or more terrestrial networks and one or more non-terrestrial networks, running a non-real time radio access network intelligent controller (non-RT RIC) at a service management and orchestration platform (SMO) of the O-RAN by running a plurality of rApps to manage traffic from the one or more terrestrial networks and the one or more non-terrestrial networks, and running a near-real time radio access network intelligent controller (near-RT RIC), where the running the near-RT RIC further comprises running an xApp to receive a UE measurement report and manage an automatic neighbor relation table in response to a command from one or more of the plurality of rApps. Other embodiments are disclosed.

The invention relates to the technical field of coal mine underground wireless communication, in particular to a time slot distribution and dormancy control method and system of a low-power-consumption wireless sensor network. The invention discloses a time slot allocation and dormancy control method for a low-power-consumption wireless sensor network, and the method comprises the following steps: S1, constructing a multi-hop tree network topology which takes a gateway as a center, and determining the neighborhood relation and the optimal path of each sensing node; s2, defining system parameters; s3, distributing native time slot numbers for all the sensing nodes; s4, distributing relay time slot numbers for all non-tail-end nodes, ignoring the tail-end nodes during distribution, and adopting a distribution principle which is the same as the original time slot number in the step S3; s5, all the sensing nodes work according to rules; and S6, the common dormancy time Tc = Tp-Nt * Ts is calculated, and Nt is the total time slot number required for completing data transmission of the whole network. Asynchronous time slot allocation and dynamic dormancy control are adopted, and the problems of high energy consumption, large interference and long delay of a synchronization scheme are solved through time-sharing awakening, conflict isolation and relay optimization.

The application provides an image clustering method and system based on natural neighbor search of fusion universal gravitation, and the method comprises the following steps: obtaining an image data set to be clustered; calculating the distance between each image data in the image data set according to the image data set; calculating the gravitation between each image data in the image data set based on the distance between each image data; obtaining a neighbor list of each image data based on the natural neighbor search method of fusion universal gravitation according to the gravitation between each image data; determining the neighbor relationship based on the neighbor list of each image data, and clustering the image data which are neighbors of each other into the same cluster according to the neighbor relationship to obtain an image clustering result. The image clustering method based on the natural neighbor search of fusion universal gravitation solves the problem of low accuracy of the existing image clustering method from the root.

Due to the line-of-sight nature of optical wireless communication and the limited field of view of optical receivers, the coverage of an access point (120) and the overlapping coverage area of neighboring access points (120) in an optical system are smaller compared to RF systems. Supporting secure roaming of an endpoint (110) in an optical multi-cell wireless communication network (100) becomes more challenging. To address this problem, a subsystem is disclosed that selects a candidate access point for an endpoint (110) from a plurality of access points (120) based on one or more neighbor relations and informs the endpoint (110) about the candidate access point to trigger the endpoint (110) to start a process to pre-establish a new pairwise transient key between the endpoint (110) and the candidate access point (120) for a secure handover.

The application discloses a privacy-enhanced data aggregation method supporting off-line fault tolerance and deviation correction. The method efficiently packs multi-dimensional data by using the Chinese remainder theorem, and realizes ciphertext aggregation without a fully trusted third party by introducing a collaborative mask based on neighbor relationship and a special mask shared by SM and CC, thereby guaranteeing data and identity privacy. Meanwhile, a deviation correction recovery mechanism executed unidirectionally by a control center is designed. The mechanism reconstructs a residual mask by using information such as a frozen candidate set and an effective participation set, thereby recovering a real aggregation result without requiring a node to respond secondly or an off-line node to supplement transmission. Performance evaluation shows that, compared with existing advanced schemes, DBPMDA reduces the additional communication and calculation overhead of the system in the case of device off-line, and is suitable for a resource-limited smart grid Internet of Things environment.

Based on a first ML model, neighbor relations of the cells (111, 111', 121, 131, 141) are predicted, using one or more traffic scenarios of data traffic per sector (110, 120, 130, 140) as input of the first ML model. Further, based on a second ML model, traffic distribution over the cells (111, 111', 121, 131, 141) is predicted, using the neighbor relations predicted by the first ML model as input of the second ML model. Further, based on a third ML model, performance of the cells (111, 111', 121, 131, 141) is predicted, using the traffic distribution predicted by the second ML model as input of the third ML model.

Methods and apparatus for supporting handover via efficiently updating neighbor tables in response to a detected dissimilar channel assignment, e.g., a temporary PAL channel assignment to one or more cells in a network, are described. In various cases the newly assigned temporary PAL channel has a different bandwidth and / or a different carrier frequency than the original PAL channel. The content of neighbor tables is supplemented to reflect the temporary dissimilar assignment. After the temporary assignment ends the original neighbor tables are restored.

The invention discloses a time slot resource allocation method and device, equipment and a medium, and relates to the technical field of wireless communication. According to the scheme, the neighbor table and the routing table corresponding to each node are constructed by setting the position code of each node in the train-ground wireless communication system, and the neighbor relationship between each node and other nodes and the corresponding data forwarding path information are clarified, so that a real-time network topology structure is obtained; when the node confirms that the node has a communication requirement, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, and the time slot resource corresponding to the node is determined according to the target route, so that the coordination of optimal route discovery and dynamic time slot allocation is realized, the method can be more adaptive to the network topology change, and the flexible marshalling requirement is met; and the time slot resource utilization rate and the communication service bearing capacity are improved.

Embodiments of a method in a user equipment and base station for implementing an Automatic Neighbor Relation (ANR) procedure. In some embodiments, the method in a user equipment includes: reporting to a network node that SIB1 is currently unavailable from a neighbor cell but can be obtained on demand; requesting the neighbor cell's SIB1 on demand, based at least in part on a configuration / indication received from the network node; and performing the ANR procedure for the neighbor cell based on an On-Demand SIB1 (OD-SIB1) received from the neighbor cell in response to the request. The method in the base station includes: configuring the UE to report that SIB1 currently unavailable from a neighbor cell but can be obtained on-demand; and configuring the UE to perform the ANR procedure for the neighbor cell based on an On-Demand SIB1 (OD- SIB1).

The invention discloses a base station opening management method and device. The method comprises the following steps: acquiring station opening template data of a to-be-opened base station and station opening template data of opened base stations, determining a scene type of the to-be-opened base station through clustering analysis, determining an adjacent region of the to-be-opened base station from the opened base stations according to the scene type, and constructing an adjacent region relationship. And analyzing a neighbor relation by using a graph neural network, generating a feature representation of a to-be-opened base station, and generating a target PCI and ZC root sequence in combination with a pre-training model. And after parameter compliance is ensured through conflict verification, the target PCI and the ZC root sequence are utilized to update the station opening template and configure the to-be-opened base station, and station opening of the to-be-opened base station is realized. The technical problems that a traditional base station opening process depends on manual configuration of PCI and other parameters, the process is tedious and the efficiency is low are solved.

The invention provides a common neighbor relation mining method and system based on graph calculation and mass data, and the method comprises the steps: 1, constructing a concept metadata system; step 2, performing data acquisition from the information system to be mined, and obtaining an instance of the concept according to the concept metadata system; step 3, unified coding: coding attributes in the instances; 4, the codes and the corresponding examples are stored in a graph database in a distributed storage mode; 5, relation mining is carried out, instance extraction is carried out from distributed graph storage, common neighbor discovery among instances is carried out according to coding characteristics, rule filtering is carried out according to preset rules, and a recommendation relation is generated; the system is used for implementing the method. The method can be widely applied to the fields of social network analysis, recommendation system optimization and the like, and an efficient solution is provided for relation mining of mass data.

Aspects of the subject disclosure may include, for example, determining, in relation to a communication node, a neighboring node of a wireless network, wherein the neighboring node comprises a baseband processor in communication with a radio frequency (RF) subsystem. A determination is made regarding one of a spatial configuration, a hosting infrastructure configuration, or both, of the neighboring node. The spatial configuration includes one of a divided configuration, including geographically separated centralized and a distributed baseband units, and an undivided configuration including an undivided baseband unit. The hosting infrastructure configuration distinguishes a physical configuration having the baseband processor includes dedicated compute resources allocated to the node, from a virtual configuration having a virtual baseband processor hosted on shared compute resources. An association between the spatial configuration, the hosting infrastructure configuration, or both, and the neighboring node facilitates mobility within the wireless communication network. Other embodiments are disclosed.

The invention discloses a network energy-saving method and device, and belongs to the technical field of networks. The network energy-saving method comprises the following steps: acquiring the path loss and / or neighbor relation of each AP in a plurality of APs in a network; obtaining the physical position information of each AP in the plurality of APs, wherein the physical position information of any AP indicates the deployment position of any AP; and determining at least one first AP in the plurality of APs based on the path loss and / or neighbor relationship of the plurality of APs and the physical location information of the plurality of APs, each first AP corresponding to one target energy-saving group, and any first AP being used for providing an associated service for a terminal intending to access the target energy-saving group when the corresponding target energy-saving group is in an energy-saving state. According to the invention, the basic signal coverage of the first AP in the target energy-saving group on the target energy-saving group in the energy-saving state can be ensured to a greater extent, and the risk of signal coverage loopholes when the network is in the energy-saving state is reduced.

The present disclosure provides an automatic neighbor relation measurement method, device and storage medium, wherein the automatic neighbor relation measurement method comprises the following steps: in response to an ANR measurement configuration issued by an original base station, performing a re-establishment with a target base station; and according to the ANR measurement configuration, acquiring public gateway interface information of the target base station and configuration information of a core network device connected to the target base station.

The invention relates to the technical field of infrastructure and IT support, and provides a route synchronization method in an SDN controller scene and related equipment, and the route synchronization method in the SDN controller scene applied to a route multi-active synchronization service comprises the following steps: receiving a service route generated by an SDN controller; sending the service route to a plurality of target BGP (Border Gateway Protocol) services, so that each target BGP service respectively sends the received service route to router equipment corresponding to the service route; wherein the plurality of target BGP protocol services respectively establish a neighbor relationship with the router device. According to the technical scheme provided by the invention, the router equipment receives the service routes sent by the multiple target BGP protocol services, a service route multi-activity mechanism is realized, when abnormal downtime of the BGP protocol services occurs, route loss cannot be caused, and high-stability continuous operation of the service routes can be ensured.

The invention discloses a multicast message forwarding path learning method and system. The method comprises the steps that a network switch establishes a multicast subscription relation table, a corresponding relation table of network switch ports and multicast addresses and a network switch neighbor relation table; establishing local part information of a network switch multicast forwarding table in combination with the multicast subscription relation table and a corresponding relation table of network switch ports and multicast addresses; a network switch publishes a multicast address learned by a local machine through a multicast routing protocol message, and establishes partial information of a multicast address forwarding table across the network switch by combining a multicast subscription relation table, a corresponding relation table of a local port of the network switch and the multicast address and a neighbor relation table of the network switch; and a complete multicast forwarding table is formed by combining information of a local part, so that automatic learning of a multicast forwarding path of the network switch is realized. According to the invention, the multicast forwarding path configuration can be automatically completed, the access port of the IED equipment is not limited, and the operation and maintenance level is effectively improved.

Aspects of the subject disclosure may include, for example, obtaining a measurement report from a communication device, the measurement report indicates a first mobile network resource of a first neighbor base station, and reporting the first mobile network resource of the first neighbor base station to an automatic neighbor relation (ANR) optimizer (ANR-o) xApplication running on a radio access network (RAN) intelligent controller (RIC). The ANR-o xApplication provides a first indication of a first group of mobile network resources of the first neighbor base station to the serving base station. Further embodiments can include receiving the first indication of the first group of mobile network resources associated with the first neighbor base station, and updating an ANR table associated with the serving base station with the first mobile network resource and the first group of mobile network resources associated with the first neighbor base station. Other embodiments are disclosed.

An inductive link prediction method based on subgraph and path comparative representation learning is characterized in that an overall knowledge graph comprises a plurality of structured triples et = (s, rT, o), surrounding subgraphs containing target nodes are extracted, isolated nodes and a complete neighbor relation are reserved, and node features of complete semantic information between neighbor nodes are obtained. And extracting a topological relation path between the head entity s and the tail entity o from the knowledge graph. Local structures and relation semantics are obtained through node-level relation coding, sub-graph-level aggregation perception message passing and an attention mechanism. And carrying out modeling on paths of adjacent relations of the sub-graphs to obtain features in the sub-graphs. A topological structure of a target map is associated with path representation, marginal-based loss is incorporated into distance scores of a positive path sample and a negative path sample, the positive path sample and the negative path sample which need to be distinguished are compared and learned through semantic information conveyed by a relation path, and a loss function is optimized through joint training.

The application provides a network management type switch communication method, which comprises the following steps: a network device periodically sends a TLV query message to surrounding devices; when a neighbor relationship is not established between the network devices, a TLV message for requesting to establish a connection is sent, if the network device starts an LLDP function and a reply to agree to the connection, the connection obtains the description information of the network device, if the connection is not agreed, the first network device Mac address information is cached, and the sending of the TLV query message is stopped; when the connection needs to be established, if the second network device Mac address is not cleared in the first network device, after receiving the connection request, the first network device directly sends a TLV message for requesting to connect, and the second network device Mac address is saved to a TLV list, if the second network device Mac address is cleared, the first network device periodically sends a TLV query message to the second network device. Through the scheme, the handshake connection is not needed when the neighbor relationship is established, the number of interactions is reduced, and the negotiation time is shortened.

The invention provides a flow test system and method for giant frame multicast. The system comprises the following steps: establishing a multicast neighbor relation among a plurality of switches; obtaining a test demand input by a user, and setting the test demand as a multicast terminal of a multicast source and a multicast terminal of a multicast receiver; if it is determined that the number of the multicast sources and the number of the multicast receivers are both one, the multicast sources are controlled to be connected with one end, connected in series, of a switch, and the multicast receivers are controlled to be connected with the other end, connected in series, of the switch; forwarding the test requirement to the multicast source; and the multicast source constructs the giant frame multicast service flow based on the received test requirement, and sends the giant frame multicast service flow to the multicast receiver through the switch with the multicast neighbor relation so as to carry out flow test. According to the method and the device, an extra tester is not needed, and the required multicast source and the multicast receiver can be directly determined in the existing multicast system, so that the test of the huge frame multicast service flow is realized, and the test cost is reduced.

The present invention relates to the technical field of social recommendation, and provides a social recommendation method and system for enhancing neighbor relationships, comprising: obtaining a user set, an item set, and user ratings of items in a social network; and performing social recommendations for each user using a social recommendation model that enhances neighbor relationships based on the obtained user set, item set, and user ratings of items. The social recommendation model that enhances neighbor relationships establishes a mapping between users and items, calculates the intimacy between the neighbors of the user and the item, samples the neighbors of the user and the item based on the intimacy, and calculates the weights of the sampled neighbors based on the intimacy using a self-attention mechanism to obtain a project social space representation and a user social space representation. The system then combines the project's own feature representation and the user's own feature representation to obtain a project feature representation and a user feature representation. This reduces the influence of invalid neighbors and improves the accuracy of social recommendations.

The embodiments disclosed herein relate to random access channel (RACH) optimization and automatic neighbor relation (ANR) use cases and requirements in 5G networks. For example, the embodiments disclosed herein automatically configure RACH parameters and neighbor relations in a 5G network, which can result in maximum savings for mobile operators in resource utilization. The RACH optimization disclosed herein can automatically configure RACH parameters in a cell to achieve optimal RACH performance by reducing network access and handover times and minimizing failures. The automatic neighbor relation (ANR) management disclosed herein can automatically create and update neighbor relations, which can result in maximum savings for mobile operators in resource utilization.

Systems and methods are described herein for automatically detecting wireless neighbor relationships within a wireless network. While a user device is using a first cell for communications, the user device detects and provides a physical cell identifier for a second cell to a computing device, e.g., the first cell or server. The computing device queries a relationship table of the first cell for a known handover relationship between the first cell and the second cell. If the table does not include the known handover relationship, the computing device instructs the user device to obtain a cell global identifier of the second cell. The computing device then adds a new handover relationship between the first cell and the second cell to the relationship table using the cell global identifier of the second cell. Communications for the user device can be automatically handed over from the first cell to the second cell.