The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
Abstract
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(\delta ) time and message complexity where \delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(\delta ), 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. We further evaluate the effect of the time-varying nature of wireless links on the conflict-free property of DRAND-assigned time slots. This experiment is conducted on a 55-node testbed consisting of the more recent MicaZ sensor nodes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An energy-efficient MAC protocol for wireless sensor networks
Ye, W., Heidemann, J., & Estrin, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019408 · Cited by 5,361
Versatile low power media access for wireless sensor networks
Polastre, J., Hill, J., & Culler, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031508 · Cited by 3,376
System architecture directions for networked sensors
Hill, J. L., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. S. J. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379006 · Cited by 1,756
IEEE 802.11 Wireless Local Area Networks
Crow, B. P., Widjaja, I., Kim, J. G., & Sakai, P. T. (1997) · IEEE Communications Magazine · doi:10.1109/35.620533 · Cited by 1,111
Advances in network simulation
Breslau, L., Estrin, D., Fall, K., Floyd, S., Heidemann, J., Helmy, A., Huang, P., McCanne, S., Varadhan, K., Xu, Y., et al. (2000) · Computer · doi:10.1109/2.841785 · Cited by 798
Impact of radio irregularity on wireless sensor networks
Zhou, G., He, T., Krishnamurthy, S., & Stankovic, J. A. (2004) · Proceedings of the 2nd international conference on Mobile systems, applications, and services · doi:10.1145/990064.990081 · Cited by 779
Mitigating congestion in wireless sensor networks
Hull, B., Jamieson, K., & Balakrishnan, H. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031512 · Cited by 648
Z-MAC: a hybrid MAC for wireless sensor networks
Rhee, I., Warrier, A., Aia, M., & Min, J. (2005) · Proceedings of the 3rd international conference on Embedded networked sensor systems · doi:10.1145/1098918.1098929 · Cited by 537
Self-citationGruteser, M., & Grunwald, D. (2005) · Mobile Networks and Applications · doi:10.1007/s11036-005-6425-1 · Cited by 227
Cited by
MAC Essentials for Wireless Sensor Networks
Bachir, A., Dohler, M., Watteyne, T., & Leung, K. K. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.020510.00058 · Cited by 523
Spatial Deep Learning for Wireless Scheduling
Cui, W., Shen, K., & Yu, W. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904352 · Cited by 265
AI-based fog and edge computing: A systematic review, taxonomy and future directions
Iftikhar, S., Gill, S. S., Song, C., Xu, M., Aslanpour, M. S., Toosi, A. N., Du, J., Wu, H., Ghosh, S., Chowdhury, D., et al. (2023) · Internet of Things · doi:10.1016/j.iot.2022.100674 · Cited by 260
Yu, F., & Biswas, S. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.071004 · Cited by 121
Metadata
- Authors
- Rhee, I., Warrier, A., Min, J., & Xu, L.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2009-10
- Volume
- 8
- Issue
- 10
- Pages
- 1384-1396
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2126726492
- Cited by
- 274
- References
- 9
- FWCI
- 33.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks. https://app.cochat.ai/papers/10.1109/tmc.2009.59
- The paper
- Rhee, I., Warrier, A., Min, J., & Xu, L. (2009). DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing. https://doi.org/10.1109/tmc.2009.59
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.