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

64 articles for “optimal path”
Set a search alert
Research ArticleOpen accessIn the abstractA REFINEMENT OF DIJKSTRA'S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHSSiddhartha Sankar Biswas, Bashir Alam, M. N. DojaThe networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from internal or external agents, sudden failure of one or … …Journal of Computer Science, Vol. 10, Issue 4 · 14 Dec 2013 · 7,266 accessesView PDFCite
Research ArticleOpen accessIn the abstractAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,053 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Cross-Layered Path Stability Based Routing Protocol for WiMAX NetworksM. Deva Priya, M. L. ValarmathiIn IEEE 802.16, a Subscriber Station (SS) is battery powered with limited capacity. A SS can be made to operate for longer durations by deploying power saving features or by using relay stations. Multi-hop communication conserves power, but finding an optimal path to the destination is monotonous. Path stability indicates how stable a path is and how long it can … …American Journal of Applied Sciences, Vol. 10, Issue 11 · 9 Sep 2013 · 6,677 accessesView PDFCite
Research ArticleOpen accessIn the abstractSECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREMSrinath Doss, Janet JeyarajRecent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the recent ant colony optimization … …Journal of Computer Science, Vol. 9, Issue 9 · 6 Aug 2013 · 6,567 accessesView PDFCite
Research ArticleOpen accessIn the abstractReal Time Multigraphs for Communication Networks: An Intuitionistic Fuzzy Mathematical ModelSiddhartha Sankar Biswas, Bashir Alam, Mohammad Najmud DojaMany problems of computer science, communication network, transportation systems, can be modeled into multigraphs (or graphs) and then can be solved. Nowadays, the networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. For a given alive network, in many situations, its complete topology may not be always available to the communication systems … …Journal of Computer Science, Vol. 9, Issue 7 · 17 Jun 2013 · 7,073 accessesView PDFCite
Research ArticleOpen accessIn the abstractParticle Swarm Optimization-Based Routing Protocol for Clustered Heterogeneous Sensor Networks with Mobile SinkR. Sudarmani, K.R. Shankar KumarIn Wireless Sensor Networks (WSN) sensor nodes with sensing, computing and communication infrastructure are randomly deployed and organized as clusters. Most of the existing sensor networks focus on homogeneous in which the cluster heads are changed periodically. To improve the lifetime of energy constraint battery powered WSN and to avoid energy sink-hole problem; Clustered Heterogeneous Sensor Networks (HSN) are analyzed … …American Journal of Applied Sciences, Vol. 10, Issue 3 · 18 Mar 2013 · 6,845 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Optimal Rate Adjustment Algorithm for Medium Access Control Protocol in 802.11 Multi Hop Ad Hoc NetworksT. Ravichandran, K. SaravananProblem statement: Medium Access Control (MAC) protocol plays an important role in providing a fair and efficient allocation of limited bandwidth in wireless LANs. In IEEE 802.11 standard protocol, data rate selection is not specified. Rate control is the process of switching data rates dynamically based on channel conditions, with the target of selecting the rate that will provide the … …Journal of Computer Science, Vol. 8, Issue 7 · 9 Jun 2012 · 7,030 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Evolutionary Algorithmic Approach based Optimal Web Service Selection for Composition with Quality of ServiceD. Palanikkumar, G. KousalyaProblem statement: Web service is a technology that provides flexibility and interconnection between different distributed applications over the Internet and intranets. When a client request cannot be satisfied by any individual service, existing web services can be combined into a composite web service. When there are a large number of Web services available, it is not easy to find an … …Journal of Computer Science, Vol. 8, Issue 4 · 10 Feb 2012 · 6,766 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,820 accessesView PDFCite
Research ArticleOpen accessIn the abstractStrength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer NetworksSubbaraj Potti, Chitra ChinnasamyProblem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing … …Journal of Computer Science, Vol. 7, Issue 1 · 16 Dec 2010 · 8,221 accessesView PDFCite