L-DRAND: A Localized Distributed TDMA Scheduling Algorithm With Distance-Measurement for Sensor Networks

Download Now Free registration required

Executive Summary

This paper proposes a distributed TDMA slot scheduling algorithm which the slot allocation priority is controlled by distance measurement information. In the proposed scheme, named L-DRAND, Lamport's bakery algorithm for mutual exclusion is applied for prioritized slot allocation based on the distance measurement information between nodes. This method aims at the realization of media access control methods which can construct a localized network practically by limiting the scope. The proposed scheme can be shown as a possible replacement of DRAND algorithm for Z-MAC scheme in a distance-measurement-oriented manner.

  • Format: PDF
  • Size: 325.5 KB