惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

雷峰网
雷峰网
G
Google Developers Blog
Blog — PlanetScale
Blog — PlanetScale
P
Proofpoint News Feed
博客园 - Franky
L
LangChain Blog
GbyAI
GbyAI
A
About on SuperTechFans
MongoDB | Blog
MongoDB | Blog
F
Fortinet All Blogs
Y
Y Combinator Blog
Stack Overflow Blog
Stack Overflow Blog
博客园 - 叶小钗
N
Netflix TechBlog - Medium
D
DataBreaches.Net
Martin Fowler
Martin Fowler
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Hugging Face - Blog
Hugging Face - Blog
博客园_首页
爱范儿
爱范儿
罗磊的独立博客
H
Help Net Security
云风的 BLOG
云风的 BLOG
C
Check Point Blog

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Maximizing Secrecy Rate of an OFDM-based Multi-hop Underw...
Waqas Aman, M. Mahboob Ur Rahman, Zeeshan Haider, Junaid Qadir, · 2018-07-04 · via cs.IT updates on arXiv.org

In this paper, we consider an eavesdropping attack on a multi-hop, UnderWater Acoustic Sensor Network (UWASN) that consists of $M+1$ underwater sensors which report their sensed data via Orthogonal Frequency Division Multiplexing (OFDM) scheme to a sink node on the water surface. Furthermore, due to the presence of a passive malicious node in nearby vicinity, the multi-hop UnderWater Acoustic (UWA) channel between a sensor node and the sink node is prone to eavesdropping attack on each hop. Therefore, the problem at hand is to do (helper/relay) node selection (for data forwarding onto the next hop) as well as power allocation (across the OFDM sub-carriers) in a way that the secrecy rate is maximized at each hop. To this end, this problem of Node Selection and Power Allocation (NSPA) is formulated as a mixed binary-integer optimization program, which is then optimally solved via decomposition approach, and by exploiting duality theory along with the Karush-Kuhn-Tucker conditions. We also provide a computationally-efficient, sub-optimal solution to the NSPA problem, where we reformulate it as a mixed-integer linear program and solve it via decomposition and geometric approach. Moreover, when the UWA channel is multipath (and not just line-of-sight), we investigate an additional, machine learning-based approach to solve the NSPA problem. Finally, we compute the computational complexity of all the three proposed schemes (optimal, sub-optimal, and learning-based), and do extensive simulations to compare their performance against each other and against the baseline schemes (which allocate equal power to all the sub-carriers and do depth-based node selection). In a nutshell, this work proposes various (optimal and sub-optimal) methods for providing information-theoretic security at the physical layer of the protocol stack through resource allocation.