32 results about "Neighbor finding" patented technology

A protocol for discovering a new neighbor node and detecting the loss of an existing neighbor node in a network is described. A node receives a neighbor discovery message from a neighbor node. The node receiving the neighbor discovery message periodically transmits a predetermined number of neighbor discovery messages in response to the received neighbor discovery message. Each neighbor discovery message includes an identity of the neighbor node. After transmitting the predetermined number of neighbor discovery messages, the node transmits neighbor discovery messages that omit the identity of the neighbor node until another neighbor discovery message is received from the neighbor node that indicates a change in a communications state associated with the neighbor node.

The present document provides a neighbor topology discovery method for a multi-interface terminal, to improve the usage rate of multiple interfaces. The method includes the following steps: after joining a network, the multi-interface terminal broadcasts a neighbor discovery request message to respective networks via each interface, and the neighbor discovery request message carries a neighbor hop value; and the multi-interface terminal in the network monitors broadcast messages of other terminals in the network where each interface is located; when detecting the neighbor discovery request message, if the neighbor hop value carried in the detected neighbor discovery request message indicates that the present terminal is the last hop, related information in the neighbor discovery request message is extracted, and neighbor information and network topology information of the present terminal is updated; and if not, the neighbor hop value is modified and then the neighbor discovery request message is forwarded via all interfaces.

The invention provides a neighbor finding method for a directional Ad Hoc network. An antenna active detection/passive monitoring mode of a node is determined based on the binary coding bit of the ID of the node, a channel resource is divided into a plurality of sub-channels through the CDMA or the OFDM technology, the number of the sub-channel which is occupied by the node is determined through an equal-probability random selection method, the purpose that multiple nodes send information alternately on different channels is achieved, the data collision conflict caused by the fact that the multiple nodes send information to the same node at the same time in the neighbor finding process is effectively reduced, the success probability of finding a neighbor node can be remarkably improved, and network networking time is shortened. By the adoption of the neighbor finding method for the directional Ad Hoc network, the neighbor node can be rapidly found in the Ad Hoc network with directional beam transmission being adopted completely, and the neighbor finding method for the directional Ad Hoc network is suitable for all networking scenes with network density being large from small. The neighbor finding method for the directional Ad Hoc network is easy to achieve, the time spent in finding all the neighbor nodes within a one-hop range is short, and reliability is high.

The invention discloses a network device neighbor finding method and system in the communication domain, which is characterized by the following: the network device sends same neighbor finding message to the abutting device and receives the neighbor finding message which is sent by the other neighbor device; the network collects abutting device information and saves and maintains the neighbor information meter; the invention doesn't need to distinctes the role in the network in realizing the neighbor finding course, which is convenience for network topological attention.

The invention discloses a novel neighbor finding method based on a directional antenna. The neighbor finding method comprises the following steps that binary system numbering is carried out on nodes, the antenna scanning direction is numbered, one node determines a receiving and sending mode according to the binary system number of the node, determines the scanning sequence according to the receiving and sending mode and carries out scanning at the neighbor finding stage according to the scanning sequence, and if a pair of receiving and sending nodes successfully come to a handshake protocol, it is shown that the neighbor finding process is successful. The novel neighbor finding method solves the problem of neighbor finding of the non-central networking under the condition of the directional antenna, the advantages of the high interference resistance and high space reused ratio of the directional antenna can be exploited to the full the flexible characteristic of entering and existing the network of the non-central networking are fully utilized, and the method has wide application prospects.

The invention relates to a networking optimization method for wireless networks for industrial automation. The networking process comprises the following steps: adding a gateway broadcast time slot in the middle of a superframe so as to increase the number of broadcast messages sent by a gateway every unit time; a node to be accessed to an internet receiving the broadcast messages and adding candidate neighbors; selecting synchronization points to carry out time synchronization; utilizing collision detection to perform neighbor finding to find out bidirectional neighbor nodes; the node to be accessed to the internet selecting the bidirectional neighbor node, which ranks in the front, as an agent node from a neighbor table and sending a join request message to the agent node; the agent node forwarding the request message to the gateway; after receiving the join request message, the gateway allocating network resources to the node to be accessed to the internet, with the network resources being distributed to the node in a wireless message manner; and after all resource allocation messages are sent, the networking process is over. The networking optimization method greatly reduces networking time, improves the usage efficiency of join time slot resources, and enables the network resource allocation to be more reasonable.

The invention discloses a handwriting number identification method, which comprises the following steps that an intra-class abutting figure and an inter-class abutting figure are constructed on training samples according to the distance and the label types; a target dimension number and a projection conversion matrix are determined according to a matrix formed by the intra-class abutting figure, the inter-class abutting figure and the training samples; the training samples are converted in to a discrimination sub space according to the projection conversion matrix; the projection conversion matrix is utilized for mapping samples to be tested into the discrimination sub space to obtain test samples; a neighbor classifier is utilized for classifying the test samples. The method has the advantages that each sample is respectively subjected to neighbor finding in identical-class samples and neighbor finding in different-class samples, so the problem of poor classification performance caused by sample distribution unbalance is solved.

A neighbor discovery method and apparatus for performing network-transparent neighbor discovery in a heterogeneous network environment is provided. A neighbor discovery method for a multi-mode mobile node includes determining a type of a network, with which a mobile node is in communication, in response to a detection of a request for sending a neighbor solicitation message, retrieving, if the network type identifies a self-processing network, information about the network from a database, determining whether a tentative address contained in the neighbor solicitation message is already in use by another node with reference to the information about the network, and generating, when the tentative address is already in use, a neighbor advertisement message.

