Performance of a Simple Positioning Algorithm (SimPA) in wireless heterogeneous mobile mesh networks (original) (raw)

Improved Position Estimation in Wireless Heterogeneous Networks

Lecture Notes in Computer Science, 2004

This paper addresses the problern of nodes localization in wireless ad hoc networks. Two types of nodes are considered: nodes with self-locating capability like GPS and nodes with no self-locating capability. For the last ones it is thus important to infer a position which will be retrieved from the position of the neighbor's nodes. The precision of this information clearly depends on the environment and may not be very accurate. We propose a method which consists in selecting and processing only nodes that are likely to enhance the accuracy of an estimated position. We focus our approach on defining a hull, made up of neighboring nodes, as a key element of position accuracy enhancement. The improvements of using such a method are then validated by a set of simulations.

Transparent and Distributed Localization of Mobile Users in Wireless Mesh Networks

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2009

Localization of mobile users in wireless mesh networks (WMN) generally relies on some sort of flooding-based technique. Broadcasting the network is good for reliability but leads to increased latency and broadcast storm problems. This results in low efficiency of the location management mechanism in terms of packets loss and disconnection time. In this paper, we investigate a new DHT-based location management scheme through experimental evaluation on our WMN testbed. The main features of our proposed scheme are that broadcast packets are totally avoided and node localization becomes transparent to the users. We compare it to our previous flooding-based location scheme, namely EMM (Enhanced Mobility Management). Our results show improved performance both in terms of dropped packets and handover latency introduced to re-establish open sessions after a user moves.

Mobile Node Localization in Cellular Networks

International Journal of Wireless & Mobile Networks, 2011

. To validate our method across cellular network, we implemented and simulated our method in two scenarios i.e. maintaining database of base stations in centralize and distributed system. Simulation results show the effectiveness of our approach and its implementation applicability in telecommunication systems.

Locating Nodes in Mobile Sensor Networks More Accurately and Faster

2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008

Localization in mobile sensor networks is more challenging than in static sensor networks because mobility increases the uncertainty of nodes' positions. Most existing localization algorithms in mobile sensor networks use Sequential Monte Carlo (SMC) methods due to their simplicity in implementation. However, SMC methods are very time-consuming because they need to keep sampling and filtering until enough samples are obtained for representing the posterior distribution of a moving node's position. In this paper, we propose a localization algorithm that can reduce the computation cost of obtaining the samples and improve the location accuracy. A simple bounding-box method is used to reduce the scope of searching the candidate samples. Inaccurate position estimations of the common neighbor nodes is used to reduce the scope of finding the valid samples and thus improve the accuracy of the obtaineed location information. Our simulation results show that, comparing with existing algorithms, our algorithm can reduce the total computation cost and increase the location accuracy. In addition, our algorithm shows several other benefits: 1) it enables each determined node to know its maximum location error, 2) it achieves higher location accuracy under higher density of common nodes, and 3) even when there are only a few anchor nodes, most nodes can still get position estimations.

GPS-Free node localization in mobile wireless sensor networks

Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access - MobiDE '06, 2006

An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node's awareness of its position relative to the network. In this paper, we introduce a variant of this problem (directional localization) where each node must be aware of both its position and orientation relative to the network. This variant is especially relevant for the applications in which mobile nodes in a sensor network are required to move in a collaborative manner. Using global positioning systems for localization in large scale sensor networks is not cost effective and may be impractical in enclosed spaces. On the other hand, a set of pre-existing anchors with globally known positions may not always be available. To address these issues, in this work we propose an algorithm for directional node localization based on relative motion of neighboring nodes in an ad-hoc sensor network without an infrastructure of global positioning systems (GPS), anchor points, or even mobile seeds with known locations. Through simulation studies, we demonstrate that our algorithm scales well for large numbers of nodes and provides convergent localization over time, even with errors introduced by motion actuators and distance measurements. Furthermore, based on our localization algorithm, we introduce mechanisms to preserve network formation during directed mobility in mobile sensor networks. Our simulations confirm that, in a number of realistic scenarios, our algorithm provides for a mobile sensor network that is stable over time irrespective of speed, while using only constant storage per neighbor.

Localization Heuristic in Mobile Wireless Networks

2014

The improvement of WSN technologies boosts the development of several new applications. For many of these applications, the use of not only static nodes, but also mobile nodes with the capability to change their position over time, can greatly expand the node coverage area, reducing the required number of nodes and the network costs.The movement of a sensor node may impose extra challenges for the WSN, such as the necessity to know the current node location as well as the ability of dynamically connecting to other nodes. Localization techniques have benefits and limitations, but by combining some of them in a proper way, it may be possible to develop more reliable and flexible node localization system, that can take advantage of the flexibility of an inertial technique, for example, and the simplicity of anchor node based techniques.This work proposes a localization heuristic that combines an anchor-based technique and the inertial measurement technique, exploring aspects regarding ...

A simple iterative positioning algorithm for client node localization in WLANs

2013

The ability to determine in real-time the geographic location of client nodes is an important tool in wireless networks, allowing instantaneous mobile tracking, implementation of location-aware services and also efficient channel and power allocation planning. Among existing classical cooperative localization techniques for wireless networks, the maximum likelihood estimator (MLE) is theoretically the best. However, the gradient-based algorithms that are commonly used for maximum likelihood estimation are quite sensitive to the initial values and cannot achieve the theoretical optimal performance. In this paper, we propose a new iterative positioning algorithm based on received signal strength information that employs a location ordering strategy and a numerical nonlinear optimization method. The algorithm performance is evaluated through simulation for different network scenarios. A real wireless network scenario is also implemented in order to demonstrate the algorithm effectiveness. The proposed algorithm, while presenting a simplified implementation, can achieve better positioning estimates than the classical MLE approach based on the conjugated gradient.

An Improved Hybrid Framework for Evaluating a Mobile Device Location in a Wireless Network

2021

Studies on techniques to track an object from a remote location have been ongoing for several years. Existing outdoor solutions to locate a Mobile Station (MS) within a cellular network require optimization in terms of accuracy and latency. In this study, an Enhanced Mobile Station Positioning (EMSP) architecture for a Wireless Sensor Network was developed and its performance was appraised using accuracy and latency metrics. The model is a fusion of the Received Signal Strength (RSS) and Time Difference of Arrival (TDOA) techniques. The RSS used the strength of the signal received at four Base Stations (BS) positioned within the neighborhood of the MS to locate it while the TDOA paradigm utilized the difference in arrival time of the signals to locate the MS. The RSS forms a circle on which the MS can be traced while the TDOA offers a hyperbola on which the MS can be located. The mathematical model was derived by solving both the circles and the hyperbolas with Taylor’s series expan...

A new geometric approach to mobile position in wireless LAN reducing complex computations

5th International Conference on Design & Technology of Integrated Systems in Nanoscale Era, 2010

Positions estimation from Time of Arrival (TOA), Time Difference of Arrival (TDOA), and Angle of Arrival (AOA) measurements are the commonly used techniques. These approaches use the location parameters received from different sources and they are based on intersections of circles, hyperbolas, and lines, respectively. The location is determined using standard complex computation methods that are usually implemented in software and needed relatively long execution time. An important factor in achieving this is to minimize and simplify the instructions that the mobile station (MS) has to execute in the location determination process. Finding an effective location estimation technique to facilitate processing data is the main focuses in this paper. Therefore, in the wireless propagation environment the Received Signal Strength (RSS) information from three base stations (BSs) are recorded and processed and they can provide an overlapping coverage area of interest. Then an easy geometric technique is applied in order to effectively calculate the location of the desired MS.