A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
On the complexity of quality of service routing
Information Processing Letters
Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Effects of wireless physical layer modeling in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Inverse optimization in high-speed networks
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
Looking at protocol efficiency from a new angle: stability—delay analysis
Proceedings of the second international workshop on Mobility management & wireless access protocols
Determining a sequence of stable multicast Steiner trees in mobile ad hoc networks
Proceedings of the 44th annual Southeast regional conference
ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES
Applied Artificial Intelligence
Proceedings of the 47th Annual Southeast Regional Conference
Maximum stability data gathering trees for mobile sensor networks
International Journal of Mobile Network Design and Innovation
Network topology models for multihop wireless networks
ISRN Communications and Networking
| Hi-index | 0.00 |
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.