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.

A method for performing neighbor discovery in a multi-tier wireless local area network where a client creates a neighbor list identifying a neighbor wherein the neighbor is identified as an access point or a client. Then, the client determines a time to perform a scan of neighbors based upon 1) a type of neighbor discovery to be performed and 2) when a first beacon is transmitted by an access point in a first tier of the multi-tier wireless local area network. Subsequently, the client performs a scan of neighbors at the determined time on a channel associated with the type of neighbor discovery. Finally, the client receives a beacon sent from a neighbor of the client to update the neighbor list with information transmitted in the beacon.

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 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 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 relates to the field of communication and discloses a system for protecting proxy neighbor discovery. The system comprises client equipment, at least one piece of proxy equipment and neighbor node equipment. The client equipment in the system provides a proxy for the proxy equipment. The proxy equipment carries the proxy in a neighbor discovery message by verifying the proxy when the proxy is confirmed to be valid. The neighbor node equipment receives the message carrying the proxy, and then verifies the availability of a proxy source. The system solves the safety problem of theproxy neighbor discovery. The invention also discloses a method and a device for protecting the proxy neighbor discovery.