Mauricio A. Caceres

Learn More
We propose a novel cooperative positioning algorithm that fuses information from satellites and terrestrial wireless systems, suitable for GPS-challenged scenarios. The algorithm is fully distributed over an unstructured network, does not require a fusion center, does not rely on fixed terrestrial infrastructure, and is thus suitable for ad-hoc deployment.(More)
The increasing availability of ubiquitous, small, low-cost devices using wireless communications to build wireless sensor networks calls for autonomous solutions and algorithms capable of calculating the location where the information is gathered, processed, used. The requirements are particularly strict when sensor nodes are mobile; in fact, mobile(More)
Cooperative positioning algorithms have been recently introduced to overcome the limitations of traditional methods, relying on GNSS or other terrestrial infrastructure. In particular, SPAWN (Sum-Product Algorithm over a Wireless Network) was shown to provide accurate position estimate even in challenged indoor environments, thanks to exchange of local(More)
In this contribution we derive an expression of the Cramér-Rao bound for hybrid cooperative positioning, where GNSS information is combined with terrestrial range measurements through exchange of peer-to-peer messages. These results provide a theoretical characterization of achievable performance of hybrid positioning schemes, as well as allow to identify(More)
The authors propose a simulation tool (ST) able to test real-time hybrid GNSS/terrestrial and cooperative positioning algorithms that fuse both pseudorange measurements from satellites and terrestrial range measurements based on radio frequency communication performed between nodes of a wireless network. In particular, the ST simulates devices belonging to(More)
DNA sequences can be analyzed by spectral techniques, looking for hidden periodicities. Anyway, mapping between nucleotide bases and numeric values has a strong impact on the DNA spectrum. The Minimum Entropy Mapping algorithm introduced the concept of adaptive mapping: the association between bases and numbers is not fixed, but is chosen to minimize a cost(More)
  • 1