Abstract: In a Mobile Ad Hoc Network (MANET), multi-metric information is gathered and applied to a cost-based route calculation. In particular, each node gathers resource metrics from neighboring of nodes, along with data rate and reliability information for data links to and from the node. This information is applied to a costing algorithm such as Dykstra' Open Shortest Path First algorithm to obtain routes through the network. This approach may be adapted with suitable modifications to use with unicast traffic or with a multicast forwarding group.

Abstract: In a Mobile Ad Hoc Network (MANET), each node calculates a bandwidth output value representative of data output requirements for the node relative to the transmit time slots available to the node. This value is shared with other nodes in the MANET and may be employed to more efficiently allocate channel usage among nodes as traffic demands and network topology change.

Abstract: In a Mobile Ad Hoc Network (MANET), each node calculates a bandwidth output value representative of data output requirements for the node relative to the transmit time slots available to the node. This value is shared with other nodes in the MANET and may be employed to more efficiently allocate channel usage among nodes as traffic demands and network topology change.

Abstract: In a Mobile Ad Hoc Network (MANET), multi-metric information is gathered and applied to a cost-based route calculation. In particular, each node gathers resource metrics from neighboring of nodes, along with data rate and reliability information for data links to and from the node. This information is applied to a costing algorithm such as Dykstra' Open Shortest Path First algorithm to obtain routes through the network. This approach may be adapted with suitable modifications to use with unicast traffic or with a multicast forwarding group.

Abstract: In one aspect, a method to schedule network communications in a network having nodes connected by links includes sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, receiving bandwidth values from the neighbors of the first node; and determining node weight values of the first node and the neighbors of the first node based on the bandwidth values received from the neighbors of the first node and the bandwidth value of the first node. The method also includes sending the node weight values of the first node to the neighbors of the first node, receiving the node weight values from the neighbors of the first node, determining access values for each node based on a fair access technique and determining network scheduling based on the access values and the node weight values.

Abstract: In a Mobile Ad Hoc Network (MANET), nested weighted round robin queues are employed to selectively provide channel access for traffic according to a priority or Quality of Service (QoS) for data. By nesting queues within other queues, and applying a weighted round robin technique to serve each queue, relatively arbitrary service metrics may be achieved including nodal QoS for class-based traffic, avoidance of queue starvation, and so forth. Prioritized queues may also be provided for preemptive delivery of high priority traffic.

Abstract: In a Mobile Ad Hoc Network (MANET), multi-metric information is gathered and applied to a cost-based route calculation. In particular, each node gathers resource metrics from neighboring of nodes, along with data rate and reliability information for data links to and from the node. This information is applied to a costing algorithm such as Dykstra' Open Shortest Path First algorithm to obtain routes through the network. This approach may be adapted with suitable modifications to use with unicast traffic or with a multicast forwarding group.

Abstract: In a Mobile Ad Hoc Network (MANET), each node calculates a bandwidth output value representative of data output requirements for the node relative to the transmit time slots available to the node. This value is shared with other nodes in the MANET and may be employed to more efficiently allocate channel usage among nodes as traffic demands and network topology change.

Abstract: In one aspect, a method to schedule network communications in a network having nodes connected by links includes sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, receiving bandwidth values from the neighbors of the first node; and determining node weight values of the first node and the neighbors of the first node based on the bandwidth values received from the neighbors of the first node and the bandwidth value of the first node. The method also includes sending the node weight values of the first node to the neighbors of the first node, receiving the node weight values from the neighbors of the first node, determining access values for each node based on a fair access technique and determining network scheduling based on the access values and the node weight values.