Resilient Range Based d Dimensional Localization for Mobile Sensor Networks in Java

Knowledge of node locations is essential to Wireless Sensor Networks (WSNs) in a wide range of potential applications and their function-dependent network protocols. A number of localization approaches have already been proposed to fulfill this requirement, but few of them can be applicable to mobile sensor networks, due to their low-dimensional embeddings, Euclidean distance representation limitations, frequent node mobility and additional measurement overhead in the network. In this paper, a resilient range-based d-dimensional localization (RRDL) approach is proposed for mobile WSNs to resolve the issues. RRDL distinguishes itself from previous work with three remarkable characteristics: (1) it works for mobile networks embedded in d-dimensional Non-Euclidean space; (2) it allows static ordinary nodes with pre-known locations to act as the alternative anchor nodes, thus tolerating the motion of the original anchor nodes to ensure that other ordinary nodes can obtain their locations in an efficient manner; and (3) it introduces an efficient path-learning approach, with the knowledge of the existing paths, to represent the real network distances as far as possible, thereby eliminating additional measurement overhead and tolerating node mobility in localization. With these characteristics, RRDL exploits the iterative factorization of the random distance matrix, formed by the distances to and from a set of k-hop static neighbors, to assign each current node d-dimensional Non-Euclidean coordinate in a distributed manner. Simulation results demonstrate that RRDL achieves higher localization accuracy with a moderate communication cost in mobile sensor networks.