116 results about "Neighbour discovery" patented technology

The present application is directed towards systems and methods for providing link management in a multi-core system. In some embodiments, the present application describes solutions for managing address resolution in IPv4 networks in a multi-core system. In other embodiments, the present application describes solutions for managing neighbor discovery in IPv6 networks in a multi-core system. In still other embodiments, the present application describes solutions for managing network bridging in a multi-core system. In yet other embodiments, the present application describes solutions for managing link aggregation in a multi-core system. And in still other embodiments, the present application describes solutions for managing virtual routers in a multi-core system.

Neighbour discovery in communications networks is made possible by a node sending beacon packets which include information regarding the node. The beacon packets are sent at pseudo-random time and on pseudo-random frequencies.

Methods and apparatus for using end nodes, e.g., wireless terminals, to discover base stations and communicate information about discovered access nodes, e.g., base stations, to other access nodes in a system are described. As the wireless terminal roams in the system and new access nodes are encountered, one or more physically adjacent access nodes will be informed of the presence of the new access node as a result of communications with the wireless terminal. A message indicating an access node's inability to route a message to another access node which is known to a wireless terminal may trigger the wireless terminal to begin the process of updating access node routing and neighbor information.

A method and apparatus for configuring Femto Devices in an Ultra Mobile Broadband network system. A Femto Device transmits a Femto pilot signal to an Access Terminal, which is served by a plurality of base stations in the Ultra Mobile Broadband network system. The Access Terminal then transmits to the Femto Device an identifier of a base station that controls a macrocell where the Femto Device is located. Next, a Neighbor Discovery Request message is transmitted from the Femto Device to the base station in dependence upon the received identifier of the base station. In response to the Neighbor Discovery Request message received, a Neighbor Discovery Report message is transmitted from the base station to the Femto device. The Neighbor Discovery Report message includes a field indicating network addresses of a Session Reference Network Controller and an Access Gateway that connect to the base station. Finally, the Femto Device connects to the Session Reference Network Controller and the Access Gateway via the Femto device in dependence upon the network addresses of the Session Reference Network Controller and the Access Gateway.

The present invention discloses a method to prevent spoofed packet attacks, wherein, a DHCPv6 relay agent device forwards address assignment packets between a DHCPv6 client and a DHCPv6 server in stateful configuration mode, establishes and maintains a client information table according to the client information in the address assignment packets, and filters neighbour discovery (ND) packets sent from clients according to the client information table. The present invention also discloses a DHCPv6 relay agent device. The technical proposal of the invention can protect the DHCPv6 relay agent device against spoofed ND packet attacks.

Methods and systems for reliable neighbor discovery in wireless ad hoc networks are provided herein. In one aspect, embodiments of the present invention provide methods and systems for analyzing the quality of a communication link. In embodiments, several factors affecting link quality may be incorporated in the analysis, and basic and / or complex statistical and / or probabilistic analysis may be used. In another aspect, embodiments of the present invention provide methods and systems for neighbor node discovery that adapt to network and / or node operating conditions and that dynamically maintain a neighbor node set at a given node according to these conditions. In a further aspect, embodiments of the present invention extend the utility of neighbor node discovery beyond the customary role of data routing support into the problem of deploying an ad hoc network by providing a display module for displaying node connectivity information.

In one embodiment, a method includes receiving a neighbor discovery message and a border routing message through an interface at a particular router. The interface communicates with a border network segment between first nodes routing with IPv6 using a first routing protocol and different second nodes routing using a different routing protocol. The messages are received from an alien router. The border routing message includes foreign routing data that indicates a route among the second nodes. If the alien router's interface on the border segment does not have a global IPv6 address, then a fictive IPv6 address is generated, which includes a global prefix of an IPv6 address for the particular router and an interface identifier associated with the alien router. The fictive IPv6 address and the foreign routing data are inserted into a domain scope external advertisement message that is sent to the first nodes.

The invention discloses an inter-mobile node communication system with position prediction based on a directional antenna. The system comprises a neighbor discovery module (1), an address analysis module (2), an address storage module (3), a position prediction module (4), a parameter setting module (5), a communication sending module (6), a communication receiving module (7) and a position correction module (8). Each mobile node in the system obtains position information of neighbor nodes through neighbor discovery operation. The node can perform position detection on surrounding neighbor nodes at regular intervals t and then communicate with predicted areas, and geographical position information of both parties are exchanged when the communication is successful; otherwise the node can automatically adopt a position prediction correction method for correction to perform the re-communication. In the system, a field angle of the directional antenna is used to perform regional definition to effectively reduce a radiofrequency coverage region during the communication of the nodes so as to reduce the energy consumption during the inter-mobile node communication, improve space usage rate, and increase the safety during the communication.

