36 results about "Direct neighbor" patented technology

In an ad-hoc mobile network, a geometry-based routing protocol (GRP) is used to route traffic from a source node to a destination node. In the GRP, each node maintains a location list, which comprises location information for a number of nodes of the ad-hoc mobile network. Periodically, each node transmits to its direct neighbors (i.e., those nodes with which it has a point-to-point link) (a) its location, and (b) its location list. Each node that receives a location list from an adjacent node merges the received location list into its own location list such that location information for existing nodes, and / or newly identified nodes, is current.

Methods and apparatus for concealing corrupted blocks of streaming data are disclosed. It is determined whether a subdivision of the streaming data is a corrupt subdivision. The corrupt subdivision is concealed using a previously reconstructed or concealed subdivision in a manner that does not require information from pairs of direct neighbor subdivisions that have not been previously reconstructed or concealed.

Embodiments of the present invention relate to methods and systems for automatically determining the network topology of a computer network containing unnumbered or unaddressed links between network devices, such as routers. The method according to one embodiment uses the network management information data available with each router. From the information, the embodiment can determine all routers connected to a given unnumbered interface. The embodiment can also automatically determine which of these routers is the immediate neighbor by comparing how they connect (via interface number) to the unnumbered interface and how they connect to each other. If the immediate neighbor is found to have a route back to the examined router or a default route, a link between the immediate neighbor and the unnumbered interface can then be stored and identified in the network topology. The method can be repeated in cycles to determine topology changes.

A dynamic binding protocol has three tasks that run in parallel: discovery, association, and operation. During discovery, control elements (CEs) and forwarding elements (FEs) learn about immediate neighbors and CEs in a SoftRouter network that has separate control and data planes. During association, FEs associate with CEs and are configured with basic parameters, such as IP interface addresses, hostnames, and the like. During operation, failover and packet tunneling between CEs and FEs is handled.

The invention relates to a distributed peer-to-peer network based on concentration service and a construction method thereof, wherein, the method includes the following steps: (1) establishing a concentration server for the peer-to-peer network, which is used for adding the peer-to-peer network for a new node and providing service for the exit of the peer-to-peer network and defining a data structure of a B plus tree for the server so as to save the information on a dynamic and variable node; (2) adopting a new node to search a direct neighbor through a concentration server or search the direct neighbor in a virtual link from a peer node and add the direct neighbor into a peer-to-peer network ; (3) applying a boundary node (a peer node with a precursor or a successor exiting from the direct neighbor) to search a direct precursor or a successor neighbor through the concentration server or search the direct precursor or the successor neighbor in the virtual link from the node, so as to maintain ring-shaped topology among the peer nodes. The invention integrates the concentration service in the distributed peer-to-peer network, thus obviously decreasing network fluctuation due to frequent entering or exiting of the node and greatly increasing the work efficiency of the peer-to-peer network.

A half-duplex communication network comprises a plurality of communication links, each link being configured a priori to communicate in one direction; and a plurality of nodes, each node coupled to a first and second direct neighbor nodes and a first and second skip neighbor nodes via the plurality of communication links. Each node comprises propagation logic adapted to arbitrate conflicts between concurrent messages based on at least one of higher level policies and a comparison between a priority of each message, wherein each node is adapted to communicate a message without waiting to determine if another node is transmitting another message with a higher priority.

A system for automatic collection and transport of readings from water, gas and electricity meters wherein at least one receiver element and one element to transmit (1) define an ad-hoc wireless network, self organizing in an area (A), where the readings are transmitted to the next element using multihop techniques according to a routing algorithm. A value t is assigned to the receiver elements (1), with maximum value T. If the direct neighbours of a given network node have as a maximum an assigned value t, a value t-k is assigned to this node. Every node will transmit a message to a node with t value larger than its own. If there is more than one with the same maximum value, it will transmit to one of them. The system allows the meter reading to be transported automatically to the billing center.

A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

