Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/138209
Title: ANALYSIS AND DESIGN OF MACHINE-TYPE COMMUNICATION NETWORKS USING STOCHASTIC GEOMETRY
Authors: UTKU TEFEK
ORCID iD:   orcid.org/0000-0002-4436-9200
Keywords: Cognitive radio, Full-duplex, Internet-of-things, Machine-to-machine communications, Relay, Stochastic geometry
Issue Date: 19-Jul-2017
Source: UTKU TEFEK (2017-07-19). ANALYSIS AND DESIGN OF MACHINE-TYPE COMMUNICATION NETWORKS USING STOCHASTIC GEOMETRY. ScholarBank@NUS Repository.
Abstract: Machine-type Communication (MTC) is an emerging technology that seeks spectrally efficient ways to provide ubiquitous connectivity among a massive number of automated devices. As MTC prevail in a wide range of applications realizing the Internet-of-Things, efficiently supporting MTC's unique requirements will be a key challenge. This thesis derives system-level insights for MTC, offers critical parameter optimizations to expedite their development and standardization progress. Firstly, the thesis proposes relaying schemes exclusively designed for MTC, and presents resource partitioning schemes for maximum network capacity. Full-duplex relays were considered in the following chapter, assuming a similar single-hop relay architecture. It was shown for certain parameter settings that using a correct proportion of in-band and out-band full-duplex relays can provide a higher network capacity than using either one alone. Finally, the last technical part studies the cognitive radio techniques for MTC, and proposes an optimal design of exclusion/guard zone radii for interference mitigation.
URI: http://scholarbank.nus.edu.sg/handle/10635/138209
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
TefekU.pdf1.28 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

19
checked on Jan 21, 2018

Download(s)

19
checked on Jan 21, 2018

Google ScholarTM

Check


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