Heuristic methods for position location based in manhattan model for position location in ad hoc networks

Abstract

The position location of nodes in wireless networks is an important building block for next generation pervasive computing systems, but a great challenge, particularly, for very small hardware and energy constrained devices, for noisy, unpredictable environments and for very large ad hoc deployed and networked systems. In this work, we design, validate and evaluate in real environments two methods and several algorithms for position location in ad hoc networks, the first method is based only on the number of hops between three references and the node to locate, the second is based in the distance between nodes connecting three references with the node to locate. Types of trajectories in routes and cluster size of the network have a significant impact on the localization quality in these systems. We propose two novel methods in order to obtain an approximation of the position location of a node under any type of trajectory in the route and under any size of network area and demonstrate their effectiveness through evaluations. These combined features allow two localization methods that are efficient and robust to different network environments.