This thesis contributes toward the design of a reliable and energy-efficient transport system for Wireless Sensor Networks. Wireless Sensor Networks have emerged as a vital new area in networking research. In many Wireless Sensor Network systems, a common task of sensor nodes is to sense the environment and send the sensed data to a sink node. Thus, the effectiveness of a Wireless Sensor Network depends on how reliably the sensor nodes can deliver their sensed data to the sink. However, the sensor nodes are susceptible to loss for various reasons when there are dynamics in wireless transmission medium, environmental interference, battery depletion, or accidentally damage, etc. Therefore, assuring reliable data delivery between the sensor nodes and the sink in Wireless Sensor Networks is a challenging task. The primary contributions of this thesis include four parts. First, we design, implement, and evaluate a cross-layer communication protocol for reliable data transfer for data streaming applications in Wireless Sensor Networks. We employ reliable algorithms in each layer of the communication stack. At the MAC layer, a CSMA MAC protocol with an explicit hop-by-hop Acknowledgment loss recovery is employed. To ensure the end-to-end reliability, the maximum number of retransmissions are estimated and used at each sensor node. At the transport layer, an end-to-end Negative Acknowledgment with an aggregated positive Acknowledgment mechanism is used. By inspecting the sequence numbers on the packets, the sink can detect which packets were lost. In addition, to increase the robustness of the system, a watchdog process is implemented at both base station and sensor nodes, which enable them to power cycle when an unexpected fault occurs. We present extensive evaluations, including theoretical analysis, simulations, and experiments in the field based on Fleck-3 platform and the TinyOS operating system. The designed network system has been working in the field for over a year. The results show that our system is a promising solution to a sustainable irrigation system. Second, we present the design of a policy-based Sensor Reliability Management framework for Wireless Sensor Networks called SRM. SRM is based on hierarchical management architecture and on the policy-based network management paradigm. SRM allows the network administrators to interact with the Wireless Sensor Network via the management policies. SRM also provides a self-control capability to the network. This thesis restricts SRM to reliability management, but the same framework is also applicable for other management services by providing the management policies. Our experimental results show that SRM can offer sufficient reliability to the application users while reducing energy consumption by more than 50% compared to other approaches. Third, we propose an Energy-efficient and Reliable Transport Protocol called ERTP, which is designed for data streaming applications in Wireless Sensor Networks. ERTP is an adaptive transport protocol based on statistical reliability that ensures the number of data packets delivered to the sink exceeds the defined threshold while reducing the energy consumption. Using a statistical reliability metric when designing a reliable transport protocol guarantees the delivery of adequate information to the users, and reduces energy consumption when compared to the absolute reliability. ERTP uses hop-by-hop Implicit Acknowledgment with a dynamically updated retransmission timeout for packet loss recovery. In multihop wireless networks, the transmitter can overhear a forwarding transmission and interpret it as an Implicit Acknowledgment. By combining the statistical reliability and the hop-by-hop Implicit Acknowledgment loss recovery, ERTP can offer sufficient reliability to the application users with minimal energy expense. Our extensive simulations and experimental evaluations show that ERTP can reduce energy consumption by more than 45% when compared to the state-of- the-art protocol. Consequently, sensor nodes are more energy-efficient and the lifespan of the unattended Wireless Sensor Network is increased. In Wireless Sensor Networks, sensor node failures can create network partitions or coverage loss which can not be solved by providing reliability at higher layers of the protocol stack. In the final part of this thesis, we investigate the problem of maintaining the network connectivity and coverage when the sensor nodes are failed. We consider a hybrid Wireless Sensor Network where a subset of the nodes has the ability to move at a high energy expense. When a node has low remaining energy (dying node) but it is a critical node which constitutes the network such as a cluster head, it will seek a replacement. If a redundant node is located in the transmission range of the dying node and can fulfill the network connectivity and coverage requirement, it can be used for substitution. Otherwise, a protocol should be in place to relocate the redundant sensor node for replacement. We propose a distributed protocol for Mobile Sensor Relocation problem called Moser. Moser works in three phases. In the first phase, the dying node determines if network partition occurs, finds an available mobile node, and asks for replacement by using flooding algorithm. The dying node also decides the movement schedule of the available mobile node based on certain criteria. The second phase of the Moser protocol involves the actual movement of the mobile nodes to approach the location of the dying node. Finally, when the mobile node has reached the transmission of the dying node, it communicates to the dying nodes and moves to a desired location, where the network connectivity and coverage to the neighbors of the dying nodes are preserved.

