Deterministic Media Access Control for Wireless Sensor Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Ad hoc wireless sensor networks face challenges in maintaining high availability and reliability due to non-determinism and overhead in dynamic environments, particularly in aviation applications where deterministic timing and predictable data packet throughput are crucial.

Innovation Solution

A method and system for controlling access to a communication medium by generating a channel allocation schedule with time slots, allowing network nodes to request resources based on bandwidth requirements, and allocating specific time slots on selected channels to ensure deterministic media access control.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If CSMA schemes are used for media access control in wireless sensor networks, then the system allows dynamic ad hoc communication, but network availability and reliability deteriorate as the number of nodes increases due to increased collisions and non-deterministic timing

Engineering Contradiction:
Improvedynamic ad hoc communicationVSAvoidnetwork availability
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The communication medium is segmented into multiple channels, each further divided into time slots within frames. This segmentation allows network nodes to be assigned specific channels and time slots, eliminating collisions while maintaining dynamic communication capabilities. The hierarchical division (channels → frames → time slots) provides structured resource allocation that scales with network size.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system maintains dynamics by allowing network nodes to join and leave the network freely while the coordinator dynamically assigns channels and time slots based on current network conditions and node requirements. The allocation is not static but adapts to changing network topology and traffic patterns, preserving ad hoc versatility while ensuring deterministic access.

Inventive Principle:
Principle #15Dynamics

2Quantity of substance

If more network nodes are added to increase network coverage and sensing capability, then the network's monitoring and data collection capacity improves, but media access reliability deteriorates due to increased contention for the communication medium

Engineering Contradiction:
Improvenumber of sensor nodesVSAvoidmedia access reliability
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The system resolves node contention by adding dimensional separation: first by frequency dimension (multiple channels), then by time dimension (frames and time slots). This multi-dimensional resource allocation allows any number of nodes to coexist without collision, as each node operates in its uniquely assigned channel-time combination, scaling the network capacity while maintaining access reliability.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Reliability

If deterministic timing is implemented through channel allocation schedules, then network availability and reliability improve, but system complexity increases due to coordination and schedule management overhead

Engineering Contradiction:
Improvedeterministic timingVSAvoidcoordination overhead
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system extracts the coordination function from distributed node interactions and centralizes it in a coordinator entity. The coordinator generates and manages the channel allocation schedule, eliminating the need for complex distributed synchronization protocols. This centralization reduces overall system complexity while ensuring deterministic timing, as the coordinator has global knowledge of network state and can make optimal allocation decisions.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The channel allocation schedule acts as an intermediary mechanism between network nodes and the communication medium. Rather than nodes directly competing for medium access, they follow the schedule provided by the coordinator. This intermediary structure simplifies node behavior (just follow the schedule) while the coordinator handles the complexity of resource management, separating concerns and reducing overall system complexity.

Inventive Principle:
Principle #24Intermediary (Mediator)

4Reliability

If time slot allocation is used to provide deterministic access, then collision avoidance and timing predictability improve, but bandwidth utilization efficiency may deteriorate due to guard times and overhead between time slots

Engineering Contradiction:
Improvetiming predictabilityVSAvoidbandwidth utilization
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system uses periodic frames with regular time slot allocations, creating a rhythmic communication pattern. This periodic structure provides timing predictability while allowing efficient packing of data transmissions. The regular frame structure enables nodes to anticipate their transmission opportunities, and the periodic nature allows for optimized guard times that minimize overhead while maintaining deterministic separation between transmissions.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS10462783B2System and method for highly deterministic media access control
Publication Date: 2019.10.29 THE BOEING CO
  • US10462783B2 patent drawing
  • US10462783B2 patent drawing
  • US10462783B2 patent drawing

AI summary

A system and method for providing media access control for networked nodes over a plurality of channels. Each channel is divided into a number of time slots per frame of data organized in a channel allocation schedule. The number of time slots is selected for each channel and is greater than or equal to one per second. Each time slot has a slot transfer rate equal to or less than the maximum channel transfer rate. A server receives a request for channel resources that includes a bandwidth requirement. At least one time slot in a channel corresponding to the bandwidth requirement over a frame time is identified and sent to the requesting node.