ERA

Download the full-sized PDF of Routing Strategies for Multihop Wireless Relaying NetworksDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3TC9H

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Routing Strategies for Multihop Wireless Relaying Networks Open Access

Descriptions

Other title
Subject/Keyword
Multihop communications
Outage probability
Routing metric
Routing algorithm
Power allocation
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Babaee, Ramin
Supervisor and department
Beaulieu, Norman C. (Electrical and Computer Engineering)
Examining committee member and department
Ardakani, Masoud (Electrical and Computer Engineering)
Elmallah, Ehab S. (Computing Science)
Department
Department of Electrical and Computer Engineering
Specialization

Date accepted
2010-12-23T22:44:47Z
Graduation date
2011-06
Degree
Master of Science
Degree level
Master's
Abstract
Multihop routing is an effective method for establishing connectivity between the nodes of a network. End-to-end outage probability and total power consumption are applied as the optimization criteria for routing protocol design in multihop networks based on the local channel state information measurement at the nodes of a network. The analysis shows that employing instantaneous channel state information in routing design results in significant performance improvement of multihop communication, e.g., achieving full diversity order when the optimization criterion is outage performance. The routing metrics derived from the optimization problems cannot be optimized in a distributed manner. Establishing an alternate framework, the metrics obtained are converted into new composite metrics, which satisfy the optimality and convergence requirements for implementation in distributed environments. The analysis shows that the running time of the proposed distributed algorithm is bounded by a polynomial.
Language
English
DOI
doi:10.7939/R3TC9H
Rights
License granted by Ramin Babaee (babaee@ualberta.ca) on 2010-12-23T22:31:01Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-30T22:06:34.373+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 693241
Last modified: 2015:10:12 20:22:18-06:00
Filename: dissertation.pdf
Original checksum: 740f21e7ccca96ddee83b8b19ba23b2f
Well formed: true
Valid: true
File title: dissertation.dvi
Page count: 94
Activity of users you follow
User Activity Date