Consistent Network Emerge for N-Hop Network
Girija M.S1, Thiagarajan K2, Tapas Bapu B.R3
1Girija M.S, Department of Computer Science and Engineering, Anna University, Jeppiaar Engineering College, Chennai (Tamil Nadu), India.
2Thiagarajan K, Academic Research Professor, Anna University, Jeppiaar Engineering College, Chennai (Tamil Nadu), India.
3Tapas Bapu B.R, Department of Electronics and Communication, Anna University, S.A. Engineering, Chennai (Tamil Nadu), India.
Manuscript received on 04 July 2019 | Revised Manuscript received on 14 August 2019 | Manuscript Published on 27 August 2019 | PP: 347-350 | Volume-8 Issue-2S4 July 2019 | Retrieval Number: B10660782S419/2019©BEIESP | DOI: 10.35940/ijrte.B1066.0782S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Communication is all about how you get your message across the network. Network theory is a part of grid theory in which a network can be depicted as a grid with nodes and links. Connected grid and completely connected grid representation of the network is converted to agenda reliance chart which illustrates the data dependencies and control dependencies. Fixation of the source node and sink node is made from the agenda reliance chart and the possible numbers of n-hop networks are determined through agenda reliance chart.
Keywords: Agenda Reliance Chart, Grid , N-Hop Network, Shortest Path.
Scope of the Article: Network Coding