H04L49/1584

Vehicle ad hoc network (VANET)

Mesh node modules are associated with vehicles and companion nodes can dynamically form a mesh network which uploads location information of the nodes and in some cases additional information, e.g., road condition or proximity to objects.

TECHNIQUES AND SYSTEMS FOR LOGICAL MESH NETWORKS
20170289038 · 2017-10-05 · ·

Various embodiments are described wherein a set of devices are configured to be a logical mesh network. Each device has a logical mesh network address. Further, the set of logical mesh network addresses form a sequence from a first address to a last address, and intermediate addresses having both a preceding and a next address. The devices store forwarding information used to determine how to forward a received logical mesh network packet. Other embodiments are described and claimed.

FULLY CONNECTED NETWORK
20170279707 · 2017-09-28 · ·

A fully-connected mesh network includes a plurality of switches. A first switch receives a packet traveling through the mesh network from an external source node to an external destination node specified by the packet. A plurality of links, which are all included in a mesh link aggregation group (LAG), couple each possible pair of the switches by a respective single link. Each of the respective links is included individually in an individual LAG. Each of the switches is configured to receive a packet from another switch of the plurality of switches via only the mesh LAG, and each switch that receives a packet via the mesh LAG is configured to transmit the packet to another switch of the plurality of switches via only one of the individual LAGs. The packet travels to the destination node at most two hops across the plurality of switches.

Route optimization for on-demand routing protocols for mesh networks

Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

Dynamic adjustment of quality of service parameters
09729457 · 2017-08-08 · ·

A computer-implemented method for dynamic adjustment of quality of service parameters is described. In one embodiment, one or more quality of service (QoS) parameters of a client of a mesh network is set based on an expected bandwidth for the mesh network. An actual bandwidth for the mesh network is measured. One or more QoS parameters of the client is automatically changed in response to the actual bandwidth differing from the expected bandwidth. The change in the QoS parameters may be configured to compensate for the difference between the actual bandwidth and the expected bandwidth.

WIRELESS COMMUNICATION DEVICE, WIRELESS COMMUNICATION METHOD, AND NON-TRANSITORY COMPUTER READABLE MEDIUM

A wireless communication device as an embodiment of the present invention configures a wireless mesh network with a plurality of other wireless communication devices and includes data storage and circuitry coupled with the data storage.

The data storage is configured to store data including a first data. The circuitry is configured to receive first reception data transmitted from one of the plurality of other wireless communication devices and to determine whether the first data matches with at least a part of the first reception data and to process to transmit at least a part of data stored in the data storage. The circuitry is configured not to process to transmit the first data determined to match at least the part of the first reception data.

Data center network with packet spraying

A network system for a data center is described in which an access node sprays a data flow of packets over a logical tunnel to another access node. In one example, a method comprises establishing, by a plurality of access nodes, a logical tunnel over a plurality of data paths across a switch fabric between a source access node and a destination access node included within the plurality of access nodes, wherein the source access node is coupled to a source network device; and spraying, by the source access node, a data flow of packets over the logical tunnel to the destination access node, wherein the source access node receives the data flow of packets from the source network device, and wherein spraying the data flow of packets includes directing each of the packets within the data flow to a least loaded data path.

DATA CENTER NETWORK WITH PACKET SPRAYING

A network system for a data center is described in which an access node sprays a data flow of packets over a logical tunnel to another access node. In one example, a method comprises establishing, by a plurality of access nodes, a logical tunnel over a plurality of data paths across a switch fabric between a source access node and a destination access node included within the plurality of access nodes, wherein the source access node is coupled to a source network device; and spraying, by the source access node, a data flow of packets over the logical tunnel to the destination access node, wherein the source access node receives the data flow of packets from the source network device, and wherein spraying the data flow of packets includes directing each of the packets within the data flow to a least loaded data path.

PSEUDO CHANNEL HOPPING USING SCAN DWELL TIMES IN MESH NETWORKS WITHOUT TIME SYNCHRONIZATION
20220337284 · 2022-10-20 ·

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 changing scan dwell times of the plurality of channels periodically based on the statistics.

Pseudo channel hopping using scan dwell times in mesh networks without time synchronization

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 changing scan dwell times of the plurality of channels periodically based on the statistics.