Efficient and reliable data dissemination and convergecast in Wireless Sensor Networks

Preview

PDF WRAP_THESIS_Saginbekov_2014.pdf - Submitted Version - Requires a PDF viewer. Download (9MB) | Preview

Request Changes to record.

Abstract

With the availability of cheap sensor nodes now it is possible to use hundreds of nodes in a Wireless Sensor Network (WSN) application. Since then WSN applications have been being used in a wide range of applications, including environmental, industrial, military, health-care and indoor applications. WSNs are composed of sensor nodes, also known as motes, that are small in size, usually battery powered, and have limited memory and computing capabilities.

As opposed to other wireless networks of more powerful nodes such as laptops, cellular phones, PDAs, etc., where communications can occur between any two nodes, in WSNs there are mainly two communication types: (i) broadcast, where a designated node, called a sink, disseminates data to all other nodes and (ii) convergecast, where all nodes send their generated data to the sink.

After deploying sensor nodes in an area of interest, they are usually unattended for a long time. Since motes are battery powered, the energy conservation is of great importance. Furthermore, due to limited resources such as computing, memory and energy, harsh environmental conditions and buggy programs, wireless sensors may experience a number of different types of faults.

Given the characteristics of sensor nodes and the environment they are deployed in, any WSN communication protocol and algorithm should be energy efficient and tolerant to faults. Several efficient communication protocols have been proposed so far. However, there are several aspects that has seen very little activity in the literature: (i) Handling transient faults and (ii) Dealing with two or more sinks. Therefore, in this thesis, we are proposing to address some of the issues that are still open. Specifically, we are planning to look at fault tolerance in data dissemination and the development of an infrastructure for two sinks.

In this thesis, (i) we try to make data dissemination protocols resilient to faults that can corrupt values stored in the memory and messages by presenting two algorithms that when added to fault-intolerant dissemination protocols, make the code dissemination protocols fault-tolerant, (ii) we try to minimize drawbacks of existing code update maintenance algorithms by proposing a new algorithm that efficiently maintains code updates in WSNs, and (iii) we propose an efficient data aggregation convergecast scheduling algorithm for wireless sensor networks with two sinks.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item