A Robust Graph Theoretic Solution of Routing in Intelligent Networks. (20th June 2022)

• Record Type: Journal Article
• Authors: Qureshi, Muhammad Aasim; Hassan, Mohd Fadzil; Ehsan, Muhammad Khurram; Khan, Muhammad Owais; Ali, Md YeaKub; Khan, Shafiullah
• Other Names: Rabie Khaled Maaiuf Academic Editor.
• Is Part Of: Wireless communications and mobile computing. Volume 2022(2022)
• Publication Date: 2022-06-20
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1155/2022/9661411
• Languages: English
• ISSNs: 1530-8669

Abstract

Abstract : 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.