The invention discloses a fraud number identification method based on graph embedding. The method comprises the following steps: calculating a call characteristic index of a user based on a call signaling of the user in a period of time, forming a call characteristic index vector of each user, and extracting a contact person having a call relationship with the user in a period of time as a directneighbor of the user to form a direct neighbor group of each user; constructing and training a graph for identifying the fraud number, embedding the graph into a neural network, inputting conversationcharacteristic index vectors of a target user and a plurality of associated users, and outputting label information for identifying whether the number of the target user is a suspected fraud number or not; and inputting the call characteristic index vectors of the target user to be identified and the plurality of associated users into the trained graph, embedding the graph into the neural network, and then judging whether the target user number to be identified is a suspected fraud number according to the output. The invention belongs to the technical field of information, and can realize accurate identification of a fraud number based on a multi-point-point communication relationship structure mode of a fraud phone.

The invention provides a dynamic power control method in a low-duty-cycle sensor network. The method comprises following steps of initializing node parameters after network nodes are deployed; evaluating wireless link qualities among the nodes according to a neighbor discovery process; exchanging dormant schedules of the nodes; according to a delay evaluating model and an energy consuming model, calculating single hop dormant delays and expected energy consumptions from a current node to direct neighbor nodes; according to the single hop dormant delays and the expected energy consumptions, through utilization of a dynamic planning method, recursively building transmission control tables; according to the transmission control tables, through routing, dynamically selecting node paths with minimum end-to-end delays and end-to-end energy consumptions to a base station node, and sending target data packets through the selected node paths. According to the method, through adoption of dynamic power adjustment and combination of topology extension of output powers, on the basis of the dynamic planning method, the routing path with the minimum delay is selected; it is unnecessary to change the existing dormant period of the nodes; the end-to-end transmission delay is ensured; and balance and optimization between the delay and the energy consumption are realized.

The invention provides a method, a server and a client for determining direct neighbor nodes. The method comprises the following steps that: a content distribution capability message sent by the client is received, and the content distribution capability message comprises the current content distribution capability of the client; and the direct neighbor nodes are determined according to the received current content distribution capability of the client. The method determines the direct neighbor nodes through the content distribution capability of the direct neighbor nodes on data contents, sothat the client of the direct neighbor nodes can well distribute the obtained data contents.

In a method of managing a content-based network including a plurality of content routers, such as XML routers, dynamic links are established between the content routers which are not direct neighbors.

The invention discloses a neighborhood exploration method based on a heterogeneous graph neural network. The neighborhood exploration method comprises the following steps: step 1, defining a parameter alpha for guiding an exploration direction; 2, in the given heterogeneous graph and meta path phi, for each direct neighbor of the node, no carrying out operation on the probability of alpha, and skipping to the next direct neighbor node; carrying out biased migration sampling when the probability is 1-alpha, and replacing original direct neighbors with meta-path neighbors obtained by migration sampling; 3, adding the direct neighbors into a neighbor set according to the probability of alpha; and adding the meta-path neighbors into the neighbor set according to the probability of 1-alpha. According to the method, two exploration strategies of depth-first exploration and breadth-first exploration are smoothly spliced to adapt to different heterogeneous network structures, and specific semantic neighbors are captured, so that the interpretability and accuracy of a recommendation system are improved.

A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbor node of the first node and any nodes of the network subtending the neighbor node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

A method, system and program product for balanced workload distribution in a plurality of networked computing nodes. The networked computing nodes may be arranged as a connected graph defining at least one direct neighbor to each networked computing node. The method comprises determining a first workload indicator of the i-th computing node, at a first stage before a new task may be started by the i-th computing node, determining an estimated workload indicator of the i-th computing node, assuming that the new task is performed at a second stage on the i-th computing node, determining estimated workload indicators of each direct neighbor assuming that the new task is performed at the second stage, deciding whether to move the new task to another computing node, and moving the new task to one of the direct neighboring computing nodes of the i-th computing node such that workloads are balanced.

The invention provides a community discovery method based on artificial intelligence. The method comprises the following steps: building a social network graph through employing a user node as a vertex and a social relation as an edge; forming a time evolution network by the social network graph changing along with the time; dividing the time evolution network, and determining a key time point; accumulating the coding costs of the sub-networks in different time periods to obtain the coding cost of the time evolution network; and decomposing the social network into homogeneous partitions by minimizing the coding cost. The invention provides a community discovery method based on artificial intelligence. When the method is applied to a network with link loss or noise data, the influence of network mutation and accumulation errors on community discovery precision is effectively reduced, the influence of node direct neighbors and the influence of indirect neighbors are considered, the sensitivity of an algorithm to neighborhood threshold parameters is reduced, and the accuracy of a community attribution result is effectively improved.

