<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510795293</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083334.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-012-0615-5</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-012-0615-5</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Torkestani</subfield>
   <subfield code="D">Javad</subfield>
   <subfield code="u">Young Researchers Club, Arak Branch, Islamic Azad University, Arak, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Javad Torkestani]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In multi-hop ad hoc networks, besides collision-free transmissions, channel utilization should be also enhanced due to the scarce bandwidth. In this paper, we propose a learning automat-based adaptive polling scheme for medium access scheduling in clustered wireless ad-hoc networks to enhance the channel utilization. In this scheme, each cluster-head takes the responsibility of coordinating intra-cluster transmissions so that no collisions occur. Taking advantage of learning automaton, each cluster-head learns the traffic parameters of its own cluster members. Cluster members are prioritized based on these traffic parameters. Each cluster-head then takes the traffic parameters into consideration for finding an optimal channel access scheduling within its cluster. By the proposed polling scheme, each cluster member is assigned a portion of bandwidth proportional to its need (i.e., traffic load). The results show that the proposed channel assignment policy considerably improves the channel utilization. Simulation experiments also show the superiority of the proposed polling-based medium access scheme over the existing methods in terms of channel utilization, waiting time for packet transmission, and control overhead.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC., 2012</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Channel assignment</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Polling</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Ad-hoc networks</subfield>
   <subfield code="2">nationallicence</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">69/2(2013-03-01), 841-855</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">69:2&lt;841</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">69</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-012-0615-5</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-012-0615-5</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Torkestani</subfield>
   <subfield code="D">Javad</subfield>
   <subfield code="u">Young Researchers Club, Arak Branch, Islamic Azad University, Arak, Iran</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">69/2(2013-03-01), 841-855</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">69:2&lt;841</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">69</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>
