Patent US4584771A successfully refreshed from Google Patents.
US5481535A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Datagram message communication service employing a hybrid network
Assignee: General Electric Co
•
Filing: 1994-06-29
•
Granted: 1996-01-02
•
Expires: 2014-06-29
Abstract
Abstract A highly fault tolerant system for datagram communication of information in the form of a message packet employs a distributed network of transmitter/receivers `transceivers`, which interact with `bridge transceivers` which are transceivers connected to a wired network, and wired nodes each having a unique identification ("ID") number. An initiating unit, which may be a transceiver, bridge transceiver or wired node, creates a message packet having an ID of an intended destination unit. If initiated from a transceiver, the message packet finds its way to a wired network by broadcasting the message packet to local transceivers. The transceivers determine valid message packets which have not expired, not been received before and were transmitted without errors. If the message packet is valid and the transceiver ID does not match its internal ID, the transceiver broadcasts the valid message packet to other local transceivers. The transceivers which receive the message packet repeat the process. The message then finds its way to a bridge transceiver connected to a wired network. A `NODE LOC` is embedded in the message packet identifying a closest wired node. The message is routed through the wired network to the wired node and then transmitted as described above to a destination unit by radio signals.
Inventors
- 👤 John E. Hershey
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 20:00
CPC Classifications
H; H04; H04W; H04W40/00; H04W40/24; H04W40/28; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H04L1/1867; H04L1/1874; H04L1/1877; H04L2001/0092; H04L2001/0093; H04L45/00; H04L45/32; H04W4/00; H04W4/06; H04W8/00; H04W8/26
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
308 words
A method of transmitting information over a hybrid network having a plurality of transceivers, bridge transceivers and a wired network with wired nodes, each with a unique internal ID number, comprising the steps of: a) obtaining message information desired to be transmitted; b) determining a destination identification number (ID) for a destination unit intended to receive information packet; c) looking up a NODE LOC code from a predetermined list of wired nodes identifying a wired node closest to the intended destination unit: d) creating a message packet having a message ID, the destination ID, the NODE LOC and the message information; e) providing the message packet to a bridge transceiver connected to the wired network; f) the bridge transceiver looking up the NODE LOC and routing the message packet to the node identified by NODE LOC through the wired network; g) the node at NODE LOC checking the destination ID with its own ID and if the IDs match, the message packet has been successfully transmitted to its intended destination unit, if the IDs do not match, broadcasting the message packet by radio signal to recipient transceivers: h) for each recipient transceiver receiving the broadcast: 1. checking for errors in the received message packet, and sending an acknowledgment signal if received with no errors, 2. identifying if the message is a valid message packet, a valid message packet being one which was received without errors, has not expired and has a message ID which does not match stored message IDs, 3. comparing the destination ID to the internal ID of the recipient transceiver, 4. storing and utilizing valid message packets for which the destination ID matches the internal ID of the recipient transceiver, and 5. re-broadcasting the valid message packets to other recipient transceivers if the destination ID does not match the internal ID of the recipient transceiver.
Claim 2
Independent Claim
308 words
A method of transmitting information over a hybrid network having a plurality of transceivers, bridge transceivers and a wired network with wired nodes, each with a unique internal ID number, comprising the steps of: a) obtaining message information desired to be transmitted; b) determining a destination identification number (ID) for a destination unit intended to receive information packet; c) looking up a NODE LOC code from a predetermined list of wired nodes identifying a wired node closest to the intended destination unit: d) creating a message packet having a message ID, the destination ID, the NODE LOC and the message information; e) providing the message packet to a bridge transceiver connected to the wired network; f) the bridge transceiver looking up the NODE LOC and routing the message packet to the node identified by NODE LOC through the wired network; g) the node at NODE LOC checking the destination ID with its own ID and if the IDs match, the message packet has been successfully transmitted to its intended destination unit, if the IDs do not match, broadcasting the message packet by radio signal to recipient transceivers: h) for each recipient transceiver receiving the broadcast: 1. checking for errors in the received message packet, and sending an acknowledgment signal if received with no errors, 2. identifying if the message is a valid message packet, a valid message packet being one which was received without errors, has not expired and has a message ID which does not match stored message IDs, 3. comparing the destination ID to the internal ID of the recipient transceiver, 4. storing and utilizing valid message packets for which the destination ID matches the internal ID of the recipient transceiver, and 5. re-broadcasting the valid message packets to other recipient transceivers if the destination ID does not match the internal ID of the recipient transceiver.
Claim 3
Dependent Claim
94 words
The method of transmitting information of claim 1 further comprising, after the step of re-broadcasting the valid message packets, the steps of: a) listening for an acknowledgment (ACK) signal from a recipient transceiver which has received the message packet without error; b) comparing a count of ACK signals received to a ROBUSTNESS value in the message packet; c) deleting the message except for the message ID if the count of ACK signals meets or exceeds the ROBUSTNESS value, and d) determining if the message has expired and erasing the message if it has expired.
Claim 4
Dependent Claim
47 words
The method of transmitting information of claim 1 further comprising, after the step of re-broadcasting the valid message packet, the steps of: a) detecting if a collision has occurred; and b) re-broadcasting valid message packet after a randomized delay period to reduce the possibility of another collision.
Claim 5
Dependent Claim
114 words
The method of transmitting information of claim 1 wherein the step of providing the message packet to a bridge transceiver comprises the steps of: a) broadcasting the message packet by radio signal from a transceiver to recipient transceivers; c) for each recipient transceiver receiving the broadcast: 1. checking for errors in the received message packet, and sending an acknowledgment signal if received with no errors, 2. identifying if the message is a valid message packet, a valid message packet being one which was received without errors, has not expired and has a message ID which does not match stored message IDs, 3. comparing the destination ID to an internal ID of the recipient transceiver,
Claim 6
Dependent Claim
45 words
storing and utilizing valid message packets for which the destination ID matches the internal ID of the recipient transceiver, and 5. re-broadcasting the valid message packets to other recipient transceivers until the bridge transceiver whose internal ID matches the destination ID receives the message packet.
Claim 7
Dependent Claim
45 words
storing and utilizing valid message packets for which the destination ID matches the internal ID of the recipient transceiver, and 5. re-broadcasting the valid message packets to other recipient transceivers until the bridge transceiver whose internal ID matches the destination ID receives the message packet.
References Cited (Backward Citations)
US5168498A
Cited
US5319699A
Cited
US5159592A
Cited
US5274841A
Cited
US5295154A
Cited
US5339316A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-01 | 1999-07-03 | 2000-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-01 | 2003-07-03 | 2004-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-01 | 2007-07-03 | 2008-01-02 | $7700.00 | Window Closed / Lapsed |