Patent application number | Description | Published |
20090238109 | METHOD FOR QUALIFIED ROUTE BUILDING IN A WIRELESS NETWORK - A method of establishing a qualified route in a mesh network includes transmitting a route-discovery request from a source node such that transmitting includes transmitting the route-discovery request from the source node to at least one intermediate node that is a neighbor node to the source node, receiving the route-discovery request from an intermediate node at the destination node, and updating a route-discovery table for the intermediate node such that the route between the source node and the destination node is the only qualified route. | 09-24-2009 |
20100271974 | SYSTEM AND METHOD FOR REJOINING SLEEPING SUBNETS IN A WIRELESS MESH 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. | 10-28-2010 |
20100271993 | 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 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. | 10-28-2010 |
20100272094 | SYSTEM AND METHOD FOR ADAPTIVELY SETTING THE PROBABILITY OF GENERATING A BEACON BROADCAST 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. | 10-28-2010 |