Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ezhil Bharathi

dblp:246/7669 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Network security · 50% Authentication and access control · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control › physical layer authentication
channel-based authentication
0.412019
Switching Topology for Resilient Consensus using Wi-Fi Signals · ICRA 2019
Network security › wireless network security
physical layer security
0.412019
Switching Topology for Resilient Consensus using Wi-Fi Signals · ICRA 2019
Distributed systems
consensus
0.412019
Switching Topology for Resilient Consensus using Wi-Fi Signals · ICRA 2019
Distributed systems › consensus › fault-tolerant consensus
resilient consensus
0.412019
Switching Topology for Resilient Consensus using Wi-Fi Signals · ICRA 2019
Distributed systems › distributed system security
sybil attacks
0.412019
Switching Topology for Resilient Consensus using Wi-Fi Signals · ICRA 2019

Methods — techniques the papers use, named apart from their topics

wireless channel information · 0.8switching topology · 0.8
YearPublicationVenuePosition
2019 Switching Topology for Resilient Consensus using Wi-Fi Signals
abstract
Securing multi-robot teams against malicious activity is crucial as these systems accelerate towards widespread societal integration. This emerging class of “physical networks” requires research into new methods of security that exploit their physical nature. This paper derives a theoretical framework for securing multi-agent consensus against the Sybil attack by using the physical properties of wireless transmissions. Our frame-work uses information extracted from the wireless channels to design a switching signal that stochastically excludes potentially untrustworthy transmissions from the consensus. Intuitively, this amounts to selectively ignoring incoming communications from untrustworthy agents, allowing for consensus to the true average to be recovered with high probability if initiated after a certain observation time T0that we derive. This work is different from previous work in that it allows for arbitrary malicious node values and is insensitive to the initial topology of the network so long as a connected topology over legitimate nodes in the network is feasible. We show that our algorithm will recover consensus and the true graph over the system of legitimate agents with an error rate that vanishes exponentially with time.
Thomas Wheeler, Ezhil Bharathi, Stephanie Gil
ICRA2