Wireless Network Scheduling via Broadcast Tree Node Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless sensor networks, data transmission collisions and delayed reception due to duty cycle scheduling lead to increased energy consumption and network delays, necessitating a method to efficiently manage collisions to reduce broadcast waiting time.
Innovation Solution
A scheduling method that generates a broadcast tree, dividing nodes into primary and secondary nodes based on predetermined criteria, allowing collisions only in secondary nodes, and reallocating time slots to minimize broadcast waiting time by prioritizing collision-free transmission in primary nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If broadcast scheduling is performed to avoid all collisions in wireless sensor network, then collision-free data transmission is achieved, but additional network delay is caused
Solution Approach 1:
The patent applies local quality by differentiating between primary nodes (requiring collision-free transmission) and secondary nodes (allowing collisions). This selective approach optimizes the broadcast waiting time by allowing controlled collisions in less critical nodes while maintaining reliability in primary nodes, thus resolving the contradiction between collision avoidance and delay reduction.
2Use of energy by moving object
If duty cycle is applied to save energy consumption in wireless sensor network, then energy efficiency is improved, but data transmission delay becomes more serious
Solution Approach 1:
The patent employs dynamics by allowing flexible collision handling in secondary nodes while maintaining strict collision avoidance in primary nodes. This dynamic scheduling approach enables the network to adapt between energy-saving duty cycle operation and timely data transmission by selectively permitting collisions only in non-critical nodes, thus balancing energy efficiency with transmission delay.
3Device complexity
If sensor node performs only one of data transmission or reception in one time slot, then simple scheduling is maintained, but data transmission delay and collision problem become more serious
Solution Approach 1:
The patent applies segmentation by dividing nodes into primary and secondary categories with different collision handling policies. This segmentation allows the system to maintain simple scheduling for primary nodes while enabling more flexible, collision-tolerant scheduling for secondary nodes, thereby reducing overall transmission delay without significantly increasing scheduling complexity.
Data Source
AI summary
The present disclosure relates to a scheduling method and apparatus of a wireless network and a scheduling method of a wireless network is a scheduling method of a wireless network including a plurality of nodes, the method including: generating a broadcast tree to transmit data from a source node to a sink node, dividing nodes included in the broadcast tree into a primary node which does not allow collision and a secondary node which allows collision at the time of receiving data, in accordance with predetermined criteria; and allocating a time slot in which nodes included in the broadcast tree operate, based on the divided result.