A Preamble to Graph Theory in Communication Network Analysis and its Applications

  • K. Thirugnanasambandam PG & Research Department of Mathematics Muthurangam, Government Arts College, Vellore, Tamil Nadu
  • S. Mahendrakumar Research Scholar in Mathematics, Manonmanium Sundaranar University, Tirunelveli, Tamil Nadu
Keywords: Discrete Mathematical Techniques, Communications, Channel Assignment, Communication Systems, Node Coloring & Location Problem, Heuristic Techniques

Abstract

Communication networks are an essential and pivotal element of the present world. Cell phones, the Internet, and all new applications and administrations gave by these media have changed drastically the manner in which both individual lives and social orders in general are composed. Every one of these administrations rely upon quick and solid information connections, regardless of whether wired or remote. To meet such requirements, information and communication innovation is tested over and over to give quicker conventions, remote interfaces with higher data transmission limit, imaginative instruments to deal with disappointments, etc. For many of those difficulties an assortment of numerical orders contribute in a strong job, either in giving bits of knowledge, proof, or algorithms or as choice help tools. Specifically, the expansive region of algorithmic discrete science assumes a significant part in the plan and operation of communication networks. Notwithstanding, the control is fragmented between logical teaches, for example, unadulterated arithmetic, theoretical computer science, conveyed computing, and operations research. Besides, scientists from communication designing use discrete numerical procedures and build up their own expansions. Graph/network theory results are appropriate to issues in communications. As an agent model, the hub shading issue in graph theory is appropriate to the divert assignment issue in cell portable communication systems. The hub shading issue is NP-complete, implying that ideally settling it is exceptionally troublesome. Consequently, we utilize heuristic algorithms for the channel assignment issue. For this situation, the graph theory results show the authenticity of utilizing heuristic strategies. Then again, we can legitimately apply graph theory to communication issues. Hence, the present study has been taken place with the primary objective of giving an introduction to graph theory in communication network analysis and its applications.

Published
2017-07-28
Statistics
Abstract views: 131 times
PDF downloads: 0 times
Section
Article