DRAND

• DOI: 10.1145/1132905.1132927
• Publication Date: 2006-07-24T16:53:01Z
• Authors: Injong Rhee; Ajit Warrier; Jeongki Min; Lisong Xu
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

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