US5394436A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Radio frequency local area network
Assignee: Avago Technologies International Sales Pte Ltd
•
Filing: 1994-06-08
•
Granted: 1995-02-28
•
Expires: 2014-06-08
Abstract
Abstract An apparatus and a method for routing data in a radio data communication system having one or more host computers, one or more intermediate base stations, and one or more RF terminals organizes the intermediate base stations into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Communication between the host computer and the RF terminals is achieved by using the network of intermediate base stations to transmit the data.
Inventors
- 👤 Robert C. Meier
- 👤 Ronald E. Luse
- 👤 Ronald L. Mahany
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 07:55
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/02; G06F15/0225; G06F1/00; G06F1/16; G06F1/1613; G06F1/1626; G06K; G06K7/00; G06K7/10; G06K7/10544; G06K7/10821; G06K7/1098; H; H01; H01Q; H01Q1/00; H01Q1/007; H01Q1/12; H01Q1/22; H01Q1/24; H01Q1/241; H01Q21/00; H01Q21/24; H04; H04B; H04B1/00; H04B1/38; H04B1/3827; H04B1/3833; H04B1/69; H04L; H04L1/00; H04L1/0001; H04L1/0002; H04L1/0003; H04L1/0006; H04L1/0007; H04L1/0014; H04L1/0023; H04L1/0025; H04L1/004; H04L1/0056; H04L1/0071; H04L12/00; H04L12/02; H04L12/12; H04L45/00; H04L45/02; H04L45/04; H04L45/44; H04L45/48; H04L9/00; H04L9/40; H04W; H04W48/00; H04W48/08; H04W88/00; H04W88/02; H04W88/06; H04B1/06; H04B1/16; H04B1/1607; H04B1/1615; H04L45/488; H04L69/00; H04L69/14; H04L69/30; H04L69/32; H04L69/322; H04L69/324; H04L69/325; H04L69/326; H04W40/00; H04W40/24; H04W52/00; H04W52/02; H04W52/0209; H04W52/0212; H04W52/0216; H04W52/0219; H04W84/00; H04W84/02; H04W84/10; H04W84/12; H04W88/04; H04W88/14; H04W92/00; H04W92/16; H04W92/20; Y; Y02; Y02D; Y02D30/00; Y02D30/70
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
104 words
An RF multi-hop data communication network comprising: a plurality of mobile terminal nodes; a plurality of bridging nodes which dynamically create and revise communication pathways between any two nodes in the network; each of the bridging nodes independently storing and maintaining local information that specifies how communication packets received should flow through that bridging node toward a destination node; said plurality of bridging nodes, together, forming a spanning tree which specifies the communication pathways in the RF multi-hop communication network; and each bridging node adding to each communication packet received the identity of a next node in a communication pathway to the destination node.
Claim 2
Dependent Claim
104 words
An RF multi-hop data communication network comprising: a plurality of mobile terminal nodes; a plurality of bridging nodes which dynamically create and revise communication pathways between any two nodes in the network; each of the bridging nodes independently storing and maintaining local information that specifies how communication packets received should flow through that bridging node toward a destination node; said plurality of bridging nodes, together, forming a spanning tree which specifies the communication pathways in the RF multi-hop communication network; and each bridging node adding to each communication packet received the identity of a next node in a communication pathway to the destination node.
Claim 3
Dependent Claim
25 words
The RF multi-hop data communication system of claim 1 wherein said bridging nodes using HELLO message -- broadcasts to create and maintain the local information.
Claim 4
Dependent Claim
49 words
The RF multi-hop data communication system of claim 2 further comprising means for calculating the time at which subsequent HELLO message broadcasts are scheduled to be received, permitting nodes which receive the HELLO message broadcasts to enter a power conserving mode until a subsequent HELLO message broadcast is scheduled.
Claim 5
Dependent Claim
34 words
The RF multi-hop data communication system of claim 3 comprising means for offsetting the time of subsequent HELLO message broadcasts, said means for offsetting using a first pseudo-random number generator for generating an offset.
Claim 6
Dependent Claim
25 words
The RF multi-hop data communication system of claim 4 wherein said means for calculating further comprising a second pseudo-random number generator for computing the offset.
Claim 7
Dependent Claim
38 words
The RF multi-hop data communication system of claim 5 further comprising means for passing a seed value between said means for offsetting and said means for calculating so as to synchronize said first and second pseudo-random number generators.
Claim 8
Dependent Claim
78 words
An RF multi-hop data communication system comprising: a plurality of terminal nodes; a plurality of bridging nodes; said bridging nodes comprising means for maintaining communication pathways between any two nodes in the network by repeatedly broadcasting messages identifying itself; and said terminal nodes comprising means for determining the timing between the identifying message broadcasts to be received from the bridging nodes, permitting said terminal nodes to enter a power conserving mode until subsequent identifying message broadcasts are scheduled.
Claim 9
Dependent Claim
78 words
An RF multi-hop data communication system comprising: a plurality of terminal nodes; a plurality of bridging nodes; said bridging nodes comprising means for maintaining communication pathways between any two nodes in the network by repeatedly broadcasting messages identifying itself; and said terminal nodes comprising means for determining the timing between the identifying message broadcasts to be received from the bridging nodes, permitting said terminal nodes to enter a power conserving mode until subsequent identifying message broadcasts are scheduled.
Claim 10
Dependent Claim
41 words
The RF multi-hop data communication system of claim 7 wherein said means for maintaining communication pathways utilizes a spanning tree configuration, and wherein said terminal nodes further comprising means for calculating the time period between identifying message broadcasts to be received.
Claim 11
Dependent Claim
34 words
The RF multi-hop data communication system of claim 8 wherein the means for determining the timing and the means for calculating the time both further comprise pseudo-random number generator using a common seed value.
Claim 12
Dependent Claim
31 words
The RF multi-hop data communication system of claim 9 further comprising means for passing a seed value between said means for determining the timing and the means for calculating the time.
Claim 13
Dependent Claim
58 words
In a multi-hop data communication network having a plurality of bridging nodes, a plurality of terminal nodes comprising: an RF transceiver; means for segmenting digitally encoded data to be transferred into discrete data packets; means responsive to said segmenting means for individually transmitting each discrete data packet; and means for reconstructing discrete data packets into digitally encoded data.
Claim 14
Dependent Claim
58 words
In a multi-hop data communication network having a plurality of bridging nodes, a plurality of terminal nodes comprising: an RF transceiver; means for segmenting digitally encoded data to be transferred into discrete data packets; means responsive to said segmenting means for individually transmitting each discrete data packet; and means for reconstructing discrete data packets into digitally encoded data.
Claim 15
Dependent Claim
31 words
The multi-hop data communication network of claim 11 wherein said terminal nodes further comprise means for digitally encoding voice signals, and means for generating audio signals from digitally encoded voice signals.
Claim 16
Dependent Claim
24 words
The multi-hop data communication network of claim 11 wherein the length of each of said discrete data packets is chosen based on correlation distance.
Claim 17
Dependent Claim
24 words
The multi-hop data communication network of claim 12 wherein the length of each of said discrete data packets is chosen based on correlation distance.
Claim 18
Dependent Claim
28 words
The multi-hop data communication network of claim 11 wherein the plurality of bridging nodes, together, forming a spanning tree which specifies communication pathways in the multi-hop communication network.
Claim 19
Dependent Claim
31 words
The multi-hop data communication network of claim 15 wherein said terminal nodes further comprise means for digitally encoding voice signals, and means for generating audio signals from digitally encoded voice signals.
Claim 20
Dependent Claim
22 words
The multi-hop data communication network of claim 16 wherein the length of said discrete data packets is chosen based on correlation distance.
Claim 21
Dependent Claim
106 words
An RF multi-hop data communication network comprising: a root node; a plurality of bridging nodes; a destination terminal node; a mobile, source terminal node which selects bridging nodes to receive RF data packet transmissions destined for said destination terminal node; said root node and each bridging node having a spanning tree, routing table that lists an address for each node that constitutes a next hop toward an upstream node; and each of said plurality of bridging nodes selecting a next hop address from its routing table in response to an RF data packet received, and transmitting the next hop address along with the RF data packet.
Claim 22
Dependent Claim
106 words
An RF multi-hop data communication network comprising: a root node; a plurality of bridging nodes; a destination terminal node; a mobile, source terminal node which selects bridging nodes to receive RF data packet transmissions destined for said destination terminal node; said root node and each bridging node having a spanning tree, routing table that lists an address for each node that constitutes a next hop toward an upstream node; and each of said plurality of bridging nodes selecting a next hop address from its routing table in response to an RF data packet received, and transmitting the next hop address along with the RF data packet.
Claim 23
Dependent Claim
32 words
The RF multi-hop data communication network of claim 18 wherein said source terminal node comprising means for segmenting a data unit into data packets, and means for sequentially transmitting each data packet.
Claim 24
Dependent Claim
25 words
The RF multi-hop data communication network of claim 19 wherein said destination terminal node comprising means for reconstructing received data packets into the data unit.
Claim 25
Dependent Claim
24 words
The RF multi-hop data communication network of claim 19 wherein the length of each of the data packets is chosen based on correlation distance.
References Cited (Backward Citations)
JPS5310206A
Cited
US4164628A
Cited
US4352955A
Cited
US4369443A
Cited
US4332027A
Cited
US4420682A
Cited
US4679244A
Cited
US4956783A
Cited
US4689786A
Cited
US4670899A
Cited
US4644532A
Cited
US4835372A
Cited
US4789983A
Cited
US5008882A
Cited
US5018133A
Cited
US5055660A
Cited
US4910794A
Cited
US5070536A
Cited
US4916441A
Cited
US4864559A
Cited
US4924462A
Cited
US4940974A
Cited
US5065003A
Cited
US5142531A
Cited
US5142550A
Cited
US5029183A
Cited
US5150360A
Cited
US5058200A
Cited
US5128932A
Cited
US5280480A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-02-27 | 1998-08-29 | 1999-02-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-02-27 | 2002-08-29 | 2003-02-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-02-27 | 2006-08-29 | 2007-02-28 | $7700.00 | Window Closed / Lapsed |