The work described in this thesis is concerned with self-localisation (automated estimation of sensor locations) and source-localisation (location of a target) using Wireless Sensor Networks (WSNs). The motivation for the research in this thesis is the on-line localisation of marmots from their alarm calls. The application requires accurate 3D self-localisation (within a small percentage of sensor spacing) as well as timely operation. Further challenges are added by the high data-rate involved: sensor nodes acquire data at a rate that is greater than the available network bandwidth. This data cannot be streamed over a multi-hop network, implying a need for data reduction through in-network event detection and local data compression or filtering techniques. The research approach adopted in this thesis combined simulation, emulation and real-life experimentation. Real-life deployment and experimentation highlighted problems that could not be predicted in controlled experiments or simulation. Emulation used data gathered from controlled, real-life experimentation to simulate proposed system refinements; this was sufficient to provide a proof-of-concept validation for some of the concepts developed. Simulation allowed the understanding of underlying theoretical behaviour without involving the complex environmental effects caused by real-life experimentation. This thesis details contributions in two distinct aspects of localisation: acoustic ranging and end-toend deployable acoustic source localisation systems. With regard to acoustic ranging and 3D localisation, two WSN platforms were evaluated: one commercially available, but heavily constrained (Mica2) and one custom-built for accurate localisation (Embedded Networked Sensing Box (ENSBox)). A new proof of concept platform for acoustic sensing (based on the Gumstix single-board computer) was developed by the author (including the implementation of a ranging mechanism), based on experiences with the platforms above. Furthermore, the literature was found to lack a specific procedure for evaluation and comparison of self-localisation algorithms from theoretical conception to real-life testing. Therefore, an evaluation cycle for self-localisation algorithms that encompassed simulation, emulation and real-life deployment was developed. With respect to source localisation, a hardware and software platform named VoxNet was designed and implemented.

We use tools and techniques from information theory to improve the design of Wireless Sensor Networks (WSNs). We do this by first developing a model for WSNs that is analogous to models of communication systems in information theory. In particular, we define the notion of WSN Coding, which is analogous to source coding from information theory, and the Collection Channel, which is analogous to a transport channel in information theory. We then use source coding theorems from information theory to develop three results that aid in WSN design. First, we propose a new top-level design metric for WSNs. Second, we develop an efficiency measure for the sensing process in a WSN. Finally, we use techniques from source coding schemes to suggest new designs for WSNs and the sensors they contain. We strive for tools that apply under the most general conditions possible so that designers can use them in any WSN. However, we also apply each tool to a specific example WSN illustrate the tool's value.

Wireless sensor networks have been used in different applications due to the advancement of sensor technology. These uses also have raised different optimization issues. Most of the algorithms proposed as solutions to the various optimization problems are either centralized or distributed which are not ideal for these real life applications. Very few strictly local algorithms for wireless sensor networks exist in the literature. In this thesis, we consider some of these optimization problems of sensor networks, for example, sleep-wake scheduling, mobile dispersion, mobile object monitoring, and gathering problems. We also consider the depth adjustment problem of underwater sensor networks. We design cellular automaton based local algorithms for these problems. The cellular automaton is a bioinspired model used to model different physical systems including wireless sensor networks. One of the main advantages of using cellular automaton based algorithms is that they need very little local information to compute a solution. We perform different simulations and analysis and find that our algorithms are efficient in practice. / Thesis (Ph.D, Computing) -- Queen's University, 2012-11-25 13:37:36.854

Over the past decade, wireless sensor networks have gained more research attention for their potential applications in healthcare, defense, environmental monitoring, etc. Due to the strict energy limitation in the sensor node, techniques used for energy saving are necessary for this kind of network. MIMO technology is proven to be an effective method of increasing the channel capacity and supporting higher data rate under a fixed power budget and bit-error-rate requirement. So, wireless sensor networks and MIMO technology are combined and investigated in this thesis. The key contributions of this thesis are detailed below. Firstly, the extended total energy consumption equations for different transmission modes in cluster-based wireless sensor networks are derived. The transmitting energy consumption and the circuit energy consumption are taken into account in both intra-cluster and inter-cluster phases respectively. Secondly, a resource allocation framework is proposed for cluster-based cooperative MIMO on consideration of circuit energy. By introducing two adjusting parameters for the transmitting energy and the time slot allocation between intra-cluster and inter-cluster phases, this framework is designed to achieve the maximum data throughput of the whole system whilst maintaining the capacity and outage probability requirement in these two phases respectively. Thirdly, on comparison of various transmission modes in wireless sensor networks, a relatively energy-efficient mode switching framework is proposed for both single-hop and multi-hop transmissions. Based on the destination and the neighboring nodes’ path-loss, the source node can decide which transmission mode, SISO or cooperative MISO, single-hop or multi-hop, should be chosen. Conditions for each mode switching are investigated. The possible existing area of the cooperative nodes and the relaying nodes can be obtained from this framework.

