Proactive reform of directed acyclic graph by accelerating parent advertisements

    公开(公告)号:US10715422B2

    公开(公告)日:2020-07-14

    申请号:US16026203

    申请日:2018-07-03

    Abstract: In one embodiment, a parent network device, operating according to a first Trickle operation using a first selected minimum contention interval, responds to detecting a loss of attached child network devices by starting a second Trickle operation using a second selected minimum contention interval. The second Trickle operation includes maintaining the second selected minimum contention interval for subsequent iterations of the second Trickle operation. The parent network device initiates an accelerated transmission rate of the advertisement message that is faster than the first and second Trickle operations (using a third selected minimum contention interval less than the first minimum contention interval) in response to receiving a message from one of the lost child network devices, and resumes the first Trickle operation upon recovery of all the lost child network devices.

    Fast reformation in a directed acyclic graph based on deferred contention to higher devices

    公开(公告)号:US10419293B1

    公开(公告)日:2019-09-17

    申请号:US16004245

    申请日:2018-06-08

    Abstract: A network device stores in its nonvolatile memory, in response to detecting a power outage in a tree-based network, an identifier for a preferred parent and a distance identifier for the network device within the network. In response to power restoration, the network device starts a trickle timer based on the ring identifier, for determining whether a beacon request from a transmitting node and destined for the preferred parent is detected during the waiting interval. In response to the network device detecting the beacon request during the waiting interval, the network device sets its channel hopping schedule to the corresponding channel hopping schedule of the transmitting node in response to determining the beacon request is destined for the preferred parent, enabling rejoining with the preferred parent in response to detecting a beacon from the preferred parent to the transmitting node via the corresponding channel hopping schedule of the transmitting node.

    Concentric transmissions in a directed acyclic graph based on deferred contention to higher devices

    公开(公告)号:US10412010B1

    公开(公告)日:2019-09-10

    申请号:US15954786

    申请日:2018-04-17

    Abstract: In one embodiment, a network device starts a deferred discovery that defers to a prescribed transmission operation in response to detecting a message is from an identified higher device that is closer to a root of a network topology in a data network. The prescribed transmission operation and the deferred discovery each require a corresponding network device to wait at least a first half of a selected minimum contention interval before attempting transmission at a randomized position within a second half of the selected minimum contention interval. The minimum contention interval of the deferred discovery is at least twice the selected minimum contention interval. The network device transmits an updated message during the deferred discovery only if, upon reaching the corresponding randomized position of the deferred discovery, the subsequent messages from identified higher devices are less than a prescribed redundancy constant.

Patent Agency Ranking