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 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 O(V+E) time complexity is proposed to supersede the existing landmark.

Automated summary

Robust routing is critical in network communication, maintaining databases for the network topology and requiring updates for efficient communication. Fast construction of shortest-path tree is important in non-delay tolerant intelligent networks.