1 Ocak 2016 Konferans bildirisi Açık Erişim

Ugurlu, Onur; Tanir, Deniz; Nuri, Elnur

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:53251</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Since no fixed infrastructure and no centralized management present in Wireless Ad Hoc Networks (WANETs), a Connected Dominating Set (CDS) representing the network is widely used as a virtual backbone. Given a graph, a CDS is a subset of vertices such that every vertex in the graph is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A smaller virtual backbone (a smaller size CDS) incurs less communication overhead. However, finding a minimum size CDS is NP-hard. Thus, it is important to design effective algorithms for the minimum CDS (MCDS) problem. In this article, a new efficient heuristic name as 2-Lenght Betweenness Heuristic for the MCDS problem is proposed. Comprehensive simulation results demonstrate that the proposed heuristic algorithm finds better solutions than the existing approach.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="a">2016 IEEE 10TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT)</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.81043/aperta.53250</subfield>
    <subfield code="n">doi</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Ugurlu, Onur</subfield>
    <subfield code="u">Ege Univ, Dept Math, Izmir, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:d8a8020e56588c2b9d08a1f1ed34f3d8</subfield>
    <subfield code="s">228</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/53251/files/bib-b945098d-ee0b-4e39-9b32-222c211aaf38.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315232104.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2016-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.81043/aperta.53251</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A Better Heuristic for the Minimum Connected Dominating Set in Ad Hoc Networks</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Tanir, Deniz</subfield>
    <subfield code="u">Ege Univ, Dept Math, Izmir, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Nuri, Elnur</subfield>
    <subfield code="u">Ege Univ, Dept Math, Izmir, Turkey</subfield>
  </datafield>
  <controlfield tag="001">53251</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>