A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods

This research presents a distributed and formula-based bilateration algorithm that can be used to provide initial set of locations. In this scheme each node uses distance estimates to anchors to solve a set of circle-circle intersection (CCI) problems, solved through a purely geometric formulation. The resulting CCIs are processed to pick those that cluster together and then take the average to produce an initial node location. The algorithm is compared in terms of accuracy and computational complexity with a Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms

A Hybrid Localization Approach in Wireless Sensor Networks by Resolving Flip Ambiguity

Localization has received considerable attention because many wireless sensor network applications require accurate knowledge of the locations of the sensors in the network. In the process the location calculation is achieved by either distance measurements or angle-of‐arrival measurement. However, the former technique suffers from flip ambiguity due to either the presence of insufficient reference points or uncertainties in the inter‐nodal distance measurements in a triangular network structure. A recently proposed quadrilateral structure (an extended complex version of a trilateration structure) can resolve flip ambiguity of a node in dense deployments under restricted orientations for anchors. However, the technique leaves open issues to consider imprecise inter‐nodal distances between all pairs of nodes as complexity increases due to measurement uncertainties in determining the locations. Moreover, both the structures (trilateral and quadrilateral) completely fail to resolve flip ambiguity in sparse node deployments as sufficient nodes are not available in order to determine the signs in calculated angles. On the other hand, AOA can provide the sign of the angles but requires expensive hardware calibration to provide a high‐level of accuracy in the measured angles. Therefore, there is a need of a localization technique that is cheaper, less complex, and robust by considering measurement uncertainties between all pair of nodes and more importantly, involves fewer reference nodes. The primary contributions of this thesis include a hybrid technique that uses low‐accuracy (cheap) AOA measurements along with erroneous distance measurements between each pair of nodes in a much simpler triangular network that corresponds to a sparse deployment. In our initial phase we develop mathematical models involving only two reference nodes that are able to resolve flip ambiguity a unknown node with a high probability of success even with an RMS error as high as 150 in the line‐of‐bearing estimate, which avoids the need for calibration in many practical situations. In later phases, we modelled our hybrid localization technique to accommodate imprecise inter‐nodal measurements between all pairs of nodes. In the final phase, we intend our localization technique to solve ambiguity in extremely sparse scenarios with non‐closed network structure that are yet to be solved by existing localizations approaches. Resolution of flip ambiguity is useful, not only to develop lower‐complexity localization techniques, but also for many lower‐layer network functionalities such as geographic routing, topology control, coverage and tracking, and controlled mobility when a large number of these nodes have to be deployed