Abstract:The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, energy expenditure and the duration of the localization phase. In this paper we propose a framework, called StarDust, for wireless sensor network localization based on passive optical components. In the StarDust framework, sensor nodes are equipped with optical retro-reflectors. An aerial device projects light towards the deployed senso… Show more
“…However, no matter which technique is used, these methods suffer from several drawbacks: first, they do not differentiate the uncertainty of measurements, or at least do not well quantify the uncertainty [29,28,10,27]. Therefore, their deduction is not theoretically optimal.…”
Previous localization solutions in wireless sensor networks mainly focus on using various techniques to estimate node positions. In this paper, we argue that quantifying the uncertainty of these estimates is equally important in practice. By using the quantitative uncertainty of measurements and estimates, we can derive more accurate estimates by better fusing the measurements, provide confidence information for confidence-based applications, and know how to select the best anchor nodes so as to minimize the total mean square errors of the whole network. This paper quantifies the estimation uncertainty as an error covariance matrix, and presents an efficient incremental centralized algorithm-INOVA and a decentralized algorithm-OSE-COV for calculating the error covariance matrix. Furthermore, we present how to use the error covariance matrix to infer the confidence region of each node's estimate, and provide an optimal strategy for the anchor selection problem. Extensive simulation results show that INOVA significantly improves the computation efficiency when the network changes dynamically; the confidence region inference is accurate when the measurement number to node number ratio is more than 2; and the optimal anchor selection strategy reduces the total mean square error by four times as much as the variation-based algorithm in best case.
“…However, no matter which technique is used, these methods suffer from several drawbacks: first, they do not differentiate the uncertainty of measurements, or at least do not well quantify the uncertainty [29,28,10,27]. Therefore, their deduction is not theoretically optimal.…”
Previous localization solutions in wireless sensor networks mainly focus on using various techniques to estimate node positions. In this paper, we argue that quantifying the uncertainty of these estimates is equally important in practice. By using the quantitative uncertainty of measurements and estimates, we can derive more accurate estimates by better fusing the measurements, provide confidence information for confidence-based applications, and know how to select the best anchor nodes so as to minimize the total mean square errors of the whole network. This paper quantifies the estimation uncertainty as an error covariance matrix, and presents an efficient incremental centralized algorithm-INOVA and a decentralized algorithm-OSE-COV for calculating the error covariance matrix. Furthermore, we present how to use the error covariance matrix to infer the confidence region of each node's estimate, and provide an optimal strategy for the anchor selection problem. Extensive simulation results show that INOVA significantly improves the computation efficiency when the network changes dynamically; the confidence region inference is accurate when the measurement number to node number ratio is more than 2; and the optimal anchor selection strategy reduces the total mean square error by four times as much as the variation-based algorithm in best case.
“…For road networks having these unique characteristics, legacy localization schemes have limitations. First of all, we can categorize legacy schemes into three kinds as follows: (a) Range-based schemes (e.g., TOA and TDOA [2,25]); (b) Range-free schemes (e.g., APIT); and (c) Artificial eventbased schemes (e.g., StarDust and Spotlight [21,22]). First, for the TOA scheme in [25], wireless sensors need GPS devices that are costly and require additional energy consumption.…”
Section: Sensor On Roadmentioning
confidence: 99%
“…In the same way as range-based schemes, when the spacing between the sensors is so large for communication, the beacon signal from the anchor nodes for localization cannot reach non-anchor nodes, so the range-free schemes cannot work well, either. Third, the localization schemes based on artificial event generation (e.g., StarDust and Spotlight [21,22]) are difficult to use in large-scale road networks, since it is hard to generate artificial events in a large area. Also, in the case where road networks are large, it is very hard to let artificial events reach all sensors.…”
Section: Sensor On Roadmentioning
confidence: 99%
“…The main idea of these schemes is to use artificial events for sensor localization that are generated from the event scheduler [8,18,22]. Some well-controlled artificial events, such as light, are injected into sensor networks.…”
In road networks, sensor nodes are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging ineffective. To address this issue, this paper introduces an autonomous passive localization scheme, called APL. Our work is inspired by the fact that vehicles move along routes with a known map. Using vehicle-detection timestamps, we can obtain distance estimates between any pair of sensors on roadways to construct a virtual graph composed of sensor identifications (i.e., vertices) and distance estimates (i.e., edges). The virtual graph is then matched with the topology of road map, in order to identify where sensors are located in roadways. We evaluate our design in local roadway and show that our distance estimate method works well. In addition, we show that our localization scheme is effective in a road network with eighteen intersections, where we found no location matching error, even with a maximum sensor time synchronization error of 0.3[sec] and the vehicle speed deviation of 10[km/h].
“…Most of them can be categorized into three classes: (i) range-based localization [16,2,19,5,29,21,11,32,3,8]; (ii) range-free localization [15,4,9,18,1,22]; and (iii) event-driven localization [20,24,25,17,33].…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.