Perturbative Time and Frequency Allocations for RFID Reader Networks

Deolalikar, Vinay; Mesarina, Malena; Recker, John; Pradhan, Salil

doi:10.1007/11807964_40

Cited by 19 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If two conflicting readers pick the same color, one of them retains and the other choose a different color. In [8], the coloring method is also used but the number of colors is restricted to the number of available channels. Some works also consider both reader-tag collisions and readerreader collisions.…”

Section: Related Workmentioning

confidence: 99%

“…However, it cannot be directly used to specify the constraints during the process of data collection. Some other works [6], [7], [8], [9] investigated how to coordinate readers to alleviate their inferences. These works assume that all readers belong to a single application and the data collection task is to scan all the tags in the coverage.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Complex data collection in large-scale RFID systems

Zhu

Cui

et al. 2014

2014 International Conference on Smart Computing

View full text Add to dashboard Cite

With the advance of RFID technology and pervasive computing, a growing number of RFID devices are deployed in the surrounding environment and form large-scale RFID systems. Many applications run on top of such a system, and perform diverse and possibly conflicting data collection tasks. Existing works about RFID data collection either focus on deducing events of interest from primitive data, or scheduling the activation of readers to mitigate various of interference. The former ones assume that the primitive data have been collected already, and the later ones assume that all the readers belong to a single application whose objective is to read all the tags once. It lacks an effective way to specify the constraints in the process of data collection for multiple applications, and coordinate the readers to meet such requirements. In this paper, we proposed a specification language and a reader coordination algorithm to solve this problem. Our language can be used to specify complex constraints in data collection tasks, based on attribute selection, set relations, and temporal relations. And then a permission based data collection approach is developed for the readers to meet these constraints in a distributed way. Extensive simulation results show that the proposed approach outperforms existing approaches in terms of the execution time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Complex data collection in large-scale RFID systems

Zhu

Cui

et al. 2014

2014 International Conference on Smart Computing

View full text Add to dashboard Cite

show abstract

“…If conflicts arise (i.e., two interfering readers pick the same color or time slot), only one of them wins (i.e., sticks to the chosen color), the others pick another color again randomly. In [8], the authors suggest coloring of the interference graph using k colors, where k is the number of available channels. If the graph is not k-colorable using their suggested heuristic, then the authors suggest removal of certain edges and nodes from the interference graph using other heuristics which consider the size of the common interference regions between neighboring readers.…”

Section: Reader-reader Collisionmentioning

confidence: 99%

Collision avoidance in a dense RFID network

Jain

Das

2006

Proceedings of the 1st International Workshop on Wireless Network Testbeds, Experimental Evaluation &Amp; Characterization

View full text Add to dashboard Cite

In this work, we develop a CSMA-based MAC protocol to avoid reader-reader and reader-tag collisions in a dense RFID network. The network is implemented using mote-based RFID readers. To implement the MAC protocol, we develop an appropriate carrier sensing circuit using an RFID tag as an antenna and the mote as an apparatus to sample received signal strength. We have augmented a commercially available OEM RFID module with such carrier sensing capability and interfaced it with motes. Performance evaluation shows much superior performance relative to a naive and a randomized protocol in dense deployment environments both in regards to accuracy and time per tag read.

show abstract

“…The best known approximation is by a factor of O(log n) [17]. It has numerous applications, for example in VLSI design [6,24], linear programming [19], computational biology [34,31,38], register allocation [39], and RFID reader networks [9]. In a breakthrough paper, Reed et al [33] proved that the Graph Bipartization problem on a graph with n vertices and m edges is solvable in O(4 k · kmn) time, where k is the number of vertices to delete.…”

Section: Introductionmentioning

confidence: 99%

Algorithm Engineering for Optimal Graph Bipartization

Hüffner¹

2009

JGAA

View full text Add to dashboard Cite

We examine exact algorithms for the NP-hard Graph Bipartization problem. The task is, given a graph, to find a minimum set of vertices to delete to make it bipartite. Based on the "iterative compression" method introduced by Reed, Smith, and Vetta in 2004, we present new algorithms and experimental results. The worst-case time complexity is improved. Based on new structural insights, we give a simplified correctness proof. This also allows us to establish a heuristic improvement that in particular speeds up the search on dense graphs. Our best algorithm can solve all instances from a testbed from computational biology within minutes, whereas established methods are only able to solve about half of the instances within reasonable time.

show abstract

Perturbative Time and Frequency Allocations for RFID Reader Networks

Cited by 19 publications

References 11 publications

Complex data collection in large-scale RFID systems

Complex data collection in large-scale RFID systems

Collision avoidance in a dense RFID network

Algorithm Engineering for Optimal Graph Bipartization

Contact Info

Product

Resources

About