SCHEDULING SENSORS BY TILING LATTICES
| Autor: | Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Exploit business.industry 020206 networking & telecommunications 02 engineering and technology Topology Theoretical Computer Science Scheduling (computing) Computer Science - Networking and Internet Architecture Atomic broadcast Hardware and Architecture Lattice (order) Broadcast communication network Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Communications protocol Telecommunications business Software Mathematics |
| Zdroj: | Parallel Processing Letters. 20:3-13 |
| ISSN: | 1793-642X 0129-6264 |
| DOI: | 10.1142/s0129626410000028 |
| Popis: | 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. 9 pages, 11 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|