Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/47582
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArslan S.S.-
dc.contributor.authorPourmandi M.-
dc.contributor.authorHaytaoglu E.-
dc.date.accessioned2023-01-09T21:29:17Z-
dc.date.available2023-01-09T21:29:17Z-
dc.date.issued2022-
dc.identifier.isbn9781665421591-
dc.identifier.issn2157-8095-
dc.identifier.urihttps://doi.org/10.1109/ISIT50566.2022.9834669-
dc.identifier.urihttps://hdl.handle.net/11499/47582-
dc.description2022 IEEE International Symposium on Information Theory, ISIT 2022 -- 26 June 2022 through 1 July 2022 -- 181636en_US
dc.description.abstractWe consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers1. Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities between the nodes of the cellular system and the base stations are also constrained. Under such a setting, we formulate the fundamental trade-off with closed form expressions between repair bandwidth cost and the storage space per node. Particularly, the minimum storage as well as bandwidth cost points are formulated. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a special set of system parameters. © 2022 IEEE.en_US
dc.description.sponsorshipTürkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK: 119E235en_US
dc.description.sponsorship1*This work is supported by The Scientific and Technological Research Council of Turkey (TUBITAK) under grant number 119E235.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartofIEEE International Symposium on Information Theory - Proceedingsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBandwidthen_US
dc.subjectDigital storageen_US
dc.subjectEconomic and social effectsen_US
dc.subjectNetwork codingen_US
dc.subjectOptimal systemsen_US
dc.subjectCellular networken_US
dc.subjectCellular systemen_US
dc.subjectClosed-form expressionen_US
dc.subjectCooperative network codingen_US
dc.subjectDistributed data storagesen_US
dc.subjectLayered Structuresen_US
dc.subjectLink capacitiesen_US
dc.subjectMultiple nodesen_US
dc.subjectStorage spacesen_US
dc.subjectTrade offen_US
dc.subjectBase stationsen_US
dc.titleBase Station-Assisted Cooperative Network Coding for Cellular Systems with Link Constraintsen_US
dc.typeConference Objecten_US
dc.identifier.volume2022-Juneen_US
dc.identifier.startpage2815en_US
dc.identifier.endpage2820en_US
dc.identifier.doi10.1109/ISIT50566.2022.9834669-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.authorscopusid35955672100-
dc.authorscopusid57155300400-
dc.authorscopusid55839391400-
dc.identifier.scopus2-s2.0-85136290014en_US
dc.identifier.scopusquality--
item.cerifentitytypePublications-
item.languageiso639-1en-
item.openairetypeConference Object-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.dept10.10. Computer Engineering-
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Files in This Item:
File SizeFormat 
Base Station-Assisted Cooperative.pdf1.07 MBAdobe PDFView/Open
Show simple item record



CORE Recommender

Page view(s)

42
checked on Aug 24, 2024

Download(s)

14
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.