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

Kaya, Onur; Su, Nugman; Ulukus, Sennur; Koca, Mutlu

JSON

{
  "conceptdoi": "10.81043/aperta.53956", 
  "conceptrecid": "53956", 
  "created": "2021-03-15T23:30:24.436049+00:00", 
  "doi": "10.81043/aperta.53957", 
  "files": [
    {
      "bucket": "218d5afb-53ac-41cf-acaf-034e587a8343", 
      "checksum": "md5:bbbe1325512ab9128994db181c40c8d6", 
      "key": "bib-38090d38-901f-4353-953a-219e24ebc06f.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/218d5afb-53ac-41cf-acaf-034e587a8343/bib-38090d38-901f-4353-953a-219e24ebc06f.txt"
      }, 
      "size": 180, 
      "type": "txt"
    }
  ], 
  "id": 53957, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.53957.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/218d5afb-53ac-41cf-acaf-034e587a8343", 
    "conceptbadge": "https://aperta.ulakbim.gov.tr/badge/doi/10.81043/aperta.53956.svg", 
    "conceptdoi": "https://doi.org/10.81043/aperta.53956", 
    "doi": "https://doi.org/10.81043/aperta.53957", 
    "html": "https://aperta.ulakbim.gov.tr/record/53957", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/53957", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/53957"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Isik Univ, Istanbul, Turkey", 
        "name": "Kaya, Onur"
      }, 
      {
        "affiliation": "Bogazici Univ, Istanbul, Turkey", 
        "name": "Su, Nugman"
      }, 
      {
        "affiliation": "Univ Maryland, College Pk, MD 20742 USA", 
        "name": "Ulukus, Sennur"
      }, 
      {
        "affiliation": "Bogazici Univ, Istanbul, Turkey", 
        "name": "Koca, Mutlu"
      }
    ], 
    "description": "We consider the optimum transmit scheduling problem for a two user energy harvesting cooperative multiple access channel. We assume a slotted model where energy harvests in each slot are known a priori. We propose a delay tolerant cooperation model: the transmitters create common information in a given slot, but need not cooperatively send the created common information immediately; they may relegate all or part of the cooperative message transmission to upcoming slots. We propose a modified block Markov superposition coding scheme based on message re-partitioning, that spans multiple slots. We characterize the corresponding achievable departure region by a deadline, and maximize it subject to energy harvesting constraints. We show that, delay tolerant cooperation need not necessarily improve the departure region over delay constrained cooperation, and derive a sufficient condition for the equivalence of the two policies. We compare optimal delay constrained and delay tolerant cooperation policies, and their achievable departure regions via simulations.", 
    "doi": "10.81043/aperta.53957", 
    "has_grant": false, 
    "license": {
      "id": "cc-by"
    }, 
    "meeting": {
      "title": "2016 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA)"
    }, 
    "publication_date": "2016-01-01", 
    "related_identifiers": [
      {
        "identifier": "10.81043/aperta.53956", 
        "relation": "isVersionOf", 
        "scheme": "doi"
      }
    ], 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "53957"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "53956"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "conferencepaper", 
      "title": "Konferans bildirisi", 
      "type": "publication"
    }, 
    "title": "Delay Tolerant Cooperation in the Energy Harvesting Multiple Access Channel"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 5.0, 
    "unique_downloads": 5.0, 
    "unique_views": 14.0, 
    "version_downloads": 5.0, 
    "version_unique_downloads": 5.0, 
    "version_unique_views": 14.0, 
    "version_views": 15.0, 
    "version_volume": 900.0, 
    "views": 15.0, 
    "volume": 900.0
  }, 
  "updated": "2021-03-15T23:30:24.486193+00:00"
}