Shortest Distance Message Broadcasting for an Applications in an irregular Mobile Topologies
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
This paper introduces data forwarding algorithm for a articular applications within Mobile Adhoc etworks that is based on the concept of electing the neighbor node from a set of esignated nodes. The algorithm, which is called Shortest Distance essage Broadcasting (SDMF), uses routing information to select the node with the shortest istance. The goal of the proposed algorithm is to educe the average number of hops taken to reach the stination node that holds the desired data. Experimental valuations using the Scalable ireless Adhoc Network (SWAN) Simulator and ODV algorithm were performed to derive the confidence nterval for the mean hop count between the source node and destination node. The results agreed with the numerical analysis of the proposed algorithm offers reduce the hop count and lesser delay when compared to the remaining algorithms.
Authors and Affiliations
A. Aruna , Prof. M. Sadish Sendil , Dr S. Karthik
PARALLELS BETWEEN GLUCONEOGENESIS AND SYNCHRONOUS MACHINES
Biological diversity particularly at molecular level is astounding and can be used for rational manipulation of biological organisms. To analyze molecular diversity in its full scope computational models of biological or...
Query Optimization on Compressed and Decompressed Object-Oriented Database Using Operators
In this paper, we present an approach using various database operators that permits to enrich technique of query ptimization existing in the objectoriented databases and the comparative analysis of query optimization of...
Performance Evaluation of Ad Hoc On Demand Distance Vector in MANETs with varying Network Size using NS-2 Simulation
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically forming a network topology without the use of any existing network infrastructure or centralized administration. Routing is the task of...
A GENETIC ALGORITHM FOR REGRESSION TEST CASE PRIORITIZATION USING CODE COVERAGE
Regression testing is a testing technique which is used to validate the modified software. The regression test suite is typically large and needs an intelligent method to choose those test cases which will detect maximum...
An Efficient Pruning Technique for Mining Frequent Itemsets in Spatial Databases
Frequent Itemset Mining is evaluating the rules and relationship within the data items are optimizing it, in the large spatial databases (for e.g. Images, Docs, AVI files etc).It is one of the major problems in DM (Data...