Topology transparent scheduling, synchronization, and maximum delay

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

6 Scopus citations

Abstract

Topology transparent scheduling for medium access control is an attractive technique for mobile ad hoc networks (MANETs) and sensor networks. The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the network is not too dense. Constructions of and performance criteria for topology transparent schedules have been extensively studied however, to date, frame synchronization is assumed. Synchronization is a difficult problem for MANETs and sensor networks. We study the relationships among topology transparent schedules, synchronization, and maximum delay. Frame synchronization, slot synchronization, and asynchronous transmission are the three synchronization models for this study. For each synchronization model, the first question is: 1. Do topology transparent schedules exist? If the answer to this question is yes, then two further questions are natural: 2. How to construct topology transparent schedules? 3. What is the least maximum delay? For frame and slot synchronization these three questions are answered in earlier work. In this paper, we give answers for these three basic questions for asynchronous networks.

Original languageEnglish (US)
Title of host publicationProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Pages3085-3090
Number of pages6
StatePublished - Dec 1 2004
EventProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) - Santa Fe, NM, United States
Duration: Apr 26 2004Apr 30 2004

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Volume18

Other

OtherProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
CountryUnited States
CitySanta Fe, NM
Period4/26/044/30/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Topology transparent scheduling, synchronization, and maximum delay'. Together they form a unique fingerprint.

  • Cite this

    Chu, W., Colbourn, C., & Syrotiuk, V. (2004). Topology transparent scheduling, synchronization, and maximum delay. In Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) (pp. 3085-3090). (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM); Vol. 18).