Abstract:
In one embodiment, in response to a trigger condition being detected at a particular location in a primary directed acyclic graph (DAG) in a computer network, a particular node in the primary DAG at the particular location may be determined to act as a remote stitched (RS)-DAG root for an RS-DAG at the particular location. The determined RS-DAG root may then be instructed to initiate the RS-DAG, the instructing indicating one or more properties for the RS-DAG that are based on the trigger condition and that are different from properties of the primary DAG. In another embodiment, a particular node receives instructions to initiate an RS-DAG as its RS-DAG root, initiates the RS-DAG, and relays messages of the RS-DAG with a primary root of the primary DAG.
Abstract:
In one embodiment, a management device determines a topology of nodes in a network. Based on the topology, frequency hopping sequences are assigned (and notified) to the nodes such that each particular node of a certain set of the nodes is assigned a frequency hopping sequence on which to transmit that is different than frequency hopping sequences of neighbors and hidden neighbors of that particular node. In another embodiment, a transmitting node first transmits a transmission indication signal on its particular frequency band based on its frequency hopping sequence, and then transmits a message on the particular frequency band. In a further embodiment, a receiving node listening to a plurality of frequency bands may detect the transmission indication signal on the particular frequency band. In response, the receiving node filters out all frequency bands other than the particular frequency band, and receives the following transmission on that particular frequency band.
Abstract:
In one embodiment, a wireless transmitting node in a frequency hopping wireless network may determine whether a packet can be transmitted within a particular timeslot of a frequency hopping sequence based on a length of the packet. If unable to transmit the packet within the particular timeslot, the transmitting node extends the particular timeslot into a subsequent timeslot to allow transmission of the packet within the extended timeslot at a frequency associated with the particular timeslot. Once the extended timeslot ends, the transmitting node and receiving node hop frequencies into the subsequent timeslot to synchronize with the rest of the network that already hopped at the conventional rate. In another embodiment, a wireless receiving node may also extend the particular timeslot into a subsequent timeslot to allow reception of a packet that would extend beyond the particular timeslot, and may hop frequencies upon expiration of the extended timeslot.
Abstract:
In one implementation, a method of distributing a multicast message in a wireless mesh network includes receiving a multicast message from a parent node of an intermediate node. The method includes transmitting the multicast message to child nodes of the intermediate node. The method includes storing the multicast message in a cache at the intermediate node. The method includes intercepting an acknowledgement message from each acknowledging child node within an acknowledging subset of less than all of the child nodes. The method includes accessing information indicating a population of the child nodes to which the multicast message transmission was directed. The method includes comparing the acknowledging subset of the child nodes with the population of the child nodes. The method includes identifying a non-acknowledging subset of less than all of the child nodes. The method includes retransmitting the multicast message to the non-acknowledging subset of the child nodes.
Abstract:
In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may also notify the parent node of a load associated with the request and whether the node has any other parent node options. The requesting node may then receive a response from the parent node that is either an acceptance or a denial. While the node may join the parent node in response to an acceptance, if a denial is received, the node may divide the load into first and second portions, and may re-request to join the parent node with the load of the first portion. In this manner, by partitioning the load, a load balancing mode of operation across multiple is parents in a DAG is provided.
Abstract:
According to one or more implementations of the disclosure, packets may be transmitted in a low power and lossy network (LLN) by receiving, on a first node, a message from a sending node, and by activating a critical message configuration to be applied in routing the message. A message identifier (e.g., signature) for the message may also be received or gleaned. The message identifier can be compared at the first node to a list of stored message identifiers, created based on routing history, to determine if the message has already been received. As such, if the message has not been received at the first node previously, a first parent and a second parent for the message are identified and the message, along with the critical message indication, can be transmitted to the first parent and the second parent, thereby achieving redundancy in the routing of the message.
Abstract:
In an example embodiment, an apparatus selects radio channels based on persistent interference device information. The apparatus comprises a wireless transceiver operable to communicate over a plurality of channels and channel selection logic in communication with the wireless transceiver and operable to select a channel for the wireless transceiver. The channel selection logic is operable to acquire data representative of intensity, duration and rate of occurrence for at least one persistent interference device detected by the wireless transceiver operating on at least one of the plurality of channels. The channel selection logic is operable to select a channel for the wireless transceiver based on the data representative of intensity, duration and rate of occurrence for the at least one persistent interference device.
Abstract:
In one embodiment, a device in a computer network monitors an alternating-current (AC) waveform of an electrical power source at the device, where the power source is part of a polyphase power source system. Once the device determines a particular phase of the polyphase power source system at the device, then the device joins a directed acyclic graph (DAG) specific to the particular phase. In another embodiment, a device detects a time of a zero crossing of the AC waveform, and may then determine a particular phase of the polyphase power source system at the device based on the time of the zero crossing relative to a corresponding location within a frequency hopping superframe of the computer network.
Abstract:
In one embodiment, a particular node in a computer network receives an indication of a number of child nodes of one or more potential parent nodes to the particular node in a primary directed acyclic graph (DAG). From this, the particular node selects a particular potential parent node with the highest number of child nodes as a secondary DAG parent for the particular node, and joins the secondary DAG at the selected secondary DAG parent (e.g., for multicast and/or broadcast message distribution). This may recursively continue, such that nodes gravitate toward parents with more children, potentially allowing parents with fewer children to relinquish their parental responsibilities.
Abstract:
In one embodiment, in response to a trigger condition being detected at a particular location in a primary directed acyclic graph (DAG) in a computer network, a particular node in the primary DAG at the particular location may be determined to act as a remote stitched (RS)-DAG root for an RS-DAG at the particular location. The determined RS-DAG root may then be instructed to initiate the RS-DAG, the instructing indicating one or more properties for the RS-DAG that are based on the trigger condition and that are different from properties of the primary DAG. In another embodiment, a particular node receives instructions to initiate an RS-DAG as its RS-DAG root, initiates the RS-DAG, and relays messages of the RS-DAG with a primary root of the primary DAG.