Telephone Traffic in a Mobile Radio Communication System Using Dynamic Frequency Assignments

IEEE Transactions on Vehicular Technology

Volumn 29, Issue 2, 1980, Pages 270-278

  Sengoku, Masakazu ^a  

^a NIIGATA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

RADIO SYSTEMS, MOBILE;

EID: 0019010416     PISSN: 00189545     EISSN: 19399359     Source Type: Journal    
DOI: 10.1109/T-VT.1980.23851     Document Type: Article

References (18)

1. W. C. Jakes, Jr., Ed. Microwave Mobile Communications. New York: Wiley, 1974.
2. L. Schiff, · “Traffic capacity of three types of common-user mobile radio communication systems”, IEEE Trans. Commun. Technol., vol, COM-18. pp. 12–21. Feb. 1970.
3. H. Staras and L. Schiff, “Spectrum conservation in land mobile radio services.” IEEE Spectrum, vol. 8, pp. 28–36, 1971.
4. D. C. Cox and D. O. Reudink, “Dynamic channel assignment in high-capacity mobile communications system,” Bell Syst. Tech. J., vo1. 50, pp. 1833–1857, July-Aug. 1971
5. D. C. Cox and D. O. Reudink, “A comparison of some channel assignment strategies in large scale mobile communications systems,” IEEE Trans. Commun. vol. COM-20, pp. 190–195, Apr. 1972.
6. D. C. Cox and D. O. Reudink, “Dynamic channel assignment in two-dimensional large-scale mobile radio systems,” Bell Syst. Tech. J., vol. 51. pp. 1611–1629, Sept. 1972.
7. J. S. Engel and Martin M. Peritsky, “Statistically-optimum dynamic server assignment in systems with interfering servers,” IEEE Trans. Commun., vol. COM-21, pp. 1287–1293. Nov. 1973.
8. L. Anderson, “A simulation study of some dynamic channel assignment algorithms in high capacity mobile telecommunications system,” IEEE Trans. Commun., vol, COM-21, pp. 1294-1301 Nov. 1973.
9. D. C. Cox and D. O. Reudink, “Increasing channel occupancy in large-scale mobile radio systems: Dynamic channel reassignment,” IEEE Trans. Commun., vol. COM-21, pp. 1302–1306, Nov. 1973.
10. M. Sengoku, K. Itoh, and T. Matsumoto, “A dynamic frequency assignment algorithm in mobile radio communication systems,” Trans. IECE Japan, vol. E61, pp. 527–533, July 1978.
11. C. Berge, Graphs and Hypergraphs. Amsterdam: North-Holland, 1973.
12. C. Bron and J. Kerbosch, “Finding all cliques of an undirected graph,” Algorithm 457 C. ACM, p. 575, Sept. 1973.
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1975.
14. N. Christofides, Graph Theory, An Algorithmic Approach. New York: Academic, 1975.
15. R. I. Wilkinson, “Theories for toll traffic engineering in the U. S. A,” Bell Syst, Tech. J., vol. 35, pp. 421–514, Mar. 1956.
16. M. Sengoku, T. Kanda, and T. Matsumoto, “Some considerations of telephone traffic in mobile radio communication systems,” Papers Tech. Group IECE Japan, SE76-76, Jan. 1977.
17. E. Ganbe, Telephone Switching Traffic Tokyo: Denkitsushinkyohkai, 1966 (Japanese).
18. M. Akiyama, Modern Communication Switching Engineering. Tokyo: Denkishoin, 1972 (Japanese).