Steiner systems for topology-transparent access control in MANETs

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

In this paper we examine the combinatorial requirements of topology-transparent transmission schedules for channel access in mobile ad hoc networks. We formulate the problem as a combinatorial question and observe that its solution is a cover-free family. The mathematical properties of certain cover-free families have been studied extensively. Indeed, we show that both existing constructions for topology-transparent schedules (which correspond to orthogonal arrays) give a cover-free family. However, a specific type of cover-free family - called a Steiner system - supports the largest number of nodes for a given frame length. We then explore the minimum and expected throughput for Steiner systems of small strength, first using the acknowledgement scheme proposed earlier and then using a more realistic model of acknowledgements. We contrast these results with the results for comparable orthogonal arrays, indicating some important trade-offs for topology-transparent access control protocols.

Original languageEnglish (US)
Pages (from-to)247-258
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2865
StatePublished - 2003

Fingerprint

Steiner System
Access Control
Access control
Appointments and Schedules
Topology
Cover
Orthogonal Array
Schedule
Mobile ad hoc networks
Mobile Ad Hoc Networks
Throughput
Trade-offs
Family
Requirements
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science
  • Engineering(all)

Cite this

@article{f26ac5e97d064ec8b2d55c69929c8abe,
title = "Steiner systems for topology-transparent access control in MANETs",
abstract = "In this paper we examine the combinatorial requirements of topology-transparent transmission schedules for channel access in mobile ad hoc networks. We formulate the problem as a combinatorial question and observe that its solution is a cover-free family. The mathematical properties of certain cover-free families have been studied extensively. Indeed, we show that both existing constructions for topology-transparent schedules (which correspond to orthogonal arrays) give a cover-free family. However, a specific type of cover-free family - called a Steiner system - supports the largest number of nodes for a given frame length. We then explore the minimum and expected throughput for Steiner systems of small strength, first using the acknowledgement scheme proposed earlier and then using a more realistic model of acknowledgements. We contrast these results with the results for comparable orthogonal arrays, indicating some important trade-offs for topology-transparent access control protocols.",
author = "Charles Colbourn and Violet Syrotiuk and Ling, {Alan C H}",
year = "2003",
language = "English (US)",
volume = "2865",
pages = "247--258",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Steiner systems for topology-transparent access control in MANETs

AU - Colbourn, Charles

AU - Syrotiuk, Violet

AU - Ling, Alan C H

PY - 2003

Y1 - 2003

N2 - In this paper we examine the combinatorial requirements of topology-transparent transmission schedules for channel access in mobile ad hoc networks. We formulate the problem as a combinatorial question and observe that its solution is a cover-free family. The mathematical properties of certain cover-free families have been studied extensively. Indeed, we show that both existing constructions for topology-transparent schedules (which correspond to orthogonal arrays) give a cover-free family. However, a specific type of cover-free family - called a Steiner system - supports the largest number of nodes for a given frame length. We then explore the minimum and expected throughput for Steiner systems of small strength, first using the acknowledgement scheme proposed earlier and then using a more realistic model of acknowledgements. We contrast these results with the results for comparable orthogonal arrays, indicating some important trade-offs for topology-transparent access control protocols.

AB - In this paper we examine the combinatorial requirements of topology-transparent transmission schedules for channel access in mobile ad hoc networks. We formulate the problem as a combinatorial question and observe that its solution is a cover-free family. The mathematical properties of certain cover-free families have been studied extensively. Indeed, we show that both existing constructions for topology-transparent schedules (which correspond to orthogonal arrays) give a cover-free family. However, a specific type of cover-free family - called a Steiner system - supports the largest number of nodes for a given frame length. We then explore the minimum and expected throughput for Steiner systems of small strength, first using the acknowledgement scheme proposed earlier and then using a more realistic model of acknowledgements. We contrast these results with the results for comparable orthogonal arrays, indicating some important trade-offs for topology-transparent access control protocols.

UR - http://www.scopus.com/inward/record.url?scp=0142249957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142249957&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0142249957

VL - 2865

SP - 247

EP - 258

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -