DeepAI AI Chat
Log In Sign Up

Robust decentralised proof-of-position algorithms for smart city applications

by   Aida Manzano Kharman, et al.
Imperial College London

We present a decentralised class of algorithms called Tree-Proof-of-Position (T-PoP). T-PoP algorithms rely on the web of interconnected devices in a smart city to establish how likely it is that an agent is in the position they claim to be. T-PoP operates under adversarial assumptions, by which some agents are incentivised to be dishonest. We present a theoretical formulation for T-PoP and its security properties, and we validate this model through a large number of Monte-Carlo simulations. We specifically focus on two instances of T-PoP and analyse their security and reliability properties under a range of adversarial conditions. Use-cases and applications are discussed towards the end of this paper.


Blockchain for the Cybersecurity of Smart City Applications

Cybersecurity is an inherent characteristic that should be addressed bef...

Knowledge co-creation in the OrganiCity: Data annotation with JAMAiCA

Numerous smart city testbeds and system deployments have surfaced around...

Secure solutions for Smart City Command Control Centre using AIOT

To build a robust secure solution for smart city IOT network from any Cy...

Enabling and Enforcing Social Distancing Measures using Smart City and ITS Infrastructures: A COVID-19 Use Case

Internet of Things is a revolutionary domain that has the caliber to imp...

Volunteers in the Smart City: Comparison of Contribution Strategies on Human-Centered Measures

Several smart city services rely on users contribution, e.g., data, whic...

Peng Cheng Object Detection Benchmark for Smart City

Object detection is an algorithm that recognizes and locates the objects...

Towards Smart City Security: Violence and Weaponized Violence Detection using DCNN

In this ever connected society, CCTVs have had a pivotal role in enforci...