<p>Shooter localization systems are used to detect and locate the origin of gunfire. A wireless sensor network is one possible implementation of such a system. A wireless sensor network is sensitive to synchronization errors. Localization techniques that rely on the timing will give less accurate or even useless results if the synchronization errors are too large.</p><p>This thesis focuses on the influence of synchronization errors on the abilityto localize a shooter using a wireless sensor network. A localization algorithm</p><p>is developed and implemented and the effect of synchronization errors is studied. The localization algorithm is evaluated using numerical experiments, simulations, and data from real gunshots collected at field trials.</p><p>The results indicate that the developed localization algorithm is able to localizea shooter with quite good accuracy. However, the localization performance is to a high degree influenced by the geographical configuration of the network as well as the synchronization error.</p> / <p><p>Skottlokaliseringssystem används för att upptäcka och lokalisera ursprunget för avlossade skott. Ett trådlöst sensornätverk är ett sätt att utforma ett sådant system.Trådlösa sensornätverk är känsliga för synkroniseringsfel. Lokaliseringsmetoder som bygger på tidsobservationer kommer med för stora synkroniseringsfel ge dåliga eller helt felaktiga resultat.</p><p>Detta examensarbete fokuserar på vilken inverkan synkroniseringsfel har på möjligheterna att lokalisera en skytt i ett trådlöst sensornätverk. En lokaliseringsalgoritm utvecklas och förmågan att korrekt lokalisera en skytt vid olika synkroniseringsfel undersöks. Lokaliseringsalgoritmen prövas med numeriska experiment, simuleringar och även för data från riktiga skottljud, insamlade vid fältförsök.</p><p>Resultaten visar att lokaliseringsalgoritmen fungerar tillfredställande, men att lokaliseringsförmågan till stor del påverkas av synkroniseringsfel men även av sensornätverkets geografiska utseende.</p></p>

Mobile communication systems are experiencing a huge growth. While traditional communication paradigms deal with fixed networks, mobility raises a new set of questions, techniques, and solutions. This work focuses on wireless sensor networks (WSNs) where each node is a mobile device. The main objectives of this thesis have been to develop algorithms and protocols enabling WSNs with a special interest in overcoming mobility support limitations of standards such as Bluetooth and Zigbee. The contributions of this work may be divided in four major parts related to mobility support. The first part describes the implementation of local positioning services in Bluetooth since local positioning is not supported in Bluetooth v1.1. The obtained results are used in later implemented handover algorithms in terms of deciding when to perform the handover. Moreover local positioning information may be used in further developed routing protocols. The second part deals with handover as a solution to overcome the getting out of range problem. Algorithms for handover have been implemented enabling mobility in Bluetooth infrastructure networks. The principal achievement in this part is the significant reduction of handover latency since sensor cost and quality of service are directly affected by this parameter. The third part solves the routing problems originated with handovers. The main contribution of this part is the impact of the Bluetooth scatternet formation and routing protocols, for multi-hop data transmissions, in the system quality of service. The final part is a comparison between Bluetooth and Zigbee in terms of mobility support. The main outcome of this comparison resides on the conclusions, which can be used as a technology election guide. The main scientific contribution relies on the implementation of a mobile WSN with Bluetooth v1.1 inside the scope of the ”Multi Monitoring Medical Chip (M3C) for Homecare Applications” European Union project (Sixth Framework Program (FP6) Reference: 508291) offering multi-hop routing support and improvements in handover latencies with aid of local positioning services.

