Distributed Data Propagation in Wireless Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication networks face scalability issues and excessive network traffic due to inefficient data distribution methods, particularly in mesh networks, where a large number of peers responding to data requests lead to exponential messaging overhead.
Innovation Solution
Implementing a system that uses uniform random host identification and generation identifiers to optimize data distribution, where peers respond based on matching host identifiers and generation age, reducing the number of queries and messaging overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all peers broadcast requests for data to find hosts, then data can be located, but network traffic increases exponentially with N-1 responses per request
Solution Approach 1:
The patent segments the peer set into multiple groups based on host identifier ranges. Instead of all N peers responding to every request, only peers in specific segments with matching host identifier ranges respond. This segmentation reduces the number of responses from O(N) to O(1) or O(log N) per request, dramatically reducing network traffic while maintaining reliable data location.
Solution Approach 2:
The patent changes the parameter of host identifier matching from exact match to range-based match with generation identifiers. By using generation identifiers and range-based host identifiers, the system can control which peers respond based on the data's age and distribution stage, reducing unnecessary responses and network traffic while maintaining accurate data location.
2Reliability
If multiple peers host the same data, then data availability increases, but load balancing becomes difficult without centralized coordination
Solution Approach 1:
The patent enables peers to autonomously determine whether to respond to requests based on their own host identifiers and the request parameters. Each peer independently evaluates whether it should serve the request based on range matching and generation identifier comparisons, eliminating the need for centralized load balancing coordination while maintaining even distribution of requests across multiple hosts.
3Area of stationary object
If data is propagated through many hops in a mesh network, then distribution coverage increases, but messaging overhead and propagation time increase
Solution Approach 1:
The patent uses generation identifiers to track data age and propagation depth. By pre-defining response behavior based on generation identifier thresholds, the system optimizes propagation: early-generation data propagates more aggressively to expand coverage, while later-generation data propagates more conservatively to reduce overhead. This preliminary action embedded in the identifier system automatically manages distribution efficiency.
Data Source
Figure 1
Figure 2~3
Figure 4~5
AI summary
A technique for distributed propagation of data in a wireless communication network includes providing (600) a unique host identifier for each peer network entity in the wireless communication network, each host identifier having a length of B bits. A next step includes requesting (602) data from peer network entities using a request having a host identifier of the requesting network entity. A next step includes, if a peer network entity is hosting the requested data, comparing (608) the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match. A next step includes responding (610) to the request if a match is determined.