77 research outputs found
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
Cross-layer energy optimisation of routing protocols in wireless sensor networks
Recent technological developments in embedded systems have led to the emergence of a new class of networks, known asWireless Sensor Networks (WSNs), where individual nodes cooperate wirelessly with each other with the goal of sensing and interacting with the environment.Many routing protocols have been developed tomeet the unique and challenging characteristics of WSNs (notably very limited power resources to sustain an expected lifetime of perhaps
years, and the restricted computation, storage and communication capabilities of nodes that are nonetheless required to support large networks and diverse applications). No standards for routing have been developed yet for WSNs, nor has any protocol gained a dominant position among the research community.
Routing has a significant influence on the overall WSN lifetime, and providing an energy efficient routing protocol remains an open problem. This thesis addresses
the issue of designing WSN routing methods that feature energy efficiency. A common time reference across nodes is required in mostWSN applications. It is needed, for example, to time-stamp sensor samples and for duty cycling of nodes. Alsomany routing protocols require that nodes communicate according to some predefined schedule. However, independent distribution of the time information, without considering the routing algorithm schedule or network topology may lead to a failure of the synchronisation protocol. This was confirmed empirically, and was shown to result in loss of connectivity. This can be avoided by
integrating the synchronisation service into the network layer with a so-called cross-layer approach. This approach introduces interactions between the layers of a conventional layered network stack, so that the routing layer may share information with other layers. I explore whether energy efficiency can be enhanced through the use of cross-layer optimisations and present three novel cross-layer routing algorithms. The first protocol, designed for hierarchical, cluster based networks
and called CLEAR (Cross Layer Efficient Architecture for Routing), uses the routing algorithm to distribute time information which can be used for efficient duty cycling of nodes. The second method - called RISS (Routing Integrated
Synchronization Service) - integrates time synchronization into the network layer and is designed to work well in flat, non-hierarchical network topologies. The third method - called SCALE (Smart Clustering Adapted LEACH) - addresses
the influence of the intra-cluster topology on the energy dissipation of nodes. I also investigate the impact of the hop distance on network lifetime and propose a method of determining the optimal location of the relay node (the node through which data is routed in a two-hop network). I also address the problem of predicting the transition region (the zone separating the region where all packets
can be received and that where no data can be received) and I describe a way of preventing the forwarding of packets through relays belonging in this transition region.
I implemented and tested the performance of these solutions in simulations and also deployed these routing techniques on sensor nodes using TinyOS. I compared the average power consumption of the nodes and the precision of time synchronization with the corresponding parameters of a number of existing algorithms. All proposed schemes extend the network lifetime and due to their lightweight architecture they are very efficient on WSN nodes with constrained resources. Hence it is recommended that a cross-layer approach should be a feature of any routing algorithm for WSNs
Optimal leach protocol with improved bat algorithm in wireless sensor networks
© 2019, Korean Society for Internet Information. All rights reserved. A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MITâs Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs)
Design of implicit routing protocols for large scale mobile wireless sensor networks
Strathclyde theses - ask staff. Thesis no. : T13189Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives.Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives
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
Recommended from our members
Automatic triangulation positioning system for wide area coverage from a fixed sensors network
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonIn a wide area that many Transmitters (TRs) operate, systems of Fixed Sensors (FS) might be used in order to detect them and find TRs position. The detection and the accurate location of a new TR entering in the area frequently can be missed if the system fails to triangulate accurately the relative readings and analyze the changes in the received data. Additionally, there are cases that a Triangulation Station Network (TSN) can detect the heading as well as the transmitterâs position wrong. This thesis presents the design of a Sensors Network (FSN) system which is able to interact with a user, and exploit the relative data of the Sensors (SRs) in real time. The system performs localization with triangulation and the SRs are detect only TRs bearing data (range free). System design and algorithms are also explained. Efficient algorithms were elaborated and the outcomes of their implementation were calculated. The system design targets to reduce system errors and increase the accuracy and the speed of detection. Synchronously and through interaction with the user and changes of relative settings and parameters will be able to offer the user accurate results on localization of TRs in the area minimizing false readings and False Triangulations (FTRNs). The system also enables the user to apply optimization techniques in order to increase the system detection rate and performance and keep the surveillance in the Field of Interest (FoI) on a high level. The optimization methodology applied for the system proves that the FSN system is able to operate with a high performance even when saturation phenomena appear. The unique outcome of the research conducted, is that this thesis paves the way to enhance the localization via Triangulation for a network of Fixed Sensors with known position. The value of this thesis is that the FSN system performs bearing only detection (Range free) with a certain accuracy and the Area of Interest (AOI) is covered efficiently
Target localization using RSS measurements in wireless sensor networks
The subject of this thesis is the development of localization algorithms for target localization in
wireless sensor networks using received signal strength (RSS) measurements or Quantized RSS
(QRSS) measurements.
In chapter 3 of the thesis, target localization using RSS measurements is investigated. Many
existing works on RSS localization assumes that the shadowing components are uncorrelated.
However, here, shadowing is assumed to be spatially correlated. It can be shown that
localization accuracy can be improved with the consideration of correlation between pairs of RSS
measurements. By linearizing the corresponding Maximum Likelihood (ML) objective function,
a weighted least squares (WLS) algorithm is formulated to obtain the target location. An iterative
technique based on Newtons method is utilized to give a solution. Numerical simulations show
that the proposed algorithms achieves better performance than existing algorithms with reasonable
complexity.
In chapter 4, target localization with an unknown path loss model parameter is investigated. Most
published work estimates location and these parameters jointly using iterative methods with a good
initialization of path loss exponent (PLE). To avoid finding an initialization, a global optimization
algorithm, particle swarm optimization (PSO) is employed to optimize the ML objective function.
By combining PSO with a consensus algorithm, the centralized estimation problem is extended to
a distributed version so that can be implemented in distributed WSN. Although suboptimal, the
distributed approach is very suitable for implementation in real sensor networks, as it is scalable,
robust against changing of network topology and requires only local communication. Numerical
simulations show that the accuracy of centralized PSO can attain the Cramer Rao Lower Bound
(CRLB). Also, as expected, there is some degradation in performance of the distributed PSO with
respect to the centralized PSO.
In chapter 5, a distributed gradient algorithm for RSS based target localization using only
quantized data is proposed. The ML of the Quantized RSS is derived and PSO is used to provide an
initial estimate for the gradient algorithm. A practical quantization threshold designer is presented
for RSS data. To derive a distributed algorithm using only the quantized signal, the local estimate
at each node is also quantized. The RSS measurements and the local estimate at each sensor
node are quantized in different ways. By using a quantization elimination scheme, a quantized
distributed gradient method is proposed. In the distributed algorithm, the quantization noise in the
local estimate is gradually eliminated with each iteration. Simulations show that the performance
of the centralized algorithm can reach the CRLB. The proposed distributed algorithm using a
small number of bits can achieve the performance of the distributed gradient algorithm using
unquantized data
Underground Mining Monitoring and Communication Systems based on ZigBee and GIS
ZigBee as a wireless sensor network (WSN) was developed for underground mine monitoring and communication systems. The radio wave attenuations between ZigBee nodes were investigated to measure underground communication distances. Various sensor node arrangements of ZigBee topologies were evaluated. A system integration of a WSN-assisted GIS for underground mining monitoring and communication from a surface office was proposed. The controllable and uncontrollable parameters of underground environments were assessed to establish a reliable ZigBee network
- âŠ