# US 2003/0067906 A1 · Method and apparatus for managing communication resources using speculation slots

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0067906 A1
- Document ID: US20030067906A1
- Status: Published application
- Kind: A1
- Application number: 09/340,467
- Filed: 1999-06-28
- Published: 2003-04-10
- Earliest claimed: 1999-06-28
- Assignees: Rockwell Collins, Inc.
- Inventors: C. DAVID YOUNG
- Web page: https://patentgrep.com/patent/US20030067906A1

## CPC

- H04W 72/535: {based on resource usage policies}
- H04B 7/2656: {for structure of frame, burst}
- H04W 74/04: Scheduled access (hybrid access H04W74/02)
- H04W 24/00: Supervisory, monitoring or testing arrangements
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04W 72/20: Control channels or signalling for resource management
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04B: TRANSMISSION

## Abstract

A method and system for managing communication resources between nodes in a network, and more particularly to a dynamic distributed multi-channel time division multiple access (TDMA) slot assignment method is presented. The method and apparatus include a set of higher level heuristics that enable the wireless channel access scheme to address predetermined characteristics of the wireless channel access system. These predetermined heuristics include using bootstrap slots, adaptive broadcast cycles, channelized neighborhoods, standby slots, speculation slots, neighbor segregation, hard circuits, and soft circuits.

## Claims

### Claim 1

A method for automatically managing communication channel resources between nodes in a network of nodes, wherein each node has neighboring nodes in the network and each node is configured to communicate during specific time slots on a time multiplex basis, the method comprising:
communicating between nodes in the network using a time division multiple access structure, the time division multiple access structure including time divisions having time frames, each time frame having time slots to communicate between nodes in the network;
storing, at each node, an assignment of possible time slots to communicate between nodes in the network; and
announcing, at a first node to neighboring nodes of the first node, during a first time slot in a particular time frame, an available time slot from the assignment of possible time slots in the particular time frame, the available time slot arranged subsequent to the first time slot in the particular time frame.

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein the time slots in a time frame include bootstrap slots and standby slots, and the first time slot is one of the bootstrap slots in the particular time frame.

### Claim 3 (depends on 2)

The method as recited in claim 2, wherein the available time slot in the particular time frame is one of the standby slots.

### Claim 4 (depends on 1)

The method as recited in claim 1, further comprising:
transmitting a communication during the available time slot.

### Claim 5 (depends on 4)

The method as recited in claim 4, further comprising:
determining successful receipt of the transmitted communication; and, if not successful,
retransmitting the communication.

### Claim 6 (depends on 1)

The method as recited in claim 1, further comprising:
determining, at a second node, if an addressed neighboring node of a queued communication at the second node can receive a communication during the available time slot; and, if so, then
transmitting the queued communication to the addressed neighboring node during the available time slot.

### Claim 7 (depends on 1)

The method as recited in claim 1, further comprising:
determining, at a second node, potential for a transmission collision during the available time slot.

### Claim 8 (depends on 7)

The method as recited in claim 7, wherein determining the potential for a transmission collision includes determining if any of the neighboring nodes of the second node that are not also neighboring nodes of the first node can receive a communication during the available time slot.

### Claim 9 (depends on 1)

The method as recited in claim 1, wherein communicating between nodes further comprises implementing a unifying slot assignment protocol.

### Claim 10

A communication system, comprising:
a plurality of transceiver nodes arranged in a network, each transceiver node having neighboring nodes and being configured to communicate on the network using a time division multiple access structure,
the time division multiple access structure including time divisions, each time division having time frames, each time frame having time slots; and
an assignment of possible time slots, stored at each transceiver node, the assignment including possible time slots during which the transceiver nodes may communicate on the network; and
a communication access protocol to allow a particular transceiver node communication access to an available possible time slot assigned to one of the neighboring nodes of the particular transceiver node.

### Claim 11 (depends on 10)

The communication system as recited in claim 10, wherein the time slots in a time frame include bootstrap slots and standby slots and the possible time slot assigned to the one of the neighboring nodes is one of the standby slots.

### Claim 12 (depends on 10)

The communication system as recited in claim 10, wherein the time slots in a time frame include bootstrap slots and standby slots, and a neighboring node announces availability of one of its possible time slots in the time frame by a communication transmitted during one of the bootstrap slots in the time frame.

### Claim 13 (depends on 10)

The communication system as recited in claim 10, further comprising an error detection protocol to allow the particular transceiver node to determine success of a communication transmitted by the particular transceiver node during the available possible time slot.

### Claim 14 (depends on 10)

The communication system as recited in claim 10, wherein the particular transceiver node determines, based on the assignment of possible time slots, whether an addressed neighboring node of a queued communication can receive communications during the available possible time slot.

### Claim 15 (depends on 10)

The communication system as recited in claim 10, wherein the particular transceiver node determines potential for a transmission collision during the available possible time slot.

### Claim 16 (depends on 10)

The communication system as recited in claim 10, wherein the transceiver nodes communicate on the network using a unifying slot assignment protocol.

### Claim 17

A method for automatically managing communication channel resources between nodes in a network of nodes, wherein each node has neighboring nodes in the network and each node is configured to communicate during specific time slots on a time multiplex basis, the method comprising:
communicating between nodes in the network using a time division multiple access structure, the time division multiple access structure including time divisions having time frames, each time frame having time slots to communicate between nodes in the network, the time slots including bootstrap slots and standby slots;
storing, at each node, an assignment of possible time slots to communicate between nodes in the network; and
identifying an unused standby slot from the assignment of possible time slots in an upcoming time frame.

### Claim 18 (depends on 17)

The method as recited in claim 17, further comprising:
controlling the communicating between nodes by implementing a unifying slot assignment protocol.

### Claim 19 (depends on 17)

The method as recited in claim 17, further comprising:
announcing the unused standby slot in one of the bootstrap slots in the upcoming time frame.

### Claim 20 (depends on 17)

The method as recited in claim 17, further comprising:
determining, at a particular node, based on the stored assignment, whether any of the neighboring nodes of the particular node may receive communications during the identified unused standby slot.

### Claim 21 (depends on 17)

The method as recited in claim 17, further comprising:
determining, at a particular node, potential for a transmission collision during the identified unused standby slot.
