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:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Multiple source destination). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Ontario Institute of Technology

1. Zuo, Fangzhi. Energy-efficient relay cooperation for lifetime maximization.

Degree: 2011, University of Ontario Institute of Technology

We study energy-efficient power allocation among relays for lifetime maximization in a dual-hop relay network operated by amplify-and-forward relays with battery limitations. Power allocation algorithms are proposed for three different scenarios. First, we study the relay cooperation case where all the relays jointly support transmissions for a targeted data rate. By exploring the correlation of time-varying relay channels, we develop a prediction-based relay cooperation method for optimal power allocation strategy to improve the relay network lifetime over existing methods that do not predict the future channel state, or assume the current channel state remains static in the future. Next, we consider energy-efficient relay selection for the single source-destination case. Assuming finite transmission power levels, we propose a stochastic shortest path approach which gives the optimal relay selection decision to maximize the network lifetime. Due to the high computational complexity, a suboptimal prediction-based relay selection algorithm, directly coming from previous problem, is created. Finally, we extend our study to multiple source-destination case, where relay selection needs to be determined for each source-destination pair simultaneously. The network lifetime in the presence of multiple source-destination pairs is defined as the longest time when all source-destination pairs can maintain the target transmission rate. We design relay-to-destination mapping algorithms to prolong the network lifeii time. They all aim at maximizing the perceived network lifetime at the current time slot. The optimal max-min approach and suboptimal user-priority based approach are proposed with different levels of computational complexity. Advisors/Committee Members: Dong, Min.

Subjects/Keywords: Energy-efficient power allocation; Lifetime maximization; Amplify-and-forward; Prediction-based; Stochastic shortest path; Prediction-based relay selection; Multiple source destination; Max-min approach; User-priority based approach.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zuo, F. (2011). Energy-efficient relay cooperation for lifetime maximization. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/188

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):

Zuo, Fangzhi. “Energy-efficient relay cooperation for lifetime maximization.” 2011. Thesis, University of Ontario Institute of Technology. Accessed December 04, 2020. http://hdl.handle.net/10155/188.

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

MLA Handbook (7th Edition):

Zuo, Fangzhi. “Energy-efficient relay cooperation for lifetime maximization.” 2011. Web. 04 Dec 2020.

Vancouver:

Zuo F. Energy-efficient relay cooperation for lifetime maximization. [Internet] [Thesis]. University of Ontario Institute of Technology; 2011. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/10155/188.

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

Council of Science Editors:

Zuo F. Energy-efficient relay cooperation for lifetime maximization. [Thesis]. University of Ontario Institute of Technology; 2011. Available from: http://hdl.handle.net/10155/188

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


Indian Institute of Science

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

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

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 (advisor).

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karthik, A. (2018). Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3441

Chicago Manual of Style (16th Edition):

Karthik, A. “Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed December 04, 2020. http://etd.iisc.ac.in/handle/2005/3441.

MLA Handbook (7th Edition):

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

Vancouver:

Karthik A. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Dec 04]. Available from: http://etd.iisc.ac.in/handle/2005/3441.

Council of Science Editors:

Karthik A. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3441

.