Search

Localization as a technique to solve the complex and challenging problems besetting line-of-sight (LOS) and non-line-of-sight (NLOS) transmissions has recently attracted considerable attention in the wireless sensor network field. This paper proposes a strategy for eliminating NLOS localization errors during calculation of the location of mobile terminals (MTs) in unfamiliar indoor environments. In order to improve the hidden Markov model (HMM), we propose two modified algorithms, namely, modified HMM (M-HMM) and replacement modified HMM (RM-HMM). Further, a hybrid localization algorithm that combines HMM with an interacting multiple model (IMM) is proposed to represent the velocity of mobile nodes. This velocity model is divided into a high-speed and a low-speed model, which means the nodes move at different speeds following the same mobility pattern. Each moving node continually switches its state based on its probability. Consequently, to improve precision, each moving node uses the IMM model to integrate the results from the HMM and its modified forms. Simulation experiments conducted show that our proposed algorithms perform well in both distance estimation and coordinate calculation, with increasing accuracy of localization of the proposed algorithms in the order M-HMM, RM-HMM, and HMM + IMM. The simulations also show that the three algorithms are accurate, stable, and robust. [ABSTRACT FROM AUTHOR]

Localization is an important research issue inWireless Sensor Networks (WSNs). Though Global Positioning System (GPS) can be used to locate the position of the sensors, unfortunately it is limited to outdoor applications and is costly and power consuming. In order to find location of sensor nodes without help of GPS, collaboration among nodes is highly essential so that localization can be accomplished efficiently. In this paper, novel localization algorithms are proposed to find out possible location information of the normal nodes in a collaborative manner for an outdoor environment with help of few beacons and anchor nodes. In our localization scheme, at most three beacon nodes should be collaborated to find out the accurate location information of any normal node. Besides, analytical methods are designed to calculate and reduce the localization error using probability distribution function. Performance evaluation of our algorithm shows that there is a tradeoff between deployed number of beacon nodes and localization error, and average localization time of the network can be increased with increase in the number of normal nodes deployed over a region. [ABSTRACT FROM AUTHOR]

The practical deployment of wireless positioning systems requires minimizing the calibration procedures while improving the location estimation accuracy. Received Signal Strength localization techniques using propagation channel models are the simplest alternative, but they are usually designed under the assumption that the radio propagation model is to be perfectly characterized a priori. In practice, this assumption does not hold and the localization results are affected by the inaccuracies of the theoretical, roughly calibrated or just imperfect channel models used to compute location. In this paper, we propose the use of weighted multilateration techniques to gain robustness with respect to these inaccuracies, reducing the dependency of having an optimal channel model. In particular, we propose two weighted least squares techniques based on the standard hyperbolic and circular positioning algorithms that specifically consider the accuracies of the different measurements to obtain a better estimation of the position. These techniques are compared to the standard hyperbolic and circular positioning techniques through both numerical simulations and an exhaustive set of real experiments on different types of wireless networks (a wireless sensor network, a WiFi network and a Bluetooth network). The algorithms not only produce better localization results with a very limited overhead in terms of computational cost but also achieve a greater robustness to inaccuracies in channel modeling. [ABSTRACT FROM AUTHOR]

Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization. [ABSTRACT FROM AUTHOR]

Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization. [ABSTRACT FROM AUTHOR]

Localization is one of the most important subjects in Wireless Sensor Networks (WSNs). To reduce the number of beacons and adopt probabilistic methods, some particle filter-based mobile beacon-assisted localization approaches have been proposed, such as Mobile Beacon-assisted Localization (MBL), Adapting MBL (A-MBL), and the method proposed by Hang et al. Some new significant problems arise in these approaches, however. The first question is which probability distribution should be selected as the dynamic model in the prediction stage. The second is whether the unknown node adopts neighbors' observation in the update stage. The third is how to find a self-adapting mechanism to achieve more flexibility in the adapting stage. In this paper, we give the theoretical analysis and experimental evaluations to suggest which probability distribution in the dynamic model should be adopted to improve the efficiency in the prediction stage. We also give the condition for whether the unknown node should use the observations from its neighbors to improve the accuracy. Finally, we propose a Self-Adapting Mobile Beacon-assisted Localization (SA-MBL) approach to achieve more flexibility and achieve almost the same performance with A-MBL. [ABSTRACT FROM AUTHOR]

As localization represents the main backbone of several wireless sensor networks applications, several localization algorithms have been proposed in the literature. There is a growing interest in the multi-hop localization algorithms as they permit the localization of sensor nodes even if they are several hops away from anchor nodes. One of the most famous localization algorithms is the Distance Vector Hop (DV-Hop). Aiming to minimize the large localization error in the original DV-Hop algorithm, we propose an improved DV-Hop algorithm in this paper. The distance between unknown nodes and anchors is estimated using the received signal strength indication (RSSI) and the polynomial approximation. Moreover, the proposed algorithm uses a recursive computation of the localization process to improve the accuracy of position estimation. Experimental results show that the proposed localization technique minimizes the localization error and improves the localization accuracy. [ABSTRACT FROM AUTHOR]

As a key technology of the Internet of Things, wireless sensor network (WSN) has been used widely in indoor localization systems. However, when the sensor is transmitting signals, it is affected by the non-line-of-sight (NLOS) transmission, and the accuracy of the positioning result is decreased. Therefore, solving the problem of NLOS positioning has become a major focus for indoor positioning. This paper focuses on solving the problem of NLOS transmission that reduces positioning accuracy in indoor positioning. We divided the anchor nodes into several groups and obtained the position information of the target node for each group through the maximum likelihood estimation (MLE). By identifying the NLOS method, a part of the position estimates polluted by NLOS transmission was discarded. For the position estimates that passed the hypothesis testing, a corresponding poly-probability matrix was established, and the probability of each position estimate from line-of-sight (LOS) and NLOS was calculated. The position of the target was obtained by combining the probability with the position estimate. In addition, we also considered the case where there was no continuous position estimation through hypothesis testing and through the NLOS tracking method to avoid positioning errors. Simulation and experimental results show that the algorithm proposed has higher positioning accuracy and higher robustness than other algorithms. [ABSTRACT FROM AUTHOR]

Location estimation in wireless sensor networks (WSNs) has received tremendous attention in recent times. Improved technology and efficient algorithms systematically empower WSNs with precise location identification. However, while algorithms are efficient in improving the location estimation error, the factor of the network lifetime has not been researched thoroughly. In addition, algorithms are not optimized in balancing the load among nodes, which reduces the overall network lifetime. In this paper, we have proposed an algorithm that balances the load of computation for location estimation among the anchor nodes. We have used vector-based swarm optimization on the connected dominating set (CDS), consisting of anchor nodes for that purpose. In this algorithm, major tasks are performed by the base station with a minimum number of messages exchanged by anchor nodes and unknown nodes. The simulation results showed that the proposed algorithm significantly improves the network lifetime and reduces the location estimation error. Furthermore, the proposed optimized CDS is capable of providing a global optimum solution with a minimum number of iterations. [ABSTRACT FROM AUTHOR]