Priority scheduling in wireless ad hoc networks

Xue Yang, Nitin Vaidya

Research output: Contribution to journalArticlepeer-review

Abstract

Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and hidden terminal problem make priority scheduling in multi-hop networks significantly different from that in wireless LANs. Most of the prior work related to priority scheduling addresses issues in wireless LANs. In this paper, priority scheduling in multi-hop networks is discussed. We propose a scheme using two narrow-band busy tone signals to ensure medium access for high priority source stations. The simulation results demonstrate the effectiveness of the proposed scheme.

Original languageEnglish (US)
Pages (from-to)273-286
Number of pages14
JournalWireless Networks
Volume12
Issue number3
DOIs
StatePublished - Jun 1 2006

Keywords

  • Ad hoc network
  • Busy tone
  • Medium access control
  • Priority scheduling

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Priority scheduling in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this