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

263 results for “routing”
Set a search alert
Research ArticleOpen accessEvery word in the titleVarying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc NetworkV. Balaji, V. DuraisamyProblem statement: An inherent feature of mobile ad hoc networks is the frequent change of network topology leading to stability and reliability problems of the network. Highly dynamic and dense network have to maintain acceptable level of service to data packets and limit the network control overheads. This capability is closely related as how quickly the network protocol control overhead … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,997 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAuthentication Based and Optimized Routing Technique in Mobile Ad hoc NetworksS. Varadhaganapathy, A. M. Natarajan, S. N. SivanandamProblem statement: An Ad hoc network has been defined as a self-organizing, dynamic topology network formed by a group of wireless mobile nodes. Minimal configuration, absence of infrastructure and quick deployment, would make ad hoc networks convenient for emergency situations other than military applications. In recent years, security in Ad hoc Networks as a research topic had started to receive … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,903 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleImplementation Weather-Type Models of Capacitated Arc Routing Problem via HeuristicsZuhaimy Ismail, Mohammad Fadzli RamliProblem statement: In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle’s operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did … …American Journal of Applied Sciences, Vol. 8, Issue 4 · 18 Apr 2011 · 7,267 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleMeta Heuristic Algorithms for Vehicle Routing Problem with Stochastic DemandsGeetha Shanmugam, Poonthalir Ganesan, Dr. P.T. VanathiProblem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 8,021 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Improved Location aided Cluster Based Routing Protocol with Intrusion Detection System in Mobile Ad Hoc NetworksS. Mangai, A. TamilarasiProblem statement: Routing and security are the main challenges for ad hoc networks due to dynamic topology as well as resource constraints. A designed protocol must provide scalable routing with better security. Lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. And also resource constraints such as limited energy and size … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,103 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimization of Capacitated Vehicle Routing Problem by Nested Particle Swarm OptimizationKaruppusamy Kanthavel, Paruchuri PrasadProblem statement: Vehicle routing problem determines the optimum route for each vehicle as a sequence of visiting cities. The problem has been defined as NP-hard and exact solution is relatively difficult to achieve for real time large scale models. Though several attempts to solve the problem were made in the literature, new approaches may be tried to solve the problem … …American Journal of Applied Sciences, Vol. 8, Issue 2 · 28 Feb 2011 · 7,978 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleMobile Ad Hoc Network Security for Reactive Routing Protocol with Node Reputation SchemeA. Suresh, Dr. K. DuraiswamyThe mobile node’s reputation in the Mobile Ad hoc Network (MANET) identifies its trust worthiness for secured multiple data communication. Unknown nature of the node’s communication status for initial period has great impact in the effective data transfer as MANET is self-organized and distributed. Problem statement: The functional operation of the mobile network relies on the trusty cooperation between the … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 6,988 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Novel Routing Protocol with High Energy Performance in Mobile Special NetworksAli Norouzi, B. Berk UstundagProblem statement: Mobile Special Networks do not have a predetermined structure. This type of networks can dynamically reorganize network connection relationships due to change of neighborhoods and the relative positions. Approach: There are many problems in creation of a special network such as routing, wireless media, energy consumption and transportability. Results: Although these networks primarily had been formed for small … …Journal of Computer Science, Vol. 7, Issue 1 · 15 Jan 2011 · 7,304 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleStrength 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,216 accessesView PDFCite