Breathfinding: A Wireless Network that Monitors and Locates Breathing in a Home

This paper explores using RSS measurements on many links in a wireless network to estimate the breathing rate of a person, and the location where the breathing is occurring, in a home, while the person is sitting, laying down, standing, or sleeping. The main challenge in breathing rate estimation is that "motion interference", i.e., movements other than a person's breathing, generally cause larger changes in RSS than inhalation and exhalation. We develop a method to estimate breathing rate despite motion interference, and demonstrate its performance during multiple short (3-7 minute) tests and during a longer 66 minute test. Further, for the same experiments, we show the location of the breathing person can be estimated, to within about 2 m average error in a 56 square meter apartment. Being able to locate a breathing person who is not otherwise moving, without calibration, is important for applications in search and rescue, health care, and security

A linear regression based cost function for WSN localization

Localization with Wireless Sensor Networks (WSN) creates new opportunities for location-based consumer communication applications. There is a great need for cost functions of maximum likelihood localization algorithms that are not only accurate but also lack local minima. In this paper we present Linear Regression based Cost Function for Localization (LiReCoFuL), a new cost function based on regression tools that fulfills these requirements. With empirical test results on a real-life test bed, we show that our cost function outperforms the accuracy of a minimum mean square error cost function. Furthermore we show that LiReCoFuL is as accurate as relative location estimation error cost functions and has very few local extremes

On a test-bed application for the ART-WiSe framework

This report describes the development of a Test-bed Application for the ART-WiSe Framework with the aim of providing a means of access, validate and demonstrate that architecture. The chosen application is a kind of pursuit-evasion game where a remote controlled robot, navigating through an area covered by wireless sensor network (WSN), is detected and continuously tracked by the WSN. Then a centralized control station takes the appropriate actions for a pursuit robot to chase and “capture” the intruder one. This kind of application imposes stringent timing requirements to the underlying communication infrastructure. It also involves interesting research problems in WSNs like tracking, localization, cooperation between nodes, energy concerns and mobility. Additionally, it can be easily ported into a real-world application. Surveillance or search and rescue operations are two examples where this kind of functionality can be applied. This is still a first approach on the test-bed application and this development effort will be continuously pushed forward until all the envisaged objectives for the Art-WiSe architecture become accomplished

D-SLATS: Distributed Simultaneous Localization and Time Synchronization

Through the last decade, we have witnessed a surge of Internet of Things (IoT) devices, and with that a greater need to choreograph their actions across both time and space. Although these two problems, namely time synchronization and localization, share many aspects in common, they are traditionally treated separately or combined on centralized approaches that results in an ineffcient use of resources, or in solutions that are not scalable in terms of the number of IoT devices. Therefore, we propose D-SLATS, a framework comprised of three different and independent algorithms to jointly solve time synchronization and localization problems in a distributed fashion. The First two algorithms are based mainly on the distributed Extended Kalman Filter (EKF) whereas the third one uses optimization techniques. No fusion center is required, and the devices only communicate with their neighbors. The proposed methods are evaluated on custom Ultra-Wideband communication Testbed and a quadrotor, representing a network of both static and mobile nodes. Our algorithms achieve up to three microseconds time synchronization accuracy and 30 cm localization error