← Back to Patent Explorer
US6487186B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for managing communication resources using bootstrap slots

Assignee: Rockwell Collins Inc
•
Filing: 1999-06-28
•
Granted: 2002-11-26
•
Expires: 2019-06-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 C. David Young
  • 👤 James A. Stevens
  • 👤 Roy W. Krueger
  • 👤 Michael S. Becker

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 01:07
CPC Classifications
H; H04; H04W; H04W72/00; H04W72/04; H04W72/044; H04W72/0446; H04W28/00; H04W28/02; H04W28/06

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 186 words
A method for automatically managing communication channel resources between nodes having neighboring nodes in a network of nodes, wherein each node communicates 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 a plurality of time slots, the plurality of time slots including bootstrap slots; storing, at each node, an assignment of bootstrap slots in a time frame of a time division to nodes in the network; dynamically adapting the assignment of bootstrap slots based on density of the network; wherein dynamically adapting the assignment of bootstrap slots includes: determining, at a node, which bootstrap slots are assigned to the neighboring nodes of that node; self-assigning, at that node, a first assignment of a bootstrap slot that is not assigned to its neighboring nodes; and transmitting, from that node to its neighboring nodes, a communication during that node's self-assigned bootstrap slot, the communication notifying its neighboring nodes of the first assignment of the bootstrap slot.
Claim 2
Independent Claim 186 words
A method for automatically managing communication channel resources between nodes having neighboring nodes in a network of nodes, wherein each node communicates 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 a plurality of time slots, the plurality of time slots including bootstrap slots; storing, at each node, an assignment of bootstrap slots in a time frame of a time division to nodes in the network; dynamically adapting the assignment of bootstrap slots based on density of the network; wherein dynamically adapting the assignment of bootstrap slots includes: determining, at a node, which bootstrap slots are assigned to the neighboring nodes of that node; self-assigning, at that node, a first assignment of a bootstrap slot that is not assigned to its neighboring nodes; and transmitting, from that node to its neighboring nodes, a communication during that node's self-assigned bootstrap slot, the communication notifying its neighboring nodes of the first assignment of the bootstrap slot.
Claim 3
Dependent Claim 22 words
The method as recited in claim 1 , further comprising: self-assigning an alternative bootstrap slot if the first assignment creates a conflict.
Claim 4
Dependent Claim 63 words
The method as recited in claim 1 , wherein dynamically adapting the assignment of bootstrap slots includes: assigning bootstrap slots to a particular node in the network in a block of bootstrap slots, the number of bootstrap slots in the block being equal to 2 N (two raised to the power of N), wherein N is the number of nodes in the network.
Claim 5
Dependent Claim 94 words
The method as recited in claim 1 , wherein dynamically adapting the assignment includes: defining a first bootstrap cycle having a first half cycle and a second half cycle; identifying when a particular node and its neighboring nodes each have an assigned -bootstrap slot in the first half cycle and no assigned bootstrap slots in the second half cycle; and, if so, then establishing a second bootstrap cycle in which the particular node and its neighboring nodes each have an assigned bootstrap slot, the second bootstrap cycle being shorter than the first bootstrap cycle.
Claim 6
Dependent Claim 27 words
The method as recited in claim 1 , further comprising: maintaining substantially contention free access to the communication channel resources by implementing a unifying slot assignment protocol.
Claim 7
Dependent Claim 165 words
A communication system, comprising: a plurality of transceiver nodes arranged in a network and configured to communicate between transceiver nodes using a time division multiple access structure, each transceiver node having neighboring nodes, the time division multiple access structure including time divisions having time frames, each time frame having time slots, the time slots including bootstrap slots; an assignment table stored at each transceiver node, the assignment table including assignments of bootstrap slots to transceiver nodes; and a bootstrap slot assignment protocol to dynamically adapt the assignment table based on density of the network, wherein the bootstrap slot assignment protocol dynamically adapts the assignment table stored at a transceiver node by determining which bootstrap slots are assigned to that transceiver node's neighboring nodes, newly assigning to that transceiver node one of the bootstrap slots that are not assigned to the neighboring nodes, and transmitting a communication to the neighboring nodes in the newly assigned bootstrap slot, the communication representing a notification of the new assignment.
Claim 8
Dependent Claim 165 words
A communication system, comprising: a plurality of transceiver nodes arranged in a network and configured to communicate between transceiver nodes using a time division multiple access structure, each transceiver node having neighboring nodes, the time division multiple access structure including time divisions having time frames, each time frame having time slots, the time slots including bootstrap slots; an assignment table stored at each transceiver node, the assignment table including assignments of bootstrap slots to transceiver nodes; and a bootstrap slot assignment protocol to dynamically adapt the assignment table based on density of the network, wherein the bootstrap slot assignment protocol dynamically adapts the assignment table stored at a transceiver node by determining which bootstrap slots are assigned to that transceiver node's neighboring nodes, newly assigning to that transceiver node one of the bootstrap slots that are not assigned to the neighboring nodes, and transmitting a communication to the neighboring nodes in the newly assigned bootstrap slot, the communication representing a notification of the new assignment.
Claim 9
Dependent Claim 38 words
The communication system as recited in claim 6 , wherein the bootstrap slot assignment protocol assigns a different bootstrap slot to transceiver node in the event the new assignment creates a conflict with other assignments of bootstrap slots.
Claim 10
Dependent Claim 57 words
The communication system as recited in claim 6 , wherein the bootstrap slot assignment protocol assigns bootstrap slots in blocks to transceiver nodes in the network, the number of bootstrap slots in each block being equal to 2 N (two raised to the power of N), wherein N is the number of transceiver nodes in the network.
Claim 11
Dependent Claim 93 words
The communication system as recited in claim 6 , wherein the bootstrap slot assignment protocol defines a first bootstrap cycle having a first half cycle and a second half cycle, determines whether a particular transceiver node and its neighboring nodes each have an assigned bootstrap slot in the first half cycle and no assigned bootstrap slots in the second half cycle, and, if so, then establishes a second bootstrap cycle for the particular transceiver node and its neighboring nodes to transmit communications, the second bootstrap cycle being shorter than the first bootstrap cycle.
Claim 12
Dependent Claim 27 words
The communication system as recited in claim 6 , further comprising a unifying slot assignment protocol to maintain substantially contention-free access to communication resources of the network.
Claim 13
Independent Claim 142 words
A method for automatically managing communication channel resources between nodes having neighboring nodes in a network of nodes, wherein each node communicates during specific time slots on a time multiplex basis, the method comprising: communicating between nodes using a time division multiple access structure, the time division multiple access structure including specific time slots during which each node communicates, the specific time slots including bootstrap slots; assigning a bootstrap slot to each node; storing a table of assigned bootstrap slots at each node; and adapting the table based on a characteristic of the network; wherein adapting the table includes: determining which of the bootstrap slots are assigned to a node's neighboring nodes; newly assigning to that node a bootstrap slot that is not assigned to that node's neighboring nodes; and transmitting, from that node, a communication during the newly assigned bootstrap slot.
Claim 14
Independent Claim 142 words
A method for automatically managing communication channel resources between nodes having neighboring nodes in a network of nodes, wherein each node communicates during specific time slots on a time multiplex basis, the method comprising: communicating between nodes using a time division multiple access structure, the time division multiple access structure including specific time slots during which each node communicates, the specific time slots including bootstrap slots; assigning a bootstrap slot to each node; storing a table of assigned bootstrap slots at each node; and adapting the table based on a characteristic of the network; wherein adapting the table includes: determining which of the bootstrap slots are assigned to a node's neighboring nodes; newly assigning to that node a bootstrap slot that is not assigned to that node's neighboring nodes; and transmitting, from that node, a communication during the newly assigned bootstrap slot.
Claim 15
Dependent Claim 52 words
The method as recited in claim 11 , wherein adapting the table includes assigning a block of bootstrap slots to a node, the number of bootstrap slots in the block being equal to 2 N (two raised to the power of N), wherein N is the number of nodes in the network.
Claim 16
Dependent Claim 91 words
The method as recited in claim 11 , further comprising: defining a first bootstrap cycle having a first half cycle and a second half cycle; determining whether a node and its neighboring nodes each have an assigned bootstrap slot in the first half cycle and do not have an assigned bootstrap slot in the second half cycle; and, if so, then establishing a second bootstrap cycle in which the node and its neighboring nodes each have an assigned bootstrap slot, the second bootstrap cycle being shorter than the first bootstrap cycle.
Claim 17
Dependent Claim 26 words
The method as recited in claim 11 , further comprising: maintaining substantially contention-free access to the communication channel resources by using a unifying slot assignment protocol.

References Cited (Backward Citations)

US5245609A Cited
US5448698A Cited
US5506848A Cited
US6310867B1 Cited
US5598417A Cited
US5742593A Cited
US5719868A Cited
US6157656A Cited
US5953344A Cited
US6314084B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2005-11-25 2006-05-27 2006-11-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2009-11-25 2010-05-27 2010-11-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2013-11-25 2014-05-27 2014-11-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag