Abstract:
A method for network authentication of wireless devices at a gateway is provided that includes scanning a wireless network by the gateway to discover unjoined wireless devices, joining a discovered wireless device to the gateway using a non-internet protocol implemented by the wireless device, wherein the joining results in an encrypted connection between the gateway and the wireless device, and authenticating the discovered wireless device to the gateway via the encrypted connection, wherein authentication is performed according to an authentication protocol of a network protocol management layer of the gateway.
Abstract:
A method for concurrent execution of multiple protocols using a single radio of a wireless communication device is provided that includes receiving, in a radio command scheduler, a first radio command from a first protocol stack of a plurality of protocol states executing on the wireless communication device, determining a scheduling policy for the first radio command based on a current state of each protocol stack of the plurality of protocol stacks, and scheduling the first radio command in a radio command queue for the radio based on the scheduling policy, wherein the radio command scheduler uses the radio command queue to schedule radio commands received from the plurality of protocol stacks.
Abstract:
A BLE-Mesh device includes a controller coupled to a memory and to a transceiver adapted to be coupled to an antenna, wherein the controller implements an applications layer including BLE and Mesh applications, and a BLE stack and a mesh stack. The BLE-Mesh device has a switchable high-speed and low-speed mode and a speed switching algorithm for implementing a method of communications in BLE-mesh network. A broadcast ping is sent to neighborhood devices with a time to live (TTL)=1. A manufacturer's ID is analyzed to identify in a manufacturer's ID field in pongs received to determine a higher-speed capable device or a lower-speed device. A higher-speed data rate is utilized for mesh communications if a percentage of higher-speed capable devices is≧a threshold percentage or a lower-speed data rate is utilized for the mesh communications if the percentage of higher-speed capable devices is
Abstract:
Embodiments of the invention provide a method for performing network resource allocation over hybrid networks so that application QoS requirements are met. The hybrid networks are represented as an undirected weighted graph with the communication links as edges irrespective of the communication medium. A QoS-based resource allocation model. Another embodiment further includes utility functions that capture the QoS attributes such as reliability, timeliness, fault-tolerance and lifetime allows determining routes and bandwidth allocation such that the total system utility across the entire network is maximized.
Abstract:
Excessive latencies and power consumption are avoided when a large number of leaf nodes (LNs) contend simultaneously to join a time slotted channel hopping wireless communication network having a root node (RN) interfaced to LNs by one or more intermediate nodes (INs). A first plurality of shared transmit/receive slots (STRSs) is allocated for at least one IN, and a second plurality of STRSs is advertised for use by contending LNs, where the first plurality is larger than the second plurality. When a LN joins, its STRSs are re-defined such that most become shared transmit-only slots (STOSs) and no STRSs remain. The numbers of STRSs allocated to INs may vary inversely with their hop counts from the RN. One or more STOSs may be added for each of one or more INs in response to a predetermined network condition.
Abstract:
A method of transmitting association requests in a wireless sensor network includes transmitting an association request from a leaf node to an intermediate node. The method further includes transmitting the association request from the intermediate node during one of either a shared time slot or a dedicated time slot in response to at least one of the timing of dedicated time slots and data collision rates during shared time slots.
Abstract:
A method for concurrent execution of multiple protocols using a single radio of a wireless communication device is provided that includes receiving, in a radio command scheduler, a first radio command from a first protocol stack of a plurality of protocol states executing on the wireless communication device, determining a scheduling policy for the first radio command based on a current state of each protocol stack of the plurality of protocol stacks, and scheduling the first radio command in a radio command queue for the radio based on the scheduling policy, wherein the radio command scheduler uses the radio command queue to schedule radio commands received from the plurality of protocol stacks.
Abstract:
A method for pseudo channel hopping in a node of a wireless mesh network is provided that includes scanning each channel of a plurality of channels used for packet transmission by the node, wherein each channel is scanned for a scan dwell time associated with the channel, updating statistics for each channel based on packets received by the node during the scanning of the channel, and selecting a channel of the plurality of channels for scanning based on the statistics when the scan dwell time of a currently scanned channel ends.
Abstract:
Excessive latencies and power consumption are avoided when a large number of leaf nodes (LNs) contend simultaneously to join a time slotted channel hopping wireless communication network having a root node (RN) interfaced to LNs by one or more intermediate nodes (INs). A first plurality of shared transmit/receive slots (STRSs) is allocated for at least one IN, and a second plurality of STRSs is advertised for use by contending LNs, where the first plurality is larger than the second plurality. When a LN joins, its STRSs are re-defined such that most become shared transmit-only slots (STOSs) and no STRSs remain. The numbers of STRSs allocated to INs may vary inversely with their hop counts from the RN. One or more STOSs may be added for each of one or more INs in response to a predetermined network condition.
Abstract:
Excessive latencies and power consumption are avoided when a large number of leaf nodes (LNs) contend simultaneously to join a time slotted channel hopping wireless communication network having a root node (RN) interfaced to LNs by one or more intermediate nodes (INs). A first plurality of shared transmit/receive slots (STRSs) is allocated for at least one IN, and a second plurality of STRSs is advertised for use by contending LNs, where the first plurality is larger than the second plurality. When a LN joins, its STRSs are re-defined such that most become shared transmit-only slots (STOSs) and no STRSs remain. The numbers of STRSs allocated to INs may vary inversely with their hop counts from the RN. One or more STOSs may be added for each of one or more INs in response to a predetermined network condition.