The invention provides a method for finding topological neighbors in sampled data of physical surface and belongs to the technical field of reverse product engineering. The method is characterized in that constructing a dynamic spatial index for physical surface sample points through an R* tree; subjecting the index to depth-first traversal to quickly acquire a k-nearest neighbor point set of target sample points, using the k-nearest neighbor point set as initial reference data for topological neighbors of the target sample points, describing distribution law of the sample points by kernel density estimation according to a relation between neighbor finding and sample point distribution, ranking the sample points in the initial reference data according to their probability densities, selecting Omega sample points of highest probability density to define a maximum point of local probability densities, determining a finding direction according to the maximum point, allowing the initial reference data to extend moderately to a sparse area so as to reduce the degree of neighbor information loss, and performing iterative computing so as to acquire complete topological neighbor data of the target sample points. The method has the advantages that topological neighbor data of uniform or non-uniform sampled data of a complex profile can be acquired fast, finding results include k neighbors, Voronoi neighbors and other effective neighbor data, and the local profile features of the sampled data of can be better indicated.

The present invention discloses a multicasting data no-break transmitting method, referring to computer network communication technology field. It contains when non-root bridge three-layer equipment protocol root port switching, non-root bridge three-layer equipment configuring new root port as multicasting transmitting port, and through new root port transmitting neighbor finding protocol message to root bridge three-layer equipment appointed port, root bridge three-layer equipment receiving neighbor finding protocol message configuring appointed port multicasting transmitting port, through said appointed port responding neighbor finding protocol message to new root port, non-root bridge three-layer equipment receiving root bridge three-layer equipment responded neighbor finding protocol message, continue transmitting link establishment and multicasting data between new root port and said appointed port through said link. The present invented method can shorten multicasting retransmission blockage time interval duo to root port switching, to make time interval dropping to 10 millisecond level, satisfying multicasting service real time requirement, and raising multicasting retransmission efficiency.

The invention discloses a method and system for finding multiplex section neighbors by regenerator section trace byte, and the method comprises: 1) source node and destination node determine to start neighbor finding course by signaling; 2) the source node writes the information about neighbor finding identification, finding course type and multiplex section resource identification into regenerator section trace byte, and send the information through transfer plane link to the destination node, and the destination node extracts the resource information from the regenerator section trace byte and finds the resources; 3) the destination node sends finding success signaling to the source node, and the source node confirms to end the finding course. And the system comprises regenerator section trace byte processor, which comprises time gap/space cross-linking device, finding proxy, protocol controller, management proxy, overhead processor, overhead reading circuit and overhead writing circuit. And it can find multiplex sections by regenerator section trace byte (J0) and raise finding efficiency.

The invention provides a neighbor discovery method of an ad hoc network. The method comprises the following steps: a node performs carrier sensing in a configured wake-up slot to determine a current channel state; and according to the detected channel state, the node determines to monitor a beacon sent by a neighboring node or to send a beacon for neighbor discovery. According to the method of theinvention, the collision of beacons sent between neighboring nodes can be reduced, the probability of neighbor discovery can be improved, and the discovery speed can be accelerated.

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.

The invention relates to neighbor discovery realization method in different link layer isolation zoom. IPv6 address, link layer address, and binding relational table of the isolation zoom label valve are set in the router. The host computer of the isolation zoom is sent out the neighbor request information to search the hardware address of the other host computer. After the link layer access device is received the neighbor request information, the isolation zoom label valve is inserted to transfer the neighbor request information to the router. The router is enquired the binding relational table. If the purpose host computer and the host computer sent out the neighbor request information are in the different isolation zoom, the neighbor request information will answer on its own initiative, and the router own hardware address will be supplied to deceive the initiating terminal initiated the neighbor request to make the different isolation zoom host computer isolated by link layer access device can be normally communicated each other.

The invention discloses a face portrait compositing method based on Bayesian inference, which mainly solves a problem that an existing method does not consider similarity constraints between adjacent image blocks in a neighbor finding or weight solving stage. The scheme of the face portrait composting method comprises the steps of 1, dividing a training portrait sample set, a training photo sample set and a test sample set; 2, dividing all images into image blocks and forming block sets; 3, dividing the training photo block set and the corresponding portrait block set into a plurality of subsets; 4, selecting nearest neighbor blocks from a training photo-portrait block set; 5, carrying out neighbor block reselection on the nearest neighbor blocks according to an Euclidean distance in the training photo-portrait block set, and solving a linear combination weight of the reselected neighbor blocks; 6, solving portrait blocks to be composited according to the neighbor blocks and the combination weight; and 7, iteratively executing the steps 5-6 for N times, and fusing to acquire a final composite portrait. The face portrait composting method has the advantages of high resolution of a composite result and more complete details, and can be applied to face retrieval and recognition.

The invention discloses a neighbor discovery method based on the greatest common divisor of period length. The specific steps of the method of the present invention are as follows: Step 1, obtain the set of basic cycle duration; Step 2, set the basic cycle duration and super cycle duration of each node; Step 3, set the working mode of each node; Step 4, the node finds its neighbor nodes. The present invention can not only work according to time slots, but also can work according to non-time slots. It is applicable to a large number of scenarios. The number of time slots included in the basic period length can be either a prime number or a composite number. Knowing the duty cycle of the neighbor nodes, the node parameters can be optimized, and the lower bound of the worst-case discovery delay can be obtained in both the symmetric duty cycle and the asymmetric duty cycle, and the average discovery delay is short.