Vertical collision avoidance in LLNs
AssigneeCisco Technology, Inc.
InventorsPascal Thubert, Huimin She, Feiliang Wang
Life of this patent
Estimating the term…
Abstract
In one embodiment, a device receives data indicative of a routing topology of a network. The network includes a root node and each node in the network has an associated network depth relative to the root node in the routing topology. The device assigns the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths. The device assigns transmit and receive actions to the timeslots of the communication schedule for a particular time such that parent-to-child and child-to-parent communications alternate with network depth in the timeslots. The device sends the communication schedule with the node and action assignments to one or more of the nodes in the network.
Claims20
A method, comprising:
- receiving, at a device, data indicative of a routing topology of a network, wherein the network comprises a root node and each node in the network has an associated network depth relative to the root node in the routing topology;
- assigning, by the device, the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths;
- assigning, by the device and for a particular time in the channel-hopping communication schedule, transmit and receive actions to a set of timeslots of the communication schedule for the particular time such that parent-to-child communications and child-to-parent communications alternate with network depth in the timeslots, wherein the parent-to-child communications are downward and the child-to-parent communications are upward;
- and
- sending, by the device, the communication schedule with the node and action assignments to one or more of the nodes in the network.
An apparatus, comprising:
- one or more network interfaces to communicate with a network;
- a processor coupled to the network interfaces and configured to execute one or more processes;
- and
- a memory configured to store a process executable by the processor, the process when executed configured to:
- receive data indicative of a routing topology of a network, wherein the network comprises a root node and each node in the network has an associated network depth relative to the root node in the routing topology;
- assign the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths;
- assign, for a particular time in the channel-hopping communication schedule, transmit and receive actions to a set of timeslots of the communication schedule for the particular time such that parent-to-child communications and child-to-parent communications alternate with network depth in the timeslots, wherein the parent-to-child communications are downward and the child-to-parent communications are upward;
- and
- send the communication schedule with the node and action assignments to one or more of the nodes in the network.
A tangible, non-transitory, computer-readable medium storing program instructions that cause a device to execute a process comprising:
- receiving, at the device, data indicative of a routing topology of a network, wherein the network comprises a root node and each node in the network has an associated network depth relative to the root node in the routing topology;
- assigning, by the device, the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths;
- assigning, by the device and for a particular time in the channel-hopping communication schedule, transmit and receive actions to a set of timeslots of the communication schedule for the particular time such that parent-to-child communications and child-to-parent communications alternate with network depth in the timeslots, wherein the parent-to-child communications are downward and the child-to-parent communications are upward;
- and
- sending, by the device, the communication schedule with the node and action assignments to one or more of the nodes in the network.
Dependencies are inferred from the claim text.