A content router, comprising a plurality of physical links to other nodes in an information centric network, a receiver coupled to the plurality of physical links configured to receive messages, a transmitter coupled to the plurality of physical links configured to transmit messages, and a service publishing and discovery (SPD) module comprising a processor and memory device coupled to the receiver and to the transmitter, wherein the SPD is configured to store status updates of the physical links, wherein the SPD is configured to determine a next hop and a number of hops to forward a received message based on a prefix in a name-based service discovery protocol name of a received message.

The invention provides an access control method and equipment. The method comprises that an ED is used as a neighbor discovery server ENDS, receives the registration which is sent out by the ED which is used as a neighbor discovery client EDNC, and informs any other ENDCs which are registered to the ENDS to the ENDCs which initiate the registration; and the ED is used as the ENDC, initiates the registration to the ED which is used as the ENDS, and acquires any other ENDCs which are registered in the ENDS from the ENDS, the ENDC which is alternately accessed to the ENDC from all the acquired ENDCs to establish a virtual forwarding passage according to the visit control strategy of the ENDC, so the established virtual forwarding passage is used to alternately accessed the selected ENDC.

The invention relates to a routing method for unmanned aerial vehicle network communication. The method comprises the following steps: 1, randomly deploying unmanned aerial vehicle network nodes; 2, interacting link information and node information between the nodes to perform link perception and neighbor discovery; 3, electing a cluster head node according to the link information and the node information; 4, the non-cluster head node sending a join request to the cluster head node, and the cluster head node establishing topological structure information in the cluster after receiving the joinrequest; 5, each cluster head node informing the non-cluster head nodes in the cluster of the topological structure information in the cluster, so that the non-cluster head nodes in the cluster establish a topological structure in the cluster; each cluster head node sending information indicating that the cluster head node is a cluster head to other cluster head nodes, and establishing a clusterhead network topology structure between the cluster head nodes; and 6, establishing a routing table according to the link information, the node information and the in-cluster topological structure. The method is good in expandability, high in network stability and real-time performance, low in energy consumption and particularly suitable for large-scale unmanned aerial vehicle network communication.

The invention discloses a method and a system for realizing a neighbor discovery proxy based on duplicate address detection (DAD). The method comprises the following steps that: an access layer switchboard detects a DAD process of a host machine node, establishes and stores address information, and uploads the address information to a convergence layer switchboard; the convergence layer switchboard stores the address information into an address information table; the host machine node sends a neighbor solicitation message to the convergence layer switchboard; the convergence layer switchboard inquires the address information table; and when the address information table comprises a target Internet protocol (IP) address of the neighbor solicitation message, the convergence layer switchboard sends a neighbor advertisement message to the host machine node. According to the technical scheme, neighbor discovery proxy equipment can judge whether the IP address is actually used, so that whether the IP address can be reached is determined, and communication between a request host machine node and a target host machine node is guaranteed.

The AI-Based Neighbor Discovery Search Engine Apparatuses, Methods and Systems (“ANDSE”) transforms embedding neural network training request, object search request inputs via ANDSE components into embedding neural network response, object search response outputs. An embedding neural network training request associated with a set of context objects is obtained. Sample similarity evaluation metrics are determined. For each context object, a set of positive target samples that satisfy the sample similarity evaluation metrics for the respective context object is determined. For each context object and each positive target sample in the respective set of positive target samples, a training example comprising the respective context object and a positive target sample is added to a training set. Configuration parameters for an embedding neural network are determined. The embedding neural network is trained using training examples in the training set. A datastructure that stores the adjusted weights of the embedding neural network is generated.

The invention relates to an intra-group member phase selection method and system based on a group neighbor discovery mechanism. The intra-group member phase selection method comprises the steps that when only a master node exists in a node group, an initial group sequence is the same as the sequence of the current master node, wherein the group sequence includes N phases; when the situation that a new node is added to the node group is discovered, the new node serves as a slave node of the master node, the slave node corresponds to a sequence, with N phase positions, in a group, and an or operation is carried out on the slave nodes and the current group sequence to obtain N combined sequences; the time delay between each combined sequence and the group sequence to obtain N sets of time delay, and the N sets of time delay are sorted by size; the minimum set of time delay is obtained, and the phase position corresponding to the minimum set of time delay serves as an optimum phase; the master node distributes the optimum phase to the slave node, and the group sequence is updated as a sequence obtained after the or operation is carried out on the current group sequence and the slave node. According to the intra-group member phase selection method, the optimal combination of phase differences is selected, and the discovery time delay of other existing neighbor discovery strategies is shortened.

