Slot synchronized topology-transparent scheduling for sensor networks

  • Authors:

  • W. Chu;C. J. Colbourn;V. R. Syrotiuk

  • Affiliations:

  • Department of Computer Science and Engineering, Arizona State University, P.O. Box 878809, Tempe, AZ 85287-8809, USA;Department of Computer Science and Engineering, Arizona State University, P.O. Box 878809, Tempe, AZ 85287-8809, USA;Department of Computer Science and Engineering, Arizona State University, P.O. Box 878809, Tempe, AZ 85287-8809, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.24

Visualization

Abstract

We propose a slot synchronized topology-transparent medium access control (MAC) protocol for sensor networks. Most of the earlier scheduled approaches require a stronger form of synchronization where nodes are synchronized on frame boundaries. Synchronizing on slot boundaries is simpler to achieve since it does not require global time, making the protocol practical for sensor networks. The benefit of topology-transparency is that it ensures a bounded delay to each neighbour as long as the number of actively transmitting nodes in a neighbourhood is at most D"m"a"x. The node schedules are independent of which nodes are active. Such a topology-transparent solution is particularly suitable for sensor networks, where nodes may not have unique identifiers, eliminating costly neighbour discovery. We formulate the problem as a combinatorial design problem on cyclic superimposed codes and give a constructive proof of existence along with a delay bound.