1 Ocak 2018 Dergi makalesi Açık Erişim

Gokbayrak, Kagan

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Robust gateway placement in wireless mesh networks</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">COMPUTERS &amp; OPERATIONS RESEARCH</subfield>
    <subfield code="v">97</subfield>
    <subfield code="c">84-95</subfield>
  </datafield>
  <controlfield tag="001">34019</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Wireless mesh networks (WMNs) are communication networks that provide wireless Internet access over areas with limited infrastructure. Each node in a WMN serves several clients in its coverage area and transfers their traffic over wireless media to a few gateway nodes that have wired connections to the Internet. In this paper, we consider the Internet gateway placement (IGP) problem along with operational problems such as routing and wireless transmission capacity allocation. To eliminate wireless interference, we adopt the spatial reuse time division multiple access (TDMA) method, in which wireless transmissions are scheduled to occur at different time slots. We also employ destination-based single path routing for its ease of implementation. We present two mixed integer linear programming (MILP) formulations, both of which jointly determine the minimum number of gateway nodes needed to support forecasted demand, the locations of these gateway nodes, the routing trees, and the time slot allocations to wireless links. These formulations differ in the flow constraints. We also present a set of valid inequalities for the formulation with the multi-commodity flow constraints. In most cases, the solution to the IGP problem is not unique. Therefore, we also introduce a local search algorithm to select the most robust solution against any demand forecast errors. On example networks, we compare the proposed formulations with and without the valid inequalities in terms of the exact solution performances and the linear programming (LP) relaxations. We also demonstrate our local search algorithm to improve robustness against forecast errors on these example networks. (C) 2018 Elsevier Ltd. All rights reserved.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</subfield>
    <subfield code="a">Gokbayrak, Kagan</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210315190327.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:34019</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:0b53a55928e31edff70b6c57a7609b2d</subfield>
    <subfield code="s">123</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/34019/files/bib-efb161a4-29dc-442e-bacf-2ec56e6f1b67.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1016/j.cor.2018.04.018</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>