Advertisement

Maximal Selection in Tandem Networks with Symmetric Hearing Range

  • Jeffrey M. Jaffe
  • Zvi Rosberg
Conference paper
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 83)

Abstract

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 buffer a mes-sage destined to one of its neighbors. 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 a small hearing range we show that a greedy selection, which can be used as a lower bound is quite close to an upper bound. We also specify a sequence of upper bounds which converge to the maximal throughput.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [EGMT]
    Even, S., Goldreich, O., Moran, S. and Tong, P., “On the NP completness of Some Network Testin, Problems” Networks, Vol. 14, pp. 1–24, 1984.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [JaRol]
    Jaffe, J.M. and Rosberg, Z, “Maximal Throughput in a Tandem Multihop Netvvork”, IBM Israel Scientific Center Technical Report 88. 151, March 1985.Google Scholar
  3. [DaRo2]
    Jaffe, J.M. and Rosberg, Z, “Dynamic Behavior of Tandem Packet Radio Network”, IBM Israel Scientific Center Technical Report 88. 159, May 1985.Google Scholar
  4. [DaRo3]
    Jaffe, J.M. and Rosberg, Z, “Maximal Throughput of a Tandem Network with Symmetric Hearing Range’’, IBM Israel Scientific Center Technical Report, June 1985.Google Scholar
  5. [NeKl]
    Nelson, R. and Kleinrock, L., “Mean Message Delay in Multi-hop Packet Radio Networks Using Spatial - TDMA”, ICC, pp. lc.4.1–1c. 4. 4, 1982.Google Scholar
  6. [Ro]
    Ross, M.S., Applied Probability, Models with Optimization Application,“ Holden-Day, San Francisco, 1970.Google Scholar
  7. [SiKl]
    Silvester, A.J. and Kleinrock, L., “On the Capacity of Multi-hop Slotted ALOHA Networks with Regular Structure’’, IEEE Rans. Commun., Vol. COM-31, No. 8, pp. 974–984, 1983.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1986

Authors and Affiliations

  • Jeffrey M. Jaffe
    • 1
  • Zvi Rosberg
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations