초록 ▼

In one aspect, a method includes scheduling network communications in a network comprising nodes connected by links, receiving at a first node updated bandwidth values from the other nodes, determining a cluster coefficient based on a number of one-hop neighbors of the first node and a number of nei

In one aspect, a method includes scheduling network communications in a network comprising nodes connected by links, receiving at a first node updated bandwidth values from the other nodes, determining a cluster coefficient based on a number of one-hop neighbors of the first node and a number of neighbors N-hops and less of the first node, adjusting the cluster coefficient to form an adjusted cluster coefficient and determining a wait period based on the adjusted cluster coefficient. The method also includes implementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired.

대표청구항 ▼

1. A method, comprising: scheduling network communications in a network comprising nodes connected by links;receiving at a first node updated bandwidth values from the other nodes;determining a cluster coefficient based on a number of one-hop neighbors of the first node, wherein N is greater than ze

1. A method, comprising: scheduling network communications in a network comprising nodes connected by links;receiving at a first node updated bandwidth values from the other nodes;determining a cluster coefficient based on a number of one-hop neighbors of the first node, wherein N is greater than zero and a number of neighbors N-hops and less of the first node;adjusting the cluster coefficient to form an adjusted cluster coefficient;determining a wait period based on the adjusted cluster coefficient; andimplementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired. 2. The method of claim 1 wherein determining a wait period based on the adjusted cluster coefficient comprises determining a counter value based on the adjusted cluster coefficient. 3. The method of claim 2 wherein implementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired comprises implementing the updated bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value. 4. The method of claim 3 implementing the bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value comprises implementing the updated bandwidth values after a counter decrements from the counter value to zero. 5. The method of claim 2 wherein determining a counter value based on the adjusted cluster coefficient comprises determining a counter value based on the adjusted cluster coefficient and an original counter value. 6. The method of claim 2, further comprising sending the counter value to at least one other node in the network. 7. The method of claim 2 wherein determining a counter value comprises determining a counter value corresponding to a countdown value. 8. The method of claim 2 wherein determining a counter value comprises determining a counter value corresponding to a count-up value. 9. The method of claim 1 wherein scheduling network communications in a network having nodes connected by links comprises scheduling network communications in a network having nodes connected by at least one wireless link. 10. The method of claim 1 wherein determining a cluster coefficient comprises determining a cluster coefficient is equal to: nCr(n1,r)/nCr(n2,r)where n1 is equal to the number of one-hop neighbors, n2 is equal to the number of neighbors that are N-hops and less and r is equal to 2. 11. The method of claim 10 wherein N is equal to 2. 12. The method of claim 1 wherein adjusting the cluster coefficient to form an adjusted cluster coefficient comprises using a steepness factor to determine the adjusted cluster coefficient. 13. The method of claim 12 wherein adjusting the cluster coefficient to form an adjusted cluster coefficient comprises using A⁢⁢C⁢⁢C=1sf*C⁢⁢C+1-C⁢⁢Csf+1 where ACC is the adjusted cluster coefficient, sf is the steepness factor and CC is the cluster coefficient. 14. The method of claim 1 wherein receiving updated bandwidth values from the other nodes comprises receiving the bandwidth values from the neighbors of the first node. 15. The method of claim 1 wherein implementing the updated bandwidth values received to determine updated node weight values of the other nodes comprises determining updated node weight values of the first node and the neighbors of the first node based on the updated bandwidth values received from the neighbors of the first node and the updated bandwidth value of the first node. 16. The method of claim 15 wherein implementing the updated bandwidth values received to determine updated node weight values of the other nodes further comprises: determining access values for each node based on a fair access technique; anddetermining network scheduling based on the access values and the updated node weight values. 17. The method of claim 16 wherein determining access values for each node based on a fair access technique comprises determining random values for each two-hop neighbor of the first node using a Node Activation Multiple Access (NAMA) technique to generate random numbers for each node based on a node ID. 18. The method of claim 1, further comprising sending an updated bandwidth value of a first node for each link connected to the first node to neighbors of the first node. 19. The method of claim 18 wherein sending an updated bandwidth value of a first node for each link connected to the first node to neighbors of the first node comprises sending a updated bandwidth value corresponding to a number of outbound packets in a queue of the first node for a link. 20. The method of claim 19 wherein sending an updated bandwidth value of a first node for each link connected to the first node to neighbors of the first node comprises sending a bandwidth value of a first node during a control timeslot. 21. A network node to schedule communications in a network having nodes connected by links comprising at least one wireless link, the network node comprising: circuitry to: receive at the network node updated bandwidth values of other nodes in the network;determine a cluster coefficient based on a number of one-hop neighbors and a number of two-hop neighbors of the node;adjust the cluster coefficient to form an adjusted cluster coefficient;determine a counter value based on the adjusted cluster coefficient; andimplement the updated bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value. 22. The network node of claim 21 wherein the circuitry comprises at least one of a processor, a memory, programmable logic and logic gates. 23. The network node of claim 21 wherein the circuitry to determine a counter value based on the adjusted cluster coefficient comprises circuitry to determine a counter value based on the adjusted cluster coefficient and an original counter value. 24. The network node of claim 21 the circuitry to implementing the bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value comprises circuitry to implement the updated bandwidth values after a counter decrements from the counter value to zero. 25. The network node of claim 21 wherein the cluster coefficient is equal to: nCr(n1,r)/nCr(n2,r)where n1 is equal to the number of one-hop neighbors, n2 is equal to the number of one-hop and two-hop neighbors and r is equal to 2. 26. The network node of claim 21 wherein the circuitry to adjust the cluster coefficient to form an adjusted cluster coefficient comprises circuitry to use a steepness factor to determine the adjusted cluster coefficient using a formula: A⁢⁢C⁢⁢C=1sf*C⁢⁢C+1-C⁢⁢Csf+1 where ACC is the adjusted cluster coefficient, sf is the steepness factor and CC is the cluster coefficient. 27. The network node of claim 21 wherein the circuitry to implement the updated bandwidth values received to determine updated node weight values of the other nodes further comprises circuitry to: determine access values for each node based on a fair access technique; anddetermine network scheduling based on the access values and the updated node weight values. 28. The network node of claim 27 wherein the circuitry to determine access values for each node based on a fair access technique comprises circuitry to determine random values for each two-hop neighbor of the first node using a Node Activation Multiple Access (NAMA) technique to generate random numbers for each node based on a node ID. 29. An article, comprising: a non-transitory computer readable medium that stores executable instructions to schedule communications in a network having nodes connected by links comprising at least one wireless link, the instructions causing a processor to: receive updated bandwidth values of other nodes;determine a cluster coefficient based on a number of one-hop neighbors and a number of two-hop neighbors;adjust the cluster coefficient to form an adjusted cluster coefficient;determine a counter value based on the adjusted cluster coefficient; andimplement the updated bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value. 30. The article of claim 29 wherein instructions causing a processor to determine a counter value based on the adjusted cluster coefficient comprises instructions causing a machine to determine a counter value based on the adjusted cluster coefficient and an original counter value. 31. The article of claim 29 wherein instructions causing a processor to implement the bandwidth values received to determine updated node weight values of the other nodes after a counter achieves one of a predetermined value from a starting point corresponding to the counter value or the counter value from a starting point corresponding to the predetermined value comprises instructions causing a machine to implement the updated bandwidth values after a counter decrements from the counter value to zero. 32. The article of claim 29 wherein the cluster coefficient is equal to: nCr(n1,r)/nCr(n2,r)where n1 is equal to the number of one-hop neighbors, n2 is equal to the number of one-hop and two-hop neighbors and r is equal to 2. 33. The article of claim 29 wherein the instructions causing a processor to adjust the cluster coefficient to form an adjusted cluster coefficient comprises instructions causing a machine to use a steepness factor to determine the adjusted cluster coefficient using a formula: A⁢⁢C⁢⁢C=1sf*C⁢⁢C+1-C⁢⁢Csf+1 where ACC is the adjusted cluster coefficient, sf is the steepness factor and CC is the cluster coefficient.