TY  - JOUR
Y1  - 2022///
PB  - Hindawi Limited
SN  - 15308669
JF  - Wireless Communications and Mobile Computing
A1  - Qureshi, M.A.
A1  - Hassan, M.F.
A1  - Ehsan, M.K.
A1  - Khan, M.O.
A1  - Ali, M.Y.
A1  - Khan, S.
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133587852&doi=10.1155%2f2022%2f9661411&partnerID=40&md5=596a59da6c90e65c28c6f0f674d36a10
VL  - 2022
AV  - none
N2  - 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. © 2022 Muhammad Aasim Qureshi et al.
N1  - cited By 1
ID  - scholars17598
TI  - A Robust Graph Theoretic Solution of Routing in Intelligent Networks
KW  - Graph theory; Intelligent networks; Military communications; Network routing; Network topology; Underwater acoustic communication; Underwater acoustics
KW  -  Efficient communications; Graph theoretics; In networks; Network communications; Network topology; Robust graphs; Robust routing; Routing table; Routings; Shortest Paths Tree
KW  -  Sensor networks
ER  -