Piconet Scheduling via Neighborhood Map for Concurrent Transmissions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional wireless communication systems in piconets face inefficiencies in scheduling multiple concurrent transmissions during contention access periods, leading to interference and reduced data throughput due to the directional nature of RF communications and the inability to manage hidden nodes effectively.
Innovation Solution
The system derives a neighborhood map to enable multiple devices to transmit concurrently during a channel time allocation slot, using neighborhood map information to set clear channel assessment thresholds and schedule transmissions such that they are non-interfering, allowing for increased spectral reuse and aggregate data throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple devices transmit concurrently during a CTA time slot, then spectral reuse and aggregate data throughput increase, but interference between transmissions occurs due to the directional nature of RF communications and hidden nodes
Solution Approach 1:
The system performs preliminary actions by deriving a neighborhood map before scheduling transmissions. This map pre-identifies hidden nodes and potential interference sources, allowing the scheduler to proactively assign non-interfering spatial relationships to concurrent transmissions, thereby enabling higher throughput without interference
Solution Approach 2:
The neighborhood map acts as an intermediary data structure that mediates between multiple transmitting devices. It captures spatial and interference relationship information that the scheduler uses to make informed decisions about which devices can transmit concurrently without interfering with each other
2Adaptability or versatility
If conventional scheduling methods are used during contention access period, then device complexity remains low, but spectral reuse is limited due to inability to manage hidden nodes effectively
Solution Approach 1:
The neighborhood map is derived in advance during the contention access period, capturing interference relationships before the CTA period begins. This preliminary action enables the scheduler to efficiently determine non-interfering transmission pairs without adding significant complexity during the actual transmission scheduling phase
Solution Approach 2:
The system serves itself by automatically deriving the neighborhood map from observed transmissions and interference patterns. This self-derived information structure enables adaptive spectral reuse without requiring external coordination or complex manual scheduling configurations
Data Source
AI summary
Aspects of a method and system for scheduling multiple concurrent transmissions during a contention access period in a wireless communications network are presented. Aspects of the system comprise communicating devices (DEVs) within a piconet that are operable to derive a neighborhood map of a piconet. The neighborhood map information may enable a plurality of DEVs to concurrently transmit signals during a given channel time allocation (CTA) time slot. The ability for multiple DEVs to transmit signals concurrently during a single CTA time slot may increase spectral reuse within a wireless communication medium. In another aspect the system, the neighborhood map information may enable individual DEVs to set clear channel assessment (CCA) thresholds. Individual DEVs may utilize CCA threshold information to determine when to transmit signals to one or more destination DEVs and/or at what rate to transmit data via the signals.