Space-partitioning with cascade-connected ANN structures for positioning in mobile communication systems

The world around us is getting more connected with each day passing by – new portable devices employing wireless connections to various networks wherever one might be. Locationaware computing has become an important bit of telecommunication services and industry. For this reason, the research efforts on new and improved localisation algorithms are constantly being performed. Thus far, the satellite positioning systems have achieved highest popularity and penetration regarding the global position estimation. In spite the numerous investigations aimed at enabling these systems to equally procure the position in both indoor and outdoor environments, this is still a task to be completed. This research work presented herein aimed at improving the state-of-the-art positioning techniques through the use of two highly popular mobile communication systems: WLAN and public land mobile networks. These systems already have widely deployed network structures (coverage) and a vast number of (inexpensive) mobile clients, so using them for additional, positioning purposes is rational and logical. First, the positioning in WLAN systems was analysed and elaborated. The indoor test-bed, used for verifying the models’ performances, covered almost 10,000m2 area. It has been chosen carefully so that the positioning could be thoroughly explored. The measurement campaigns performed therein covered the whole of test-bed environment and gave insight into location dependent parameters available in WLAN networks. Further analysis of the data lead to developing of positioning models based on ANNs. The best single ANN model obtained 9.26m average distance error and 7.75m median distance error. The novel positioning model structure, consisting of cascade-connected ANNs, improved those results to 8.14m and 4.57m, respectively. To adequately compare the proposed techniques with other, well-known research techniques, the environment positioning error parameter was introduced. This parameter enables to take the size of the test environment into account when comparing the accuracy of the indoor positioning techniques. Concerning the PLMN positioning, in-depth analysis of available system parameters and signalling protocols produced a positioning algorithm, capable of fusing the system received signal strength parameters received from multiple systems and multiple operators. Knowing that most of the areas are covered by signals from more than one network operator and even more than one system from one operator, it becomes easy to note the great practical value of this novel algorithm. On the other hand, an extensive drive-test measurement campaign, covering more than 600km in the central areas of Belgrade, was performed. Using this algorithm and applying the single ANN models to the recorded measurements, a 59m average distance error and 50m median distance error were obtained. Moreover, the positioning in indoor environment was verified and the degradation of performances, due to the crossenvironment model use, was reported: 105m average distance error and 101m median distance error. When applying the new, cascade-connected ANN structure model, distance errors were reduced to 26m and 2m, for the average and median distance errors, respectively. The obtained positioning accuracy was shown to be good enough for the implementation of a broad scope of location based services by using the existing and deployed, commonly available, infrastructure

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

K-Means Fingerprint Clustering for Low-Complexity Floor Estimation in Indoor Mobile Localization

Indoor localization in multi-floor buildings is an important research problem. Finding the correct floor, in a fast and efficient manner, in a shopping mall or an unknown university building can save the users' search time and can enable a myriad of Location Based Services in the future. One of the most widely spread techniques for floor estimation in multi-floor buildings is the fingerprinting-based localization using Received Signal Strength (RSS) measurements coming from indoor networks, such as WLAN and BLE. The clear advantage of RSS-based floor estimation is its ease of implementation on a multitude of mobile devices at the Application Programming Interface (API) level, because RSS values are directly accessible through API interface. However, the downside of a fingerprinting approach, especially for large-scale floor estimation and positioning solutions, is their need to store and transmit a huge amount of fingerprinting data. The problem becomes more severe when the localization is intended to be done on mobile devices which have limited memory, power, and computational resources. An alternative floor estimation method, which has lower complexity and is faster than the fingerprinting is the Weighted Centroid Localization (WCL) method. The trade-off is however paid in terms of a lower accuracy than the one obtained with traditional fingerprinting with Nearest Neighbour (NN) estimates. In this paper a novel K-means-based method for floor estimation via fingerprint clustering of WiFi and various other positioning sensor outputs is introduced. Our method achieves a floor estimation accuracy close to the one with NN fingerprinting, while significantly improves the complexity and the speed of the floor detection algorithm. The decrease in the database size is achieved through storing and transmitting only the cluster heads (CH's) and their corresponding floor labels.Comment: Accepted to IEEE Globecom 2015, Workshop on Localization and Tracking: Indoors, Outdoors and Emerging Network

Distributed and adaptive location identification system for mobile devices

Indoor location identification and navigation need to be as simple, seamless, and ubiquitous as its outdoor GPS-based counterpart is. It would be of great convenience to the mobile user to be able to continue navigating seamlessly as he or she moves from a GPS-clear outdoor environment into an indoor environment or a GPS-obstructed outdoor environment such as a tunnel or forest. Existing infrastructure-based indoor localization systems lack such capability, on top of potentially facing several critical technical challenges such as increased cost of installation, centralization, lack of reliability, poor localization accuracy, poor adaptation to the dynamics of the surrounding environment, latency, system-level and computational complexities, repetitive labor-intensive parameter tuning, and user privacy. To this end, this paper presents a novel mechanism with the potential to overcome most (if not all) of the abovementioned challenges. The proposed mechanism is simple, distributed, adaptive, collaborative, and cost-effective. Based on the proposed algorithm, a mobile blind device can potentially utilize, as GPS-like reference nodes, either in-range location-aware compatible mobile devices or preinstalled low-cost infrastructure-less location-aware beacon nodes. The proposed approach is model-based and calibration-free that uses the received signal strength to periodically and collaboratively measure and update the radio frequency characteristics of the operating environment to estimate the distances to the reference nodes. Trilateration is then used by the blind device to identify its own location, similar to that used in the GPS-based system. Simulation and empirical testing ascertained that the proposed approach can potentially be the core of future indoor and GPS-obstructed environments

Space-Time diversity for NLOS mitigation in TDOA-based positioning systems

This paper studies the potential impact of using space-Time information in the mitigation of the Non-LineOf-Sight condition in mobile subscriber's positioning systems. First of all, this work discusses the positioning problem based on measures of Time Differences Of Arrival departing from a more exact characterization of the signal statistics and including some geometrical restrictions to achieve an improved accurate. Furthermore, a novel approach that integrates signal propagation characteristics to information provided by a suitable timing estimation model based on Cramer Rao Bound for a Rayleigh-fading channel, when antenna arrays are used at the receiver and when a set ofchannel vector estimates are available, has been introduced to study the positive benefits of space-Time diversity. These approaches are evaluated within a realistic simulation scenario.Peer ReviewedPostprint (published version

Position Estimation of Robotic Mobile Nodes in Wireless Testbed using GENI

We present a low complexity experimental RF-based indoor localization system based on the collection and processing of WiFi RSSI signals and processing using a RSS-based multi-lateration algorithm to determine a robotic mobile node's location. We use a real indoor wireless testbed called w-iLab.t that is deployed in Zwijnaarde, Ghent, Belgium. One of the unique attributes of this testbed is that it provides tools and interfaces using Global Environment for Network Innovations (GENI) project to easily create reproducible wireless network experiments in a controlled environment. We provide a low complexity algorithm to estimate the location of the mobile robots in the indoor environment. In addition, we provide a comparison between some of our collected measurements with their corresponding location estimation and the actual robot location. The comparison shows an accuracy between 0.65 and 5 meters.Comment: (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust