Article

Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks

Authors:

András Faragó,

Violet R. SyrotiukAuthors Info & Claims

MobiCom '01: Proceedings of the 7th annual international conference on Mobile computing and networking

Pages 53 - 60

https://doi.org/10.1145/381677.381683

Published: 16 July 2001 Publication History

Abstract

MERIT is a framework to assess routing protocols in mobile Ad hoc networks (manets). It is based on the novel concept of a shortest mobile path (SMP) in a mobile qraph, generalizing the traditional shortest path concept for the mobile environment. As a standard measure for routing protocols in a manet, the MERIT framework proposes the mean ratio of the cost of the actually used route to the cost of the optimal mobile path, under the same history of link metrics in the changing network topology. The MERIT spectrum takes the MERIT ratio as a function of parameters of interest yielding a multi-faceted representation of protocol effectiveness. This Mean Real vs. Ideal cosT (MERIT) framework is unifying in that it provides a measure that allows a protocol to be assessed independently of other protocols, within its own environment. 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.

References

[1]

J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom'98), pages 85-97. October 1998.

Digital Library

[2]

M.S. Corson and J. Macker. Mobile Ad hoc Networking (manet): Routing Protocol Performance Issues and Evaluation Considerations. In Network Working Group, RFC 2501. January 1999. http://www.ieft.org/rfc/rfc2501.txt

Digital Library

[3]

The C++ Protocol Toolkit (CPT). Rooftop Communications Corp. (Now Nokia Rooftop.) http://www.rooftop.com

[4]

A. Farago and V.R. Syrotiuk. Transport Layer Routing Assessment in Mobile Ad Hoc Networks. Submitted to Symposium on Ad Hoc Wireless Networks, IEEE Global Communications Conference (Globecom'01).

[5]

A. Farago, A. Szentesi, and B. Szviatovszki. Inverse Optimization in High Speed Networks. Submitted to Discrete Applied Mathematics, Special Issue on Telecommunications.

Digital Library

[6]

M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Co., San Francisco, California, 1983.

[7]

GloMoSim: Global Mobile Information Systems Simulation Library. The University of California, Los Angeles. http://pcl.cs.ucla.edu/projects/glomosim/

[8]

D.B. Johnson. Routing in Ad Hoc Networks of Mobile Hosts, In IEEE Workshop on Mobile Computing Systems and Applications, pages 158-163. December 1994.

[9]

The Network Simulator - ns-2. The University of California, Berkeley. http://www.isi.edu/nsname/ns/

[10]

OPNET: Optimum Network Performance. OPNET Technologies, Inc. http://www.mil3.com

[11]

V.D. Park and M.S. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom'97), pages 1405-1413. April 1997.

Digital Library

[12]

C.E. Perkins, ed. Ad Hoc Networking, Addison-Wesley Inc., 2001.

Digital Library

[13]

C.E. Perkins and P. Bhagwat. DSDV Routing over a Multihop Wireless Network of Mobile Computers. In T. Imielinski and H.F. Korth, editors, Mobile Computing, pages 183-206. Kluwer Inc., 1996.

[14]

C.E. Perkins and E.M. Royer. Ad-hoc On-Demand Distance Vector Routing. In Proceedings of the Second Annual IEEE Workshop on Mobile Computing Systems and Applications, pages 90-100. February 1999.

Digital Library

[15]

E.M. Royer and C.-K. Toh. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. In IEEE Personal Communications, pages 46-55. April 1999.

[16]

Z. Wang. On the Complexity of Quality of Service Routing. In Information Processing Letters, 69:111-114, 1999.

Digital Library

Cited By

Bari MKalkal SAhmad S(2017)A Comparative Study and Performance Analysis of Routing Algorithms for MANETComputational Intelligence in Data Mining10.1007/978-981-10-3874-7_31(333-345)Online publication date: 20-May-2017
https://doi.org/10.1007/978-981-10-3874-7_31
Mongiovi MSingh AYan XZong BPsounis K(2012)Efficient multicasting for delay tolerant networks using graph indexing2012 Proceedings IEEE INFOCOM10.1109/INFCOM.2012.6195503(1386-1394)Online publication date: Mar-2012
https://doi.org/10.1109/INFCOM.2012.6195503
Bhadra SFerreira A(2012)Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphsJournal of Internet Services and Applications10.1007/s13174-012-0073-z3:3(269-275)Online publication date: 6-Nov-2012
https://doi.org/10.1007/s13174-012-0073-z
Show More Cited By

Index Terms

Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Frameworks

Recommendations

MERIT: a scalable approach for protocol assessment

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 ...
On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively ...
On-Demand Loop-Free Routing with Link Vectors
ICNP '04: Proceedings of the 12th IEEE International Conference on Network Protocols

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad-hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiCom '01: Proceedings of the 7th annual international conference on Mobile computing and networking

July 2001

356 pages

ISBN:1581134223

DOI:10.1145/381677

Chairman:
Christopher Rose
Rutgers Univ.

Copyright © 2001 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 July 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

MobiCom01

Sponsor:

SIGMOBILE

MobiCom01: International Conference on Mobile Computing and Networking

Rome, Italy

Acceptance Rates

MobiCom '01 Paper Acceptance Rate 30 of 281 submissions, 11%;

Overall Acceptance Rate 440 of 2,972 submissions, 15%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
743
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)2

Reflects downloads up to 02 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bari MKalkal SAhmad S(2017)A Comparative Study and Performance Analysis of Routing Algorithms for MANETComputational Intelligence in Data Mining10.1007/978-981-10-3874-7_31(333-345)Online publication date: 20-May-2017
https://doi.org/10.1007/978-981-10-3874-7_31
Mongiovi MSingh AYan XZong BPsounis K(2012)Efficient multicasting for delay tolerant networks using graph indexing2012 Proceedings IEEE INFOCOM10.1109/INFCOM.2012.6195503(1386-1394)Online publication date: Mar-2012
https://doi.org/10.1109/INFCOM.2012.6195503
Bhadra SFerreira A(2012)Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphsJournal of Internet Services and Applications10.1007/s13174-012-0073-z3:3(269-275)Online publication date: 6-Nov-2012
https://doi.org/10.1007/s13174-012-0073-z
Kiess WMauve M(2007)A survey on real-world implementations of mobile ad-hoc networksAd Hoc Networks10.1016/j.adhoc.2005.12.0035:3(324-339)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1016/j.adhoc.2005.12.003
Jarry ALotker ZBasagni SPhillips C(2004)Connectivity in evolving graph with geometric propertiesProceedings of the 2004 joint workshop on Foundations of mobile computing10.1145/1022630.1022635(24-30)Online publication date: 1-Oct-2004
https://dl.acm.org/doi/10.1145/1022630.1022635
Ferreira A(2004)Building a reference combinatorial model for MANETsIEEE Network: The Magazine of Global Internetworking10.1109/MNET.2004.133773218:5(24-29)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1109/MNET.2004.1337732
Chu TNikolaidis I(2004)Node density and connectivity properties of the random waypoint modelComputer Communications10.1016/j.comcom.2004.01.00327:10(914-922)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1016/j.comcom.2004.01.003
Faragó ASyrotiuk V(2003)MERITMobile Networks and Applications10.1023/A:10251939290818:5(567-577)Online publication date: 1-Oct-2003
https://dl.acm.org/doi/10.1023/A%3A1025193929081
Narayan PSyrotiuk V(2003)Evaluation of the AODV and DSR Routing Protocols Using the MERIT ToolAd-Hoc, Mobile, and Wireless Networks10.1007/978-3-540-39611-6_3(25-36)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39611-6_3
Bhadra SFerreira A(2003)Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic NetworksAd-Hoc, Mobile, and Wireless Networks10.1007/978-3-540-39611-6_23(259-270)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39611-6_23
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents