A Simulation-based Performance Analysis of Multicast Routing in Mobile Ad hoc Networks.

International Journal of Information Processing and Management 07/2010; 1:4-14. DOI: 10.4156/ijipm.vol1.issue1.1
Source: DBLP
Download full-text


Available from: Natarajan Meghanathan, Oct 17, 2014
20 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: MERIT is a framework that can be used to assess routing protocols in mobile ad hoc networks (manets). It uses the novel concept of a shortest mobile path (SMP) in a mobile graph, a generalization of the shortest path problem for mobile environments. As a measure for routing protocol assessment, we propose the mean ratio of the cost of the route used by a protocol to the cost of the optimal mobile path for the same network history. The cost reflects that the route used in a session can change over time because of network dynamics such as topology changes. The aim is for the ratio to be an abstract, inherent measure of the protocol that is as implementation-independent as possible. The MERIT spectrum, which is the ratio expressed as the function of some parameters of interest, is a characterization of protocol effectiveness. MERIT, for MEan Real vs. Ideal cosT, provides a scalable assessment framework: rather than comparing performance measures of different protocols directly, we compare a protocol to the optimal solution. That is, rather than forcing the comparison to be in the same system, it is done once for each protocol in its own environment. Furthermore, we show that there is an efficient algorithm to solve the underlying SMP problem for important cases, making the approach practically feasible. We also investigate generalizations of and extensions within the MERIT framework. We show that the MERIT framework is rich, with much wider generality and potential applicability than assessing routing protocols.
    Mobile Networks and Applications 01/2003; 8:567-577. DOI:10.1023/A:1025193929081 · 1.05 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and SV is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper, we analyze a heuristic algorithm for the Steiner tree problem. The heuristic algorithm has a worst case time complexity of O(SV 2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1–1/l) times that of the optimal tree, where l is the number of leaves in the optimal tree.
    Acta Informatica 05/1981; 15(2):141-145. DOI:10.1007/BF00288961 · 0.50 Impact Factor
Show more