Open Access Theses and Dissertations

Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for subject:(MSD System). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Karthik, A. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems.

Degree: 2013, Indian Institute of Science

URL: http://etd.iisc.ernet.in/2005/3441  ; http://etd.iisc.ernet.in/abstracts/4308/G25960-Abs.pdf 

Opportunistic selection algorithms have grown in importance as next generation wireless systems strive towards higher data rates and spectral efficiencies. For example, in orthogonal frequency division multiple access(OFDMA), the system bandwidth is divided into many sub channels. For each sub channel, the user with the highest channel gain is opportunistically assigned to it. .Likewise, in a multi-source, multi-destination (MSD) cooperative relay system, a relay node must be assigned for every source-destination (SD) pair. The assignment decisions are based on local channel knowledge and must be fast so as to maximize the time available for data transmission. We develop novel multiple access based splitting-based selection algorithms for OFDMA and MSD systems. These systems are unique in that the same user and relay can be the most suitable one for multiple sub channels and multiple SD pairs, respectively. For OFDMA systems, we propose an algorithm called Split Select that assigns for every sub channel the user with the highest channel gain over it. For MSD systems, we propose a contention-based en masse assignment (CBEA) algorithm that assigns to each SD pair a relay that is capable of aiding it. Both Split Select and CBEA are fast and scale well with the number of nodes. For example, Split Select requires just 2.2 slots, on average, to assign a sub channel to its best user even when there are an asymptotically large number of contending users. Likewise, CBEA often takes far less than one slot, on average, to assign a relay to each SD pair. Advisors/Committee Members: Mehta, Neelesh B.

Subjects/Keywords: Wireless Communication Systems; Orthogonal Frequency Division Multiple Access System; Multi-source Multi-destination Cooperative Relay System; Wireless Systems - Multi-Node Selection; Multiple Access Channel (MAC)-based Selection; Cooperative Wireless Systems - Contention-based Algorithms; Wireless Systems - Opportunistic Selection Algorithms; OFDMA Systems; MSD System; Communication Engineering

Record Details  Similar Records    Google PlusoneFacebookTwitterCiteULikeMendeleyreddit

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karthik, A. (2013). Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3441 ; http://etd.iisc.ernet.in/abstracts/4308/G25960-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Karthik, A. “Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems.” 2013. Thesis, Indian Institute of Science. Accessed December 13, 2019. http://etd.iisc.ernet.in/2005/3441 ; http://etd.iisc.ernet.in/abstracts/4308/G25960-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Karthik, A. “Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems.” 2013. Web. 13 Dec 2019.

Vancouver:

Karthik A. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2019 Dec 13]. Available from: http://etd.iisc.ernet.in/2005/3441 ; http://etd.iisc.ernet.in/abstracts/4308/G25960-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karthik A. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3441 ; http://etd.iisc.ernet.in/abstracts/4308/G25960-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.