Decentralized Time Slot Re-assignment in Wireless Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Wireless communication networks face inefficiencies when managing large numbers of nodes, particularly in allocating and re-assigning time slots, especially when a central network authority is not immediately accessible and when constraints like the Unifying Slot Assignment Protocol (USAP) restrict simultaneous use by nodes within three hops.

Innovation Solution

A decentralized method where nodes share information to determine which nearby nodes can use unused time slots, allowing nodes at least three hops apart to use a time slot, and enabling resource-rich nodes to loan or yield slots to needy nodes without violating USAP constraints.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a central network authority is used to allocate and re-assign time slots, then slot allocation can be centralized and coordinated, but the system becomes less efficient and slower when the central authority is not immediately accessible to all nodes

Engineering Contradiction:
Improvecoordination of slot allocationVSAvoidtime to re-assign slots
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts the slot allocation function from the central network authority and implements it locally at each node. Each node independently determines whether to re-assign unused slots to neighboring nodes based on local information exchange, eliminating the time delay associated with central authority coordination while maintaining slot allocation coordination through distributed decision-making.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent combines the functions of slot allocation, monitoring, and re-assignment at each individual node. Each node not only uses its own allocated slots but also monitors unused slots and autonomously decides on re-assignment to neighbors, merging multiple previously separate functions into a unified local decision-making process that improves responsiveness.

Inventive Principle:
Principle #5Merging (Combining)

2Productivity

If time slots are re-assigned to maximize network efficiency, then slot utilization improves, but conflicts may arise when nodes less than three hops apart simultaneously use the same time slot

Engineering Contradiction:
Improveslot utilization efficiencyVSAvoidconflict-free transmission
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent applies different quality constraints to different spatial locations in the network. Nodes that are three or more hops apart are permitted to simultaneously use the same time slot, while nodes closer than three hops must maintain exclusive slot usage. This local differentiation of access rights maximizes slot utilization while preventing conflicts through spatially-aware quality control.

Inventive Principle:
Principle #3Local quality

3Productivity

If nodes are permitted to use unused time slots from other nodes, then network efficiency increases, but the complexity of managing slot assignments increases

Engineering Contradiction:
Improvenetwork communication efficiencyVSAvoidslot management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where each node autonomously manages its own slot usage and independently evaluates opportunities to use unused slots from neighbors. Nodes exchange basic information about their slot usage status and independently make re-assignment decisions without requiring complex centralized management or intricate coordination protocols, thereby increasing efficiency while limiting complexity growth.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS7382799B1On-demand broadcast protocol
Publication Date: 2008.06.03 ROCKWELL COLLINS INC
  • US7382799B1 patent drawing
  • US7382799B1 patent drawing
  • US7382799B1 patent drawing

AI summary

A method of communicating over a network of nodes using a plurality of time slots is disclosed. According to the method, at least one of the plurality of time slots are assigned to a first node. The first node communicates, to neighboring nodes within one hop of the first node, which time slots assigned to the first node are scheduled to be used by the first node. Each neighboring node determines whether it has a need to use more time slots than it has been assigned. Each neighboring node communicates its respective need to the first node. At least one of the neighboring nodes is permitted to use one of the unscheduled time slots.