Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

22 results for “Optimal Route”
Set a search alert
Research ArticleOpen accessIn the keywordsEnergy Aware Multiple Constraints Quality of Service Routing Protocol with Dynamic Mobility Prediction for Mobile Ad hoc NetworksSenthilkumar Maruthamuthu, Somasundaram SankaralingamProblem statement: This study presents a source based reactive protocol called "Energy Aware Multiple Constraints QoS Routing Protocol with Dynamic Mobility Prediction (EMQRPDM)" for MANET. It is an enhanced version of our previous protocol called "Power aware multiple QoS constraints routing protocol with mobility prediction (PMQRPMP)". It addresses the issues such as routing, mobility and power management in MANET. Approach: … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,477 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDynamic Weighting Technique Based Arctic Puffin Optimization for Energy Efficient Data Transmission in Wireless Sensor NetworksM. Bharathraj Kumar, S. Avinash, Prakash G. Gani, Prathapchandra ShettyWireless Sensor Networks (WSNs) are designed using various sensor nodes, which are employed for communication in diverse applications that include healthcare, industrial areas, and smart cities. Specifically, WSNs demand energy-efficient clustering and routing mechanisms that assist in extending network lifetime due to the limited battery capacity of sensor nodes. However, many existing meta-heuristic-based approaches incorporate fixed objective weights that struggle … …Journal of Computer Science, Vol. 22, Issue 9 · 10 Sep 2026 · 767 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimized Earthquake Evacuation Routes Using Dijkstra's Algorithm and WinQSBSandra Huarcaya Gonzales, Hugo Vega-Huerta, Gisella Luisa Elena Maquen-Niño et al.This research analyzes and generates optimal evacuation routes in the Barranco district during earthquake scenarios using the Dijkstra algorithm implemented through WinQSB. A preliminary review was conducted to establish key concepts related to earthquake dynamics, evacuation route planning, and the application of Dijkstra’s algorithm. Given its high seismic exposure and the prevalence of aging infrastructure, Barranco is considered highly vulnerable … …Journal of Computer Science, Vol. 21, Issue 10 · 9 Dec 2025 · 2,851 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid Optimization to Trust Enhanced Secure Routing Optimization with IABC and CGWAA for MANETYuvaraja Panneer Selvam, Suganthi PerumalRouting in Mobile Ad Hoc Networks (MANET) presents significant challenges due to the dynamic nature of network topology. Optimal route selection and efficient route discovery are matched by effective routing in MANET. This study proposes a Hybrid Optimization to Trust-Enhanced Secure Routing Optimization (HO-TESRO) designed to address these challenges in IoT environments by integrating metrics such as link stability, bandwidth, … …Journal of Computer Science, Vol. 21, Issue 4 · 19 Mar 2025 · 4,983 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Lifetime Maximization Using Metaheuristics-Based Unequal Clustering With Routing Protocol on Wireless Sensor NetworksN. E. Kanaghadhara, R. SubanThe Wireless Sensor Network (WSN) consists of spatially distributed autonomous sensors that monitor environmental or physical factors such as sound, pressure, or temperature, and pass the information directly through the network to a sink or central location. Clustering and routing are essential in WSNs to optimize their longevity, scalability, and efficiency. Clustering includes grouping Sensor Nodes (SN) into clusters, each … …Journal of Computer Science, Vol. 22, Issue 7 · 21 Jul 2026 · 682 accessesView PDFCite
Research ArticleOpen accessIn the abstractModified ACS Centroid Memory for Data ClusteringAyad Mohammed Jabbar, Ku Ruhana Ku-Mahamud, Rafid SagbanAnt Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In contrast to other algorithms, ACO explicitly utilizes an adaptive memory, which is important to … …Journal of Computer Science, Vol. 15, Issue 10 · 11 Oct 2019 · 7,641 accessesView PDFCite
Research ArticleOpen accessIn the abstractOPTIMIZING LOCALIZATION ROUTE USING PARTICLE SWARM-A GENETIC APPROACHL. Lakshmanan, D. C. TomarOne of the most key problems in wireless sensor networks is finding optimal algorithms for sending packets from source node to destination node. Several algorithms exist in literature, since some are in vital role other may not. Since WSN focus on low power consumption during packet transmission and receiving, finally we adopt by merging swarm particle based algorithm with genetic … …American Journal of Applied Sciences, Vol. 11, Issue 3 · 20 Jan 2014 · 7,381 accessesView PDFCite
Research ArticleOpen accessIn the abstractDynamic Route Shortening and Route Repairing Mechanism for Mobile Ad Hoc NetworksS. Revathi, T. R. RangaswamyProblem statement: Ad hoc Networks are wireless networks without any fixed infrastructure. The network topology changes frequently and unpredictably due to the random movement of the nodes. The Ad Hoc on Demand Distant Vector Routing (AODV) protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network … …Journal of Computer Science, Vol. 8, Issue 8 · 11 Jul 2012 · 7,068 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Optimal Path Management Strategy in Mobile Ad Hoc Network Using Fuzzy and Rough Set TheoryP. Seethalakshmi, M. Joseph Auxilius Jude, G. RajendranProblem statement: Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes that dynamically forms a network. Most of the existing ad-hoc routing algorithms select the shortest path using various resources. However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing methods are … …American Journal of Applied Sciences, Vol. 8, Issue 12 · 15 Oct 2011 · 7,667 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Study of Threshold Variations in Temporal Decision Systems for Routing in Vehicular Ad hoc NetworksB. S. Shylaja, V. Mary Anita Rajam, V. Uma Maheswari, Arul SiromoneyProblem statement: Route maintenance and re-discovery are expensive in signaling and computation for routing in Vehicular Ad hoc Networks (VANETs). Hence it was desirable to choose the optimal route during the route selection phase. Approach: In this study, the threshold-based routing protocol β-wt uses the notion of threshold from variable precision rough sets. This protocol was used to evaluate routing … …Journal of Computer Science, Vol. 6, Issue 12 · 9 Nov 2010 · 6,890 accessesView PDFCite