Abstract: A node forms a network by scanning for an existing network. If an existing network is not found, the node operates as a network controller node of the first network and admits at least one client node to the first network. As a network controller node, the node designates one of the client nodes as a scout node. The scout node removes itself from the first network and scans for a second network. If the scout node does not return to the first network after a predetermined time, it is assumed that the scout node has found a second network. The network controller node of the first network then designates the remaining client nodes as scout nodes, and then joins the second network as a client node. Therefore, multiple networks are avoided.

Abstract: A node forms a network by scanning for an existing network. If an existing network is not found, the node operates as a network controller node of the first network and admits at least one client node to the first network. As a network controller node, the node designates one of the client nodes as a scout node. The scout node removes itself from the first network and scans for a second network. If the scout node does not return to the first network after a predetermined time, it is assumed that the scout node has found a second network. The network controller node of the first network then designates the remaining client nodes as scout nodes, and then joins the second network as a client node. Therefore, multiple networks are avoided.

Abstract: A process for scheduling reservation requests among a plurality of nodes on a network, includes examining a level of network communication activity of a first node to determine whether the first node is active; allocating a reservation request to the first node, but only if the first node is determined to be active; and repeating the process of examining and allocating for one or more subsequent nodes on the network. In one embodiment, the process can utilize thresholds to determine whether a network device is active and the thresholds can be based on, for example, recent network activity for the node being evaluated.

Abstract: A method is disclosed for optimizing a network that is formed from a plurality of nodes. The NC node of the network compiles an order that the plurality of nodes perform a probing operation. The order is typically round robin. The NC node receives a request from a client that identifies a next node to perform the probing operation. Based on the request, the NC node changes the order so that the next node performs the probing operation after the current node that is performing the probing operation has completed the operation.

Abstract: A node forms a network by scanning for an existing network. If an existing network is not found, the node operates as a network controller node of the first network and admits at least one client node to the first network. As a network controller node, the node designates one of the client nodes as a scout node. The scout node removes itself from the first network and scans for a second network. If the scout node does not return to the first network after a predetermined time, it is assumed that the scout node has found a second network. The network controller node of the first network then designates the remaining client nodes as scout nodes, and then joins the second network as a client node. Therefore, multiple networks are avoided.

Abstract: A process for scheduling reservation requests among a plurality of nodes on a network, includes examining a level of network communication activity of a first node to determine whether the first node is active; allocating a reservation request to the first node, but only if the first node is determined to be active; and repeating the process of examining and allocating for one or more subsequent nodes on the network. In one embodiment, the process can utilize thresholds to determine whether a network device is active and the thresholds can be based on, for example, recent network activity for the node being evaluated.

Abstract: A method is disclosed for optimizing a network that is formed from a plurality of nodes. The NC node of the network compiles an order that the plurality of nodes perform a probing operation. The order is typically round robin. The NC node receives a request from a client that identifies a next node to perform the probing operation. Based on the request, the NC node changes the order so that the next node performs the probing operation after the current node that is performing the probing operation has completed the operation.

Abstract: A node forms a network by scanning for an existing network. If an existing network is not found, the node operates as a network controller node of the first network and admits at least one client node to the first network. As a network controller node, the node designates one of the client nodes as a scout node. The scout node removes itself from the first network and scans for a second network. If the scout node does not return to the first network after a predetermined time, it is assumed that the scout node has found a second network. The network controller node of the first network then designates the remaining client nodes as scout nodes, and then joins the second network as a client node. Therefore, multiple networks are avoided.