Improve Performance Wireless Sensor Network Localization using RSSI and AEMM

Improve wireless sensor network localisation performance using RSSI and an advanced error minimisation method (AEMM). WSNs remain domain-specific and are typically deployed to support a single application. However, as WSN nodes become more powerful, it becomes increasingly important to investigate how multiple applications can share the same WSN infrastructure. Virtualisation is a technology that may allow for this sharing. The issues surrounding wireless sensor node localisation estimation are still being researched. There are a large number of Wireless Sensor Networks (WSNs) with limited computing, sensing, and energy capabilities. Localisation is one of the most important topics in wireless sensor networks (WSNs) because location information is typically useful for many applications. The locations of anchor nodes and the distances between neighbouring nodes are the primary data in a localisation process. The complexity and diversity of current and future wireless detector network operations drive this. Several single schemes have been proposed and studied for position estimation, each with advantages and limitations. Nonetheless, current methods for evaluating the performance of wireless detector networks are heavily focused on a single private or objective evaluation. Accurate position information in a wireless detector network is critical for colourful arising operations (WSN). It is critical to reducing the goods of noisy distance measures to improve localisation accuracy. Existing works (RSSI) are detailed and critically evaluated, with a higher error rate using a set of scenario requirements. Our proposed method (AEMM) is critical for detecting and dealing with outliers in wireless sensor networks to achieve a low localisation error rate. The proposed method (AEMM) for localisation and positioning nodes in wireless sensor networks supported by IOT and discovering the appropriate position of several nodes addresses all of the issues in WSN

Energy-efficient data acquisition for accurate signal estimation in wireless sensor networks

Long-term monitoring of an environment is a fundamental requirement for most wireless sensor networks. Owing to the fact that the sensor nodes have limited energy budget, prolonging their lifetime is essential in order to permit long-term monitoring. Furthermore, many applications require sensor nodes to obtain an accurate estimation of a point-source signal (for example, an animal call or seismic activity). Commonly, multiple sensor nodes simultaneously sample and then cooperate to estimate the event signal. The selection of cooperation nodes is important to reduce the estimation error while conserving the network’s energy. In this paper, we present a novel method for sensor data acquisition and signal estimation, which considers estimation accuracy, energy conservation, and energy balance. The method, using a concept of ‘virtual clusters,’ forms groups of sensor nodes with the same spatial and temporal properties. Two algorithms are used to provide functionality. The ‘distributed formation’ algorithm automatically forms and classifies the virtual clusters. The ‘round robin sample scheme’ schedules the virtual clusters to sample the event signals in turn. The estimation error and the energy consumption of the method, when used with a generalized sensing model, are evaluated through analysis and simulation. The results show that this method can achieve an improved signal estimation while reducing and balancing energy consumption

Efficient calculation of sensor utility and sensor removal in wireless sensor networks for adaptive signal estimation and beamforming

Wireless sensor networks are often deployed over a large area of interest and therefore the quality of the sensor signals may vary significantly across the different sensors. In this case, it is useful to have a measure for the importance or the so-called "utility" of each sensor, e.g., for sensor subset selection, resource allocation or topology selection. In this paper, we consider the efficient calculation of sensor utility measures for four different signal estimation or beamforming algorithms in an adaptive context. We use the definition of sensor utility as the increase in cost (e.g., mean-squared error) when the sensor is removed from the estimation procedure. Since each possible sensor removal corresponds to a new estimation problem (involving less sensors), calculating the sensor utilities would require a continuous updating of different signal estimators (where is the number of sensors), increasing computational complexity and memory usage by a factor. However, we derive formulas to efficiently calculate all sensor utilities with hardly any increase in memory usage and computational complexity compared to the signal estimation algorithm already in place. When applied in adaptive signal estimation algorithms, this allows for on-line tracking of all the sensor utilities at almost no additional cost. Furthermore, we derive efficient formulas for sensor removal, i.e., for updating the signal estimator coefficients when a sensor is removed, e.g., due to a failure in the wireless link or when its utility is too low. We provide a complexity evaluation of the derived formulas, and demonstrate the significant reduction in computational complexity compared to straightforward implementations

Dynamic and Channel Adaptive Error Control Scheme in Wireless Sensor Networks