Wireless Sensor Networks (WSNs) is an important field of study as more and more applications are enhancing daily life. The technology trend is to achieve small-sized, cheap, and power efficient sensor nodes, which will make the system reliable and efficient. The Crossbow Technologies MICAz mote is an example used in this thesis. Measurements for its propagation characteristics in a realistic environment will help the deployment and installation of these motes to form a WSN. The CST Microwave Studio is used to build a simulation for the MICAz. The Rhino software is used to build Spanagel Hall, which is the location of the simulation. All of these elements are integrated in Urbana. Urbana is a simulation tool used to simulate the propagation decay around the mote and investigate the irregularity of the electromagnetic field for the indoor environment of the motes. The results and comparisons between empirical and simulated data are intended for assisting in the design and future studies and deployment of WSNs in the real world. / Jordanian Army author.

The meteoric rise and prevalent usage of wireless networking technologies for mobile communication applications have captured the attention of media and imagination of public in the recent decade. One such proliferation is experienced in Wireless Sensor Networks (WSNs), where multimedia enabled elements are fused with integrated sensors to empower tightly coupled interaction with the physical world. As a promising alternative to antiquated wired systems and traditional WSNs in a multitude of novel application scenarios, the newly renovated WSNs have inspired a wide range of research among which investigation on data acquisition techniques is a fundamental one. In this dissertation, we address the problem of data acquisition in next generation WSNs. As wireless sensors are powered with limited energy resources while they are expected to work in an unattended manner for a long duration, energy conservation stands as the primal concern. Also, to enable in-situ sensing in different rate-constrained applications, routing decisions should care about the medium access feasibility of achievable end-to-end data rates. Driven by the fact, we first design cross-layer medium contention aware routing schemes for rate-constrained traffic in single-channel WSNs that maximize network lifetime. Three sufficient conditions on rate feasibility, referred to as rate-based, degree-based, and mixed constraints, are incorporated into the routing formulations to guarantee the practical viability of the routing solutions. Next, with the aim to mitigate interference and hence to enhance network capacity, we extend our work by proposing energy and cross-layer aware routing schemes for multichannel access WSNs that account for radio, MAC contention, and network constraints. In that context, we first derive three new sets of sufficient conditions that ensure feasibility of data rates in multichannel access WSNs. Then, utilizing these sets, we devise three different MAC-aware routing optimization schemes, each aiming to maximize the network lifetime while meeting data rate requirements of end-to-end flows. Finally, we perform extensive simulation studies to evaluate and compare the performance of the proposed routing approaches under various network conditions. So far works are done in milieu of WSNs with both fixed access node and sensor nodes. In the subsequent part of the dissertation, we present the continuation of our work focusing on reliable data acquisition in Mobile WSNs for a promising application namely free-ranging animal tracking/monitoring. To accomplish that goal, we concentrate on providing sufficient conditions on access-point density that limit the likelihood of buffer overflow. We first derive sufficient access-point density conditions that ensure that the data loss rates are statistically guaranteed to remain below a given threshold. Then, we evaluate and validate the derived theoretical results with both synthetic and real-world data. / Graduation date: 2012

Many applications of wireless sensor networks (WSNs) require the sensor nodes of a network to belong to different priority classes where the nodes of a higher priority class enjoy higher data rates than nodes of a lower priority class. Practical design of such networks, however, faces challenges in satisfying the following basic design requirements: a) the need to rely on the medium access control mechanisms provided by the IEEE 802.15.4 standard for low-rate wireless personal area networks, b) the need to solve certain types of class size optimization problems to ensure adequate sensing coverage, and c) the need to achieve good utilization of the available channels. Unfortunately, the current version of the IEEE 802.15.4 does not provide adequate support for rate differentiation. Hence, many proposed solutions to the problem in the literature consider adding extensions to the standard. In this thesis, we introduce some class size optimization problems as examples of coverage problems that may arise in designing a WSN. We then consider a method proposed in the literature for handling the rate differentiation problem. The method relies on modifying the CSMA-CA channel access mechanism of the IEEE standard. We use simulation to examine its performance and its applicability to solve some class size optimization problems. We next investigate the use of Time Division Multiple Access (TDMA) protocols in providing service differentiation among different classes of sensors. We show simple sufficient conditions for the existence of TDMA-based solutions to a class size feasibility problem. Lastly, we consider the use of Guaranteed Time Slots (GTS) of the IEEE 802.15.4 standard in constructing TDMA schedules. We present a new algorithm that uses the GTS service to construct such schedules. The desired algorithm contains some optimization features. The obtained simulation results show the performance gain achieved by the algorithm.