The invention discloses a simplified protocol stack routing and neighbor discovery method applied to a space-ground integrated network, which comprises the following steps: a protocol stack communication address is an identifier with the length of 16 bits, a routing table maintained by a routing subsystem is a three-level hash chain table, and a data packet routing mode is host routing, so that the routing efficiency is further improved. A data packet passes through a routing subsystem to obtain a next-hop node identifier and exit equipment, then the data packet is transmitted to a neighbor subsystem, a corresponding next-hop node Mac address is obtained in the neighbor subsystem according to the next-hop node identifier, maintenance and management are carried out on the neighbor subsystemthrough an identifier neighbor analysis protocol, and the whole network state is monitored. The method effectively solves the main challenges faced by the space-ground integrated network, such as topology dynamic change, node capability limitation, transmission time delay and the like, can improve the security of the backbone network and reduce the bandwidth resource and power consumption of thenetwork, and is suitable for a satellite network environment.

Many internet of things (IoT) are "sleepy" and thus occasionally go into a sleep mode. As described herein, nodes in a connected network of nodes may determine that other nodes in the network are sleepy. Further, nodes, such as endpoint devices and routers for example, may process packets in the network based on a reachability state of their neighboring nodes.

Various methods and devices are provided to address the need for improved neighbor detection. In a first method, a node (e.g., a mobile node or a network transceiver node) transmits (401) a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the node receives (402) signaling indicating a signature of at least one neighbor node. In a second method, a neighbor node receives (501) a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the neighbor node transmits (502) a signature identifying itself.

Transmitting a probe signal. A method includes transmitting a signal, having a predetermined total power, during a transmit cycle. The signal has a traffic channel transmitting user data and a probe channel to locate new nodes to add to the network. The transmit channel uses a first portion of the total power and the probe channel uses a second portion of the total power. The method further includes performing a probe cycle by lowering the power in the first portion of the total power and raising the power in the second portion of the total power, but maintaining the total power at the same level as the total power during the transmit cycle. The method further includes, after the probe cycle, raising the power in the first portion of the total power and lowering the power in the second portion of the total power.

The invention provides a method and equipment for detecting asymmetric static aggregation. A neighbour discovery protocol is enabled by a static aggregation group member port, a neighbour relation is built between the static aggregation group member port and opposite end equipment, a neighbour discovery protocol message carrying neighbour summary information is received, whether the neighbour discovery protocol message is consistent with relevant information of a static aggregation group reference port or not is judged according to relevant content in the neighbour summary information, and if not, a port where a neighbour is located is not selected in a static aggregation group, and is blocked. According to the scheme, the method and equipment are simple, universal and high in compatibility.

The invention provides an underwater acoustic network penetration routing method, which comprises the following steps that: after nodes in an underwater acoustic network initiate neighbor discovery, a source node starts a timer, calculates to obtain the packet loss rate of a data packet, sets the flag position of a relay data packet of the source node as zero, updates the source node and sends the data packet until a destination node receives the data packet from the source node; and a route is established, successful relaying of data is completed, the connectivity probability of a link is calculated, and a permeation route process is ended and permeated to a destination in a grid, wherein a relay path in a data packet received by a destination node is a finally established route path. Reliable transmission of the route is effectively guaranteed by improving the redundancy of link communication, huge overhead caused by route flooding is greatly reduced by adopting the limiting condition that each data packet is only transmitted once on each link, and the method is simple, effective and easy to operate and implement and has feasibility. Rapid transmission of data packets from a source to a destination is realized, and reliable and timely communication service tasks are provided.

The invention discloses a fast neighbor discovery method for a double-area-array radar ad hoc network. The method comprises the following steps: firstly, obtaining a coarse position of a neighbor nodeby using an inherent scanning function of the radar; then, allocating a neighbor discovery scanning area according to the bidirectional transmission characteristics of a double-area-array phased array radar; and finally, fully utilizing the advantages of the double-area-array phased array radar to reasonably schedule two area-arrays to cooperatively work, performing deep scanning in a scanning interval, and achieving neighbor discovery in the whole network in a secondary handshake manner. By adoption of the method disclosed by the invention, neighbor discovery can be achieved efficiently andquickly in the background of the double-area-array radar ad hoc network.

The invention discloses a directional ad hoc network neighbor discovery method based on cooperation, and belongs to the technical field of wireless communication. According to the invention, the method comprises the steps: when a node observes a conflict, determining that a plurality of neighbors exist in a beam range selected by a current time slot, and giving a rewards to the node; utilizing the information of discovered neighbors in the neighbor discovery process to calculate the number of beams where potential neighbors are located, so cooperation among the nodes is realized; enabling each time slot node to randomly select a receiving and transmitting mode, selecting one beam for communication according to beam probability distribution, and updating the probability distribution of the beams according to conflict occurrence conditions and stored potential neighbor information, thereby improving the probability that the beams with conflicts or potential neighbors are selected in the next time slot. The problem that the neighbor discovery efficiency is low due to the fact that information obtained in the neighbor discovery process is not fully utilized although the influence brought by conflicts is considered in an existing method is solved. The method can be applied to military and other fields.

The invention discloses a cooperative neighbor discovery and access control protocol based on a power broadband carrier. The protocol comprises the following steps that waking time of the station in the high-speed carrier communication network is set as the multiple of the prime number, the prime number is automatically selected by a global calculator of the neighbor discovery protocol, and an expected station work period or discovery delay is matched when each multiple of the prime number is selected; the station selects a work period or discovery delay, and obtains the minimum discovery delay of the work period; the station acquires communication neighbor information, and executes an access control protocol after completing verification of all communication neighbors; a real neighbor isidentified based on the positioned routing distributed protocol, and a relay station is selected to forward data through multi-point relay routing; the neighbor discovery protocol is realized in the broadband power line carrier communication network, and data packet forwarding efficiency can be improved; the protocol has good discovery performance, minimum discovery delay and maximum work period;the security is relatively high, and the site discovery delay can be effectively controlled.

The invention discloses a directional antenna ad hoc network neighbor discovery method based on an SARSA (lambda) algorithm, and the method comprises the following steps: 1, enabling each node to initialize an own Q matrix at the beginning of a neighbor discovery process, and randomly selecting an initial state and an initial action; 2, enabling the node to enter a transmission mode and a receiving mode to carry out corresponding steps, and adopting different steps; 3, employing a greedy strategy to select the action of the next time slot; 4, calculating a one-step prediction error; 5, for all states and actions, updating a Q matrix according to a one-step prediction error; 6, entering the next time slot, returning to the step 2, and stopping until the neighbor discovery process is finished. Compared with a complete random algorithm, the ad hoc network neighbor discovery method disclosed by the invention can accumulate experience in scanning and adaptively find sectors with undiscovered neighbors, so the neighbor discovery speed is accelerated.

The invention discloses an intelligent neighbor discovery method and device for a directional antenna self-organizing network, and the method comprises the steps: constructing a reinforcement learning model through employing a receiving and transmitting mode and a scanning mode of a directional antenna; according to a Q value table in the reinforcement learning model, adopting an belonging-greedy algorithm to select a transmitting-receiving mode and a scanning direction of a node in the directional antenna self-organizing network; sending or intercepting a handshake packet according to the transceiving mode of the node, and carrying out three-step handshake interaction based on the handshake packet; detecting the conflict of handshake packets in the interaction process through the nodes, and determining a reward value in the reinforcement learning model according to conflict information and a receiving and transmitting mode; and updating a Q value table in the reinforcement learning model according to the reward value and a preset learning algorithm. According to the embodiment of the invention, the scanning strategy of the antenna is continuously adjusted through a learning mode, the conflict in the scanning process can be adaptively avoided, the link discovery can be accelerated when no conflict occurs in the handshake process, and the method is a fast and efficient neighbor discovery method in a directional antenna self-organizing network. Good application prospects are realized.

The present invention provides a method for discovering neighbors based on asynchronous time slices in a single-hop network with a known node number. Each node in the network comprises a message sending module, a message receiving module and a main neighbor discovering module, wherein the message sending module is used for combination of different messages; the messages are classified into DISCOVERY messages and SUCCESS messages; the message receiving module is used for receiving messages; the main neighbor discovering module is divided into a time slice management module, a neighbor information module and a node information module. When inter-network time slices are asynchronous, in case of knowing a network node n, a sending probability lambda in the message sending module of the current node is configured to be 1 / (2kappa(n-b)), wherein kappa is configured to be the sum of a fixed time period tau and a feedback time period sigma, while the time slice management module configures an interception time period to be Exp(1 / lambda). After processing according to the solution in the present invention, the operation complexity of the aforementioned method for discovering neighbors is Theta(n).

The invention provides an efficient and fast convergence neighbor discovery scheme, which is mainly applied to constructing neighbor discovery nodes in an autonomous control plane and adopts two mechanisms of 'constructing an adjacency list using simplified neighbor discovery messages' and 'efficiently and fast accessing a node into a security autonomous domain'. The first mechanism mainly solvesthe problems that neighbor messages are redundant and too long in the neighbor discovery process. The second mechanism mainly solves the problem that when a new node is added into a security autonomous domain, neighbor table convergence is too slow. By using the two new mechanisms, the neighbor discovery method provided by the invention can reduce the control overhead and effectively improve the convergence speed of the adjacency list, thereby reducing the control overhead and improving the neighbor discovery efficiency in the neighbor discovery process.