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

Gul, Omer Melih; Uysal-Biyikoglu, Elif

JSON

{
  "conceptdoi": "10.81043/aperta.64078", 
  "conceptrecid": "64078", 
  "created": "2021-03-16T01:49:02.303629+00:00", 
  "doi": "10.81043/aperta.64079", 
  "files": [
    {
      "bucket": "91cd7078-3b6a-481b-b5d6-ed49f110b543", 
      "checksum": "md5:833748d04fc5e865e107023bc9b82c31", 
      "key": "bib-00699fc3-d7fa-4d6e-9d36-7dd2cc2896b4.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/91cd7078-3b6a-481b-b5d6-ed49f110b543/bib-00699fc3-d7fa-4d6e-9d36-7dd2cc2896b4.txt"
      }, 
      "size": 219, 
      "type": "txt"
    }
  ], 
  "id": 64079, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.64079.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/91cd7078-3b6a-481b-b5d6-ed49f110b543", 
    "conceptbadge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.64078.svg", 
    "conceptdoi": "https://doi.org/10.81043/aperta.64078", 
    "doi": "https://doi.org/10.81043/aperta.64079", 
    "html": "https://aperta.ulakbim.gov.tr/record/64079", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/64079", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/64079"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Middle East Tech Univ, Elect & Elect Engn, Ankara, Turkey", 
        "name": "Gul, Omer Melih"
      }, 
      {
        "affiliation": "Middle East Tech Univ, Elect & Elect Engn, Ankara, Turkey", 
        "name": "Uysal-Biyikoglu, Elif"
      }
    ], 
    "description": "This paper considers a single-hop wireless network where a fusion center (FC) collects data from a set of m energy harvesting (EH) sensors. In each time slot, k of m nodes can be scheduled by the FC for transmission over k communication channels. FC has no knowledge about the EH processes and current battery states of sensors; however, it knows the outcomes of previous transmission attempts. Also, battery leakage is ignored since it is very small. The objective is to find a low complexity scheduling policy that maximizes the total throughput of the data backlogged system for general case of EH process in finite or infinite horizon. A low-complexity and near optimal policy UROP (Uniformizing Random Ordered Policy) is proposed for a general case of EH process under infinite battery assumption. Simulations indicate that under a reasonable-sized finite battery assumption, there is almost no loss in throughput.", 
    "doi": "10.81043/aperta.64079", 
    "has_grant": false, 
    "license": {
      "id": "cc-by"
    }, 
    "meeting": {
      "title": "2014 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)"
    }, 
    "publication_date": "2014-01-01", 
    "related_identifiers": [
      {
        "identifier": "10.81043/aperta.64078", 
        "relation": "isVersionOf", 
        "scheme": "doi"
      }
    ], 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "64079"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "64078"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "conferencepaper", 
      "title": "Konferans bildirisi", 
      "type": "publication"
    }, 
    "title": "A Randomized Scheduling Algorithm for Energy Harvesting Wireless Sensor Networks Achieving Nearly 100% Throughput"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 8.0, 
    "unique_downloads": 8.0, 
    "unique_views": 44.0, 
    "version_downloads": 8.0, 
    "version_unique_downloads": 8.0, 
    "version_unique_views": 44.0, 
    "version_views": 47.0, 
    "version_volume": 1752.0, 
    "views": 47.0, 
    "volume": 1752.0
  }, 
  "updated": "2021-03-16T01:49:02.346700+00:00"
}