Maximal Selection in Tandem Networks with Symmetric Hearing Range

Jeffrey M. Jaffe, Zvi Rosberg

Research output: Contribution to journalArticlepeer-review


We consider an infinite tandem network in which every node is capable of hearing its neighbors up to a given distance n. At any moment of time every node may contain in the top of its queue a message destined to one of its neighbors. This network can be used as a model for a microwave or optic link with many users. For small and large n we investigate the maximal selection of nodes in the network, for which their transmissions are collision-free. For a large hearing range we show that the upper bound on the maximal selection, which is found herein, is asymptotically achievable. For small hearing ranges we show that a greedy selection is better but not asymptotically optimal. We also specify a sequence of upper bounds which converge to the maximal throughput.

Original languageEnglish
Article number343
Pages (from-to)343-364
Number of pages22
StatePublished - Jun 1989
Externally publishedYes


  • Collisionfree algorithm
  • Maximal utilization
  • Multihop communication networks
  • Tandem networks

ASJC Scopus subject areas

  • Computer Science (all)
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Maximal Selection in Tandem Networks with Symmetric Hearing Range'. Together they form a unique fingerprint.

Cite this