DeAMON Distributed Scheduling Protocol for Wireless Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless technologies face challenges in achieving low latency and high reliability for closed-loop control applications in industrial automation, particularly in mesh-topology environments, due to limitations in bi-directional communication, latency, and scalability.
Innovation Solution
The proposed solution involves a decentralized adaptive multi-hop scheduling protocol, DeAMON, which builds a sequential schedule and allows parallel transmissions, and a novel wireless solution, ENCLOSE, using enhanced physical and MAC layer designs with network coding and adaptive frequency hopping, to ensure reliable and low-latency communication in star-topology environments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If wireless technologies are used for closed-loop control applications, then cost is reduced compared to wired solutions, but latency and reliability deteriorate
Solution Approach 1:
The patent segments the control communication into distinct uplink and downlink phases within a structured frame format. Each phase is allocated specific time slots and resources, allowing independent optimization of transmission parameters for each direction while maintaining overall reliability requirements for closed-loop control
Solution Approach 2:
The patent implements dynamic resource allocation where transmission parameters, time slots, and frequency resources are adaptively adjusted based on channel conditions, traffic requirements, and quality of service metrics. This dynamic adaptation enables wireless medium to meet the reliability demands of closed-loop control while maintaining cost advantages
2Ease of manufacture
If wireless technologies are used for closed-loop control applications, then cost is reduced compared to wired solutions, but latency increases
Solution Approach 1:
The patent establishes preliminary synchronized timing and resource allocation before control data transmission begins. The structured frame format pre-allocates uplink and downlink time slots, allowing devices to prepare transmission buffers and synchronize clocks in advance, thereby minimizing actual control loop latency
Solution Approach 2:
The patent implements continuous transmission opportunities within each frame structure, ensuring that control commands and feedback data are transmitted without unnecessary idle periods. The alternating uplink-downlink phases provide continuous useful communication action, reducing overall cycle time while maintaining wireless cost benefits
3Adaptability or versatility
If decentralized scheduling is implemented in multi-hop networks, then scalability is improved, but coordination complexity increases
Solution Approach 1:
The patent segments the decentralized scheduling into hierarchical levels where root nodes perform higher-level coordination and child nodes execute local scheduling decisions. This segmentation allows networks to scale by adding more child nodes without proportionally increasing overall system complexity
Solution Approach 2:
The patent implements self-service mechanisms where each node autonomously determines its transmission parameters based on locally available information and pre-established protocols. Nodes independently manage their own scheduling without requiring complex centralized coordination, enabling scalable deployment while controlling individual device complexity
Data Source
AI summary
Arrangements described herein provide a distributed means of scheduling communications originating from a control node to nodes in a multi-hop wireless network. By listening for other messages assigning schedules to other nodes, each node is able to create its own local record of scheduled transmissions in its area. This allows each node to determine a preliminary schedule. Having said this, the parent node of the node will have additional information regarding the scheduled local transmissions. Accordingly, the node sends the preliminary schedule to its parent node for confirmation that it provides no collisions/conflicts with other scheduled transmissions. As the parent node is involved in the scheduling of each child node, it is better able to determine whether the child nodes are proposing schedules that may conflict with each other.