Recent years have seen a tremendous growth in the development of small sensing devices capable of data processing and wireless communication through their embed- ded processors and radios. Wireless Sensor Networks (WSNs) are ad hoc networks consisting of such devices gaining importance due to their emerging applications. For a meaningful processing of the information sensed by WSN nodes, the clocks of these individual nodes need to be matched through some well de¯ned procedures. This dissertation focuses on deriving e±cient estimators for the clock parameters of the network nodes for synchronization with the reference node and the estimators variance thresholds are obtained to lower bound the maximum achievable performance. For any general time synchronization protocol involving a two way message ex- change mechanism, the BLUE-OS and the MVUE of the clock o®set between them is derived assuming both symmetric and asymmetric exponential network delays. Next, with the inclusion of clock skew in the model, the joint MLE of clock o®set and skew under both the Gaussian and the exponential delay model and the corresponding al- gorithms for ¯nding these estimates are presented. Also, for applications where even clock skew correction cannot maintain long-term clock synchronization, a closed-form expression for the joint MLE for a quadratic model is obtained. Although the derived MLEs are not computationally very complex, two compu- tationally e±cient algorithms have been proposed to estimate the clock o®set and skew regardless of the distribution of the delays. Afterwards, extending the idea of having inactive nodes in a WSN overhear the two-way timing message communication between two active (master and slave) nodes, the MLE, the BLUE-OS, the MVUE and the MMSE estimators for the clock o®sets of the inactive nodes located within the communication range of the active nodes are derived, hence synchronizing with the reference node at a reduced cost. Finally, focusing on the the one-way timing exchange mechanism, the joint MLE for clock phase o®set and skew under exponential noise model and the Gibbs Sampler for a receiver-receiver protocol is formulated and found via a direct algorithm. Lower and upper bounds for the MSE of JMLE and Gibbs Sampler are introduced in terms of the MSEs of the MVUE and the conventional BLUE, respectively.

A large-scale distributed wireless sensor network is composed of a large collection of small low-power, unattended sensing devices equipped with limited memory, processors, and short-range wireless communication. The network is capable of controlling and monitoring ambient conditions, such as temperature, movement, sound, light and others, and thus enable smart environments. Energy efficient data dissemination is one of the fundamental services in large-scale wireless sensor networks. Based on the study of the data dissemination problem, we propose two efficient data dissemination schemes for two categories of applications in large-scale wireless sensor networks. In addition, our schemes provide spatial-based multi-resolution data dissemination for some applications to achieve further energy efficiency. Analysis and simulation results are given to show the performance of our schemes in comparison with current techniques.

<p>Wireless sensor networks are emerging from the mobile ad hoc network concept and as such they share many similarities. However, it is not the similarities that differentiates sensor networks from their ad hoc counterparts, it is the differences. One of the most important difference is that they should operate unattended for long periods of time. This is especially important since they usually rely on a finite energy source to function. To get this into a perspective, a sensor network constitutes of a sensor field where a number of sensor nodes are deployed. The sensor nodes relay the gathered information to a base station from which the data are forwarded either through a network or directly to the enduser. The communication between sensor nodes are conducted in an ad hoc manner, which means that paths toward the base station are dynamically constructed based on current network conditions. The network conditions changes and examples of this includes node failure, deactivated nodes, variations in the radio channel characteristics, etc.</p><p>As mentioned above, the sensor nodes are energy constrained and one of the more important design criteria is the life time of a sensor node or network. To be able to evaluate this criteria an energy dissipation model is needed. Most of the energy dissipation models developed for wireless sensor networks are not based on the basic sensor node architecture and as such they where not accurate enough for our needs. Thus, an energy dissipation model was developed. This model utilises the basic sensor node architecture to obtain the operation states available and their corresponding state transitions.</p><p>Communication is the most energy consuming task a sensor node can undertake. As such, the contributed energy dissipation model is used to evaluate this aspect of the proposed controlled flooding protocols. Generally, the controlled flooding protocols tries to minimise the number of forwarding nodes and by doing this they lower the energy consumed in the network. Along with this, the communication overhead of a protocol also needs to be taken into account. Our idea is to utilise the received signal strength directly to make forwarding decisions based on a cost function. This idea has a number of key features, which are: no additional overhead in the message, no neighbour knowledge and no location information are needed. The results from the proposed flooding protocols are promising as they have a lower number of forwarding nodes and a longer lifetime than the</p><p>others.</p> / Report code: LIU-TEK-LIC-2007:43.