<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606190252</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100854.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10776-015-0263-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10776-015-0263-2</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Access Disparity Mitigation in Multi-hop Wireless Networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Jalaa Hoblos, Hassan Peyravi]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In Multi-hop Wireless Networks (MWNs), the end-to-end performance degrades exponentially with hop counts and the degree of traffic aggregation at each hop. Fair allocation of bandwidth among nodes is one of the challenging problems in MWNs. The IEEE 802.11 distributed coordination function standard stipulates long-term equalization of throughput among stations by giving the same number of transmission opportunities regardless of their individual bit rates. In this paper, we propose a bandwidth allocation scheme for MWNs that uses the underlying hop contention graph, along with hop counts and traffic aggregates in order to achieve a long-term equalization of the end-to-end throughput. The proposed scheme first determines direct and indirect (hidden) contentions among nodes, it then finds the end-to-end upstream and downstream access probabilities, and finally allocates access opportunities accordingly. The scheme significantly improves fairness among nodes. The performance, in terms of throughput, delay, and fairness, has been studied under various traffic sources, traffic loads, and different network topologies.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2015</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hoblos</subfield>
   <subfield code="D">Jalaa</subfield>
   <subfield code="u">Kent State University, Kent, OH, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Peyravi</subfield>
   <subfield code="D">Hassan</subfield>
   <subfield code="u">Kent State University, Kent, OH, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">International Journal of Wireless Information Networks</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">22/2(2015-06-01), 85-96</subfield>
   <subfield code="x">1068-9605</subfield>
   <subfield code="q">22:2&lt;85</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">22</subfield>
   <subfield code="o">10776</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10776-015-0263-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s10776-015-0263-2</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">Hoblos</subfield>
   <subfield code="D">Jalaa</subfield>
   <subfield code="u">Kent State University, Kent, OH, USA</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">Peyravi</subfield>
   <subfield code="D">Hassan</subfield>
   <subfield code="u">Kent State University, Kent, OH, USA</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">International Journal of Wireless Information Networks</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">22/2(2015-06-01), 85-96</subfield>
   <subfield code="x">1068-9605</subfield>
   <subfield code="q">22:2&lt;85</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">22</subfield>
   <subfield code="o">10776</subfield>
  </datafield>
 </record>
</collection>
