A Lattice Discrete Model for Intensive RFID Reader Deployment

Abstract:

In an intensive RFID reader environment, multiple RFID reader are deployed together to cover a pointed area. In such intensive RFID reader application, it needs to determine how many readers are enough to cover the expect area and calculate the position of readers. However, the coverage of multiple readers is a NP problem. Therefore, it needs an approximate approach to optimize the coverage. In this paper, we proposed a lattice decentralized approach to model the coverage problem of intensive RFID reader deployment. In our novel model, both the deployment area and the reader reading region are discretized to a lattice and described by a matrix. Then, the coverage is easily calculated by matrix operation. In order to test our discrete method, we propose a heuristic algorithm to deploy readers based on the PSO (particle swarm optimization) algorithm. The simulations show that the proposed algorithm can cover an irregular or regular area with a high coverage rate and a low overlapping rate.

• Periodical: Applied Mechanics and Materials (Volume 340)
• Pages: 502-506
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.340.502
• Online since: July 2013
• Authors: Chao Chen, Shi Jie Zhou, Jia Qing Luo, Yan Pan Chen
• Keywords: Coverage, Particle Swarm Optimization (PSO), Radio Frequency Identification (RFID), Reader Deployment

References

[1] N. Gupta (2006) RFIDPlanner - A Coverage Planning Tool for RFID Networks. Indian Institute of Technology Bombay, Computer Science and Engineering Department 1: 56-62.

[2] CHEN Han-ning. ZHU Yun-long and HU Kun-yuan (2008) RFID network optimization based on multi-species coevolution. Journal of pla university of science and technology(natural science edition) 9(5): 413-416.

[3] LIU Lei-an LAI Sheng-li LIU Chang and LAI Xiao-zheng (2007) Research and Analysis of the Reader Anti-collision Algorithm in RFID System. science technology and engineering 7(9): 1890-1893.

[4] B. Carbunar, M. K. Ramanathan, M. Koyuturk, et al (2005) Redundant-Reader Elimination in RFID Systems. In: In Proceedings of the 2nd IEEE International Conference on Sensor and Ad Hoc Communications and Networks (SECON). Santa Clara 1: 45-64.

DOI: 10.1109/sahcn.2005.1557073

[5] B. Carbunar, M. K. Ramanathan, M. Koyutürk, et al (2009) Efficient Tag Detection in RFID Systems. Journal of Parallel and Distributed Computing 69(2): 180-196.

DOI: 10.1016/j.jpdc.2008.06.013

[6] H. Chen, Y. Zhu (2008) RFID Networks Planning Using Evolutionary Algorithms and Swarm Intelligence. In: Wireless Communications, Networking and Mobile Computing 1: 341-345.

DOI: 10.1109/wicom.2008.680

[7] D. Tian, N. D. Georganas (2002) A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the 1st ACM WSNA 1: 32-41.

DOI: 10.1145/570738.570744

[8] Y. Yang, Y. Wu, M. Xia, et al (2009) A RFID Network Planning Method Based on Genetic Algorithm. In: International Conference on Networks Security, Wireless Communications and Trusted Computing. Wuhan, Hubei 1: 534-537.

DOI: 10.1109/nswctc.2009.238

[9] Q. Guan, Y. Liu, Y. Yang, et al (2006) Genetic Approach for Network Planning in the RFID Systems. Sixth International Conference on Intelligent Systems Design and Applications(ISDA'06) 2: 567-572.

DOI: 10.1109/isda.2006.253899

[10] E. D. Giampaolo, F. Fornì, G. Marrocco (2010) RFID-network planning by Particle Swarm Optimization. In: Proceedings of the Fourth European Conference on Antennas and Propagation. Barcelona Spain 1: 1-5.

[11] Y. Zou, K. Chakrabarty (2003) Sensor deployment and target localization based on virtual forces. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies 1: 1293-1303.

DOI: 10.1109/infcom.2003.1208965