Network Topologies for Energy Efficient Networks

A method comprising:

• by one or more computing devices,
• identifying all one-hop neighbor nodes and two-hop neighbor nodes of a node;
• determining an active set of one-hop neighbor nodes for the node, comprising:
• including in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected;
• and
• when any two-hop neighbor node is not connected with at least one one-hop neighbor node in the active set, or a bandwidth of the active set is less than a baseline bandwidth, or a number of paths of the active set is less than a minimum number of paths, then:
• determining all combinations of one-hop neighbor nodes that are not already in the active set;
• testing each combination to determine whether a specific combination is able to complete the active set;
• and
• when no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set;
• and
• communicating a message to each one-hop neighbor node in the active set

An apparatus comprising:

• a memory comprising instructions executable by one or more processors;
• and
• the one or more processors coupled to the memory and operable to execute the instructions, the one or more processors being operable when executing the instructions to:
• identify all one-hop neighbor nodes and two-hop neighbor nodes of a node;
• determine an active set of one-hop neighbor nodes for the node, comprising:
• including in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected;
• and
• when any two-hop neighbor node is not connected with at least one one-hop neighbor node in the active set, or a bandwidth of the active set is less than a baseline bandwidth, or a number of paths of the active set is less than a minimum number of paths, then:
• testing each combination to determine whether a specific combination is able to complete the active set;
• when no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set;
• and
• communicating a message to each one-hop neighbor node in the active set indicating that it is in the active set.

One or more computer-readable non-transitory storage media embodying software operable when executed by one or more computer systems to:

• identify all one-hop neighbor nodes and two-hop neighbor nodes of a node;
• determine an active set of one-hop neighbor nodes for the node, comprising:
• including in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected;
• and
• when any two-hop neighbor node is not connected with at least one one-hop neighbor node in the active set, or a bandwidth of the active set is less than a baseline bandwidth, or a number of paths of the active set is less than a minimum number of paths, then:
• determining all combinations of one-hop neighbor nodes that are not already in the active set;
• testing each combination to determine whether a specific combination is able to complete the active set;
• and
• when no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set;
• and
• communicating a message to each one-hop neighbor node in the active set indicating that it is in the active set.