Power management for a network
First Claim
1. A method for power management of a network including a plurality of computing devices, comprising:
- identifying an order of flows between one or more computing devices within a prescribed time period; and
reducing a number of wakeups for at least one computing device by increasing a number of adjacent flows that share a computing device.
2 Assignments
0 Petitions
Accused Products
Abstract
A power management technique for a network including a plurality of computing devices. The power management technique includes identifying an order in which one or more devices of the plurality of computing devices can transmit data within the prescribed time period. In one aspect, the number of wakeups are reduced for the computing devices within the network by increasing a number of adjacent channel time allocation periods within a prescribed time period that share a common computing device. In one aspect, the network can be based on Time Division Multiple Access (TDMA), .
51 Citations
23 Claims
-
1. A method for power management of a network including a plurality of computing devices, comprising:
-
identifying an order of flows between one or more computing devices within a prescribed time period; and
reducing a number of wakeups for at least one computing device by increasing a number of adjacent flows that share a computing device. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method of power management for a time division multiple access (TDMA) network, comprising:
-
deriving a vertex/edge graph representing the TDMA network in which a vertex of the vertex/edge graph represents a computing device and an edge of the vertex/edge graph represents a request for data communications between a pair of computing devices;
selecting a first edge has a pair of associated first vertices, the pair of associated first vertices have the same or lower order of any pair of associated vertices of any edge within the vertex/edge graph;
removing the selected first edge from the vertex/edge graph;
selecting a second edge that is a neighbor to the first edge which has two associated second vertices, the associated second vertices have the same or lower degree of any pair of associated vertices of any neighbor edge to the first edge within the vertex/edge graph; and
removing the selected second edge from the vertex edge graph, wherein the sequence that the first edge and any subsequent edge are removed correlates to the order that corresponding computing devices will transmit corresponding data signals over the TDMA network. - View Dependent Claims (12, 13, 14, 15)
-
-
16. A computer readable media having computer readable instructions that when executed by a processor causes the processor to provide power management to a plurality of computing devices, by:
-
obtaining a sequence of one or more computing devices that can transmit data within the prescribed time period; and
wherein the power management is provided by reducing a number of wakeups for the computing devices within the network which is performed by increasing a number of associated channel time allocation periods within a prescribed time period that share a common computing device. - View Dependent Claims (17)
-
-
18. An apparatus, comprising:
a power management portion for a time division multiple access (TDMA) network, the TDMA network including a plurality of computing devices, wherein the power management portion reduces a number of wakeups for computing devices within the TDMA network by using;
means for deriving a vertex/edge graph representing the TDMA network in which a vertex represents a computing device and one edge that represents each request for data communications between a pair of computing devices;
means for selecting a first edge that at least shares the lowest degree of any edge in the vertex/edge graph;
means for removing the selected first edge;
means for selecting a neighbor edge that is a neighbor to the first edge, wherein they neighbor edge has or shares the lowest degree of any edge that is a neighbor to the first edge;
removing the neighbor edge; and
wherein the order that the first edge and the neighbor edge are removed corresponds to the order that corresponding computing devices will be permitted to use the TDMA network. - View Dependent Claims (19, 20, 21, 22)
-
23. An apparatus, comprising:
a power management portion for a time division multiple access network having a plurality of computing devices, wherein the power management portion reduces a number of wakeups for computing devices within the network by using;
a vertex/edge graph in which a vertex of the vertex/edge graph represents a computing device and an edge of the vertex/edge graph represents a request for data communications between a pair of computing devices;
a first edge having two associated first vertices, the two associated first vertices having a total degree that is equal to or less than the sum of the degrees of the any associated pair of vertices within the vertex/edge graph; and
wherein the power management portion considers the order that the first edge and any subsequent edges are removed as being related to the order that corresponding computing devices are allowed to use the network.
Specification