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

• Author / Creator

  Islam, Mohammad S

• 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.

• Subjects / Keywords

  • Degree Constraint Shortest Path Tree
  • Reliability
  • Multiple Sinks
  • Wireless Sensor Networks

• Graduation date

  Spring 2013

• Type of Item

  Thesis

• Degree

  Master of Science

• DOI

  https://doi.org/10.7939/R3914H

• License

  This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.