TDOA-Based Localization via Stochastic Gradient Descent Variants

  title={TDOA-Based Localization via Stochastic Gradient Descent Variants},
  author={Luis F. Abanto-Leon and Arie G. C. Koppelaar and Sonia M. Heemstra de Groot},
  journal={2018 IEEE 88th Vehicular Technology Conference (VTC-Fall)},
Source localization is of pivotal importance in several areas such as wireless sensor networks and Internet of Things (IoT), where the location information can be used for a variety of purposes, e.g. surveillance, monitoring, tracking, etc. Time Difference of Arrival (TDOA) is one of the well- known localization approaches where the source broadcasts a signal and a number of receivers record the arriving time of the transmitted signal. By means of computing the time difference from various… 
Distance-based Mobile Node Localization of Fixed Beacons Using RMS Prop
An adaptive localization that utilizes RMS Prop technique to change the gradient descent gains adaptive to the distance between mobile node and beacons, thus giving the improved convergence speed and provide stable localization is proposed.


Accuracy studies for TDOA and TOA localization
  • R. Kaune
  • Computer Science
    2012 15th International Conference on Information Fusion
  • 2012
In sensor networks, passive localization can be performed by exploiting the received signals of unknown emitters. In this paper, the Time of Arrival (TOA) measurements are investigated. Often, the
Algorithms and Bounds for Distributed TDOA-Based Positioning Using OFDM Signals
Development of an algorithm for simultaneously resolving the integer ambiguities and obtaining a position estimate; derivation of the Cramér-Rao lower bound (CRLB) on locating the CP, and hence, on the underlying source localization and navigation problems.
Positioning using time-difference of arrival measurements
  • F. Gustafsson, F. Gunnarsson
  • Computer Science
    2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).
  • 2003
This work suggests and compares a Monte Carlo based method for positioning and a gradient search algorithm using a nonlinear least squares framework and has the feature of being easily extended to a dynamic framework where a motion model of the transmitter is included.
Adam: A Method for Stochastic Optimization
This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
On the momentum term in gradient descent learning algorithms
  • N. Qian
  • Mathematics, Medicine
    Neural Networks
  • 1999
The bounds for convergence on learning-rate and momentum parameters are derived, and it is demonstrated that the momentum term can increase the range of learning rate over which the system converges.
Graph-based resource allocation with conflict avoidance for V2V broadcast communications
This research has envisaged a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the signal-to-interference-plus-noise ratio (SINR) that vehicles perceive.
Lecture 6 a : Overview of Mini - batch Gradient Descent
Lecture 6a: Overview of Mini-batch Gradient Descent
Sensor intelligence enabling Industry 4.0