Graph theory metrics of 2G and 3G communication networks

  • John Gerard Maunahan Arasa Electrical and Electronics Engineering Institute, University of the Philippines Diliman
  • Charleston Dale Ambatali Electrical and Electronics Engineering Institute, University of the Philippines Diliman
  • Paul Leonard Atchong Hilario Electrical and Electronics Engineering Institute, University of the Philippines Diliman

Abstract

We construct a graph representing a second generation (2G) and third generation (3G) communication network. We derive the average degree, degree distribution, diameter, and average clustering coefficients of the constructed graphs. We find that a large number of nodes has degree = 1 for both networks. This number corresponds to the number of subscribers. Moreover, we find that a 2G network has a higher diameter as compared to a 3G network, however, a 3G network has higher average degree and clustering coefficient. Relationship to network parameters such as congestion, latency, and throughput is discussed.

Published
2018-06-01
How to Cite
[1]
J. G. Arasa, C. D. Ambatali, and P. L. A. Hilario. Graph theory metrics of 2G and 3G communication networks, Proceedings of the Samahang Pisika ng Pilipinas 36, SPP-2018-PC-48 (2018). URL: https://paperview.spp-online.org/proceedings/article/view/SPP-2018-PC-48.
Section
Poster Session C (Mathematical Physics, Optics, and Interdisciplinary Topics)