In a communications system, especially an SDH DCN system in which most network elements (NEs) function as intermediate systems (ISs) rather than end systems (ESs), it is made possible to reduce the constraints on the DCN topology posed by the IS-IS routing protocol by configuring the gateway element (GNE) and the NEs directly connected to it in such a way that the non-gateway NEs appear as ESs to the rest of the system. This is achieved by setting up on each of the digital communication channels (DCCs) of the GNE manual end-system adjacencies for all the NEs reachable through that DCC; setting the “external domain” attribute of these DCCs to TRUE and setting the same attributes of the corresponding DCCs of those NEs which are immediate neighbors of the GNE likewise TRUE; and supplying those DCCs with length-zero reachable address prefixes (RAPs) and configuring the neighbor NEs as level 2 Intermediate Systems. The invention applies especially to SDH ring topologies, in which case the gateway element has two DCCs, but also to bus topologies, in which case the gateway has only one DCC. Systems with more than one gateway element are also catered for.

A device validates reachability of nodes of a communication network of an industrial automation and control system. The device includes a collector module configured to update a data set including discovered dataflow information by detecting direct neighbor nodes having a physical connection to a selected node, and updating the data set by adding the selected node and those direct neighbor nodes which have configured logical network constraints matching logical network constraints of the selected node. The device includes a repeater module configured to repeat the selecting of a direct neighbor node in the data set and directing the collector module to update the data set using the selected direct neighbor node. The device includes a validation module configured to validate reachability of nodes of the network by comparing the data set with a data set including designed dataflow information which defines reachability requirements for nodes of the communication network.

The present invention provides an article recommendation method and system based on user intent in a session by encoding a current session with articles of a previous timing and a last article, thereby generating an accurate session representation, and then using it to perform initial article prediction as user intent. Afterwards, we design an intentionally directed neighbor detector to locate a correct neighbor session. Finally, the representation of the current session and the representation of the neighbor session are combined through a gating fusion layer, final article recommendation is generated, and the accuracy of article recommendation is effectively improved.

The invention belongs to the technical field of computer graph abstraction, and particularly relates to a parallel graph abstraction method based on an attribute graph, which comprises the following steps of: 1, preprocessing acquired graph data, and processing each node in a graph into a node structure with own information and all direct neighbor information; 2, randomly selecting a direct neighbor node for the current node, and then selecting a node with the same attribute and maximum similarity as the current node from all the direct neighbor nodes of the neighbor node as a candidate node combined with the current node; 3, judging whether an introduced error exceeds an error threshold value or not after the current node and the candidate nodes are combined, if yes, returning to the step2 to continue to search for other candidate nodes, and if not, combining the two nodes; and 4, executing two-node combination by updating all node information in the node structure, repeating the steps 3-4 until the number of the remaining nodes is smaller than a set threshold, storing a final node structure, and exporting an abstract graph.

The invention relates to a distributed peer-to-peer network based on concentration service and a construction method thereof, wherein, the method includes the following steps: (1) establishing a concentration server for the peer-to-peer network, which is used for adding the peer-to-peer network for a new node and providing service for the exit of the peer-to-peer network and defining a data structure of a B plus tree for the server so as to save the information on a dynamic and variable node; (2) adopting a new node to search a direct neighbor through a concentration server or search the direct neighbor in a virtual link from a peer node and add the direct neighbor into a peer-to-peer network ; (3) applying a boundary node (a peer node with a precursor or a successor exiting from the direct neighbor) to search a direct precursor or a successor neighbor through the concentration server or search the direct precursor or the successor neighbor in the virtual link from the node, so as to maintain ring-shaped topology among the peer nodes. The invention integrates the concentration service in the distributed peer-to-peer network, thus obviously decreasing network fluctuationdue to frequent entering or exiting of the node and greatly increasing the work efficiency of the peer-to-peer network.

