A novel algorithm L-NCD for redundant reader elimination in P2P-RFID network

7Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the development of radio frequency identification technology, radio frequency identification system has been deployed in different applications in a large scale. It needs a densely deployed reader environment to cover the work area, especially in radio frequency identification logistics and warehousing applications. If the distribution area and the number of readers are not optimized, and some of them will be redundant, which will reduce the efficiency of the whole radio frequency identification system. Researchers have proposed many algorithms and optimization techniques to solve the problem of redundant readers. In this paper, the authors propose a novel redundant reader elimination algorithm, namely, L-NCD, in P2P-RFID reader network, combined with layered eliminate optimization and neighboring coverage density. The simulation results demonstrate that the proposed algorithm eliminates more redundant readers than the other methods such as redundant-reader elimination under the same conditions.

Cite

CITATION STYLE

APA

Xu, H., Shen, W., Li, P., Zhu, J., & Wang, R. (2017). A novel algorithm L-NCD for redundant reader elimination in P2P-RFID network. Journal of Algorithms and Computational Technology, 11(2), 135–147. https://doi.org/10.1177/1748301816688020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free