US4745600A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Network collision detection and avoidance apparatus
Assignee: Motorola Solutions Inc
•
Filing: 1986-04-14
•
Granted: 1988-05-17
•
Expires: 2006-04-14
Abstract
Abstract A technique for regulating the transmission of messages initiated simultaneously by a plurality of nodes of a network, in which clock intervals are established for the network, a sequence of digital values is included in each message and is transmitted to the medium at the rate of one digital value per clock interval, the sequences included in messages that are initiated at the same time by more than one node are transmitted in the same sequence of clock intervals, the presence on the medium of a selected digital value during any clock interval in which a node is transmitting a different digital value within the sequence of a message is detected, and the transmission of the message is interrupted by the node upon such detection, without corrupting another node's transmission.
Inventors
- 👤 Alexander Herman
- 👤 Robert L. Smith, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 22:47
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/40143; H04L12/40163; H04L12/407; H04L12/413; H04L12/4135
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
202 words
In a synchronous digital data communications network having a multiplicity of nodes each having a transmitter and a receiver for connection to a medium, means for regulating the transmission of messages initiated simultaneously by a plurality of nodes, said means for regulating comprising clock means for determining clock intervals for said network, coding means connected to be responsive to said clock means for including in each message a sequence of digital values and for transmitting to said medium each said sequence at a rate of one digital value per clock interval as determined by said clock means, timing means for causing each said sequence included in each one of a plurality of said messages initiated simultaneously by a plurality of said nodes to be transmitted in the same clock intervals, monitoring means connected to be responsive to said medium for detecting the presence on said medium of a selected digital value during any said clock interval in which a node is transmitting a different digital value within said sequence included in a said message, and collision control means connected to be responsive to said monitoring means for interrupting transmission of said message by said node upon such detection by said monitoring means.
Claim 2
Dependent Claim
202 words
In a synchronous digital data communications network having a multiplicity of nodes each having a transmitter and a receiver for connection to a medium, means for regulating the transmission of messages initiated simultaneously by a plurality of nodes, said means for regulating comprising clock means for determining clock intervals for said network, coding means connected to be responsive to said clock means for including in each message a sequence of digital values and for transmitting to said medium each said sequence at a rate of one digital value per clock interval as determined by said clock means, timing means for causing each said sequence included in each one of a plurality of said messages initiated simultaneously by a plurality of said nodes to be transmitted in the same clock intervals, monitoring means connected to be responsive to said medium for detecting the presence on said medium of a selected digital value during any said clock interval in which a node is transmitting a different digital value within said sequence included in a said message, and collision control means connected to be responsive to said monitoring means for interrupting transmission of said message by said node upon such detection by said monitoring means.
Claim 3
Dependent Claim
66 words
The network of claim 1, wherein said coding means codes said different digital value into an energy-free clock interval and codes said selected digital value into an energy-containing clock interval, and said monitoring means causes the receiver of each said node to listen for energy on said medium during each clock interval in which said node is transmitting no energy during transmission of a said sequence.
Claim 4
Dependent Claim
30 words
The network of claim 1 wherein said messages comprise a series of digital values where said digital values are transmitted at a rate of one digital value per clock interval.
Claim 5
Dependent Claim
20 words
The network of claim 1, wherein said sequence is unique to the node initiating the transmission of each said message.
Claim 6
Dependent Claim
16 words
The network of claim 4, wherein said sequence comprises a source address of said initiating node.
Claim 7
Dependent Claim
12 words
The network of claim 1, wherein said digital values are binary values.
Claim 8
Dependent Claim
80 words
The network of claim 6, wherein said coding means further comprises means for converting said binary values into a format wherein one binary level is represented by a pulse during a said clock interval, said pulse comprising a transition of a carrier signal level from low to high and then from high to low during some part of said clock interval, and the other binary level is represented by said carrier signal level remaining low during an entire clock interval.
Claim 9
Dependent Claim
42 words
The network of claim 7, wherein said coding means further comprises means for transmitting said pulse as a burst of RF energy, and means for disabling the transmitter of said transceiver during said clock intervals when said carrier signal level remains low.
Claim 10
Dependent Claim
34 words
The network of claim 1, wherein said clock means comprises means in each said node for deriving said clock intervals from messages received from said network, except when said node is attempting to transmit.
Claim 11
Dependent Claim
26 words
The network of claim 1 wherein said sequence of digital values included in each said message are indicative of a predetermined relative priority of said message.
Claim 12
Dependent Claim
30 words
The network of claim 10 wherein at least a portion of said sequence is unique to said node and represents a predetermined relative priority of messages sent by said node.
Claim 13
Dependent Claim
51 words
The network of claim 10 wherein said messages fall into a plurality of categories having different priorities, and said sequence comprises two portions, one portion being unique to said node, the second portion not being unique to said node, said second portion being indicative of the priority category of said message.
Claim 14
Dependent Claim
35 words
The network of claim 12 wherein said second portion comprises one segment indicative of said priority category, and a second segment indicative of subpriorities of said messages within at least one of said priority categories.
Claim 15
Dependent Claim
11 words
The network of claim 13 wherein said subpriorities are dynamically allocated.
Claim 16
Independent Claim
142 words
A method for regulating the transmission of messages initiated simultaneously by a plurality of nodes in a synchronous digital data communications network that includes a multiplicity of nodes each having a transmitter and a receiver for connection to a medium, comprising the steps of establishing clock intervals for said network, including in each message a sequence of digital values and transmitting to said medium each sequence at a rate of one digital value per clock interval, causing sequences included in a plurality of messages initiated simultaneously by a plurality of nodes to be transmitted in the same sequence of clock intervals, detecting the presence on said medium of a selected digital value any clock interval in which a node is transmitting a different value within said sequence of a message, and interrupting transmission of said message by said node upon said detection.
Claim 17
Independent Claim
142 words
A method for regulating the transmission of messages initiated simultaneously by a plurality of nodes in a synchronous digital data communications network that includes a multiplicity of nodes each having a transmitter and a receiver for connection to a medium, comprising the steps of establishing clock intervals for said network, including in each message a sequence of digital values and transmitting to said medium each sequence at a rate of one digital value per clock interval, causing sequences included in a plurality of messages initiated simultaneously by a plurality of nodes to be transmitted in the same sequence of clock intervals, detecting the presence on said medium of a selected digital value any clock interval in which a node is transmitting a different value within said sequence of a message, and interrupting transmission of said message by said node upon said detection.
Claim 18
Dependent Claim
71 words
The method of claim 15 wherein said step of including comprises coding said different digital value into an energy-free clock interval, and said selected digital value into an energy containing clock interval, and said step of detecting includes causing the receiver of each of said node to listen for energy on said medium during each clock interval in which said node is transmitted no energy during transmission of a said sequence.
Claim 19
Dependent Claim
28 words
The method of claim 15 wherein said step of including comprises causing said sequence of digital values to be indicative of a predetermined relative priority of said message.
Claim 20
Dependent Claim
51 words
The network of claim 1 wherein said digital value present on said medium during said clock interval is part of one of said messages transmitted by another said node and said other node is permitted to continue transmitting said message after said collision control means interrupts transmission by said first node.
Claim 21
Dependent Claim
29 words
The network of claim 1 wherein said node whose transmission is interrupted is able to receive the entirety of the message with which its own interrupted transmission had collided.
Claim 22
Dependent Claim
27 words
The network of claim 1 wherein each said node has an address within said network, and said digital values included in said message correspond to said address.
Claim 23
Dependent Claim
14 words
The network of claim 20 wherein each said address is unique within said network.
References Cited (Backward Citations)
US3986122A
Cited
US3781803A
Cited
US3825829A
Cited
US4063220A
Cited
US3955140A
Cited
US4013959A
Cited
US4135057A
Cited
US4335468A
Cited
US4295122A
Cited
US4259663A
Cited
US4380761A
Cited
US4428061A
Cited
US4402073A
Cited
US4394760A
Cited
US4409684A
Cited
US4479228A
Cited
US4380088A
Cited
US4384363A
Cited
US4484353A
Cited
US4488218A
Cited
US4464658A
Cited
US4476467A
Cited
US4491942A
Cited
US4623886A
Cited
US4630261A
Cited
US4611334A
Cited
US4644348A
Cited
US4610010A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-05-17 | 1991-11-16 | 1992-05-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-05-17 | 1995-11-16 | 1996-05-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-05-17 | 1999-11-16 | 2000-05-17 | $7700.00 | Window Closed / Lapsed |