The invention provides a community recognition method in a social network. The method comprises the steps of analyzing a time evolutionary structure of a social network graph, encoding a network evolutionary model formed by various possible solutions in a problem solving process, converting a social network into a uniform network structure with a low entropy value, calculating encoding cost of a social relationship, and searching an optimal solution through a clustering algorithm to obtain a stable community structure. The invention provides a community recognition method in a social network.When the method is applied to a network with link loss or noise data, the influence of network mutation and accumulation errors on community discovery precision is effectively reduced, the influence of node direct neighbors and the influence of indirect neighbors are considered, the sensitivity of an algorithm to neighborhood threshold parameters is reduced, and the accuracy of a community attribution result is effectively improved.

The invention discloses an optimal unidirectional communication path selection method between wireless sensor network nodes. The method comprises the following four steps: a node broadcasts a relative hop test packet, and the node and a direct neighbor node thereof calculate a relative hop; the node broadcasts an optimal unidirectional communication path detection packet, and other nodes determine a minimum hop from a packet sending node to itself, an optimal unidirectional communication path and the relative hop; other nodes send an optimal unidirectional communication path notification packet to the packet sending node; and the node requests a specific node to send the optimal unidirectional communication path detection packet by a path detection packet request sending message to obtain the optimal unidirectional communication path information from the specific node to itself. According to the optimal unidirectional communication path selection method disclosed by the invention, the irregularity of the communication radiation range of the nodes and the inconsistency of node distribution are fully considered, the unidirectional communication path between the nodes is selected in combination with the minimum communication hop and the relative hop, the optimal unidirectional communication path is selected, the performance is stable, and the cost is reduced.

The invention relates to a cell PCI allocation method of a mobile communication system, comprising the following steps of: acquiring a PCI set A of a third-stage neighbor cell of a current node, a PCI set B available for the current node and a PCI set C available in a network, wherein the third-stage neighbor cell is a neighbor cell of the neighbor cell of a direct neighbor cell of a current cell; acquiring a PCI set D with PCI interference in a first-stage neighbor cell PCI in an Intra-eNB and an Inter-eNB, wherein the first-stage neighbor cell is the direct neighbor cell of the current cell; respectively acquiring a node PCI different from the PCI set D from the PCI set A, the PCI set B and the PCI set C, thereby forming a PCI set Cx, a PCI set Bx and a PCI set Ax; and respectively selecting an element from the PCI set Cx, the PCI set Bx and the PCI set Ax , and allocating the selected element as the PCI of the current node. With the technology of the cell PCI allocation method of the mobile communication system, interference suppression of uplink and downlink pilot signals under the condition of same-frequency networking is avoided, and operating performances, such as terminal wireless transmission, cell reselection and switching, are improved.

A method, system and program product for balanced workload distribution in a plurality of networked computing nodes. The networked computing nodes may be arranged as a connected graph defining at least one direct neighbor to each networked computing node. The method comprises determining a first workload indicator of the i-th computing node, at a first stage before a new task may be started by the i-th computing node, determining an estimated workload indicator of the i-th computing node, assuming that the new task is performed at a second stage on the i-th computing node, determining estimated workload indicators of each direct neighbor assuming that the new task is performed at the second stage, deciding whether to move the new task to another computing node, and moving the new task to one of the direct neighboring computing nodes of the i-th computing node such that workloads are balanced.

The invention relates to the technical field of waste water treatment, particularly a method for processing sludge depositing in a continuous ring-type reaction tank, which comprises the following steps: intermittently switching on or off direct neighbor or indirect neighbor aerators so that the sludge mixed liquor in the continuous ring-type reaction tank has a certain flow rate when switching on the aerators in the continuous ring-type reaction tank; and switching off any aerator in the continuous ring-type reaction tank so that the flow direction of part of the sludge mixed liquor can be changed due to the flow rate inertia of the sludge mixed liquor in the tank. The change of the flow direction of the sludge mixed liquor can lift the sludge depositing in the tank, thereby having good capability of stirring and plug-flow. Thus, the invention solves the problem of sludge deposit in the continuous ring-type reaction tank without adding other equipment, and has the advantages of simple realization and favorable treatment effect on waste water.