QUALITY-PERCEIVED MULTIPLE LABEL-SWITCHED PATHS FOR ACHIEVING ULTRA-RELIABLE WI-FI FOR INDUSTRIAL IOT DEPLOYMENTS

Operating within an environment that incorporates technologies based on Multiprotocol Label Switching (MPLS) and the Label Distribution Protocol (LDP) to provide an ultra-reliable wireless backhaul service supporting large Internet of Things (IoT) and Industrial IoT (IIoT) environments (comprising, for example, many hundreds of radio devices), techniques are presented herein that support a mechanism to implement quality-perceived multiple label-switched paths (LSP)s that can perform replication according to path quality. Aspects of the presented techniques leverage a replication strategy, that is defined on both a client and a Network Appliance that defines how replication should be performed with preconditions, replication should be stopped when the preconditions are not met, or replication should be recovered when a precondition is met. According to aspects of the presented techniques, when a strategic precondition is met or not met, the corresponding LSP state is changed to pending or recovered (respectively) instead of being torn down or being rebuilt

FAST FORWARDING ROUTING MECHANISM BASED ON NETWORK TOPOLOGY FOR WIRELESS SENSOR NETWORK

Techniques are described herein for dynamically adjusting a transmit sequence based on a coefficient collision table. A fast forwarding routing mechanism may search a routing table when traffic enters the data plane, and fill the output buffer of a corresponding interface. Furthermore, if the data plane detects large amounts of short packets destined for the mesh, compression into one packet can be achieved if they belong to a common parent

SERVICE CATEGORY SYSTEM IN LOW-POWER AND LOSSY NETWORKS

Presented herein are novel techniques to resolve cache capacity issues in Low-Power and Lossy Networks (LLNs) by utilizing border router edge computing. Following deployment of a network, such as an information-centric networking (ICN) network, a border router will generate a bitmap for all support services through negotiations with a cloud service (CS) and low-power devices. The border router will then cache data that satisfies specific service criteria for low-power devices that have registered for such data. The border router will further publish the service bitmap to a sleep proxy. A given low-power device can periodically examine the service bitmap via beacons to determine whether there may be any service(s) in which it is interested and, if so, respond to the border router

PREDICTION OF PEER-TO-PEER ROUTING REQUEST BASED ON LOW-POWER AND LOSSY NETWORKS BEHAVIOR ANALYTICS

Techniques are provided to predict Peer-to-Peer (P2P) routing requests in Low-Power and Lossy Networks (LLNs). With this prediction, a P2P routing path may be prepared on demand and in advance

NON-INTERFERING SEQUENCE FOR MASSIVE DATA TRAFFIC IN LOW-POWER LOSSY NETWORKS

Techniques are described herein for generating a non-interfering sequence. This mechanism mainly comprises two steps. The first step involves computing and generating a schedule, and the second step involves receiving metering data from all nodes. After the second step ends, the head end system builds a residual node set containing all nodes that failed to report data in a given schedule, and then the first and second steps are repeated until the residual set is empty. The two steps are performed serially. The techniques described herein optimize these two steps. In particular, first a system mathematical mode is built from a Routing Protocol for Low-Power and Lossy Networks (RPL) p-table and link neighbor, second the constraint condition is constructed, and third the parameter is adjusted and the schedule is implemented

SMART DEPLOYMENT WITH ROUTING PROTOCOL FOR LOW-POWER AND LOSSY NETWORKS TOPOLOGY IN WIRELESS MESH NETWORKS BY MULTI-OBJECTIVE OPTIMIZATION ALGORITHM

Techniques are provided for a multi-objective model for the Wireless Mesh Networks (WMNs) planning problem where three conflicting objectives are optimized simultaneously. Different discrete recommendation areas may form different network topologies, thus screening out the best recommendation. In order to evaluate the network topology, a mechanism is described to simulate the radio coverage and Routing Protocol for Low-Power and Lossy Networks (RPL) simulator to search the optimal positon by new deployments generated iteratively. In particular, provided are (1) a networking deployment mathematical model based on RPL topology, (2) a multi-objective optimization approach to search the best RPL topology, and (3) model resolution after optimizing the candidate sets

PROACTIVE METHOD FOR FASTER REFORMATION IN LOW-POWER AND LOSSY NETWORKS

Techniques are described herein for a proactive method to achieve faster reformation in Lower-power and Lossy Networks (LLNs). These techniques also provide reduced asynchronization and functions regardless of the number of powered-off nodes in the LLN

SPIRAL DATA REPORTING MECHANISM IN LOW-POWER AND LOSSY NETWORKS

The embodiments presented herein relate to low-power and lossy networks (LLNs), and more specifically, to dividing LLN nodes into groups. Groups may be determined by traversing a directed acyclic graph (DAG) topology in a spiral manner. In this manner, contention, collisions, and interference may be minimized, while bandwidth usage can be maximized