Ad Hoc Network Loop Detection via Commutative Hash Values

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

In Mobile Ad Hoc Networks (MANETs), existing routing protocols face challenges in preventing message looping and network congestion due to the fragile nature of wireless links, which increases the risk of message duplication and requires significant network overhead for loop prevention.

Innovation Solution

A method for detecting communication loops in ad hoc networks by using commutative values associated with node identifiers, where nodes perform commutative operations (such as addition, multiplication, or XOR) on message headers or payloads to identify loop occurrences, allowing for decentralized loop detection without increasing control message overhead.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If path-vector routing schemes or link-state routing schemes are used to prevent routing loops, then loop prevention capability is improved, but control message overhead increases due to requiring full path information or complete network topology sharing

Engineering Contradiction:

Improveloop prevention capabilityVSAvoidcontrol message overhead

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential loop detection information (commutative hash value of node identifiers) from the complete path information, eliminating the need to maintain and transmit full path vectors or complete network topology while retaining loop detection capability

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent transforms the path representation from detailed node sequences to a commutative hash value parameter, which preserves loop detection functionality while significantly reducing the information quantity that needs to be transmitted in control messages

Inventive Principle:

Principle #35Parameter changes

2Productivity

If proactive link-state routing algorithms utilize dynamic link metrics to find better quality paths, then routing quality is improved, but the risk of message looping or duplication increases due to paths flapping

Engineering Contradiction:

Improverouting qualityVSAvoidmessage looping risk

Core Design Contradiction:

ProductivityVSObject-generated harmful factors

Solution Approach 1:

The patent implements a feedback mechanism where each node examines the commutative hash value in received messages against its own generated value, providing immediate local feedback to detect loops without requiring complex protocol modifications or increasing messaging overhead

Inventive Principle:

Principle #23Feedback

Solution Approach 2:

The patent uses a lightweight commutative hash value that can be quickly computed and discarded after loop detection, replacing complex path vector maintenance with simple, disposable hash comparisons that do not persist through multiple routing updates

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

Data Source

PatentUS10959157B2Systems and methods for wireless communication network loop detection

Publication Date: 2021.03.23 UPLINK LABS INC

AI summary

A method for detecting communication loop in an ad hoc network is provided. The method may comprise: receiving, at a node of the ad hoc network, a message comprising a commutative value, wherein the node is associated with a node identifier and the commutative value pertains to node identifiers associated with one or more nodes along a path the message has been traversed along regardless of the order of the nodes; and determining, with aid of one or more processors, presence of a loop based on whether the commutative value is identical to a previously obtained commutative value.