Distributed Time Slot Assignment for MIMO-MPR Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing MIMO-MPR systems in wireless networks face challenges with synchronization issues and hidden terminal problems, leading to poor bit error rate performance and reduced throughput due to the inability to effectively handle asynchronous transmissions and interference in multi-user networks.
Innovation Solution
The implementation of distributed time slot assignment (DTSA) in multi-user networks, where receivers can detect two packets simultaneously, by assigning time slots to nodes instead of links, and using a method that adjusts frame lengths and slot assignments to minimize interference, allowing for non-interfering transmissions between one-hop and two-hop neighbors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If MIMO-MPR systems allow simultaneous packet detection at receivers, then network throughput is improved, but synchronization issues and hidden terminal problems cause poor bit error rate performance
Solution Approach 1:
The patent segments the transmission medium by introducing virtual time slots that divide the continuous transmission channel into discrete time segments. This segmentation allows receivers to process packets in an organized manner, reducing the impact of asynchronous arrivals and improving bit error rate performance while maintaining high throughput through parallel packet detection capabilities.
Solution Approach 2:
The patent implements preliminary actions by having nodes announce their intended transmission times before actual data transmission. This advance notification allows receivers to prepare for incoming packets, synchronize their processing, and resolve hidden terminal problems by knowing which time slots will be occupied, thereby improving reliability without sacrificing throughput.
2Reliability
If distributed time slot assignment is implemented to minimize interference, then bit error rate performance is improved, but system complexity increases due to frame length adjustment and slot assignment mechanisms
Solution Approach 1:
The patent implements self-service mechanisms where each node autonomously determines its own time slot assignments based on local information about neighboring nodes. Nodes independently adjust their frame lengths and select time slots that minimize interference with one-hop and two-hop neighbors, eliminating the need for centralized control and reducing overall system complexity while maintaining improved bit error rate performance.
Solution Approach 2:
The patent introduces dynamic adjustment capabilities where frame lengths and time slot assignments are not fixed but can be adapted based on network conditions. Nodes can modify their transmission parameters to optimize performance in changing environments, achieving reliable communication without requiring complex static configuration schemes.
3Productivity
If time slots are assigned to nodes instead of links to enable simultaneous transmissions, then network productivity is improved, but handling asynchronous transmissions and interference becomes more difficult
Solution Approach 1:
The patent introduces virtual time slots as an intermediary mechanism that mediates between node-based transmissions and packet detection. This intermediary framework provides a structured way to handle asynchronous transmissions by organizing them into time-based groups, making it easier to detect and process multiple packets simultaneously while maintaining high network productivity.
Data Source
AI summary
A method of multiple packet reception (MPR) using distributed time slot assignment (TDSA) in a multi-user network where receivers can detect two packets at the same time includes the steps of requesting information on slot assignment in a contention area, setting a frame length and acquiring a the slot assignment, selecting the assigned slot, and announcing and confirming information about the frame length and the assigned slot. The step of requesting information on slot assignment, setting a frame length and acquiring a slot assignment, and selecting the assigned slot are performed in a network where receivers can detect two packets at the same time, where time slots are assigned to nodes instead of links, where one-hop neighbors are assigned to different time slots since they may form a link together, while sharing one time slot with one of the two-hop neighbors in a non-interfering assignment.