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

Ugurlu, Onur; Tanir, Deniz; Nuri, Elnur

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 53251, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Ege Univ, Dept Math, Izmir, Turkey", 
      "name": "Ugurlu, Onur"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Ege Univ, Dept Math, Izmir, Turkey", 
      "name": "Tanir, Deniz"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Ege Univ, Dept Math, Izmir, Turkey", 
      "name": "Nuri, Elnur"
    }
  ], 
  "datePublished": "2016-01-01", 
  "description": "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.", 
  "headline": "A Better Heuristic for the Minimum Connected Dominating Set in Ad Hoc Networks", 
  "identifier": 53251, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "A Better Heuristic for the Minimum Connected Dominating Set in Ad Hoc Networks", 
  "url": "https://aperta.ulakbim.gov.tr/record/53251"
}