Graph theory metrics of 2G and 3G communication networks

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.