A Robust Graph Theoretic Solution of Routing in Intelligent Networks

Implementation of robust routing is very critical in network communication. Connecting devices like routers maintain databases for the whole network topology in the routing table. Each router needs to keep these tables updated with the best possible routes so that an efficient communication can alwa...

Full description

Saved in:
Bibliographic Details
Published in:Wireless communications and mobile computing 2022-06, Vol.2022, p.1-7
Main Authors: Qureshi, Muhammad Aasim, Hassan, Mohd Fadzil, Ehsan, Muhammad Khurram, Khan, Muhammad Owais, Ali, Md YeaKub, Khan, Shafiullah
Format: Article
Language:English
Subjects:
Algorithms
Communication
Communication networks
Communications networks
Graphs
Intelligent networks
Military communications
Network topologies
Optimization techniques
Robustness (mathematics)
Routers
Routing (telecommunications)
Shortest-path problems
Tables (data)
Underwater acoustics
Underwater communication
Underwater construction
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Implementation of robust routing is very critical in network communication. Connecting devices like routers maintain databases for the whole network topology in the routing table. Each router needs to keep these tables updated with the best possible routes so that an efficient communication can always take place in nondelay tolerant intelligent networks that include military and tactical systems, vehicular communication networks, underwater acoustic networks, and intelligent sensor networks. The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with OV+E time complexity is proposed to supersede the existing landmark.
ISSN:1530-8669
1530-8677
DOI:10.1155/2022/9661411