Small-World Regular Networks for Communication

A network with a homogeneous degree distribution is considered as a better topology to design a communication network. This is due to equal sharing of the communication channels and the network capacity that improves parallel search and other communication activities. A Regular Network (RN) uses such a topology and gains the benefits offered by the homogeneity of the topology. However, it suffers from increased network delays due to high average path length and diameter. This brief proposes a novel algorithm to generate large size RNs of low diameter and average path length called Small-World Regular Networks (SWRN). The proposed algorithm uses the distribution of prime numbers in a given finite set of positive integers to generate a RN, then applies a random link-swapping mechanism to the network to reduce the diameter and the average path-length, keeping the regularity (degrees) of the network unchanged. The performance of the proposed algorithm has been studied extensively and observed that the proposed algorithm outperforms the existing state-of-the-art algorithms from the literature in terms of networks with shorter diameter and paths while maintaining the properties of the RN.