Topology-Transparent Scheduling for MANETs using Orthogonal Arrays

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Scopus citations

Abstract

In this paper, we generalize the known topology-transparent medium access control protocols for mobile ad hoc networks by observing that their transmission schedule corresponds to an orthogonal array. Some new results on throughput are obtained as a consequence. We also show how to compute the probability of successful transmission if the actual node degree in the network exceeds the design parameter related to maximum node degree, showing the sensitivity of the schedule to this parameter. The selection of orthogonal array to provide the best throughput is also examined, and combinatorial generalizations are explored. Finally we outline schemes that combine the delay guarantees of current approaches to handle exceeding the stipulated maximum node degree.

Original languageEnglish (US)
Title of host publicationProceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2003
PublisherAssociation for Computing Machinery
Pages43-49
Number of pages7
ISBN (Print)1581137656, 9781581137651
DOIs
StatePublished - Jan 1 2003
EventProceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2003 - San Diego, CA, United States
Duration: Sep 19 2003Sep 19 2003

Publication series

NameProceedings of the Joint Workshop on Foundations of Mobile Computing

Conference

ConferenceProceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2003
CountryUnited States
CitySan Diego, CA
Period9/19/039/19/03

Keywords

  • Medium access control
  • Mobile ad hoc networks
  • Orthogonal array
  • Scheduling
  • Topology-transparency

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Topology-Transparent Scheduling for MANETs using Orthogonal Arrays'. Together they form a unique fingerprint.

Cite this