The effects of synchronization on topology-transparent scheduling

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment.

Original languageEnglish (US)
Pages (from-to)681-690
Number of pages10
JournalWireless Networks
Volume12
Issue number6
DOIs
StatePublished - Dec 2006

Fingerprint

Synchronization
Scheduling
Topology
Mobile ad hoc networks
Wireless sensor networks
Medium access control

Keywords

  • Ad hoc networks
  • Scheduling
  • Synchronization models

ASJC Scopus subject areas

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

Cite this

The effects of synchronization on topology-transparent scheduling. / Chu, Wensong; Colbourn, Charles; Syrotiuk, Violet.

In: Wireless Networks, Vol. 12, No. 6, 12.2006, p. 681-690.

Research output: Contribution to journalArticle

@article{caf2953b08a54fb3ab21e8a14264bc38,
title = "The effects of synchronization on topology-transparent scheduling",
abstract = "Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment.",
keywords = "Ad hoc networks, Scheduling, Synchronization models",
author = "Wensong Chu and Charles Colbourn and Violet Syrotiuk",
year = "2006",
month = "12",
doi = "10.1007/s11276-006-6528-z",
language = "English (US)",
volume = "12",
pages = "681--690",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "6",

}

TY - JOUR

T1 - The effects of synchronization on topology-transparent scheduling

AU - Chu, Wensong

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2006/12

Y1 - 2006/12

N2 - Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment.

AB - Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of which nodes are its neighbours, as long as the active neighbourhood is not too dense. Most of the existing work on topology-transparent scheduling assumes that the nodes are synchronized on frame boundaries. Synchronization is a challenging problem in MANETs and in WSNs. Hence, we study the relationships among topology-transparent schedules, expected delay, and maximum delay, for successively weaker models of synchronization: frame-synchronized, slot-synchronized, and asynchronous transmission. For each synchronization model, we give constructive proofs of existence of topology-transparent schedules, and bound the least maximum delay. Perhaps surprisingly, the construction for the asynchronous model is a simple variant of the slot synchronized model. While it is foreseen that the maximum delay increases as the synchronization model is weakened, the bound is too pessimistic. The results on expected delay show that topology-transparent schedules are very robust to node density higher than the construction is designed to support, allowing the nodes to cope well with mobility, and irregularities of their deployment.

KW - Ad hoc networks

KW - Scheduling

KW - Synchronization models

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

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

U2 - 10.1007/s11276-006-6528-z

DO - 10.1007/s11276-006-6528-z

M3 - Article

AN - SCOPUS:33749614927

VL - 12

SP - 681

EP - 690

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 6

ER -