Scheduling Sensors by Tiling Lattices
Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch (Texas A&M, University)

TL;DR
This paper presents a method to create collision-free, deterministic, and optimal periodic broadcast schedules for sensors placed on a lattice, using tiling techniques to ensure efficient communication without collisions.
Contribution
It introduces a novel approach leveraging lattice tilings to design optimal, collision-free broadcast schedules for regularly placed sensors.
Findings
Schedule guarantees collision-free communication
Schedule is proven to be optimal in the number of time slots
Applicable to sensors arranged on lattice points
Abstract
Suppose that wirelessly communicating sensors are placed in a regular fashion on the points of a lattice. Common communication protocols allow the sensors to broadcast messages at arbitrary times, which can lead to problems should two sensors broadcast at the same time. It is shown that one can exploit a tiling of the lattice to derive a deterministic periodic schedule for the broadcast communication of sensors that is guaranteed to be collision-free. The proposed schedule is shown to be optimal in the number of time slots.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Quantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms
