Data Aggregation in Wireless Sensor Networks with Multiple Sinks
| dc.contributor.author | Yestemirova, Gaukhar | |
| dc.date.accessioned | 2018-11-01T10:24:52Z | |
| dc.date.available | 2018-11-01T10:24:52Z | |
| dc.date.issued | 2017-04 | |
| dc.description.abstract | The invention of wireless sensor networks (WSNs) has caused a technological breakthrough in almost all industry fields that need to acquire regular and reliable real-time data from the field of interest. Today WSNs are used in many applications, including environmental, industrial, health care, and military. A WSN is a network comprised of sensors devices, usually called nodes, and a designated device called a sink to which nodes transmit their sensed data. Nodes are low-cost, battery-powered devices with limited memory and computational power. Usually WSNs are deployed and left unattended for a long time. During this time the WSN can experience different faulty scenarios. For example, nodes and sink can crash or communication between them can go down. In such cases, the network becomes useless as the sink will not be able to collect data from nodes. One way to increase the reliability of such WSNs is to deploy them with more than one sink so that when one sink goes down other sinks could forward collected data. A number of data collection protocols have been proposed so far. However, they have been proposed mainly for WSNs with a single sink. Existing protocols developed for WSNs with a single sink does not show the similar system efficiency to WSNs with multiple sinks. In this thesis work, we propose three data aggregation protocols for WSNs with multiple sinks: i) an adjusted form of Minimum Spanning Tree (MST); ii) two adjusted forms of Shortest Path Tree (SPT) and i) Maximum Spanning Backbone (MSB) that try to minimize the number of message transmissions during data collection. In all cases we first build a tree and then highlight the set of nodes that connect all the sinks and call them backbone nodes. These backbone nodes first collect the data from the nodes, then send aggregated data to all the sinks. We show the performance of our proposed protocols using simulation program. The simulation results from least to most backbone nodes as the following: MSB, two adjustments of SPT and MST. | en_US |
| dc.identifier.citation | Gaukhar Yestemirova. Data Aggregation in Wireless Sensor Networks with Multiple Sinks. 2017. Department of of Robotics and Mechatronics, School of Science and Technology, Nazarbayev University | en_US |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/3589 | |
| dc.language.iso | en | en_US |
| dc.publisher | Nazarbayev University School of Science and Technology | en_US |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Wireless Sensor Networks | en_US |
| dc.title | Data Aggregation in Wireless Sensor Networks with Multiple Sinks | en_US |
| dc.type | Master's thesis | en_US |
| workflow.import.source | science |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- MS_Thesis_Gaukhar_Yestemirova_Spring_2017.pdf
- Size:
- 1.38 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 6 KB
- Format:
- Item-specific license agreed upon to submission
- Description: