Earticle

초록

영어

For the insufficient of existing algorithms of redundant-reader elimination, the paper proposes a data-cleaning algorithm based on communication information among readers. This algorithm is no longer dependent on the tag to send information between the RFID readers, but to transmit information directly through communication information among the readers to determine which reader the tag belongs to and whether the reader is redundant or not. This paper does a lot of experiments to verify the effectiveness of the algorithm.

목차

Abstract
 1. Introduction
 2. Redundant Reader Elimination Algorithm and Its Analysis
 3. A Data-Cleaning Algorithm Based on Communication Information among Readers
  3.1. Algorithm Prerequisite
  3.2. Specific Steps of Proposed Algorithm
  3.3 Analysis of Algorithm Instance
  3.4. Algorithm Analysis
 4. Experiments
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Yunhua Gu [ Jiangsu Engineering Center of Network Monitoring, School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China, ]
• Bao Gao [ Jiangsu Engineering Center of Network Monitoring, School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China, ]
• Jin Wang [ Jiangsu Engineering Center of Network Monitoring, School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China, ]
• Mingshu Yin [ Jiangsu Engineering Center of Network Monitoring, School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China, ]
• Junyong Zhang [ Jiangsu Engineering Center of Network Monitoring, School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China, ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of u- and e- Service, Science and Technology

• 간기

  격월간

• pISSN

  2005-4246

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605