Search arXivSearch

arXiv · 2407.02845

FedPot: A Quality-Aware Collaborative and Incentivized Honeypot-Based Detector for Smart Grid Networks

Abstract

Honeypot technologies provide an effective defense strategy for the Industrial Internet of Things (IIoT), particularly in enhancing the Advanced Metering Infrastructure's (AMI) security by bolstering the network intrusion detection system. For this security paradigm to be fully realized, it necessitates the active participation of small-scale power suppliers (SPSs) in implementing honeypots and engaging in collaborative data sharing with traditional power retailers (TPRs). To motivate this interaction, TPRs incentivize data sharing with tangible rewards. However, without access to an SPS's confidential data, it is daunting for TPRs to validate shared data, thereby risking SPSs' privacy and increasing sharing costs due to voluminous honeypot logs. These challenges can be resolved by utilizing Federated Learning (FL), a distributed machine learning (ML) technique that allows for model training without data relocation. However, the conventional FL algorithm lacks the requisite functionality for both the security defense model and the rewards system of the AMI network. This work presents two solutions: first, an enhanced and cost-efficient FedAvg algorithm incorporating a novel data quality measure, and second, FedPot, the development of an effective security model with a fair incentives mechanism under an FL architecture. Accordingly, SPSs are limited to sharing the ML model they learn after efficiently measuring their local data quality, whereas TPRs can verify the participants' uploaded models and fairly compensate each participant for their contributions through rewards. Simulation results, drawn from realistic mircorgrid network log datasets, demonstrate that the proposed solutions outperform state-of-the-art techniques by enhancing the security model and guaranteeing fair reward distributions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abdullatif Albaseer, Nima Abdi, Mohamed Abdallah, Marwa Qaraqe, Saif Alkuwari. 2024-07-03. FedPot: A Quality-Aware Collaborative and Incentivized Honeypot-Based Detector for Smart Grid Networks. https://arxiv.org/abs/2407.02845

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Protocol-Flexible Custom NFC for Wire-Free Wearable Sensor Networks

This study presents a custom near-field communication (NFC) system with software-defined protocol implementation for wearable sensors distributed across the body. Conventional wired implementations can degrade wearability because of mechanical constraints, whereas radio-based wireless approaches such as Bluetooth are affected by body-induced signal attenuation and limited communication coverage. The proposed system is compatible with previously demonstrated fabric-integrated meander coils, which provides a feasible path toward garment-scale NFC communication areas. The system combines a microcontroller unit with compact modulation and demodulation circuits, allowing medium access control and other communication protocols to be implemented in software. Experimental results demonstrate continuous acquisition of three-axis acceleration data from three sensor tags, achieving a per-tag polling rate of $222\,\mathrm{Hz}$ and an effective throughput of approximately $16\,\mathrm{kbps}$, delivering $156$ valid samples per second per tag at a measured packet error rate of $30\%$.

cs.NI

SemDHT: Certified Semantic Discovery for Peer-to-Peer Agent Networks over Exact-Key DHTs

Agents may need capabilities exposed through external agent endpoints or service APIs. When a requester is not already bound to a provider, it must discover advertised capabilities matching its task and interface requirements. Over exact-key distributed hash tables (DHTs), broad retrieval transfers large candidate lists, whereas selective retrieval may miss relevant providers or require more replication and lookups. Open publication also lets providers inflate their exposure unless publication bounds are enforceable. We present SemDHT, a certified semantic index for discovering agent-accessible capabilities over exact-key DHTs. A two-layer semantic sketch uses coarse cells to group nearby descriptors and residual codes to narrow candidate selection. Providers publish at a bounded set of derived keys, while requesters probe precision keys before broader recall keys within a lookup budget. Anchor committees certify each descriptor's publication-key set, enabling storage services and requesters to enforce descriptor-to-key consistency. On real API descriptors and task queries, SemDHT achieves recall@10 of 0.955 against exact embedding-space neighbors and 0.947 against ToolBench relevance labels. On a corpus with controlled density augmentation, it matches the candidate exposure of tuned locality-sensitive hashing (LSH) over a DHT at recall 0.95 with 7.7x fewer lookups and reduces publication fan-out from 16 to 10. A Go/libp2p prototype deployed on same-region and cross-region 200-peer cloud overlays replays 299 Internet queries. With parallel probes and cold certificate caches, SemDHT achieves mean completion-time speedups of 3.64x and 4.11x over LSH, respectively.

cs.NI

Toward an Unbiased Collective Memory for Efficient LLM-Based Agentic 6G Cross-Domain Management

Agentic artificial intelligence is a candidate enabler of Level-4 autonomy in sixth-generation (6G) networks, but agents reasoning over a shared memory inherit its distortions. We study cross-domain radio access network (RAN)--edge orchestration in which a RAN agent minimizing energy and an edge agent minimizing latency negotiate, validate proposals against a digital twin (DT), and share a collective memory. Such a memory is a sampling device: what agents retrieve, not what they store, determines what they do. We define the Retrieval Bias Index, a divergence between the induced retrieval law and a representative reference, decomposed along temporal, confirmation and availability axes, and show that additive retrieval scoring is an exponential tilt of the undebiased law, yielding a closed form for the failure-amplification weight and a saturation floor set by the store's own composition; a further result bounds excess service level agreement (SLA) violation additively in retrieval bias and DT mismatch. On a tandem queue for which stochastic network calculus supplies a feasible region, an oracle and a Nash bargaining reference, the operator attains a $12.7\times$ bias reduction over a recency store and the smallest distance to the bargaining solution among six memory architectures.

cs.NI