ERA

Download the full-sized PDF of RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREESDownload the full-sized PDF

Analytics

Share

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

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

RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES Open Access

Descriptions

Other title
Subject/Keyword
Wireless Sensor Networks
Degree Constraint Shortest Path Tree
Reliability
Multiple Sinks
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Islam, Mohammad S
Supervisor and department
Harms, Janelle (Computing Science)
Examining committee member and department
Stewart, Lorna (Computing Science)
Wong, Kenny (Computing Science)
Nikolaidis, Ioanis (Computing Science)
Harms, Janelle (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2013-03-14T10:09:12Z
Graduation date
2013-06
Degree
Master of Science
Degree level
Master's
Abstract
Wireless Sensor networks (WSN) have gained attention in both industry and academia due to their versatile fields of application. One of the main characteristics of a sensor node is its limited energy supply. The network needs to be reliable in the sense that it can deliver the data to sink with the presence of multiple link failures. Having more than one sink provides alternative paths to route packets in the presence of link failures and helps load balancing. Degree Constrained Shortest Path Trees (DCSPT) can be used as routing trees to limit the communication of sensor nodes thus conserving energy. In this thesis, we consider the problem of designing logical topologies for routing in WSNs with multiple sinks. We design reliable logical topologies most of which are based on DCSPT in grid and random graphs. We also design scheduling and routing algorithms for the logical topologies and evaluate the reliability of the designs using simulation. We demonstrate that with moderate link failures our schemes can reliably transfer data with low delay and the performance improves as the load of the network decreases.
Language
English
DOI
doi:10.7939/R3914H
Rights
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 these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before 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-29T17:56:05.163+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: 1091278
Last modified: 2015:10:12 15:09:21-06:00
Filename: Islam_Mohammad_Spring 2013.pdf
Original checksum: f9d1d18d84adbed2f5c8ef42d70d9baa
Well formed: false
Valid: false
Status message: Lexical error offset=1075921
Page count: 104
Activity of users you follow
User Activity Date