H04W40/32

INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM
20170250898 · 2017-08-31 ·

An information processing apparatus in a mesh network, includes circuitry that, when the information processing apparatus is allocated as a root node for multicast transmission, transmits path request for multicast to other information processing apparatuses in the mesh network. The circuitry also determines a path for multicast based on responses received from the other information processing apparatuses, and performs multicast transmission of data via the determined path for multicast.

Root network device causing execution of network service operations on behalf of constrained wireless network device in a low power and lossy network

In one embodiment, a method comprises: registering, by a root network device in a low power and lossy network, a constrained network device that is reachable within the low power and lossy network; obtaining, by the root network device, executable code associated with execution of a network service operation by the constrained network device; receiving a data packet from a source device and destined for the constrained network device; and causing execution on the data packet, by the root network device, of the network service operation on behalf of the constrained network device in response to reception of the data packet.

System, method, and device for utilizing network connectivity by combining allocated bandwidth for optimized broadband access
09742664 · 2017-08-22 ·

A system for network aggregation/disaggregation includes an aggregation/disaggregation server; an aggregation/disaggregation router; and at least one carrier network; such that the aggregation/disaggregation router aggregates individual bandwidth subscriptions to provide an aggregated bandwidth local area network connection, which is accessed by a plurality of mobile devices. An aggregation/disaggregation router can include a processor; a non-transitory memory; an input/output; a proxy connection manager; a software-defined radio; a local area network manager; and a subscriber controller; all connected via a data bus. Also disclosed is a method of network aggregation/disaggregation, including creating proxy connections; aggregating proxy connections; accessing proxy connections; disaggregating inbound network data, wherein the aggregation/disaggregation server distributes data across a plurality of network connections; and aggregating outbound network data, wherein the aggregation/disaggregation server aggregates and routes outbound data to a final internet destination.

MESSAGE TRANSMISSION METHOD AND RELATED DEVICES
20220038531 · 2022-02-03 ·

A message transmission method and related devices are provided in the disclosure. The method includes the following. A first long range (LoRa) device creates a LoRa mesh group. Based on a peer-to-peer (P2P) communication requirement with a second LoRa device belonging to the LoRa mesh group, the first LoRa device switches to a P2P communication mode, transmits a mode switching instruction to the second LoRa device, and increases a transmission priority associated with a target message type to a predetermined transmission priority. The mode switching instruction is used to instruct the second LoRa device to switch to the P2P communication mode. The target message type is the type of a message that needs to be transmitted in P2P communication between the first LoRa device and the second LoRa device. The first LoRa device transmits a message of the target message type to the second LoRa device.

Techniques for optimizing a mesh network

A node receives status data associated with a current collector in the network, where the node is active on the current collector. The node also receives status data associated with a candidate collector in the network, where the node is not active on the candidate collector. An analysis of the status data of the collectors is generated, where the analysis includes at least comparing respective network loads reported in the received status data. An optimal collector is determined from among the current collector and the candidate collector. The determination of the optimal collector is based at least in part upon the analysis of the status data of the collectors. The node remains active on the current collector when the current collector is determined to be the optimal collector, and the node becomes active on the candidate collector when the candidate collector is determined to be the optimal collector.

Techniques for optimizing a mesh network

A node receives status data associated with a current collector in the network, where the node is active on the current collector. The node also receives status data associated with a candidate collector in the network, where the node is not active on the candidate collector. An analysis of the status data of the collectors is generated, where the analysis includes at least comparing respective network loads reported in the received status data. An optimal collector is determined from among the current collector and the candidate collector. The determination of the optimal collector is based at least in part upon the analysis of the status data of the collectors. The node remains active on the current collector when the current collector is determined to be the optimal collector, and the node becomes active on the candidate collector when the candidate collector is determined to be the optimal collector.

Localized multicast in a low power and lossy network based on rank-based distance

In one embodiment, a method comprises: identifying, by a low power and lossy network (LLN) device in a low power and lossy network, a minimum distance value and a distance limit value for limiting multicast propagation, initiated at the LLN device, of a multicast data message in the LLN; and multicast transmitting, by the LLN device, the multicast data message with a current distance field specifying the minimum distance value and a distance limit field specifying the distance limit value, the multicast transmitting causing a receiving LLN device having a corresponding rank in the LLN to respond to the multicast data message by: (1) determining an updated distance based on adding to the current distance field a rank difference between the receiving LLN device and the LLN device, and (2) selectively retransmitting the multicast data message if the updated distance is less than the distance limit value.

MOBILE COMMUNICATION DEVICE CLUSTERING

A mobile communication device includes a network transceiver configured to communicate with a cellular network, a cluster transceiver configured to communicate with other mobile communication devices, and a communication management subsystem. The communication management subsystem is configured to send to each of a plurality of candidate mobile communication devices, a setup request, receive from each of the plurality of candidate mobile communication devices, a network signal strength, determine a network signal strength of the mobile communication device, if the network signal strength of the mobile communication device is greater than the network signal strength of each of the plurality of candidate mobile communication devices, send to the plurality of candidate mobile communication devices, a setup notification indicating that the mobile communication device is a cluster head configured to provide the candidate mobile communication devices with a connection to the cellular network via the network transceiver.

Distributed arbitration of time contention in TSCH networks

In one embodiment, a parent node in a network observes time slot usage of a channel hopping schedule by one or more child nodes of the parent node to communicate with the parent node. The parent node also identifies high priority traffic from a particular child node. The parent node detects time contention for the high priority traffic based on an indication that at least a portion of the traffic has been rerouted by a particular child node to a different parent node. In response to detecting the time contention, the parent node adjusts a communication strategy used by the one or more child nodes.

Distributed arbitration of time contention in TSCH networks

In one embodiment, a parent node in a network observes time slot usage of a channel hopping schedule by one or more child nodes of the parent node to communicate with the parent node. The parent node also identifies high priority traffic from a particular child node. The parent node detects time contention for the high priority traffic based on an indication that at least a portion of the traffic has been rerouted by a particular child node to a different parent node. In response to detecting the time contention, the parent node adjusts a communication strategy used by the one or more child nodes.