Throughput guarantees for multi-priority traffic in ad hoc networks

  • Authors:
  • Yaling Yang;Robin Kravets

  • Affiliations:
  • Department of Computer Science, University of Illinois at Urbana-Champaign, 201 North Goodwin Avenue, Room 3107, Siebel Center, Urbana, IL 61801-2302, United States;Department of Computer Science, University of Illinois at Urbana-Champaign, 201 North Goodwin Avenue, Room 3107, Siebel Center, Urbana, IL 61801-2302, United States

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model, which captures the bandwidth allocation for saturated, unsaturated and semi-saturated networks. MPARC guarantees that the throughput of admitted realtime flows will not decrease due to later arriving realtime flows with equal or lower priorities or due to best effort flows. MPARC achieves this goal by performing accurate admission control on every newly arriving realtime flow and appropriate rate policing on all best effort traffic. Through simulation, we demonstrate that MPARC has better performance than existing approaches.