Distributed algorithms for the RFID coverage problem

We introduce distributed algorithms for the RFID coverage problem, which is defined as finding the minimum amount of RFID readers that cover every tag. The algorithms depends on rounds of writes and reads in/from the tags' memories. The first algorithm, called Greedy Distributed Elimination (GD...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Jedda, Ahmed, Khair, Mazen G., Mouftah, Hussein T.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Approximation algorithms Low earth orbit satellites Monitoring Radiofrequency identification Wireless sensor networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!