Improved AODV based on Load and Delay for Route Discovery in MANET
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 14, Issue 2
Abstract
A mobile Ad-hoc network (MANET) is a self configuring network of mobile devices connected by wireless links. A dynamic traffic allocation algorithm based on packet delay and hops in Mobile Ad hoc networks is proposed. The algorithm is based on the minimization product of delay and the number of hops ineach path and adjusts the traffic adaptively so as to make load-balanced which optimizes network resource utilization. Simulation demonstrated that the algorithm could dynamically balance the traffic allocation between paths. The aim of the minimum utilization of resource in mobile Ad hoc networks can be achieved.
Authors and Affiliations
Shital Umredkar
A System for Task Scheduling and Task Migration in Cloud Environment
Abstract: Large scale data processing is increasingly common in cloud computing systems in recent years. In these systems, files are split into many small blocks and all blocks are replicated over several servers....
Various Techniques of Clustering: A Review
Abstract: Data mining is a method that is used to select the information from large datasets and it performs the principal task of data analysis. The Clustering is a technique that consist groups of data and elemen...
An Efficient Method for Noisy Annotation Data Modeling
Abstract : Probabilistic topic models are used for analyzing and extracting content-related annotations from noisy annotated discrete data like WebPages on WWW and these WebPages are stored using social bookmarking servi...
Optimized Framework for Online Admission Systems With Reference To Professional Programmes in Maharashtra
Abstract: As Admission system is a process, researchers are going to concentrate on standardization, evaluation and optimization. This research paper presents optimized framework for Online Admission process. Framework i...
Semi-Supervised Discriminant Analysis Based On Data Structure
Abstract: Dimensionality reduction is a key data-analytic technique for mining high-dimensional data. In thispaper, we consider a general problem of learning from pairwise constraints in the form of must-link and cannotl...