{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:38:35Z","timestamp":1649000315107},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T00:00:00Z","timestamp":1376611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s11277-013-1241-6","type":"journal-article","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T15:55:23Z","timestamp":1376582123000},"page":"329-339","source":"Crossref","is-referenced-by-count":0,"title":["Channel and Time Slot Allocation for Dense RFID Networks"],"prefix":"10.1007","volume":"73","author":[{"given":"Surgwon","family":"Sohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Jin","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,16]]},"reference":[{"key":"1241_CR1","doi-asserted-by":"crossref","unstructured":"Zhou, S., Luo, Z., Wong, E., Tan, C. J., & Luo, J. (2007). Interconnected RFID reader collision model and its application in reader anti-collision. In Proceeding of the 2007 IEEE international conference on RFID (pp. 212\u2013219).","DOI":"10.1109\/RFID.2007.346171"},{"key":"1241_CR2","unstructured":"Piramuthu, S. (2008). Anti-collision algorithm for RFID tags. In Proceeding of the mobile and, pervasive computing (pp. 116\u2013118)."},{"issue":"1","key":"1241_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s11277-012-0524-7","volume":"64","author":"C Galiotto","year":"2012","unstructured":"Galiotto, C., Marchetti, N., Prasad, N., & Prasad, R. (2012). Low access delay anti-collision algorithm for readers in passive RFID systems. Wireless Personal Communications, 64(1), 169\u2013183.","journal-title":"Wireless Personal Communications"},{"key":"1241_CR4","doi-asserted-by":"crossref","unstructured":"Engels, D. W., & Sarma, S. E. (2002). The reader collision problem. In Proceedings of the 2002 IEEE international conference on systems, man and cybernetics (pp. 92\u201397).","DOI":"10.1109\/ICSMC.2002.1176117"},{"issue":"1","key":"1241_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4103\/0256-4602.74511","volume":"28","author":"SK Sayeed","year":"2011","unstructured":"Sayeed, S. K., Kim, Y. S., Yang, H., & Yook, J. G. (2011). A solution to the RFID reader interference problem using adaptive beam-forming approach. IETE Technical Review, 28(1), 17\u201328.","journal-title":"IETE Technical Review"},{"key":"1241_CR6","doi-asserted-by":"crossref","unstructured":"Bueno-Delgado, M. V., Vales-Alonso, J., Angerer, C., & Rupp, M. (2010). A comparative study of RFID schedulers in dense reader environments. In 2010 IEEE international conference on industrial technology (ICIT) (pp. 1373\u20131378).","DOI":"10.1109\/ICIT.2010.5472512"},{"key":"1241_CR7","doi-asserted-by":"crossref","unstructured":"Seo, H., & Lee, C. (2010). A new GA-based resource allocation scheme for a reader-to-reader interference problem in RFID systems. In 2010 IEEE international conference on communications (ICC) (pp. 1\u20135).","DOI":"10.1109\/ICC.2010.5502751"},{"key":"1241_CR8","doi-asserted-by":"crossref","unstructured":"Song, I, Hong, S., & Chang, K. (2009). An improved reader anti-collision algorithm based on pulse protocol with slot occupied probability in dense reader mode. In Proceeding of the IEEE 69th vehicular technology conference (pp. 1\u20135).","DOI":"10.1109\/VETECS.2009.5073385"},{"key":"1241_CR9","doi-asserted-by":"crossref","unstructured":"Yu, J., & Lee, W. (2008). GENTLE: Reducing reader collision in mobile RFID networks. In Proceeding of the 4th international conference on mobile ad-hoc and sensor, networks (pp. 280\u2013287).","DOI":"10.1109\/MSN.2008.31"},{"key":"1241_CR10","doi-asserted-by":"crossref","unstructured":"Kang, H., Zhao, Y., & Mei, F. (2013). A graph coloring based TDMA scheduling algorithm for wireless sensor networks. Wireless Personal Communications.","DOI":"10.1007\/s11277-013-1052-9"},{"key":"1241_CR11","doi-asserted-by":"crossref","unstructured":"Hale, W. K. (1980). Frequency assignment: Theory and applications. Proceedings of the IEEE, 68, 1497\u20131514.","DOI":"10.1109\/PROC.1980.11899"},{"key":"1241_CR12","doi-asserted-by":"crossref","unstructured":"Giortzis, A. I., & Turner, L. F. (1997). Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. IEE Proceedings of Communication, 144, 257\u2013264.","DOI":"10.1049\/ip-com:19971249"},{"key":"1241_CR13","unstructured":"Carlsson, M., & Grindal, M. (1993). Automatic frequency assignment for cellular telephone using constraint satisfaction techniques. In Proceedings of the tenth international conference on logic programming (pp. 647\u2013665)."},{"key":"1241_CR14","unstructured":"Walsher, J. P. (1996). Feasible cellular frequency assignment using constraint programming abstractions. In Proceedings of the workshop on constraint programming applications."},{"key":"1241_CR15","unstructured":"Tian, J., Fan, Y., Zhu, Y., & Hu, K. (2008). RFID reader anti-collision using chaos neural network based on annealing strategy. In Proceeding of the world congress on, intelligent control and automation (pp. 6128\u20136132)."},{"issue":"4","key":"1241_CR16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u2019elaz","year":"1979","unstructured":"Br\u2019elaz, D. (1979). New methods to color the vertices of a graph. Communication of the ACM, 22(4), 251\u2013256.","journal-title":"Communication of the ACM"},{"key":"1241_CR17","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.4007\/annals.2005.162.1335","volume":"162","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas, D., & Naor, A. (2005). The two possible values of the chromatic number of a random graph. Annals of Mathematics, 162, 1335\u20131351.","journal-title":"Annals of Mathematics"},{"key":"1241_CR18","doi-asserted-by":"crossref","unstructured":"Waldrop, J., Engels, D. W., & Sarma, S. E. (2003). Colorwave: An anticollision algorithm for the reader collision problem. In IEEE international conference on communications, 2003 (ICC \u201903) (pp. 1206\u20131210).","DOI":"10.1109\/ICC.2003.1204562"},{"key":"1241_CR19","volume-title":"Handbook of constraint programming","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of constraint programming. Amsterdam: Elsevier."},{"issue":"9","key":"1241_CR20","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., & Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9), 993\u20131002.","journal-title":"IEEE Transactions on Computers"},{"key":"1241_CR21","unstructured":"Bacchus, F., & van Run, P. (1995). Dynamic variable ordering in CSPs, CP\u201995, volume 976 of, Lecture Notes in Computer Science (pp. 258\u2013277)."},{"key":"1241_CR22","doi-asserted-by":"crossref","unstructured":"Gent, I. P., MacIntyre, E., Prosser, P., Smith, B. M., & Walsh, T. (1996). An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Principles and practice of constraint programming (CP-96) (pp. 179\u2013193).","DOI":"10.1007\/3-540-61551-2_74"},{"key":"1241_CR23","unstructured":"Smith, B. M., & Grant, S. A. (1998). Trying harder to fail first. In ECAI (pp. 249\u2013253)."},{"key":"1241_CR24","unstructured":"Smith, B. M. (1999). The Br\u2019elaz heuristic and optimal static orderings. In J. Jaffar (Ed.), CP, volume 1713 of, Lecture Notes in Computer Science (pp. 405\u2013418)."},{"key":"1241_CR25","doi-asserted-by":"crossref","unstructured":"Singh, W., & Sengupta, J. (2013). An efficient algorithm for optimizing base station site selection to cover a convex square region in cell planning. Wireless Personal Communications.","DOI":"10.1007\/s11277-013-1044-9"},{"key":"1241_CR26","doi-asserted-by":"crossref","unstructured":"Sohn, S., & Jo, G. (2006). Optimization of base stations positioning in mobile networks. In ICCSA 2006, vol. 3981 of Lecture Notes in Computer Science (pp. 779\u2013787).","DOI":"10.1007\/11751588_81"},{"key":"1241_CR27","doi-asserted-by":"crossref","unstructured":"Masaeli, N., Haj, H., Javadi, S., & Noori. E. (2013). Optimistic selection of cluster heads based on facility location problem in cluster-based routing protocols. Wireless Personal Communications.","DOI":"10.1007\/s11277-013-1176-y"},{"issue":"5","key":"1241_CR28","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TMC.2005.68","volume":"4","author":"J Pan","year":"2005","unstructured":"Pan, J., Cai, L., Hou, Y. T., Shi, Y., & Shen, S. X. (2005). Optimal base-station locations in two-tiered wireless sensor networks. IEEE Transactions on Mobile Computing, 4(5), 458\u2013473.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"1241_CR29","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1613\/jair.1351","volume":"21","author":"B Hnich","year":"2004","unstructured":"Hnich, B., Walsh, T., & Smith, B. M. (2004). Dual modeling of permutation and injection problems. Journal of Artificial Intelligence Research, 21, 357\u2013391.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"1241_CR30","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"SW Golomb","year":"1965","unstructured":"Golomb, S. W., & Baumert, L. D. (1965). Backtrack programming. Journal of the ACM, 12(4), 516\u2013524.","journal-title":"Journal of the ACM"},{"issue":"3","key":"1241_CR31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14(3), 263\u2013313.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"1241_CR32","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder, E. C. (1982). A sufficient condition for backtrack-free search. Journal of ACM, 29(1), 24\u201332.","journal-title":"Journal of ACM"},{"key":"1241_CR33","unstructured":"Bessi\u2018ere, C., & R\u2019egin, J.-C. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Lecture Notes in Computer Science (Vol. 1118, pp. 61\u201375)."},{"key":"1241_CR34","unstructured":"Boussemart, F, Hemery, F., Lecoutre, C., & Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceeding of the ECAI (pp. 146\u2013150)."},{"key":"1241_CR35","unstructured":"Sohn, S., & Jo, G. S. (2006). Solving a constraint satisfaction problem for frequency assignment in low power FM broadcasting, Lecture Notes in Artificial Intelligence (Vol. 4304, pp. 739\u2013748)."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1241-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-013-1241-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1241-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T01:26:36Z","timestamp":1563672396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-013-1241-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1241"],"URL":"https:\/\/doi.org\/10.1007\/s11277-013-1241-6","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,16]]}}}