Decentralized Wireless Scheduling for Buffer Overflow
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current scheduling algorithms for wireless industrial networks primarily focus on uplink data, neglecting downlink data needs and often lead to buffer overflow issues due to centralized scheduling, which can result in data loss and network malfunction, especially in larger networks.
Innovation Solution
A decentralized scheduling method for wireless local area networks that allocates additional timeslots for both uplink and downlink communications, allowing each network device to manage its own schedule and reduce buffer requirements by interleaving transmitting and receiving timeslots, thereby minimizing data storage needs and avoiding overflow.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized scheduling algorithms are used to manage wireless network communications, then scheduling control can be maintained, but buffer overflow occurs at central nodes leading to data loss
Solution Approach 1:
The patent divides the centralized scheduling function into distributed scheduling units at each network node. Each node independently manages its own buffer and makes local scheduling decisions, segmenting the monolithic centralized control into multiple autonomous decision-making units that prevent buffer overflow at any single point.
Solution Approach 2:
The patent introduces buffer status reporting as an intermediary mechanism where nodes report their buffer status to neighbors, enabling indirect coordination without requiring centralized buffer management. This intermediary information exchange allows distributed nodes to make informed scheduling decisions while maintaining overall network coordination.
2Productivity
If centralized scheduling algorithms allocate timeslots for uplink data, then uplink communication efficiency is improved, but downlink communication requirements are neglected
Solution Approach 1:
The patent designs the distributed scheduling algorithm to be universal, handling both uplink and downlink communications through the same mechanism. Each node can initiate scheduling requests for either uplink or downlink data, and the scheduling algorithm adapts its timeslot allocation based on the direction and type of communication required, making the system versatile for bidirectional industrial communications.
3Ease of operation
If distributed scheduling schemes build schedules sequentially from distal nodes, then local scheduling decisions are made quickly, but network start-up time increases for large networks
Solution Approach 1:
The patent implements preliminary action by pre-calculating and storing optimal path information and buffer status during network initialization. Nodes prepare their scheduling capabilities in advance by establishing neighbor relationships and buffer configurations before actual data transmission begins, reducing the time required for schedule establishment when the network becomes active.
Data Source
AI summary
A network device for a wireless local area network, wherein the network device is operable to wirelessly communicate with a neighbouring device according to a schedule which allocates timeslots to communication between neighbouring devices. The network device has: a wireless receiver operable to receive a request from a child neighbouring device for at least one timeslot for communicating a first amount of data to the network device; a processor configured to allocate timeslots in a schedule to communication between the network device and the child neighbouring device.