<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">51079744X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083341.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20131101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-013-1241-6</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-013-1241-6</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Channel and Time Slot Allocation for Dense RFID Networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Surgwon Sohn, Jong-Jin Jung]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper presents a constraint satisfaction approach to the reader collision problem in dense mode environments for static RFID networks. Our method assigns available channels and time slots to the RFID readers to increase the read rate while satisfying all the interference constraints. We model the problem with a hybrid frequency and time division multiplexing constraint satisfaction for reader anti-collision and assign workable channels and time slots to each reader using backtracking search algorithms. A depth-first-search based on backtracking was performed to find solutions to constraint satisfaction problems. Instead of performing an exhaustive search for the optimal result, we adopted good variable ordering heuristics as branching strategies where the search can be completed quickly. Thus, the search space is greatly reduced, and approximate solutions are found instantly. To find appropriate heuristics, we applied a problem classifying rule to determine the quality of the variable ordering heuristics. Computer simulations of the comparable performance of some variable ordering algorithms in the channel and time slot allocation for dense RFID networks are presented.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Channel and time slot allocation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Dense RFID networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Graph coloring</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Backtracking search</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Constraint satisfaction problems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Sohn</subfield>
   <subfield code="D">Surgwon</subfield>
   <subfield code="u">School of Computer Engineering, Hoseo University, 165 Baebang-eup, 336-795, Asan, Chungnam, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Jung</subfield>
   <subfield code="D">Jong-Jin</subfield>
   <subfield code="u">Department of Computer Engineering, Daejin University, 1007 Hoguk Road, Pocheon-si, Gyeonggi-do, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">73/2(2013-11-01), 329-339</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:2&lt;329</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-013-1241-6</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11277-013-1241-6</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Sohn</subfield>
   <subfield code="D">Surgwon</subfield>
   <subfield code="u">School of Computer Engineering, Hoseo University, 165 Baebang-eup, 336-795, Asan, Chungnam, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Jung</subfield>
   <subfield code="D">Jong-Jin</subfield>
   <subfield code="u">Department of Computer Engineering, Daejin University, 1007 Hoguk Road, Pocheon-si, Gyeonggi-do, Korea</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">73/2(2013-11-01), 329-339</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:2&lt;329</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
