Wireless Cooperative Localization in the Next-Generation Mobile Communication System
0
Citation
0
Reference
20
Related Paper
Abstract:
To enhance the precision of wireless localization in the traditional mobile network,a wireless cooperative localization algorithm is proposed for the next-generation mobile communication system by employing the cooperative communication between the mobile stations(MS).The cooperative localization problem is solved by non-linear optimization theory.With that this problem is converted to the linear least square problem,finally the location is estimated by the Gauss-Newton algorithm.Simulation shows that,when Gauss-Newton algorithm is applied in the cooperative localization,it is almost converged and the times for convergence(the converging speed) is about 2~3.When there are two or more than two reference terminals(RT) involved in the cooperative localization,and the standard deviation of the distance measured by RT is less than 50 m,the root mean square error of the location estimate is less than 100 m.Keywords:
Square root
Cite
Cellular-based cooperative communication is a promising technique that allows cooperation among mobile devices not only to increase data throughput but also to improve localization services. For a certain number of cooperative nodes, the geometry plays a significant role in enhancing the accuracy of target. In this paper, a simple solution to the deployment of cooperative nodes aiming at the lowest geometric dilution of precision (GDOP) is proposed suitable for both time of arrival-based cooperative localization system and angle of arrival-based cooperative localization system. Inertia dependence factor is suggested to reveal the relationship among the optimal positions of each cooperative node, which extracts the inertia and the recursiveness of deployment. It is shown in simulations that the proposed solution almost achieves the same GDOP as that of global exclusive method but with less complexity.
Dilution of precision
Angle of arrival
Cite
Citations (12)
In this paper, we proposed a RSS based cooperative localization algorithm using VRN for wireless sensor networks, which can estimate the BN position. The proposed localization system monitoring all nodes estimates a position of BN, and calculates an intersection area with cooperative localization. From the results, we confirm that BN intersection area is reduced as the number of RN is increased. In addition, the fewer RN exists, the more iteration needs at least 4 times. Moreover, the propose algorithm using 4 RNs is improved 71.6% estimation performance than conventional method. Therefore, the cooperative localization algorithm with VRN provides higher localization accuracy than RSS based conventional method.
RSS
Position (finance)
Shadow mapping
Cite
Citations (3)
In the real world,the nodes in Wireless Sensor Networks(WSN) are often deployed in 3D scenario,e.g.,deep sea,hill or forest,etc.,therefore the information of three-dimensional localization should be provided for those nodes.A range-based localization algorithm for 3D WSN is proposed.This algorithm bases TDOA(Time Difference of Arrival) and gains the range between all of those nodes,moreover,it sets the weight as one when the range between the single-hop neighbor nodes is not greater than the communication radius,and the rest is zero.This algorithm bases the method of matrix iterative optimization and obtains the accurate position for the unknown nodes.Simulation result indicates that the localization accuracy of the localization algorithm is excellent.
Position (finance)
Cite
Citations (0)
We address the received signal strength (RSS) based target localization problem in large-scale cooperative wireless sensor networks (WSNs). Using the noisy RSS measurements, we formulate the localization problem based on the maximum likelihood (ML) criterion. Although ML-based solutions have asymptotically optimal performance, the derived localization problem is non-convex. To overcome this difficulty, we propose a convex relaxation leading to second-order cone programming (SOCP) estimator, which can be solved efficiently by interior-point algorithms. Moreover, we investigate the case where target nodes limit the number of cooperating nodes by selecting only those neighbors with the highest RSS. This simple procedure can reduce the energy consumption of an algorithm in both communication and computation phase. Our simulation results show that the proposed approach outperforms significantly the existing ones in terms of the estimation accuracy and convergence. Furthermore, the new approach does not suffer significant performance degradation when the number of cooperating nodes is reduced.
RSS
Cite
Citations (4)
We propose a novel algorithm for sensor self-localization in cooperative wireless networks where observations of relative sensor distances are available. The variational message passing (VMP) algorithm is used to implement a mean field solution to the estimation of the posterior probabilities of the sensor positions in an R 2 scenario. Extension to R 3 is straight-forward. Compared to non-parametric methods based on belief propagation, the VMP algorithm features significantly lower communication overhead between sensors. This is supported by performance simulations which show that the estimated mean localization error of the algorithm stabilizes after approximately 30 iterations.
Belief Propagation
Cite
Citations (61)
In this paper we propose a distributed approach for localization in wireless sensor networks using a mobile beacon based on Particle Filter (PF) and Extended Kalman Filter (EKF). The algorithm has two phases. In the first phase, each node localizes itself using messages received from the mobile beacon. In the second phase nodes cooperate with each other to improve their estimations of their locations. In the first phase particle filter is used for localization due to its multi-modal/multi-hypothesis nature. In the later EKF is used, due to the nonlinearity nature of the problem in hand, to improve the estimation. On the other hand, using EKF, instead of PF, in the inter-node communication reduces the communication bandwidth tremendously. The mobile beacon's trajectory is based on Hilbert curve which has shown better accuracy in localizing the nodes in the sensor network. The simulation results show better performance than the previous approaches, that either uses inter-node communication or mobile beacon localization.
Cite
Citations (11)
Location awareness is becoming essential for emerging wireless applications where most network activities require the location information of network nodes, e.g., routing between nodes in ad-hoc sensor networks, positioning vehicles on the road, or tracking targets in underwater acoustic sensor networks. In particular, cooperation among nodes is highly beneficial for the localization accuracy and coverage in harsh environments. In this paper, we study least square (LS) cooperative localization in the presence of arbitrary non-line-of-sight (NLOS) ranging bias. To develop the network position error bound (PEB), we first derive the Fisher information matrix (FIM) for a general NLOS bias model and show that a Gaussian bias due to NLOS effects is the worst case that produces the extremal FIM, whereas a constant bias or equivalently full line-of-sight is the best situation leading to the largest FIM in a sense of Löwner partial ordering. We then analyze the asymptotic performance, such as uniform convergence, consistency, and efficiency, of LS cooperative localization to quantify the deviations of localization accuracy for LS, squared-range LS, and squared-range weighted LS solutions from the fundamental limit (i.e., Cramér-Rao lower bound) due to their practical tractability. We also propose a simple distributed algorithm for LS cooperative localization by integrating squared-range relaxation into Gaussian variational message passing on the localization network. To account for stochastic natures of node locations and populations, we further characterize the network PEB for Gilbert's disk localization network, where anchors and/or agents are randomly distributed in the network according to point processes.
Non-line-of-sight propagation
Cramér–Rao bound
Fisher information
Ranging
Cite
Citations (92)
For situations such as indoor and underground parking lots in which satellite signals are obstructed, GNSS cooperative positioning can be used to achieve high-precision positioning with the assistance of cooperative nodes. Here we study the cooperative positioning of two static nodes, node 1 is placed on the roof of the building and the satellite observation is ideal, node 2 is placed on the indoor windowsill where the occlusion situation is more serious, we mainly study how to locate node 2 with the assistance of node 1. Firstly, the two cooperative nodes are located with pseudo-range single point positioning, and the positioning performance of cooperative node is analyzed, therefore the information of pseudo-range and position of node 1 is obtained. Secondly, the distance between cooperative nodes is obtained by using the baseline method with double-difference carrier phase. Finally, the cooperative location algorithms are studied. The Extended Kalman Filtering (EKF), Unscented Kalman Filtering (UKF) and Particle Filtering (PF) are used to fuse the pseudo-range, ranging information and location information respectively. Due to the mutual influences among the cooperative nodes in cooperative positioning, the EKF, UKF and PF algorithms are improved by resetting the error covariance matrix of the cooperative nodes at each update time. Experimental results show that after being improved, the influence between the cooperative nodes becomes smaller, and the positioning performance of the nodes is better than before.
Precise Point Positioning
Cite
Citations (18)
In traditional TOA or TDOA-based cellular localization, if mobile terminal (MT) can not connect well with 3 or more than 3 BSs, the localization will fail, or positioning accuracy is very poor. To solve this problem in 4G wireless networks, the cooperative group localization (CGL) scheme is proposed in this paper, where it is assumed that different MTs can directly communicate with each other in a peer-to-peer manner and perform the distance measurement, forming a terminal group (TG). When each MT in a TG connects with less than 3 BSs, CGL makes it possible to locate all the MTs in the TG by other MTs' cooperation. The proposed scheme can effectively enhance the robustness and precision of localization. Based on rigid graph theory, the unique solvability of CGL scheme is analyzed in theory. A searching and positioning algorithm for CGL is introduced, and numerical simulations indicate that the proposed algorithm has significantly advantages, compared with traditional localization methods.
Robustness
Cite
Citations (10)
Robustness
Multidimensional scaling
Cite
Citations (2)