Advanced asynchronous random access protocols

buir.advisorDuman, Tolga Mete
dc.contributor.authorAkyıldız, Talha
dc.date.accessioned2020-08-26T05:35:13Z
dc.date.available2020-08-26T05:35:13Z
dc.date.copyright2020-08
dc.date.issued2020-08
dc.date.submitted2020-08-19
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2020.en_US
dc.descriptionIncludes bibliographical references (leaves 77-82).en_US
dc.description.abstractFifth generation wireless systems and beyond require linking an enormous number of simple machine type devices leading to a new wave of interest in massive machine type communications (mMTC). Different from the human-centric communication systems, mMTCs are composed of a large number of devices where each user node generates small data blocks sporadically in an unpredictable manner. In such scenarios, traditional multiple access schemes, e.g., time division multiple access or frequency division multiple access, are not suitable because resource allocation and scheduling based approaches cannot be conveniently adopted due to the required complexity and latency, motivating the use of uncoordinated random access (RA) protocols and making asynchronous ALOHA-like solutions ideal candidates for such applications. In this thesis, we consider the design and analysis of advanced asynchronous RA protocols for different settings. We first study contention resolution ALOHA (CRA) and irregular repetition ALOHA (IRA) protocols with regular and irregular repetition rates on the collision channel where collisions are resolved through successive interference cancellation. We also propose concatenation of packet replicas with some clean parts with IRA, named irregular repetition ALOHA with replica concatenation (IRARC). Secondly, we introduce energy harvesting (EH) into the framework with the motivation of self-sustainability, and study RA protocols with EH nodes. Finally, we propose a generalization of IRA with packet length diversity to improve the system performance further. We present asymptotic analyses of all the proposed RA protocols, and determine the optimal repetition distributions to maximize the system throughput. We also provide a comprehensive set of numerical results for both asymptotic and practical scenarios to further demonstrate the effectiveness of the proposed approaches.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2020-08-26T05:35:13Z No. of bitstreams: 1 TalhaAkyıldızMsThesis.pdf: 1522671 bytes, checksum: 49ca43efdd70689c63c7bc14a92f445f (MD5)en
dc.description.provenanceMade available in DSpace on 2020-08-26T05:35:13Z (GMT). No. of bitstreams: 1 TalhaAkyıldızMsThesis.pdf: 1522671 bytes, checksum: 49ca43efdd70689c63c7bc14a92f445f (MD5) Previous issue date: 2020-08en
dc.description.statementofresponsibilityby Talha Akyıldızen_US
dc.format.extentxvi, 82 leaves : charts (some color) ; 30 cm.en_US
dc.identifier.itemidB160398
dc.identifier.urihttp://hdl.handle.net/11693/53933
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectRandom accessen_US
dc.subjectContention resolution ALOHAen_US
dc.subjectIrregular repetition ALOHAen_US
dc.subjectAsymptotic analysisen_US
dc.subjectSuccessive interference cancellationen_US
dc.subjectEnergy harvestingen_US
dc.titleAdvanced asynchronous random access protocolsen_US
dc.title.alternativeGelişmiş asenkron rastgele erişim protokollerien_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TalhaAkyıldızMsThesis.pdf
Size:
1.45 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: