Localisation in wireless sensor networks for disaster recovery and rescuing in built environments

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Doctor of PhilosophyProgress in micro-electromechanical systems (MEMS) and radio frequency (RF) technology has fostered the development of wireless sensor networks (WSNs). Different from traditional networks, WSNs are data-centric, self-configuring and self-healing. Although WSNs have been successfully applied in built environments (e.g. security and services in smart homes), their applications and benefits have not been fully explored in areas such as disaster recovery and rescuing. There are issues related to self-localisation as well as practical constraints to be taken into account. The current state-of-the art communication technologies used in disaster scenarios are challenged by various limitations (e.g. the uncertainty of RSS). Localisation in WSNs (location sensing) is a challenging problem, especially in disaster environments and there is a need for technological developments in order to cater to disaster conditions. This research seeks to design and develop novel localisation algorithms using WSNs to overcome the limitations in existing techniques. A novel probabilistic fuzzy logic based range-free localisation algorithm (PFRL) is devised to solve localisation problems for WSNs. Simulation results show that the proposed algorithm performs better than other range free localisation algorithms (namely DVhop localisation, Centroid localisation and Amorphous localisation) in terms of localisation accuracy by 15-30% with various numbers of anchors and degrees of radio propagation irregularity. In disaster scenarios, for example, if WSNs are applied to sense fire hazards in building, wireless sensor nodes will be equipped on different floors. To this end, PFRL has been extended to solve sensor localisation problems in 3D space. Computational results show that the 3D localisation algorithm provides better localisation accuracy when varying the system parameters with different communication/deployment models. PFRL is further developed by applying dynamic distance measurement updates among the moving sensors in a disaster environment. Simulation results indicate that the new method scales very well

Tracking mobile targets through Wireless Sensor Networks

In recent years, advances in signal processing have led to small, low power, inexpensive Wireless Sensor Network (WSN). The signal processing in WSN is different from the traditional wireless networks in two critical aspects: firstly, the signal processing in WSN is performed in a fully distributed manner, unlike in traditional wireless networks; secondly, due to the limited computation capabilities of sensor networks, it is essential to develop an energy and bandwidth efficient signal processing algorithms. Target localisation and tracking problems in WSNs have received considerable attention recently, driven by the necessity to achieve higher localisation accuracy, lower cost, and the smallest form factor. Received Signal Strength (RSS) based localisation techniques are at the forefront of tracking research applications. Since tracking algorithms have been attracting research and development attention recently, prolific literature and a wide range of proposed approaches regarding the topic have emerged. This thesis is devoted to discussing the existing WSN-based localisation and tracking approaches. This thesis includes five studies. The first study leads to the design and implementation of a triangulation-based localisation approach using RSS technique for indoor tracking applications. The presented work achieves low localisation error in complex environments by predicting the environmental characteristics among beacon nodes. The second study concentrates on investigating a fingerprinting localisation method for indoor tracking applications. The proposed approach offers reasonable localisation accuracy while requiring a short period of offline computation time. The third study focuses on designing and implementing a decentralised tracking approach for tracking multiple mobile targets with low resource requirements. Despite the interest in target tracking and localisation issues, there are few systems deployed using ZigBee network standard, and no tracking system has used the full features of the ZigBee network standard. Tracking through the ZigBee is a challenging task when the density of router and end-device nodes is low, due to the limited communication capabilities of end-device nodes. The fourth study focuses on developing and designing a practical ZigBee-based tracking approach. To save energy, different strategies were adopted. The fifth study outlines designing and implementing an energy-efficient approach for tracking applications. This study consists of two main approaches: a data aggregation approach, proposed and implemented in order to reduce the total number of messages transmitted over the network; and a prediction approach, deployed to increase the lifetime of the WSN. For evaluation purposes, two environmental models were used in this thesis: firstly, real experiments, in which the proposed approaches were implemented on real sensor nodes, to test the validity for the proposed approaches; secondly, simulation experiments, in which NS-2 was used to evaluate the power-consumption issues of the two approaches proposed in this thesis

Distributed localisation algorithm for wireless ad hoc networks of moving nodes

Existing ad hoc network localisation solutions rely either on external location references or network-wide exchange of information and centralised processing and computation of location estimates. Without these, nodes are not able to estimate the relative locations of other nodes within their communication range. This thesis defines a new distributed localisation algorithm for ad hoc networks of moving nodes. The Relative Neighbour Localisation (RNL) algorithm works without any external localisation signal or systems and does not assume centralised information processing. The idea behind the location estimates produced by the RNL algorithm is the relationship between the relative locations of two nodes, their mobility parameters and the signal strengths measured between them. The proposed algorithm makes use of the data available to each node to produce a location estimate. The signal strength each node is capable of measuring is used as one algorithm input. The other input is the velocity vector of the neighbouring node, composed of its speed and direction of movement, which each node is assumed to periodically broadcast. The relationship between the signal strength and the mobility parameters on one, and the relative location on the other side can be analytically formulated in an ideal case. The limitations of a realistic scenario complicate this relationship, making it very difficult to formulate analytically. An empirical approach is thus used. The angle and the distance estimates are individually computed, together forming a two-dimensional location estimate. The performance of the algorithm was analysed in detail using simulation, showing a median estimate error of under 10m, and its application was tested through design and evaluation of a distributed sensing coverage algorithm, showing RNL location estimates can provide 90% of the coverage achievable with true locations being known

