Browse > Article
http://dx.doi.org/10.9708/jksci.2013.18.2.069

Channel Assignment for RFID Readers in Dense Reader Environments  

Sohn, Surgwon (Graduate School of Venture, Hoseo University)
Publication Information
Journal of the Korea Society of Computer and Information / v.18, no.2, 2013 , pp. 69-76 More about this Journal
Abstract
Reader-to-reader interference in RFID system is occurred due to the use of limited number of frequencies, and this is the main cause of read rate reduction in the passive RFID tags. Therefore, in order to maximize the read rate under the circumstances of limited frequency resources, it is necessary to minimize the frequency interference among RFID readers. This paper presents a hybrid FDM/TDM constraint satisfaction problem models for frequency interference minimization problems of the RFID readers, and assigns optimal channels to each readers using conventional backtracking search algorithms. A depth first search based on backtracking are accomplished to find solutions of constraint satisfaction problems. At this moment, a variable ordering algorithm is very important to find a solution quickly. Variable ordering algorithms applied in the experiment are known as efficient in the graph coloring. To justify the performance of the proposed constraint satisfaction problem model, optimal channels for each readers in the passive UHF RFID system are allocated by using computer simulation satisfying various interference constraints.
Keywords
Dense Reader Environment; Channel Assignment Algorithm; Graph Coloring; Constraint Satisfaction Problem; Backtracking Search;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 D.S. Zhou, Z. Luo, E. Wong, C.J. Tan, and J. Luo, "Interconnected RFID Reader Collision Model and its Application in Reader Anti-collision," 2007 IEEE International Conference on RFID, pp.212-219, 2007.
2 D.Y. Kim, J.G. Yook, H.G. Yoon and B.J. Jang, "Interference Analysis of UHF RFID Systems," Progress in Electromagnetics Research B, Vol.4, pp.115-126, 2008.   DOI
3 M. Buettner and D. Wetherall, "An Empirical Study of UHF RFID Performance," MobiCom''08, pp. 14-18, Sep. 2008.
4 M.V. Bueno-Delgado, J. Vales-Alonso, C. Angerer and M. Rupp, "A Comparative Study of RFID Scheduler in Dense Reader Environments," Proc. of IEEE ICIT 2010, pp. 1353-1358, Mar. 2010.
5 H. Seo and C. Lee, "A New GA-based Resource Allocation Scheme for a Reader-to-reader Interference Problem in RFID Systems," Proc. of IEEE ICC 2010, pp. 1-5, May 2010.
6 W.K. Hale, "Frequency Assignment: Theory and Applications," Proceedings of the IEEE, vol. 68, pp. 1497-1514, 1980.   DOI   ScienceOn
7 Y.H. Cho and J.G. Kook, "Energy Effective Tag Anti-collision Protocol for Mobile RFID System," Journal of The Korea Society of Computer and Information, Vol. 17, No. 2, pp.207-214, Feb. 2012.   과학기술학회마을   DOI   ScienceOn
8 S. Sohn, "A Backtracking Search Framework for Constraint Satisfaction Optimization Problems," The KIPS Transactions:Part A, Vol. 18A, No. 3, pp. 115-122, Jun. 2011.   과학기술학회마을   DOI   ScienceOn
9 M. Carlsson, M. Grindal, "Automatic Frequency Assignment for Cellular Telephone Using Constraint Satisfaction Techniques," Proceedings of the Tenth International Conference on Logic Programming, pp. 647-665, 1993.
10 J.P. Walsher, "Feasible Cellular Frequency Assignment Using Constraint Programming Abstractions," Proceedings of the Workshop on Constraint Programming Applications, 1996.
11 M. Yokoo, K. Hirayama, "Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques," IEEE Int'l Proceedings of Vehicular Technology Conferences, 2000.
12 E. Tsang, Ed., "Foundations of Constraint Satisfaction," Academic Press, 1993.
13 F. Rossi, P. van Beek, and T. Walsh (Eds.), "Handbook of Constraint Programming," Elsevier, 2006.
14 R.J. Wallace, "Determining the principles underlying performance variation in csp heuristics," International Journal on Artificial Intelligence Tools, Vol. 17 Issue 5, pp.857-880, Oct. 2008,   DOI   ScienceOn
15 F. Bacchus and P. van Run, "Dynamic Variable Ordering in CSPs," CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming, pp. 258 - 275, 1995.
16 S. Sohn, "Variable Ordering Algorithms Using Problem Classifying Rule," Journal of The Korea Society of Computer and Information, Vol. 16, No. 4, Apr. 2011.
17 I. P. Gent, E. MacIntyre, P. Prosser, B. M. Smith, and T. Walsh, "An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem," in Principles and Practice of Constraint Programming, pp. 179-193, 1996.
18 E. C. Freuder, "A sufficient condition for backtrack-free search," Journal of ACM, vol. 29, no. 1, pp. 24-32, 1982.   DOI   ScienceOn
19 D. Brelaz, New Methods to Color the Vertices of a Graph, Communication of the ACM 22(4), pp.251-256, 1979.   DOI   ScienceOn
20 C. Bessiere and J.-C. Regin, "MAC and combined heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems," Lecture Notes in Computer Science 1118, pp.61-75, 1996.
21 F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, "Boosting Systematic Search by Weighting Constraints," In Proceeding of the ECAI, pp.146-150, 2004.