Research ArticleOpen accessIn the abstractQ-Optimizer: An AI-Based Optimization Framework for Efficient SDN Routing and QoS EnhancementDeepthi Goteti, Vurrury Krishna ReddyWith their rigid layers, traditional networks do not meet evolving traffic demands. As a result, they tend to face congestion along with un-optimized routing. SDN controls traffic management by introducing a programmable control plane, enabling dynamic and intelligent network management. However, older routing techniques, such as Dijkstra's and Multipath, suffer from low adaptability, leading to a rise in latency and … …Journal of Computer Science, Vol. 22, Issue 1 · 3 Feb 2026 · 2,227 accessesView PDFCite
Research ArticleOpen accessIn the abstractTraversal Algorithm for Complete CoverageKavitha Thiayagarajan, Coimbatore Ganeshsankar BalajiThere are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s algorithm finds the shortest path between the source and destination. But in many applications we require complete coverage of the proposed area with obstacle avoidance. There are LSP, LSSP, BSA, spiral-STC … …Journal of Computer Science, Vol. 8, Issue 12 · 15 Dec 2012 · 7,120 accessesView PDFCite
Research ArticleOpen accessIn the abstractConstructing Longest Lifetime Route in Mobile Ad-hoc NetworksFredrick Mtenzi, Yingyu WanA mobile ad hoc network (MANET) is an autonomous system consisting of mobile hosts connected by wireless links. Every host can move in any direction at any speed and time. This leads to a dynamic topology as hosts move constantly. MANET broadcast messages to each hosts, the transmission of one host can be heard by all hosts in its communication … …Journal of Computer Science, Vol. 1, Issue 2 · 19 Oct 2005 · 4,936 accessesView PDFCite