Wireless Time Slot Allocation Without Contention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
IEEE 802.15.4 standards face limitations in allocating guaranteed time slots, leading to inefficient network bandwidth utilization and increased power consumption due to the inability to ensure real-time transmission for more than 7 periodic nodes and inflexible scheduling.
Innovation Solution
A method and apparatus for allocating time slots using a window scheduling algorithm, which determines a beacon order and superframe order to allocate guaranteed time slots without contention, allowing for simultaneous allocation to 7 or more periodic nodes, improving bandwidth allocation and energy efficiency by adjusting the beacon order and superframe order until all nodes are allocated.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If IEEE 802.15.4 standards allocate guaranteed time slots using conventional methods, then the allocation process is simple, but the network bandwidth utilization is inefficient and real-time transmission cannot be ensured for more than 7 periodic nodes
Solution Approach 1:
The superframe is segmented into multiple time slots, and the window scheduling algorithm divides the allocation process into systematic phases: collecting node requests, calculating packet lengths in symbol units, determining beacon order, determining superframe order, and allocating GTS slots. This segmentation enables efficient bandwidth utilization for more than 7 periodic nodes while maintaining manageable algorithm complexity through structured processing.
Solution Approach 2:
The scheduling algorithm dynamically adjusts the beacon order and superframe order based on the number of nodes and their packet length requirements. The system calculates optimal values for BO and SO parameters, and the coordinator dynamically allocates GTS slots according to node priorities and packet sizes. This dynamic adaptation maximizes network bandwidth utilization while ensuring real-time transmission for all periodic nodes.
2Adaptability or versatility
If the beacon order and superframe order are increased to allocate more time slots, then more nodes can be served simultaneously, but the power consumption efficiency deteriorates
Solution Approach 1:
The algorithm optimizes the beacon order (BO) and superframe order (SO) parameters by calculating their optimal values based on the number of periodic nodes and their packet length requirements. The system determines the minimum necessary BO and SO values to accommodate all nodes, avoiding unnecessary increases that would waste energy. This parameter optimization enables serving more nodes while maintaining power consumption efficiency.
Solution Approach 2:
The window scheduling algorithm allocates GTS slots precisely according to the actual needs of periodic nodes, avoiding excessive allocation. The coordinator calculates the exact number of slots required based on packet lengths and node priorities, allocating only the necessary bandwidth. This partial action approach ensures all nodes are served without wasting energy on unnecessary time slots, maintaining power consumption efficiency while supporting multiple nodes.
3Reliability
If more guaranteed time slots are requested by end devices, then real-time transmission can be ensured, but the conventional allocation mechanism cannot accommodate more than 7 slots per superframe
Solution Approach 1:
The algorithm transitions from the conventional fixed 7-slot limit to a dynamic allocation model that operates in multiple dimensions: it calculates optimal beacon order, superframe order, and packet length conversions simultaneously. The window scheduling algorithm processes node requests in a systematic dimensional approach, allocating slots based on multiple parameters (priority, packet size, timing requirements) rather than being constrained by a single fixed limit. This enables supporting more than 7 periodic nodes while ensuring real-time transmission reliability.
Data Source
AI summary
Provided is an apparatus and method for allocating time slots to nodes without contention in a wireless network. The method for allotting time slots includes: receiveing a packet length and maximum allowable latencies of the nodes and converting them into data in symbol units; determining a beacon order so that a beacon interval representing a length of a superframe is smaller than or equal to a minimum value of the converted maximum allowable latencies; determining a superframe order so that the sum of a length of a beacon frame, a length of a contention access period, and a length of contention free period is smaller than a length of an active portion, based on the converted packet length; and allocating a guaranteed time slot without contention to each node according to an allocation priority order for the nodes.