Controlled Flooding Mechanism for Wireless Multihop Network Broadcasts
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless multihop networks face challenges in efficient and reliable message broadcasting due to unreliable links, interference, and varying node density, which leads to inefficient use of communication resources and potential collisions.
Innovation Solution
A node device with a message broadcast module that initiates connection-less broadcasts at specified times, suppresses duplicate messages, and maintains a time reference to optimize broadcasts, allowing for automated self-regulation and controlled re-broadcast hops, thereby managing high-density neighborhoods and directing broadcasts effectively.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If connection-oriented protocol with handshaking is used for reliable communication, then reliability is improved, but communication overhead increases and efficiency for short messages deteriorates
Solution Approach 1:
The patent segments the broadcast process into discrete time windows, where each window allows controlled broadcast attempts. This segmentation enables reliability through repeated attempts across multiple windows while maintaining efficiency by limiting each attempt to a bounded time period, resolving the contradiction between reliable delivery and message dissemination speed.
Solution Approach 2:
The system implements periodic broadcast attempts within defined time windows rather than continuous transmission. This periodic action provides reliable message delivery through multiple attempts while improving efficiency by introducing pauses between attempts, allowing the network to recover and reducing overall transmission time compared to continuous connection-oriented handshaking.
2Reliability
If uncontrolled broadcast re-transmission is allowed to propagate messages throughout the network, then message dissemination coverage is improved, but communication resources are overloaded and channel capacity deteriorates
Solution Approach 1:
The patent implements feedback mechanisms where nodes track received broadcast messages and suppress duplicates. Each node maintains state information about broadcasts it has received and uses this feedback to determine whether to re-transmit, thereby ensuring comprehensive coverage while preventing redundant transmissions that would overload communication resources.
Solution Approach 2:
The system dynamically adjusts broadcast parameters including time window duration, re-transmission count limits, and suppression thresholds based on network conditions. This parameter adaptation allows the system to achieve broad message dissemination coverage while controlling resource consumption by adjusting transmission intensity based on actual network state.
3Speed
If simultaneous broadcasts are sent by multiple nodes in dense environments, then message dissemination speed is improved, but collisions occur and reception reliability deteriorates
Solution Approach 1:
The patent divides the broadcast process into periodic time windows, allowing only one node to transmit at a time within each window. This periodic structure enables fast message dissemination across the network while preventing collisions by ensuring exclusive access to the communication channel during each time window, thus maintaining reception reliability.
Solution Approach 2:
The system performs preliminary actions by having nodes prepare broadcast messages in advance and schedule transmissions within specific time windows. This preliminary scheduling prevents simultaneous transmissions that would cause collisions, while still achieving fast dissemination by coordinating multiple nodes to transmit in rapid succession across different time windows.
Data Source
AI summary
In a wireless multihop network having node devices within communication range neighboring node devices in a corresponding local neighborhood, the node devices initiate repeated message broadcasts of a first message as a connection-less broadcast into the local neighborhood. Initiation of message broadcasts is governed such that the message broadcasts are permitted only at specified transmission times within a plurality of transmission time windows. Each of the node devices determines whether any of the connection-less-broadcasted messages are duplicates of the first message, and generate a count of those duplicates received during each of the transmission windows. Based on counts of the duplicates, initiation of a message broadcast of the first message in a current transmission window is suppressed in response to a corresponding count of duplicates of the first message received during the first transmission window exceeding a suppression limit.