Localization and coverage are two important and closely related problems in wireless ad hoc networks. Localization aims to determine the physical locations of devices in a network, while coverage determines if a region of interest is sufficiently monitored by devices. Localization systems require a high degree of coverage for correct functioning, while coverage schemes typically require accurate location information. This thesis investigates the relationship between localization and coverage such that new schemes can be devised which integrate approaches found in each of these well studied problems. This work begins with a thorough review of the current literature on the subjects of localization and coverage. The localization scheduling problem is then introduced with the goal to allow as many devices as possible to enter deep sleep states to conserve energy and reduce message overhead, while maintaining sufficient network coverage for high localization accuracy. Initially this sufficient coverage level for localization is simply a minimum connectivity condition. An analytical method is then proposed to estimate the amount of localization error within a certain probability based on the theoretical lower bounds of location estimation. Error estimates can then be integrated into location dependent schemes to improve on their robustness to localization error. Location error estimation is then used by an improved scheduling scheme to determine the minimum number of reference devices required for accurate localization. Finally, an optimal coverage preserving sleep scheduling scheme is proposed which is robust to localization error, a condition which is ignored by most existing solutions. Simulation results show that with localization scheduling network lifetimes can be increased by several times and message overhead is reduced while maintaining negligible differences in localization error. Furthermore, results show that the proposed coverage preserving sleep scheduling scheme results in fewer active devices and coverage holes under the presence of localization error.

Localization accuracy based on RSS (Received Signal Strength) is notoriously inaccurate in the application of wireless sensor networks. RSS is subject to shadowing effects, which is signal attenuation caused by stationary objects in the radio propagation. RSS are actually the result of decay over distances, and random attenuation over different directions. RSS measurement is also affected by antenna orientation. Starting from extracting the statistical orders in the function relationship between RSS and distance, this thesis first shows how non-metric MDS (Multi-Dimensional Scaling) is the suitable method for cooperative localization. Then, several issues are presented and discussed in the application of non-metric MDS, including determining full connections to avoid flip ambiguities, leveraging the proper initial estimation to avert from local minimum solutions, and imposing structural information to bend the localization result to a priori knowledge. To evaluate the solution, data were acquired from different scenarios including accurate radio propagation model, indoor empirical test, and outside empirical test. Experiment results shows that non-metric MDS can only combat the small scale randomness in the shadowing effects. To combat the large scale ones, macro-diversity approaches are further presented including rotating the receiver’s antenna or collecting RSS from more than one mote in the same position. By averaging the measurements from these diversified receivers, simulation results and empirical tests show that shadowing effects can be greatly reduced. Also included in this thesis is how effective packet structures should be designed in the mote programming based on TinyOS to collect different sequences of RSS measurements and fuse them together. / UOIT

Localization and coverage are two important and closely related problems in wireless ad hoc networks. Localization aims to determine the physical locations of devices in a network, while coverage determines if a region of interest is sufficiently monitored by devices. Localization systems require a high degree of coverage for correct functioning, while coverage schemes typically require accurate location information. This thesis investigates the relationship between localization and coverage such that new schemes can be devised which integrate approaches found in each of these well studied problems. This work begins with a thorough review of the current literature on the subjects of localization and coverage. The localization scheduling problem is then introduced with the goal to allow as many devices as possible to enter deep sleep states to conserve energy and reduce message overhead, while maintaining sufficient network coverage for high localization accuracy. Initially this sufficient coverage level for localization is simply a minimum connectivity condition. An analytical method is then proposed to estimate the amount of localization error within a certain probability based on the theoretical lower bounds of location estimation. Error estimates can then be integrated into location dependent schemes to improve on their robustness to localization error. Location error estimation is then used by an improved scheduling scheme to determine the minimum number of reference devices required for accurate localization. Finally, an optimal coverage preserving sleep scheduling scheme is proposed which is robust to localization error, a condition which is ignored by most existing solutions. Simulation results show that with localization scheduling network lifetimes can be increased by several times and message overhead is reduced while maintaining negligible differences in localization error. Furthermore, results show that the proposed coverage preserving sleep scheduling scheme results in fewer active devices and coverage holes under the presence of localization error.

An achievable rate region for general wireless sensor networks is proposed. A general multi-source, multi-relay, multi-destination wireless sensor network with arbitrarily correlated sources is considered. Each node can sense some real phenomena and send its readings to one or more sinks (data gathering nodes) via some relays. It also can relay some correlated or independent readings of other nodes, simultaneously. In this problem the source and channel coding separation is not optimal and the information which each reading has about others nodes is destroyed in separation. Thus, a joint source channel coding scheme can be used. The problem consists of relay channels and multiple access channels with arbitrarily correlated sources. The proposed scheme is based on regular block Markov encoding/backward decoding and code division multiple-access (CDMA) and the result is a combination of multi-relay and multiple-access with correlated sources.

Radio Frequency Identification (RFID) technology is an electronic labeling technique.These electronic labels are called tags and read wirelessly. In this thesis a battery and amicroprocessor are connected to the tag. The work consisted of programming themicroprocessor to transfers sensor data into the tags memory. The tags are placed ontrains and data is collected from sensors at the train's axle. That way sensor data can betransmitted from a train to readers stationed along the railroad tracks.The aim of the project is to predict service intervals. There is currently no possibility tosee wear in real time and stop a train before it breaks. At present, there is a form of heatdetectors located along the railroad tracks to measure temperatures of wheels and axlesof passing trains. These are expensive and have the disadvantage of being able to detecterrors that have already occurred, they can not detect errors that do not radiate heat.The thesis aims to provide a solution for this. By programming a microprocessor totransmit sensor data to the tags memory it is possible for an RFID reader to read thesensor data from the tag. Ensuring that data and identity can be read from the tag atspeeds up to 250 km/h, you can get the status of a trains wagon before it breaks.

An achievable rate region for general wireless sensor networks is proposed. A general multi-source, multi-relay, multi-destination wireless sensor network with arbitrarily correlated sources is considered. Each node can sense some real phenomena and send its readings to one or more sinks (data gathering nodes) via some relays. It also can relay some correlated or independent readings of other nodes, simultaneously. In this problem the source and channel coding separation is not optimal and the information which each reading has about others nodes is destroyed in separation. Thus, a joint source channel coding scheme can be used. The problem consists of relay channels and multiple access channels with arbitrarily correlated sources. The proposed scheme is based on regular block Markov encoding/backward decoding and code division multiple-access (CDMA) and the result is a combination of multi-relay and multiple-access with correlated sources.

With the advances of wireless communications and micro-electronic device technologies, wireless sensor networks have been applied in a wide spectrum of applications, including one of the killer applications--object tracking. Among numerous challenges in object tracking, one of the important issues is the energy management. One solution to the above issue is the mobile agent-based paradigm. Using the mobile agent in wireless sensor networks has many advantages over the client/server paradigm in terms of energy consumptions, networks band-width, etc. In this thesis, we adopt the mobile agent-based paradigm to support object track-ing in wireless sensor networks. Although using the mobile agents for object tracking can improve the overall perfor-mance, the hurdle is the determination of the mobile agent itinerary. The past studies on ob-ject tracking considered the object¡¦s movement behavior as randomness or the direction and the speed of the object remain constant for a certain period of time. However, in most real-world cases, the object movement behavior is often based on certain underlying events rather than randomness complete. With this assumption, the movements of objects are some-times predictable. Through the prediction, the mobile agent can determine which node to mi-grate in order to reduce energy consumption and increase the performance of object tracking. In this thesis, we develop a mining-based approach to discover the useful patterns from the object¡¦s movement behavior. This approach utilizes the discovered rules to choose the sensor node the mobile agent needs to migrate in order to reduce the number of wrong migration, to reduce total energy consumed by sensor nodes, and to prolong the lifetime of the wireless sensor network. Experimental results show the efficiency of the proposed approach.