Scheduling Sensors by Tiling Lattices

Simple item page
dc.creatorKlappenecker, Andreas
dc.creatorLee, Hyunyoung
dc.creatorWelch, Jennifer L.
dc.date2008-06-07
dc.date.accessioned2026-07-07T09:43:16Z
dc.date.available2026-07-07T09:43:16Z
dc.descriptionSuppose 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.
dc.description9 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/0806.1271
dc.identifierhttp://arxiv.org/abs/0806.1271
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162491
dc.subjectNetworking and Internet Architecture
dc.titleScheduling Sensors by Tiling Lattices
dc.typetext

Files

Collections

arXiv