Construct · 1 fields · 1 citations

hidden terminal problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer networking

loss in carrier sensing networks when two senders out of range of each other both reach a common receiver and collide.

In computer networking, hidden terminal problem refers to loss in carrier sensing networks when two senders out of range of each other both reach a common receiver and collide. This meaning comes from Tobagi (1975) in IEEE Transactions on Communications.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how hidden terminal problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

carrier3 fields · 3 citationsjingle · one word, three constructs loss2 fields · 3 citationsjingle · one word, two constructs range4 fields · 6 citationsjingle · one word, four constructs

References

Tobagi, F., & Kleinrock, L. (1975). Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution. IEEE Transactions on Communications, 23(12), 1417-1433. https://doi.org/10.1109/tcom.1975.1092767

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct