Real-Time Neutrosophic Graphs for Communication Networks

Real-Time Neutrosophic Graphs for Communication Networks

Siddhartha Sankar Biswas (Jamia Hamdard (Deemed), India)
Copyright: © 2020 |Pages: 27
DOI: 10.4018/978-1-7998-2555-5.ch015

Abstract

In this century the communication networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. But for a given alive communication network, its complete core topology may not be always available to the concerned communication systems at a given real point of time. Thus, at any real-time instant the complete graph may not be available, but a subgraph of it to the system for executing its communication or transportation activities may be. In this chapter, the author introduces ‘real-time neutrosophic graphs' (RTN-graphs) in which all real-time information (being updated every q quantum of time) are incorporated so that the communication/transportation system can serve very efficiently with optimal results. Although the style and philosophy of Dijkstra's algorithm is followed, the approach is completely new in the sense that the neutrosophic shortest path problem (NSPP) is solved with the real-time information of the network where most of the data are neutrosophic numbers.
Chapter Preview
Top

Background

This section recollects some relevant basic preliminaries, and in particular, the work of [Smarandache(1998a,1998b,2002,2005), Salama(2012), Salama et el (2012)] and few other theoretical works [Ansari et el(2013), Ashbacher(2002), Wang et el(2010), Wang et el(2011), Alblowi(2014)], [Ye(2013)]. Smarandache introduced the neutrosophic components T, I, F which represent the membership, indeterminacy, and non-membership values respectively having the domain for each function the non-standard unit interval. ]-0,1+[ .

Complete Chapter List

Search this Book:
Reset