Radio Relay Device Waiting Time Optimization

The patent applies preliminary action by having the participation node select an optimum parent node based on the first received response message and index values before waiting for all neighbor nodes to respond. This allows the node to initiate network joining earlier without sacrificing selection quality, as the selection is made on probabilistic basis using received signals strength indicator (RSSI) and other index values from partial responses.

The patent implements partial action by not requiring complete response messages from all neighbor nodes for parent node selection. Instead, the participation node makes a selection based on partial information from received responses, using index values such as RSSI, number of child nodes, and hop count to determine the optimum parent node without waiting for the complete set of responses.

The patent applies preliminary action by enabling the participation node to perform parent node selection before the maximum waiting time expires. The node uses index values from received response messages to identify the optimum parent node and initiates joining procedures early, avoiding the need to extend the waiting period and thereby reducing the window for potential message collisions.

The patent implements self-service by having the participation node independently determine the optimum parent node using index values from received responses without requiring confirmation or coordination with other neighbor nodes. The node autonomously makes the selection and proceeds with joining, eliminating the need for extended waiting or collision avoidance protocols.

The patent applies preliminary action by enabling the participation node to complete parent node selection and initiate network joining before collecting response messages from all neighbor nodes. The selection is made preliminarily based on index values from received messages, and the node proceeds with joining while potentially continuing to receive additional responses that would not significantly alter the selection.

The patent implements partial action by requiring only sufficient response messages to make an accurate parent node selection rather than collecting all possible responses. The node uses index values from a subset of received responses to identify the optimum parent node, achieving adequate selection accuracy without the time cost of waiting for all neighbor nodes to respond.