The application of wireless technology is increasingly influencing the deployment of sensor networks at low cost and maintainance in all walks of life. Poor channel conditions, severe power constraints, fading, interference and the low power communication requirements magnify the need for energy efficient and preferably cross layer error control schemes in Wireless Sensor Networks (WSNs). The main goal of error control mechanisms in WSNs is to reduce the energy expenditure while taking care of reliable and fast delivery of the sensed data. In this paper, we propose a FFFD;Dynamic and Channel Adaptive Error Control Scheme in Wireless Sensor NetworksFFFD; (DCAECS) that estimates the channel errors and controls errors dynamically based on channel characteristics and noise power observed at the receiver. This motivates the error control strategy to vary as the channel conditions change in terms of noise level. In this paper, we have come up with the models for both the error and channel estimation. Analysis and simulation results for various message sizes and error conditions show that there is an improvement in terms of throughput, BER and the probability of retransmission as compared to FFFD;ARQ Scheme With Adaptive Error ControlFFFD; (ASAEC)

New Coding/Decoding Techniques for Wireless Communication Systems

Wireless communication encompasses cellular telephony systems (mobile communication), wireless sensor networks, satellite communication systems and many other applications. Studies relevant to wireless communication deal with maintaining reliable and efficient exchange of information between the transmitter and receiver over a wireless channel. The most practical approach to facilitate reliable communication is using channel coding. In this dissertation we propose novel coding and decoding approaches for practical wireless systems. These approaches include variable-rate convolutional encoder, modified turbo decoder for local content in Single-Frequency Networks, and blind encoder parameter estimation for turbo codes. On the other hand, energy efficiency is major performance issue in wireless sensor networks. In this dissertation, we propose a novel hexagonal-tessellation based clustering and cluster-head selection scheme to maximize the lifetime of a wireless sensor network. For each proposed approach, the system performance evaluation is also provided. In this dissertation the reliability performance is expressed in terms of bit-error-rate (BER), and the energy efficiency is expressed in terms of network lifetime

Distributed Recognition of Reference Nodes for Wireless Sensor Network Localization

All known localization techniques for wireless sensor and ad-hoc networks require certain set of reference nodes being used for position estimation. The anchor-free techniques in contrast to anchor-based do not require reference nodes called anchors to be placed in the network area before localization operation itself, but they can establish own reference coordinate system to be used for the relative position estimation. We observed that contemporary anchor-free localization algorithms achieve a low localization error, but dissipate significant energy reserves during the recognition of reference nodes used for the position estimation. Therefore, we have proposed the optimized anchor-free localization algorithm referred to as BRL (Boundary Recognition aided Localization), which achieves a low localization error and mainly reduces the communication cost of the reference nodes recognition phase. The proposed BRL algorithm was investigated throughout the extensive simulations on the database of networks with the different number of nodes and densities and was compared in terms of communication cost and localization error with the known related algorithms such as AFL and CRP. Through the extensive simulations we have observed network conditions where novel BRL algorithm excels in comparison with the state of art

Resource optimisation in a wireless sensor network with guaranteed estimator performance

New control paradigms are needed for large networks of wireless sensors and actuators in order to efficiently utilise system resources. In this study, the authors consider the problem of discrete-time state estimation over a wireless sensor network. Given a tree that represents the sensor communications with the fusion centre, the authors derive the optimal estimation algorithm at the fusion centre, and provide a closedform expression for the steady-state error covariance matrix. They then present a tree reconfiguration algorithm that produces a sensor tree that has low overall energy consumption and guarantees a desired level of estimation quality at the fusion centre. The authors further propose a sensor tree construction and scheduling algorithm that leads to a longer network lifetime than the tree reconfiguration algorithm. Examples are provided throughout the paper to demonstrate the algorithms and theory developed

A linear regression based cost function for WSN localization

Localization with Wireless Sensor Networks (WSN) creates new opportunities for location-based consumer communication applications. There is a great need for cost functions of maximum likelihood localization algorithms that are not only accurate but also lack local minima. In this paper we present Linear Regression based Cost Function for Localization (LiReCoFuL), a new cost function based on regression tools that fulfills these requirements. With empirical test results on a real-life test bed, we show that our cost function outperforms the accuracy of a minimum mean square error cost function. Furthermore we show that LiReCoFuL is as accurate as relative location estimation error cost functions and has very few local extremes

On the Effect of Correlated Measurements on the Performance of Distributed Estimation

We address the distributed estimation of an unknown scalar parameter in Wireless Sensor Networks (WSNs). Sensor nodes transmit their noisy observations over multiple access channel to a Fusion Center (FC) that reconstructs the source parameter. The received signal is corrupted by noise and channel fading, so that the FC objective is to minimize the Mean-Square Error (MSE) of the estimate. In this paper, we assume sensor node observations to be correlated with the source signal and correlated with each other as well. The correlation coefficient between two observations is exponentially decaying with the distance separation. The effect of the distance-based correlation on the estimation quality is demonstrated and compared with the case of unity correlated observations. Moreover, a closed-form expression for the outage probability is derived and its dependency on the correlation coefficients is investigated. Numerical simulations are provided to verify our analytic results.Comment: 5 page