IMPLEMENTATION OF CHORDAL RING NETWORK TOPOLOGY TO ENHANCE THE PERFORMANCE OF WIRELESS BROADBAND NETWORK

The expansion of networks involved higher jump on the users utilizing the networks resources, which may require extra higher bandwidth. Due to the development of technology especially those folded under the Internet of Things (IoT), the new demand of higher data rate is been witnesses among the users. In order to feed the demand of users with high data rate, broadband networks are required where high data rate can be ensured for each user. Broadband networks can be established using optical network that carries the data through wide broadband. Areas such as rural and forests sides which are witnessing plenty of natural obstacles such as mountains, trees, seas, etc. are forming big challenge for propagating a cable (wire) or optical network. Due to the limitations of the wire network, World Interoperability for Microwave Access (WiMAX) technology has been introduced as substitution for the broadband network. Such kind of alternative can be deployed through any geographical area without concerning on the wire paths. WiMAX preserved large coverage area and hence it may not suffer from the signal hand-off as in the case of another wireless network. In this project, Chordal Ring network topology is implemented to enhance the performance of wireless broadband network. With different routing protocols such as Destination Sequenced Distance Vector Protocol (DSDV) and Ad hoc On Demand Distance Vector (AODV), the network performance was examined for various Chordal Ring degree (e.g. fourth degree and fifth degree). Performance metrics such as number of transmitted packets, number of received packers, delivered packet rate (PDR), total number of drop packers (DP) and average queuing delay (been measured). Finally, the obtained results had been shown that fifth-degree Chordal Ring network is outperforming through DSDV routing protocol

Multicasting in modified chordal ring of degree six network topology

Wired networking environment has presented some interesting challenges to the study of network casting. Hence, graphs are usually used to represent networks of communication. In practice, the topology should be well-designed to meet future reliability demands. Therefore, Modified Chordal Ring of Degree Six (CHRm6) topology has been proposed as mathematical model to represent a network. This paper discussed about multicasting scheme focusing on even and odd nodes. CHRm6 structure has been used to derive results in multicasting scheme. In this type of network, CHRm6 involved a high total number of nodes to deliver a message to multiple destinations simultaneously in terms of multicasting.

Chromatic numbers and indices of the optimised degree six 3-modified chordal ring network topology

Graph colouring is the labelling of the elements of a graph subject to certain constraints. It is divided into vertex and edge colouring. In both cases, the assignment of labels, traditionally called colours is such that two vertices or edges must not have the same colour. This has various applications, especially in parallel computing. This paper introduces the degree six 3-modified chordal ring, CHR6o3, a parallel network interconnection topology model, and discusses its node and link colouring. Despite its asymmetry, the chromatic number of CHR6o3 cannot be generalised and must be determined specifically based on the combination of chords in each case. Cases where the chromatic index of CHR6o3 is its degree and where it is its one colour more than its degree were generalised and proven. Chromatic numbers are important in minimising the completion times of processes in parallel processing by reducing points of synchronisation, and link colouring aids processor scheduling.

Some graph properties of the optimised degree six 3-modified chordal ring network

The interconnection topology of a parallel or distributed network is pivotal in ensuring good system performance. It can be modelled by a graph, where its edges represent the links between processor nodes represented by vertices. One such graph model that has gained attention by researchers since its founding is the chordal ring, based on an undirected circulant graph. This paper discusses the degree six 3-modified chordal ring, CHR6o3, and presents its graph theoretical properties of symmetry and Hamiltonicity. CHR6o3 is shown to be asymmetric, and can be decomposed into similar subgraphs, each consisting of only one type of node in its class if ring links are ignored. These properties aid both the development of a routing scheme and also determining lower bounds for its chromatic number. Conditions for the existence of a Hamiltonian Circuit within CHR6o3 are also discussed. The existence of a Hamiltonian Circuit within a network simplifies parallel processing as the processors can be arranged to work on a task in a linear array. An Eulerian Circuit was shown to exist in CHR6o3. The existence of an Eulerian Circuit plays a role in routing in optical networks.