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...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Published: |
Hindawi Limited
2022
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133587852&doi=10.1155%2f2022%2f9661411&partnerID=40&md5=596a59da6c90e65c28c6f0f674d36a10 http://eprints.utp.edu.my/33388/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. © 2022 Muhammad Aasim Qureshi et al. |
|---|