US4947484A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Protocol for network having a plurality of intelligent cells
Assignee: Echelon Systems Corp
•
Filing: 1988-11-08
•
Granted: 1990-08-07
•
Expires: 2008-11-08
Abstract
Abstract A network for sensing, communicating and controlling, which uses packets to communicate between a plurality of cells. Cells in a system are given a system identification number (e.g., a 48 bit number). One part of the system identification number (e.g., 32 bits) is transmitted with a packet. The remaining part of this system identification number (e.g., 16 bits) is included in the computation of a cyclic redundancy code (CRC). A receiving cell is able to verify that a packet is intended for it by examining the first part of the system identification number in the packet and by computing and comparing the CRC in the same manner as was done by the transmitting cell.
Inventors
- 👤 William B. Twitty
- 👤 Wendell B. Sander
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 23:52
CPC Classifications
G; G08; G08C; G08C15/00; H; H02; H02J; H02J13/00; H02J13/13; H02J13/1311; H02J13/1337; H05; H05B; H05B47/00; H05B47/10; H05B47/155; Y; Y02; Y02B; Y02B20/00; Y02B20/40; Y02B70/00; Y02B70/30; Y04; Y04S; Y04S20/00; Y04S20/20; Y04S20/242; Y04S20/246
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
93 words
In a network for sensing, communicating and controlling, where packets are communicated between a plurality of cells, an improved method for including in said packets representations of a system identification number of N bits comprising the steps of: including a portion of said N bit identification number in a field within each of said packets; using the remaining bits of said N bit identification number in the calculation of a cyclic redundancy code (CRC), said CRC calculation including other fields in said packet; transmitting the results of said CRC calculation with said packet.
Claim 2
Dependent Claim
93 words
In a network for sensing, communicating and controlling, where packets are communicated between a plurality of cells, an improved method for including in said packets representations of a system identification number of N bits comprising the steps of: including a portion of said N bit identification number in a field within each of said packets; using the remaining bits of said N bit identification number in the calculation of a cyclic redundancy code (CRC), said CRC calculation including other fields in said packet; transmitting the results of said CRC calculation with said packet.
Claim 3
Dependent Claim
49 words
The method defined by claim 1 including the additional steps of: receiving said packet; calculating the CRC for said other fields of said packet using said system identification number in said calculation; comparing the results of said calculation with said results of said CRC calculation transmitted with said packet.
Claim 4
Dependent Claim
31 words
The method defined by claim 1 wherein the portion of said CRC calculation using said remaining bits of said N bit identification number is stored for use in subsequent CRC calculations.
Claim 5
Independent Claim
37 words
The method defined by claims 1 or 2 including the additional step of converting said predetermined fields of said packet into segments of six bit codes where each segment comprises three binary ones and three binary zeroes.
Claim 6
Dependent Claim
133 words
In a network for sensing, communicating and controlling, where a plurality of cells communicate with one another with packets, each of said packets comprising a plurality of first fields, an improvement comprising the steps of: including with said packet a second field the value of which represents the total time waited by all of said cells to transmit one of said packets; including with said packet a first verification number calculated for said first fields, said first number being used to verify the accuracy of transmission of said first fields; including with said packet a second verification number calculated for said second field, said second verification number being used to verify the accuracy of transmission of said second field; whereby said first verification number may be calculated before said second field is determined.
Claim 7
Dependent Claim
133 words
In a network for sensing, communicating and controlling, where a plurality of cells communicate with one another with packets, each of said packets comprising a plurality of first fields, an improvement comprising the steps of: including with said packet a second field the value of which represents the total time waited by all of said cells to transmit one of said packets; including with said packet a first verification number calculated for said first fields, said first number being used to verify the accuracy of transmission of said first fields; including with said packet a second verification number calculated for said second field, said second verification number being used to verify the accuracy of transmission of said second field; whereby said first verification number may be calculated before said second field is determined.
Claim 8
Dependent Claim
16 words
The method defined by claim 5 wherein said first verification number is a cyclic redundancy code.
Claim 9
Dependent Claim
16 words
The method defined by claim 6 wherein said second verification number is a cyclic redundancy code.
Claim 10
Dependent Claim
105 words
In a network having a plurality of cells which communicate with one another with packets, where each of said cells includes processing means for preparing and interpreting said packets, some of said cells for repeating said packets, an improvement comprising: a field in said packets representing the time one or more of said repeater cells waits to transmit a packet; said processing means of each of said repeater cells including means for counting the time said cell waits for transmitting a packet and means for operating upon said field to indicate in said field said time said cell waits, whereby an improved network is realized.
Claim 11
Dependent Claim
105 words
In a network having a plurality of cells which communicate with one another with packets, where each of said cells includes processing means for preparing and interpreting said packets, some of said cells for repeating said packets, an improvement comprising: a field in said packets representing the time one or more of said repeater cells waits to transmit a packet; said processing means of each of said repeater cells including means for counting the time said cell waits for transmitting a packet and means for operating upon said field to indicate in said field said time said cell waits, whereby an improved network is realized.
Claim 12
Dependent Claim
23 words
The improvement defined by claim 8 wherein, when said field reaches a predetermined number, said cell discards said packet rather than transmitting it.
Claim 13
Dependent Claim
18 words
The method defined by claim 9 wherein said processing means calculates a cyclic redundancy code for said field.
References Cited (Backward Citations)
US4134103A
Cited
US4332027A
Cited
US4637022A
Cited
US4639921A
Cited
US4712215A
Cited
US4712214A
Cited
US4807224A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-08-06 | 1994-02-05 | 1994-08-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-08-06 | 1998-02-05 | 1998-08-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-08-06 | 2002-02-05 | 2002-08-07 | $7700.00 | Window Closed / Lapsed |