DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks

  • Authors:

  • Injong Rhee;Ajit Warrier;Jeongki Min;Lisong Xu

  • Affiliations:

  • North Carolina State University, Raleigh, NC;North Carolina State University, Raleigh, NC;North Carolina State University, Raleigh, NC;University of Nebraska, Lincoln, Nebraska

  • Venue:
  • Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(δ) time and message complexity where δ is the maximum size of a two-hop neighborhood in a wire-less network while message complexity remains O(δ), assuming that message delays can be bounded by an unknown constant.DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move,such as wireless mesh networks and wireless sensor networks.We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling.Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced.