Work

Solutions for wireless sensor network localization

Year: 2012
Type: dissertation
Abstract: Wireless sensor network localization opens the door to many location based applications. In\n\nthis thesis, some solutions obtained from localization algorithms are investigated. There are\n\ntwo categories of problem on localization. Range-based methods are applied to the situation\n\nin which information on the distances between each pair of nodes is available. Algorithms are\n\ndeveloped to estimate the location of each sensor in the network. Usually, the distance\n\nbetween each pair of nodes is estimated by the signal strength received between them, and\n\nthis information is very noisy. Range-free methods, which are also called connectivity-based\n\nmethods, assume that the distances between any two nodes are unknown but the connectivity\n\ninformation between them is known. If the distance between any two nodes in the network is\n\nwithin a communication range, connectivity between these two nodes is said to be established.\n\nIn a range-based scenario, with the information of inter-sensor distance measurements as\n\nwell as the absolute locations of the anchors, the objective is to obtain the location of all the\n\nunknown nodes. Two new localization methods based on gradient descent are shown in the\n\nthesis. The gradient descent methods would minimize the difference between the measured\n\ndistances and the distances obtained from the estimated locations. From a comparison with\n\nother well-known localization methods, the two newly developed gradient descent algorithms\n\ncan reach better accuracy at the expense of computational complexity. This is not surprising\n\nas the proposed algorithms are iterative in nature.\n\nFor range-free scenario, a new model utilizing all the information derived from\n\nconnectivity-based sensor network localization is introduced. Unlike other algorithms which\n\nonly utilize the information on connections, this model makes use of both information on\n\nconnections and disconnections between any pair of nodes. The connectivity information\n\nbetween any pair of nodes is modeled as convex and non-convex constraints. The localization\n\nproblem is solved by an optimization algorithm to obtain a solution that would satisfy all the\n\nconstraints established in the problem. The simulation has shown that better accuracy is\n\nobtained when compared with algorithms developed by other researchers.\n\nAnother solution for the range-free scenario is obtained with the use of a two-objective\n\nevolutionary algorithm called Pareto Archived Evolution Strategy (PAES). In an evolutionary\n\nalgorithm, the aim is to search for a solution that would satisfy all the convex and non-convex\n\nconstraints of the problem. The number of wrong connections and the summation of\n\ncorresponding distances are set as the two objectives. A starting point on the location of the\n\nunknown nodes is obtained using a solution from the result of all convex constraints. The\n\nfinal solution can reach the most suitable configuration of the unknown nodes as all the\n\ninformation on the constraints (convex and non-convex) related to connectivity have been\n\nused. From the simulation results, a relationship between the communication range and\n\naccuracy is obtained.\n\nIn this thesis, another evolutionary algorithm has been examined to obtain a solution for\n\nour problem. The solution is based on a modified differential evolution algorithm with\n\nheuristic procedures peculiar to our domain of application. The characteristics of the sensor\n\nnetwork localization are thoroughly investigated and utilized to produce corresponding\n\ntreatment to search for the reasonable node locations. The modified differential evolution\n\nalgorithm uses a new crossover step that is based on the characteristics of the problem. With\n\nthe combination of some heuristics, the solution search can move the node to jump out of\n\nlocal minimums more easily, and give better accuracy than current algorithms.\n\nIn the last part of the thesis, a novel two-level range connectivity-based sensor network\n\nlocalization problem is proposed, which would enrich the connectivity information. In this\n\nnew problem, the information of the connectivity between any pair of nodes is either strong,\n\nweak or zero. Again, a two-objective evolutionary algorithm is used to search for a solution\n\nthat would satisfy all the convex and non-convex constraints of the problem. Based on\n\nsimulations on a range of situations, a suitable range value for the second range is found.
Author: Dapeng Qiao
Language: English
Open Access status: green
OpenAlex ID: W2264367231
Cites:
Cited by: 2
Related to: 10