Monte Carlo localization algorithm based on particle swarm optimization

In wireless sensor networks, Monte Carlo localization for mobile nodes has a large positioning error and slow convergence speed. To address the challenges of low sampling efficiency and particle impoverishment, a time sequence Monte Carlo localization algorithm based on particle swarm optimization (TSMCL-BPSO) is proposed in this paper. Firstly, the sampling region is constructed according to the overlap of the initial sampling region and the Monte Carlo sampling region. Then, particle swarm optimization (PSO) strategy is adopted to search the optimum position of the target node. The velocity of particle swarm is updated by adaptive step size and the particle impoverishment is improved by distributed estimation and particle replication, which avoids the local optimum caused by the premature convergence of particles. Experiment results indicate that the proposed algorithm improves the particle fitness, increases the particle searching efficiency, and meanwhile the lower positioning error can be obtained at the node\u27s maximum speed of 70 m/s

Position-relative identities in the internet of things: An evolutionary GHT approach

The Internet of Things (IoT) will result in the deployment of many billions of wireless embedded systems creating interactive pervasive environments. It is envisaged that devices will cooperate to provide greater system knowledge than the sum of its parts. In an emergency situation, the flow of data across the IoT may be disrupted, giving rise to a requirement for machine-to-machine interaction within the remaining ubiquitous environment. Geographic hash tables (GHTs) provide an efficient mechanism to support fault-tolerant rendezvous communication between devices. However, current approaches either rely on devices being equipped with a GPS or being manually assigned an identity. This is unrealistic when the majority of these systems will be located inside buildings and will be too numerous to expect manual configuration. Additionally, when using GHT as a distributed data store, imbalance in the topology can lead to storage and routing overhead. This causes unfair work load, exhausting limited power supplies as well as causing poor data redundancy. To deal with these issues, we propose an approach that balances graph-based layout identity assignment, through the application of multifitness genetic algorithms. Our experiments show through simulation that our multifitness evolution technique improves on the initial graph-based layout, providing devices with improved balance and reachability metrics

Self-organising an indoor location system using a paintable amorphous computer

This thesis investigates new methods for self-organising a precisely defined pattern of intertwined number sequences which may be used in the rapid deployment of a passive indoor positioning system's infrastructure.A future hypothetical scenario is used where computing particles are suspended in paint and covered over a ceiling. A spatial pattern is then formed over the covered ceiling. Any small portion of the spatial pattern may be decoded, by a simple camera equipped device, to provide a unique location to support location-aware pervasive computing applications.Such a pattern is established from the interactions of many thousands of locally connected computing particles that are disseminated randomly and densely over a surface, such as a ceiling. Each particle has initially no knowledge of its location or network topology and shares no synchronous clock or memory with any other particle.The challenge addressed within this thesis is how such a network of computing particles that begin in such an initial state of disarray and ignorance can, without outside intervention or expensive equipment, collaborate to create a relative coordinate system. It shows how the coordinate system can be created to be coherent, even in the face of obstacles, and closely represent the actual shape of the networked surface itself. The precision errors incurred during the propagation of the coordinate system are identified and the distributed algorithms used to avoid this error are explained and demonstrated through simulation.A new perimeter detection algorithm is proposed that discovers network edges and other obstacles without the use of any existing location knowledge. A new distributed localisation algorithm is demonstrated to propagate a relative coordinate system throughout the network and remain free of the error introduced by the network perimeter that is normally seen in non-convex networks. This localisation algorithm operates without prior configuration or calibration, allowing the coordinate system to be deployed without expert manual intervention or on networks that are otherwise inaccessible.The painted ceiling's spatial pattern, when based on the proposed localisation algorithm, is discussed in the context of an indoor positioning system

AN ENERGY EFFICIENT CROSS-LAYER NETWORK OPERATION MODEL FOR MOBILE WIRELESS SENSOR NETWORKS

Wireless sensor networks (WSNs) are modern technologies used to sense/control the environment whether indoors or outdoors. Sensor nodes are miniatures that can sense a specific event according to the end user(s) needs. The types of applications where such technology can be utilised and implemented are vast and range from households’ low end simple need applications to high end military based applications. WSNs are resource limited. Sensor nodes are expected to work on a limited source of power (e.g., batteries). The connectivity quality and reliability of the nodes is dependent on the quality of the hardware which the nodes are made of. Sensor nodes are envisioned to be either stationary or mobile. Mobility increases the issues of the quality of the operation of the network because it effects directly on the quality of the connections between the nodes