Year

2022

Season

Fall

Paper Type

Master's Thesis

College

College of Computing, Engineering & Construction

Degree Name

Master of Science in Computer and Information Sciences (MS)

Department

Computing

NACO controlled Corporate Body

University of North Florida. School of Computing

First Advisor

Dr. Ayan Dutta

Second Advisor

Dr. Swapnoneel Roy

Third Advisor

Dr. O. Patrick Kreidl

Department Chair

Dr. Sherif Elfayoumy

College Dean

Dr. William Klostermeyer

Abstract

Multi-robot teams are an increasingly popular approach for information gathering in large geographic areas, with applications in precision agriculture, natural disaster aftermath surveying, and pollution tracking. In a coordinated multi-robot information sampling scenario, robots share their collected information amongst one another to form better predictions. These robot teams are often assembled from untrusted devices, making the verification of the integrity of the collected samples an important challenge. Furthermore, such robots often operate under conditions of continuous, periodic, or opportunistic connectivity and are limited in their energy budget and computational power. In this thesis, we study how to secure the information being shared in a multi-robot network against integrity attacks and the cost of integrating such techniques. We propose a blockchain-based information sharing protocol that allows robots to reject fake data injection by a malicious entity. However, optimal information sampling is a resource-intensive technique, as are the popular blockchain-based consensus protocols. Therefore, we also study its impact on the execution time of the sampling algorithm, which affects the energy spent. We propose algorithms that build on blockchain technology to address the data integrity problem, but also take into account the limitations of the robots’ resources and communication. We evaluate the proposed algorithms along the perspective of the trade-offs between data integrity, model accuracy, and time consumption under continuous, periodic, and opportunistic connectivity.

Share

COinS