A performance evaluation framework for fair solutions in ad hoc networks

  • Authors:
  • Manos Dramitinos;Rémi Vannier;Isabelle Guérin Lassous

  • Affiliations:
  • INRIA, LIP, RESO Team, Lyon, France;INRIA, LIP, RESO Team, Lyon, France;INRIA, LIP, RESO Team, Lyon, France

  • Venue:
  • Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fairness in multihop ad hoc networks has received considerable attention in the literature. Many schemes have been proposed, which attempt to compute the ``optimal'' bit rates of the transmitting mobile nodes so that a certain fairness criterion is met. As the related literature indicates, there is a trade-off between fairness and efficiency, since fairness schemes typically reduce the channel utilization. Also, it is questionable whether certain fairness schemes have a positive or negative impact on the QoS of certain user services. So far, there has been limited research on the impact of the varying short-term allocations of these protocols, due to their inherent features and also nodes mobility, on the user-perceived QoS (and social welfare) for services of long duration. In this paper, we introduce an assessment framework, based on history-dependent utility functions that can be used as a holistic performance evaluation tool of these fairness schemes. These functions quantify the satisfaction that the ad hoc users obtain from the way their long-lived service sessions are allocated bandwidth, due to the behavior of the MANETs fair schemes. This way we can unambiguously compare the performance of various fair solutions whose maximization goals are inherently different (max-min fairness, proportional fairness, etc.). Finally, we demonstrate the usefulness of this framework by applying it on different protocols.