Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Localization of nodes in wired and wireless networks

This thesis focuses on the implementation of algorithms for localization of nodes in wired and wireless networks. The thesis is organized into two papers. The first paper presents the localization algorithms based on time of arrival (TOA) and time difference of arrival (TDOA) techniques for computer networks such as the Internet by using round-trip-time (RTT) measurements obtained from known positions of the gateway nodes. The RTT values provide an approximate measure of distance between the gateway nodes and an unknown node. The least squares technique is then used to obtain an estimated position of the unknown node. The second paper presents localization of an unknown node during route setup messages in wireless ad hoc and sensor networks using a new routing protocol. A proactive multi-interface multichannel routing (MMCR) protocol, recently developed at Missouri S&T, was implemented on the Missouri S&T motes. This protocol calculates link costs based on a composite metric defined using the available end-to-end delay, energy utilization, and bandwidth, and it chooses the path that minimizes the link cost factor to effectively route the information to the required destination. Experimental results indicate enhanced performance in terms of quality of service, and implementation of this protocol requires no modification to the current IEEE 802.11 MAC protocol. Received signal strength indicator (RSSI) values are recorded from the relay nodes (gateway nodes) to the unknown node during route setup messages. The location of the unknown node is estimated using these values with some a priori profiling and the known positions of the relay nodes as inputs to the least squares technique --Abstract, page iv

Energy-Efficient Querying of Wireless Sensor Networks

Due to the distributed nature of information collection in wireless sensor networks and the inherent limitations of the component devices, the ability to store, locate, and retrieve data and services with minimum energy expenditure is a critical network function. Additionally, effective search protocols must scale efficiently and consume a minimum of network energy and memory reserves. A novel search protocol, the Trajectory-based Selective Broadcast Query protocol, is proposed. An analytical model of the protocol is derived, and an optimization model is formulated. Based on the results of analysis and simulation, the protocol is shown to reduce the expected total network energy expenditure by 45.5 percent to 75 percent compared to current methods. This research also derives an enhanced analytical node model of random walk search protocols for networks with limited-lifetime resources and time-constrained queries. An optimization program is developed to minimize the expected total energy expenditure while simultaneously ensuring the proportion of failed queries does not exceed a specified threshold. Finally, the ability of the analytical node model to predict the performance of random walk search protocols in large-population networks is established through extensive simulation experiments. It is shown that the model provides a reliable estimate of optimum search algorithm parameters

Towards low power radio localisation

This work investigates the use of super-resolution algorithms for precision localisation and long-term tracking of small subjects, like rodents. An overview is given of a variety of techniques for positioning in use today, namely received signal strength, time of arrival, time difference of arrival and direction of arrival (DoA). Based on the analysis, it is concluded that the direction finding signal subspace based techniques are most appropriate for the purposes of our system. The details of the software defined radio (SDR) antenna array testbed development, build, characterisation and performance evaluation are presented. The results of direction finding experiments in the screened anechoic chamber emulating open-space propagation are discussed. It is shown that such testbed is capable of locating sources in the vicinity of the array with high precision. It can estimate the DoAs of more simultaneously working transmitters than antennas in the array, by employing spread spectrum techniques, and readily accommodates very low power sources. Overall constraints on the system are such that the operational range must be around 50 – 100 m. The transmitter must be small both volumetrically and in terms of weight. It also has to be operational over an extended period of around 1 year. The implications of these are that very small antennas and batteries must be used, which are usually accompanied by very low transmission efficiencies and tiny capacities, respectively. Based on the above, the use of ultra-low power oscillator transmitters, as first cut prototypes of the tag, is proposed. It is shown that the Clapp, Colpitts, Pierce and Cross-coupled architectures are adequate. A thorough analysis of these topologies is provided with full details of tag and antenna co-design. Finally the performance of these architectures is evaluated through simulations with respect to power output, overall efficiency and phase noise.Open Acces

Localization Of Sensors In Presence Of Fading And Mobility

The objective of this dissertation is to estimate the location of a sensor through analysis of signal strengths of messages received from a collection of mobile anchors. In particular, a sensor node determines its location from distance measurements to mobile anchors of known locations. We take into account the uncertainty and fluctuation of the RSS as a result of fading and take into account the decay of the RSS which is proportional to the transmitter-receiver distance power raised to the PLE. The objective is to characterize the channel in order to derive accurate distance estimates from RSS measurements and then utilize the distance estimates in locating the sensors. To characterize the channel, two techniques are presented for the mobile anchors to periodically estimate the channel\u27s PLE and fading parameter. Both techniques estimate the PLE by solving an equation via successive approximations. The formula in the first is stated directly from MLE analysis whereas in the second is derived from a simple probability analysis. Then two distance estimates are proposed, one based on a derived formula and the other based on the MLE analysis. Then a location technique is proposed where two anchors are sufficient to uniquely locate a sensor. That is, the sensor narrows down its possible locations to two when collects RSS measurements transmitted by a mobile anchor, then uniquely determines its location when given a distance to the second anchor. Analysis shows the PLE has no effect on the accuracy of the channel characterization, the normalized error in the distance estimation is invariant to the estimated distance, and accurate location estimates can be achieved from a moderate sample of RSS measurements