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

48 results for “Shortest Path”
Set a search alert
Research ArticleOpen accessIn the abstractPERFORMANCE ANALYSIS OF RANDOMIZED REVERSE AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL IN MANETK. Santhi, B. ParvathavarthiniIn high mobility, routing in Mobile Ad-Hoc Network is a very difficult task. In AODV and RAODV, all the data packets are travel through the same shortest path so the intruders can easily trace out the data path. The main objective of Randomized RAODV provides the multipath and then the paths are selected randomly for security purposes. Using randomized routing … …Journal of Computer Science, Vol. 10, Issue 9 · 30 Apr 2014 · 6,809 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,560 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Policy for Path Selection in Dynamic Source Routing Protocol for Mobile Ad-Hoc NetworksRagb O.M. Saleh, Md Yazid Mohd Saman, M. Nordin A. RahmanIn standard DSR protocol, nodes automatically discover and maintain the routes in the network by storing source routes, discovered dynamically on-demand. They maintain route caches that contain the source routes which the node is aware of. Entries are continually updated when new routes are learned and reorder the cached routes according to the traditional shortest path policy. The problem with … …Journal of Computer Science, Vol. 9, Issue 5 · 17 May 2013 · 6,216 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 abstractMultipath Adaptive Packet Dispersion for Voice ApplicationsJ. Faritha Banu, V. RamachandranProblem statement: The quality of Voice over IP applications is decided by the main factors like network capacity and technologies such as codec type, Packet Loss Concealment (PLC) and Forward Error Correction (FEC). Approach: In MPLS networks multiple Label Switched Paths (LSP) are established between MPLS ingress and egress nodes to enhance the network performance and QoS for subscribers. To … …Journal of Computer Science, Vol. 8, Issue 4 · 27 Jan 2012 · 7,716 accessesView PDFCite
Research ArticleOpen accessIn the abstractFlow Based AlgorithmT. Karpagam, V. J. Sudhakar, N. Arunsankar, M. DhanasekaranProblem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 22 Dec 2011 · 8,482 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 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,813 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeographic Information System-Allocation Model for Forest Path: A Case Study in Ayer Hitam Forest Reserve, MalaysiaI. Mohd Hasmadi, H. Z. Pakhriazad, F. S. MohamadProblem statement: Forest road planning requires a host of information, particularly the availability of spatial and non-spatial data. The requirement of a planning system or tools to gather, integrate and manipulate all data is essential. The ability of Geographic Information System (GIS) to integrate such massive information and develop a spatial model of earth features will lead to time and … …American Journal of Applied Sciences, Vol. 7, Issue 3 · 31 Mar 2010 · 8,014 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Free Educational Java Framework for Graph AlgorithmsGianluca Costa, Claudia D’Ambrosio, Silvano MartelloProblem statement: In the teaching of graph theory algorithms it is important that students can experiment them on numerical instances in order to fully understand their logical meaning and to learn how they can be implemented. Approach: We developed an open source Java framework to help students in their approach to the study of graph algorithms. The framework was implemented … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,397 accessesView PDFCite