2011
DOI: 10.1007/s10799-011-0085-6
|View full text |Cite
|
Sign up to set email alerts
|

Managing RFID events in large-scale distributed RFID infrastructures

Abstract: As RFID installations become larger and more geographically distributed, their scalability becomes a concern. Currently, most RFID processing occurs in a central location, gathering tag scans and matching them to event-condition-action (ECA) rules. However, as the number of scans and ECA rules grows, the workload quickly outpaces the capacity of a centralized processing server. In this paper, we consider the problem of distributing the RFID processing workload across multiple nodes in the system. We describe t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Before elaborating such binary-tree-like algorithm, it is necessary to explain the realization principle of binary tree algorithm [8][9][10][11] . The binary tree algorithm which is ISO 18000-6B belongs to probabilistic category.…”
Section: Basic Principles In Binary Tree Algorithmmentioning
confidence: 99%
“…Before elaborating such binary-tree-like algorithm, it is necessary to explain the realization principle of binary tree algorithm [8][9][10][11] . The binary tree algorithm which is ISO 18000-6B belongs to probabilistic category.…”
Section: Basic Principles In Binary Tree Algorithmmentioning
confidence: 99%