Decentralized RFID coverage algorithms using writeable tags

A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer networks (Amsterdam, Netherlands : 1999) Ročník 102; s. 96 - 108
Hlavní autoři: Jedda, Ahmed, Khair, Mazen G., Mouftah, Hussein T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 19.06.2016
Elsevier Sequoia S.A
Témata:
Algorithms
Automatic identification
Computer simulation
Decentralization
Decentralized
Distributed algorithms
Energy conservation
Experiments
Greedy algorithms
Monitors
Networks
Performance measurement
Proximity
Radio
Radio frequency identification
Readers
Redundancy
RFID
RFID coverage
Simulation
Studies
Tags
Topology construction
Tracking
RFID
RFID coverage
Topology construction
Distributed algorithms
ISSN:1389-1286, 1872-7069
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A Radio Frequency IDentification (RFID) reader network is as a collaboration of RFID readers that aim to cover (i.e., identify, monitor, and track) every RFID tag in a given area. The RFID coverage (RFC) problem is defined as follows. Given a reader network, assign to each tag t a specific reader v in its proximity such that v is responsible for covering t (called its owner), while minimizing the number of owner readers. The problem has applications in energy conservation and in eliminating readers and data redundancy from the reader networks. We introduce a number of decentralized algorithms for the RFID coverage problem: 1) algorithms RANDOM, RANDOM+, and MAX-MIN which are randomized algorithms that run in O(1) write/read rounds, 2) algorithm GDE which is an efficient decentralized implementation of the greedy set cover algorithm, and 3) an improvement of GDE which is called . Our algorithms assume that the RFID tags are writeable, where a writeable tag is a passive RFID tag with writeable memory. We show using simulation experiments that our algorithms outperform major RFID coverage algorithms in various scenarios with respect to a number of performance metrics.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2016.03.003