Maximal Selection in Tandem Networks with Symmetric Hearing Range
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.
Unable to display preview. Download preview PDF.
- [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
- [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
- [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
- [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
- [Ro]Ross, M.S., Applied Probability, Models with Optimization Application,“ Holden-Day, San Francisco, 1970.Google Scholar
- [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