Digi International Inc.

Robert P Byard

John Patrick Filoso

Jay Douglas George

Jared Hofhiens

J Douglas George

Joel Lovinger

John P Filoso

Systems and methods for ordering candidates for wireless network association are provided. In certain embodiments, a wireless device, includes a processor that controls data received and data to be transmitted by the wireless device; and a memory, wherein the memory stores a short list that stores network device responses, wherein a network device response is associated with a network device in an environment of the wireless device. In certain implementations, instructions direct the processor to perform a short list search, wherein the wireless device attempts to connect to networks associated with network devices identified in the short list; and when the wireless device fails to connect with the networks associated with the network devices identified in the short list, perform an exhaustive search, wherein the wireless device attempts to connect to additional networks associated with additional network devices based on an ordered arrangement of network identifiers.

Systems and methods for ordering candidates for wireless network association

A system and method of operating a wireless network having a plurality of nodes. Each node determines whether to replace the beacon node. When a node determines that the beacon node is to be replaced, the node determines whether it should nominate itself as a potential replacement beacon node. The decision whether to nominate itself as a potential replacement beacon node is a function of a random number generated by the node. If the node determines that it should nominate itself as a potential replacement beacon node, the node sends out one or more beacon signals. Beacon signals are received by potential replacement nodes and, if the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node, the node removes itself as a candidate for the replacement beacon node.

Method for synchronizing sleeping nodes in a wireless network

A system and method of operating a wireless network having a plurality of nodes. Each node determines whether to replace the beacon node. When a node determines that the beacon node is to be replaced, the node determines whether it should nominate itself as a potential replacement beacon node. The decision whether to nominate itself as a potential replacement beacon node is a function of a nomination probability associated with the node. If the node determines that it should nominate itself as a potential replacement beacon node, the node sends out one or more beacon signals. Each node then adaptively modifies the probability of nominating itself as a function of the number of beacon signals received from other nodes. Beacon signals are received by potential replacement nodes and, if the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node, the node removes itself as a candidate for the replacement beacon node.

System and method for adaptively setting the probability of generating a beacon broadcast in a wireless network

A system and method for joining nodes from a first and a second subnet into a network. A probability is established that a node within the first subnet will enter scout mode during its sleep interval, wherein the probability is less than 100%. If the node enters scout mode, a message is broadcasted from the node in scout mode to other nodes inviting nodes in other subnets to join with the first subnet, wherein the message includes the node's network identifier. If the message broadcasted by the node in scout mode is detected by a node in a second subnet, the node in the second subnet determines whether nodes in the second subnet have the same network identifier as the network identifier in the message broadcast by the node in scout mode. If the nodes in the second subnet have the same network identifier as the network identifier in the message broadcast by the node in scout mode, the nodes in the first and second subnets are combined into a combined network.

Growing community of inventors

Sandy, UT, United States of America

Robert P Byard