Method and Device for Performing Energy Detection on a Subset of a Wireless Channel

    公开(公告)号:US20200092730A1

    公开(公告)日:2020-03-19

    申请号:US16133826

    申请日:2018-09-18

    Abstract: Various embodiments disclosed herein enable performing energy detection on a subset of a channel. In various embodiments, a method of performing energy detection is performed by a computing device. In various embodiments, the computing device includes a wireless transceiver, one or more processors, and a non-transitory memory. In various embodiments, the method includes performing energy detection on one or more overlapping portions of a first channel and a second channel. In some embodiments, the method includes determining whether a detected energy level from the energy detection satisfies a threshold. In some embodiments, the method includes transmitting a signal into the first channel based on the threshold being satisfied.

    FULL PATH DIVERSITY FOR VIRTUAL ACCESS POINT (VAP) ENABLED NETWORKS

    公开(公告)号:US20190342167A1

    公开(公告)日:2019-11-07

    申请号:US16511139

    申请日:2019-07-15

    Abstract: In one embodiment, a supervisory device in a network assigns different access points in the network to different access point groupings. Each of the different access point groupings uses a different network path to communicate with a given endpoint in the network. The supervisory device selects at least one of the access points in each of the different access point groupings for mapping to a virtual access point (VAP) for a node in the network as part of a VAP mapping. The supervisory device instructs the selected access points to form a VAP for the node. The node treats the access points in the VAP mapping as a single access point for purposes of communicating with the network.

    Propagating an intelligent walker agent in a network to perform a computation

    公开(公告)号:US10469563B2

    公开(公告)日:2019-11-05

    申请号:US15624071

    申请日:2017-06-15

    Abstract: These techniques introduce various “walker” agents that may physically move between different executing nodes/devices within the network. More specifically, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent.

    Transport layer identifying failure cause and mitigation for deterministic transport across multiple deterministic data links

    公开(公告)号:US10461886B2

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

    申请号:US15784401

    申请日:2017-10-16

    Abstract: In one embodiment, a method comprises: detecting, by a transport layer executed by a processor circuit in an apparatus, a request message received via a non-deterministic data link from one of a plurality of deterministic network interface circuits, the request message for a transport layer packet having been stored in a buffer circuit storing a plurality of transport layer packets in the apparatus, the deterministic network interface circuits providing respective deterministic links for deterministic transmission of the transport layer packets in a deterministic data network, the request message specifying a first number identifying any missed transmission opportunities on the corresponding deterministic link; determining, by the transport layer, a cause of failure in one or more of the missed transmission opportunities; and selectively executing, by the transport layer based on determining the cause of failure, a corrective action for preventing an increase in latency of the transport layer packets.

    BAYESIAN DYNAMIC MULTIHOP WIRELESS BEST PATH PREDICTION

    公开(公告)号:US20190297004A1

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

    申请号:US15927014

    申请日:2018-03-20

    Abstract: In one embodiment, a processor receives observed node characteristics of a node in a network. The node characteristics include a link cost metric for a network link associated with the node. The processor uses a Bayesian learning model to estimate a virtual link cost metric based on the observed node characteristics. The model uses statistics regarding the observed link cost metric as background belief measures. The processor forms a routing path in the network that includes the network link in part based on an objective function that uses the virtual link cost metric as a parameter.

    Mitigating neighbor discovery-based denial of service attacks

    公开(公告)号:US10382397B2

    公开(公告)日:2019-08-13

    申请号:US15654070

    申请日:2017-07-19

    Abstract: In one embodiment, a device in a network determines whether a destination address of a packet received by the device is within a neighbor discovery (ND) cache of the device. The device determines whether the destination address is not in a set of addresses used to generate an address lookup array or possibly in the set of addresses used to generate the address lookup array, in response to determining that the destination address of the packet is not within the ND cache. The device performs address resolution for the destination address of the packet, in response to determining that the destination address of the packet is possibly in the set of addresses used to generate the address lookup array.

    CHANNEL MANAGEMENT IN A VIRTUAL ACCESS POINT (VAP)

    公开(公告)号:US20190215704A1

    公开(公告)日:2019-07-11

    申请号:US15864554

    申请日:2018-01-08

    CPC classification number: H04W24/02 H04W72/1205 H04W88/08 H04W92/20

    Abstract: In one embodiment, a supervisory device in a network forms a first virtual access point (VAP) for a first node in the network. A plurality of access points (APs) in the network are mapped to the first VAP as part of a VAP mapping and the first node treats the APs in the VAP mapping as a single AP for purposes of communicating with the network. The supervisory device determines a communication schedule for the first node based on a radio chain of at least one of the APs in the VAP mapping for the first VAP being shared by the first VAP and a second VAP for a second node in the network. The supervisory device, according to the communication schedule for the first node, causes one or more of the APs in the VAP mapping for the first VAP to instruct the first node to stop transmitting for a period of time.

    DETERMINISTIC FORWARDING ACROSS L2 AND L3 NETWORKS

    公开(公告)号:US20190132150A1

    公开(公告)日:2019-05-02

    申请号:US16105421

    申请日:2018-08-20

    Abstract: According to one or more embodiments of the disclosure, a first tunnel router may receive a reservation request to establish a deterministic path between a first node and a second node. The first tunnel router may determine, based on the reservation request, a destination address of the second node. The first tunnel router may identify, based on the destination address of the second node, a second tunnel router associated with the second node. The first tunnel router may encapsulate a deterministic packet sent by the first towards the second node into a tunnel packet, wherein a multicast address in a header of the tunnel packet is set to the destination address of the second node. The first tunnel router can forward the tunnel packet along the deterministic path. The multicast address in the header of the tunnel packet causes nodes to send the tunnel packet according to the deterministic path.

Patent Agency Ranking