Searcharxiv⌕ Search

arXiv subjects

Ivan Alexander Morales Sandoval

Publications and source records attributed to Ivan Alexander Morales Sandoval.

2 recordsLinked to original sources

Fundamental Limits of Rigid Body Localization

We consider a novel and general approach to easily compute the Cramér-Rao Lower Bounds (CRLBs) of rigid body localization (RBL) problem using arbitrary types of information. To that end, we adopt an information-centric construction of the Fisher information matrix (FIM), which allows capturing the contribution of each measurement towards the FIM explicitly, both in terms of input measurement types, as well as of their error distributions. Taking advantage of this approach, we derive a generic framework for evaluating the CRLB, which is applicable to arbitrary rigid body localization scenarios, and which, unlike the formulation of FIM commonly used in point-target localization, is better suited to RBL problems as it explicitly allows capturing the precision in both the translation vector and the rotation matrix (or alternative the rotation angles) of the rigid body, with respect to a reference. Examples of CRLBs obtained via the proposed approach are given in closed form, including the bound incorporating an orthonormality constraint onto the rotation matrix, which enables a straightforward adjustment of the derived bound when new measurements are added or removed. Numerical results illustrate that the derived expression correctly lower-bounds the errors of estimated localization parameters obtained via various related state-of-the-art (SotA) estimators, revealing their accuracies and suggesting that SotA RBL algorithms can still be improved.

eess.SP↗

A Robust Routing Protocol for 5G Mesh Networks

We consider a novel routing protocol suitable for ad-hoc networks with dynamically changing topologies, such as DECT 2020 NR (NR+) systems, which often lead to missing links between the nodes and thus, incomplete or inefficient routes. A key point of the proposed protocol is the combination of network discovery and matrix completion techniques, which allow the nodes to establish communication paths efficiently and reliably. Additionally, multihop localization is performed to estimate the location of the nodes without needing to broadcast each node's geographical position, thus preserving privacy during the routing process and enabling nodes in the network to independently find potentially missing paths in a decentralized manner instead of flooding the whole network. Simulation results illustrate the good performance of the proposed technique in terms of the average number of hops of the obtained routes in different scenarios, with different network densities and amounts of incompleteness.

cs.NI↗