No Cover Image

E-Thesis 160 views 56 downloads

Distributed opportunistic scheduling algorithms for wireless communications. / Toan To

Swansea University Author: Toan To

Abstract

In this thesis, we propose a number of distributed schemes for wireless communications in the cross layer design context, considering an uplink random access network in which multiple users communicate with a common base station. In addition, we perform a comprehensive study on a splitting based mul...

Full description

Published: 2012
Institution: Swansea University
Degree level: Doctoral
Degree name: Ph.D
URI: https://cronfa.swan.ac.uk/Record/cronfa42588
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2018-08-02T18:55:04Z
last_indexed 2018-08-03T10:10:33Z
id cronfa42588
recordtype RisThesis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2018-08-02T16:24:29.7589956</datestamp><bib-version>v2</bib-version><id>42588</id><entry>2018-08-02</entry><title>Distributed opportunistic scheduling algorithms for wireless communications.</title><swanseaauthors><author><sid>eed83d35a107a83809f68f9a6714cb00</sid><ORCID>NULL</ORCID><firstname>Toan</firstname><surname>To</surname><name>Toan To</name><active>true</active><ethesisStudent>true</ethesisStudent></author></swanseaauthors><date>2018-08-02</date><abstract>In this thesis, we propose a number of distributed schemes for wireless communications in the cross layer design context, considering an uplink random access network in which multiple users communicate with a common base station. In addition, we perform a comprehensive study on a splitting based multiuser selection algorithm which is simple, effective, and scales with the network size. First, we investigate a reservation-type protocol in a channel aware ALOHA system. Various Markovian models are used to describe the system and to capture the temporal correlation of the channel evolution. The average throughput of the system is obtained using the Markov Analysis technique and we show that the reservation protocol can achieve better performance than the original channel-aware ALOHA by reducing the collision probability. Second, for better resource utilization in the Opportunistic Multichannel ALOHA scheme, we propose a simple extension to the transmission policy that exploits the idle channels. Performance analysis shows that, theoretically, the maximum system throughput can be improved by up to 63% in the asymptotic case. Through numerical results, it can be seen that a significant gain is achieved even when the system consists of a small number of users. Third, we consider a splitting based multiuser selection algorithm in a probabilistic view. Asymptotic analysis leads to a functional equation, similar to that encountered in the analysis of the collision resolution algorithm. Subject to some conditions, the solution of the functional equation can be obtained, which provides the approximations for the expected number of slots and the expected number of transmissions required by the algorithm in a large system. These results shed light on open design problems in choosing parameters for the algorithm when considering the delay and the overhead jointly. A typical example is to optimize the parameters that minimize the weighted sum of these measures of interest.</abstract><type>E-Thesis</type><journal/><journalNumber></journalNumber><paginationStart/><paginationEnd/><publisher/><placeOfPublication/><isbnPrint/><issnPrint/><issnElectronic/><keywords>Computer science.</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2012</publishedYear><publishedDate>2012-12-31</publishedDate><doi/><url/><notes/><college>COLLEGE NANME</college><department>Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><institution>Swansea University</institution><degreelevel>Doctoral</degreelevel><degreename>Ph.D</degreename><apcterm/><lastEdited>2018-08-02T16:24:29.7589956</lastEdited><Created>2018-08-02T16:24:29.7589956</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Engineering and Applied Sciences - Uncategorised</level></path><authors><author><firstname>Toan</firstname><surname>To</surname><orcid>NULL</orcid><order>1</order></author></authors><documents><document><filename>0042588-02082018162506.pdf</filename><originalFilename>10805346.pdf</originalFilename><uploaded>2018-08-02T16:25:06.2970000</uploaded><type>Output</type><contentLength>6212462</contentLength><contentType>application/pdf</contentType><version>E-Thesis</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-08-02T16:25:06.2970000</embargoDate><copyrightCorrect>false</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2018-08-02T16:24:29.7589956 v2 42588 2018-08-02 Distributed opportunistic scheduling algorithms for wireless communications. eed83d35a107a83809f68f9a6714cb00 NULL Toan To Toan To true true 2018-08-02 In this thesis, we propose a number of distributed schemes for wireless communications in the cross layer design context, considering an uplink random access network in which multiple users communicate with a common base station. In addition, we perform a comprehensive study on a splitting based multiuser selection algorithm which is simple, effective, and scales with the network size. First, we investigate a reservation-type protocol in a channel aware ALOHA system. Various Markovian models are used to describe the system and to capture the temporal correlation of the channel evolution. The average throughput of the system is obtained using the Markov Analysis technique and we show that the reservation protocol can achieve better performance than the original channel-aware ALOHA by reducing the collision probability. Second, for better resource utilization in the Opportunistic Multichannel ALOHA scheme, we propose a simple extension to the transmission policy that exploits the idle channels. Performance analysis shows that, theoretically, the maximum system throughput can be improved by up to 63% in the asymptotic case. Through numerical results, it can be seen that a significant gain is achieved even when the system consists of a small number of users. Third, we consider a splitting based multiuser selection algorithm in a probabilistic view. Asymptotic analysis leads to a functional equation, similar to that encountered in the analysis of the collision resolution algorithm. Subject to some conditions, the solution of the functional equation can be obtained, which provides the approximations for the expected number of slots and the expected number of transmissions required by the algorithm in a large system. These results shed light on open design problems in choosing parameters for the algorithm when considering the delay and the overhead jointly. A typical example is to optimize the parameters that minimize the weighted sum of these measures of interest. E-Thesis Computer science. 31 12 2012 2012-12-31 COLLEGE NANME Engineering COLLEGE CODE Swansea University Doctoral Ph.D 2018-08-02T16:24:29.7589956 2018-08-02T16:24:29.7589956 Faculty of Science and Engineering School of Engineering and Applied Sciences - Uncategorised Toan To NULL 1 0042588-02082018162506.pdf 10805346.pdf 2018-08-02T16:25:06.2970000 Output 6212462 application/pdf E-Thesis true 2018-08-02T16:25:06.2970000 false
title Distributed opportunistic scheduling algorithms for wireless communications.
spellingShingle Distributed opportunistic scheduling algorithms for wireless communications.
Toan To
title_short Distributed opportunistic scheduling algorithms for wireless communications.
title_full Distributed opportunistic scheduling algorithms for wireless communications.
title_fullStr Distributed opportunistic scheduling algorithms for wireless communications.
title_full_unstemmed Distributed opportunistic scheduling algorithms for wireless communications.
title_sort Distributed opportunistic scheduling algorithms for wireless communications.
author_id_str_mv eed83d35a107a83809f68f9a6714cb00
author_id_fullname_str_mv eed83d35a107a83809f68f9a6714cb00_***_Toan To
author Toan To
author2 Toan To
format E-Thesis
publishDate 2012
institution Swansea University
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Engineering and Applied Sciences - Uncategorised{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Engineering and Applied Sciences - Uncategorised
document_store_str 1
active_str 0
description In this thesis, we propose a number of distributed schemes for wireless communications in the cross layer design context, considering an uplink random access network in which multiple users communicate with a common base station. In addition, we perform a comprehensive study on a splitting based multiuser selection algorithm which is simple, effective, and scales with the network size. First, we investigate a reservation-type protocol in a channel aware ALOHA system. Various Markovian models are used to describe the system and to capture the temporal correlation of the channel evolution. The average throughput of the system is obtained using the Markov Analysis technique and we show that the reservation protocol can achieve better performance than the original channel-aware ALOHA by reducing the collision probability. Second, for better resource utilization in the Opportunistic Multichannel ALOHA scheme, we propose a simple extension to the transmission policy that exploits the idle channels. Performance analysis shows that, theoretically, the maximum system throughput can be improved by up to 63% in the asymptotic case. Through numerical results, it can be seen that a significant gain is achieved even when the system consists of a small number of users. Third, we consider a splitting based multiuser selection algorithm in a probabilistic view. Asymptotic analysis leads to a functional equation, similar to that encountered in the analysis of the collision resolution algorithm. Subject to some conditions, the solution of the functional equation can be obtained, which provides the approximations for the expected number of slots and the expected number of transmissions required by the algorithm in a large system. These results shed light on open design problems in choosing parameters for the algorithm when considering the delay and the overhead jointly. A typical example is to optimize the parameters that minimize the weighted sum of these measures of interest.
published_date 2012-12-31T03:53:15Z
_version_ 1763752642747564032
score 11.014358

Similar Items