Wireless Data Collection Synchronization via Variable Wait Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems using the CSMA/CA technique face interference issues due to asynchronous device operations, leading to potential data collisions, especially in high-throughput environments with multiple devices, and struggle to accurately assess the presence of base units, causing erroneous associations in crowded networks.
Innovation Solution
A method that synchronizes devices by calculating a variable wait time based on the end of previous transmissions and uses signal processing to assess packet integrity, ensuring staggered transmissions and accurate device association independent of physical signal intensity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If CSMA/CA algorithm is used for wireless communication access, then collision avoidance is provided through random backoff time, but transmission interference still occurs due to asynchronous device operations and probability of simultaneous transmissions
Solution Approach 1:
The patent applies preliminary action by having devices determine a predetermined time interval before the channel becomes free, then waiting for this interval to elapse before attempting transmission. This advance preparation and timing coordination reduces the probability of simultaneous transmissions and collisions, improving transmission reliability while maintaining network throughput.
2Productivity
If multiple devices transmit simultaneously in high-throughput environments, then network capacity is utilized, but interference on the transmission channel increases making correct reception impossible
Solution Approach 1:
Devices perform preliminary actions by calculating and waiting for a predetermined time interval before the channel becomes free before attempting transmission. This timing coordination staggers transmissions and reduces simultaneous access attempts, thereby reducing transmission interference while maintaining network capacity utilization.
Solution Approach 2:
The patent implements feedback by having devices monitor the transmission channel to detect when it becomes free, then using this information to determine their transmission timing. This feedback mechanism allows devices to adapt their transmission behavior based on actual channel conditions, reducing interference while maintaining throughput.
3Reliability
If devices use random backoff time to avoid collisions, then transmission attempts are staggered, but the probability of simultaneous transmission increases with network throughput
Solution Approach 1:
The patent changes the parameter from random backoff time to a predetermined time interval based on channel free time. This parameter transformation provides more deterministic transmission timing that scales better with network throughput, maintaining collision avoidance effectiveness even as network capacity increases.
4Ease of operation
If base units are identified using physical signal intensity, then device association is established, but erroneous associations occur in crowded networks with multiple base units
Solution Approach 1:
The patent uses feedback by having portable units monitor transmission channels and process physical signals to assess packet integrity and identify sending devices. This feedback mechanism allows accurate identification of base units based on actual communication behavior rather than just signal intensity, preventing erroneous associations in crowded networks.
Solution Approach 2:
The patent replaces the mechanical/physical approach of using signal intensity for identification with a signal processing approach that analyzes packet integrity and correlates physical signals with decoded packets. This substitution provides more accurate device identification independent of signal strength variations.
Data Source
AI summary
A method for performing wireless communication in a data-collection system includes a) listening whether a channel is free or busy and if the channel is free, transmitting; b) if the channel is busy, generating a random number and associating therewith a first interval of time to determine the instant of the start of transmission and further whether said channel is busy, identifying a second variable interval of time, monitoring the data exchanged in said channel with other devices that occupy the channel, queuing a third interval of time obtained from said first interval of time onto said second interval of time and transmitting at the end of said third interval of time. The second interval of time has a duration that is equal to the time wherein the channel remains in busy status.


