Patent US4485860A successfully refreshed from Google Patents.
Patent US3017402A successfully refreshed from Google Patents.
Patent US6574199B1 successfully refreshed from Google Patents.
US6574199B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Unifying slot assignment protocol logical neighborhooding
Assignee: Rockwell Collins Inc
•
Filing: 1999-04-30
•
Granted: 2003-06-03
•
Expires: 2019-04-30
Abstract
Abstract A heuristic logical neighborhooding technique is applied to dynamic wireless networking. Logical neighborhooding, provides for the formation of logical neighborhoods across a plurality of channels when such need arises due to increased network density. The technique utilizes a time division multiple access structure including bootstrap slots, broadcast slots, and traffic slots.
Inventors
- 👤 C. David Young
- 👤 James A. Stevens
- 👤 Roy W. Krueger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 00:59
CPC Classifications
H; H04; H04W; H04W16/00; H04W16/02; H04W16/10; H04W72/00; H04W72/02; H04W72/04; H04W72/044; H04W72/0446; H04W74/00; H04W74/04; H04W76/00; H04W76/10; H04W84/00; H04W84/18
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
167 words
A method for automatically managing the communication channel resources between two nodes having neighboring nodes in a network of transceiver nodes, wherein each node communicates during specific time slots and uses multiple frequencies on a time multiplex basis, the method comprising: storing possible communication time slots and frequencies between nodes in the network at each node; announcing and transmitting from a first node during a specific time slot, a specific transmit slot and frequency and the identification of a second node to all neighboring nodes of the first node comprising a first set of neighboring nodes; transmitting from the first node a control packet containing transmit and receive information of the first node and the first set of neighboring nodes; identifying in the first set of neighboring nodes the announced selected transmit slot and frequency used to establish substantially contention free communication on the selected transmit slot and frequency between the first and second nodes; and adapting to the transceiver node network density by utilizing logical neighborhooding.
Claim 2
Independent Claim
167 words
A method for automatically managing the communication channel resources between two nodes having neighboring nodes in a network of transceiver nodes, wherein each node communicates during specific time slots and uses multiple frequencies on a time multiplex basis, the method comprising: storing possible communication time slots and frequencies between nodes in the network at each node; announcing and transmitting from a first node during a specific time slot, a specific transmit slot and frequency and the identification of a second node to all neighboring nodes of the first node comprising a first set of neighboring nodes; transmitting from the first node a control packet containing transmit and receive information of the first node and the first set of neighboring nodes; identifying in the first set of neighboring nodes the announced selected transmit slot and frequency used to establish substantially contention free communication on the selected transmit slot and frequency between the first and second nodes; and adapting to the transceiver node network density by utilizing logical neighborhooding.
Claim 3
Dependent Claim
30 words
The method of claim 1 wherein logical neighborhooding is used when the number of nodes in a neighborhood is greater than the number of time slots in a broadcast cycle.
Claim 4
Dependent Claim
15 words
The method of claim 1 wherein time slots are assigned first on a primary channel.
Claim 5
Dependent Claim
23 words
The method of claim 3 wherein time slots are assigned on a secondary channel when no slots are available on the primary channel.
Claim 6
Dependent Claim
26 words
The method of claim 1 wherein the network of transceiver nodes is divided into a plurality of neighborhoods, each neighborhood substantially communicating on a separate channel.
Claim 7
Dependent Claim
19 words
The method of claim 1 wherein substantially contention free access is maintained by a unifying slot assignment protocol (USAP).
Claim 8
Dependent Claim
20 words
The method of claim 1 wherein the possible communication time slots and frequencies are stored in assigned slot records (ASR).
Claim 9
Dependent Claim
19 words
The method of claim 7 wherein substantially contention free access is maintained by a unifying slot assignment protocol (USAP).
Claim 10
Dependent Claim
15 words
The method of claim 8 wherein the USAP utilizes the information stored in the ASR.
Claim 11
Dependent Claim
15 words
The method of claim 8 wherein the USAP coordinates consistent slot assignments between logical neighborhoods.
Claim 12
Dependent Claim
17 words
The method of claim 10 wherein the USAP is used to establish communication between the logical neighborhoods.
Claim 13
Dependent Claim
90 words
A communication network comprising: a network of transceiver nodes, each node having neighbors, utilizing a time division multiple access structure, the time division multiple access structure having broadcast slots, and traffic slots, and each node including, a boot manager, including a logical neighborhooding protocol; a slot assignment protocol that chooses the number of slots to assign to each neighboring node and coordinates the activation of the slots for the neighboring nodes; a slot allocation storage, communicating with the slot assignment protocol; and a channel access communicating with the boot manager.
Claim 14
Dependent Claim
90 words
A communication network comprising: a network of transceiver nodes, each node having neighbors, utilizing a time division multiple access structure, the time division multiple access structure having broadcast slots, and traffic slots, and each node including, a boot manager, including a logical neighborhooding protocol; a slot assignment protocol that chooses the number of slots to assign to each neighboring node and coordinates the activation of the slots for the neighboring nodes; a slot allocation storage, communicating with the slot assignment protocol; and a channel access communicating with the boot manager.
Claim 15
Dependent Claim
16 words
The communication network of claim 12 wherein the time division multiple access structure includes bootstrap slots.
Claim 16
Dependent Claim
15 words
The communication network of claim 12 wherein the boot manager handles the node allocation process.
Claim 17
Dependent Claim
25 words
The communication network of claim 12 wherein the logical neighborhooding protocol produces a plurality of logical neighborhoods, each logical neighborhood being on a separate channel.
Claim 18
Dependent Claim
23 words
The communication network of claim 12 wherein the slot assignment receives information from the boot manager in an assigned slot records (ASR) format.
Claim 19
Dependent Claim
31 words
The communication network of claim 12 wherein the boot manager creates logical neighborhoods when the number of nodes in a neighborhood exceeds twice the number of frames in a broadcast cycle.
Claim 20
Independent Claim
180 words
A method of automatically managing the communication channel resources between two nodes having neighboring nodes in a network of transceiver nodes, wherein each node communicates during specific time slots and uses multiple frequencies on a time multiplex basis, the method comprising: storing possible communication time slots and frequencies between nodes in the network of each node; announcing and transmitting from a first node during a specific time slot, a specific transmit slot and frequency and the identification of a second node to all neighboring nodes of the first node comprising a first set of neighboring nodes; transmitting from the first node a control packet containing transmit and receive information of the first node and the first set of neighboring nodes; identifying in the first set of neighboring nodes the announced selected transmit slot and frequency used to establish substantially contention free communication on the selected transmit slot and frequency between the first and second nodes; and adapting to the transceiver node network density by creating logical neighborhoods over a plurality of frequencies when the network density exceeds a predetermined limit.
Claim 21
Independent Claim
180 words
A method of automatically managing the communication channel resources between two nodes having neighboring nodes in a network of transceiver nodes, wherein each node communicates during specific time slots and uses multiple frequencies on a time multiplex basis, the method comprising: storing possible communication time slots and frequencies between nodes in the network of each node; announcing and transmitting from a first node during a specific time slot, a specific transmit slot and frequency and the identification of a second node to all neighboring nodes of the first node comprising a first set of neighboring nodes; transmitting from the first node a control packet containing transmit and receive information of the first node and the first set of neighboring nodes; identifying in the first set of neighboring nodes the announced selected transmit slot and frequency used to establish substantially contention free communication on the selected transmit slot and frequency between the first and second nodes; and adapting to the transceiver node network density by creating logical neighborhoods over a plurality of frequencies when the network density exceeds a predetermined limit.
Claim 22
Dependent Claim
19 words
The method of claim 18 wherein the predetermined limit is the number of time slots in a broadcast cycle.
Claim 23
Dependent Claim
16 words
The method of claim 18 wherein the time slots are assigned first on a primary channel.
Claim 24
Dependent Claim
21 words
The method of claim 18 wherein the slots are assigned in subsequent channels when no slots are available on preceding channels.
Claim 25
Dependent Claim
19 words
The method of claim 18 wherein substantially contention free access is maintained by a unifying slot assignment protocol (USAP).
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-06-02 | 2006-12-02 | 2007-06-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-06-02 | 2010-12-02 | 2011-06-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-06-02 | 2014-12-02 | 2015-06-03 | $7700.00 | Window Closed / Lapsed |