TY - GEN
T1 - D-SLATS
T2 - 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017
AU - Alanwar, Amr
AU - Ferraz, Henrique
AU - Hsieh, Kevin
AU - Thazhath, Rohit
AU - Martin, Paul
AU - Hespanha, Joao
AU - Srivastava, Mani
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/7/10
Y1 - 2017/7/10
N2 - 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 inefficient 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.
AB - 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 inefficient 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.
KW - Collaborative localization
KW - Time synchronization
UR - http://www.scopus.com/inward/record.url?scp=85027440899&partnerID=8YFLogxK
U2 - 10.1145/3084041.3084049
DO - 10.1145/3084041.3084049
M3 - Conference contribution
AN - SCOPUS:85027440899
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
BT - MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PB - Association for Computing Machinery
Y2 - 10 July 2017
ER -