3D Tdoa Problem Solution with Four ReceivingNodes

Time difference of arrival (TDOA) positioning methods have experienced growing importance over the last few years due to their multiple applications in local positioning systems (LPSs). While five sensors are needed to determine an unequivocal three-dimensional position, systems with four nodes present two different solutions that cannot be discarded according to mathematical standards. In this paper, a new methodology to solve the 3D TDOA problems in a sensor network with four beacons is proposed. A confidence interval, which is defined in this paper as a sphere, is defined to use positioning algorithms with four different nodes. It is proven that the separation between solutions in the four-beacon TDOA problem allows the transformation of the problem into an analogous one in which more receivers are implied due to the geometric properties of the intersection of hyperboloids. The achievement of the distance between solutions needs the application of genetic algorithms in order to find an optimized sensor distribution. Results show that positioning algorithms can be used 96.7% of the time with total security in cases where vehicles travel at less than 25 m/s.