English
Related papers

Related papers: On Intercept Probability Minimization under Sparse…

200 papers

We consider a scenario of broadcasting information over a network of nodes connected by noiseless communication links. A source node in the network has some data packets to broadcast. It encodes these data packets into $n$ coded packets in…

Information Theory · Computer Science 2020-02-12 B. R. Vinay Kumar , Navin Kashyap

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive…

Systems and Control · Computer Science 2015-06-16 Masaaki Nagahara , Takahiro Matsuda , Kazunori Hayashi

The additional degree of freedom (DoF) in the distance domain of near-field communication offers new opportunities for physical layer security (PLS) design. However, existing works mainly consider static eavesdroppers, and the related study…

Signal Processing · Electrical Eng. & Systems 2024-08-27 Yiming Xu , Mingxuan Zheng , Dongfang Xu , Shenghui Song , Daniel Benevides da Costa

This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal $x \in \mathbb{R}^p$ from noisy quadratic measurements $y_j = (a_j' x )^2 + \epsilon_j$, $j=1, \ldots, m$, with independent sub-exponential noise…

Statistics Theory · Mathematics 2015-06-11 T. Tony Cai , Xiaodong Li , Zongming Ma

We present a novel feedback protocol for wireless broadcast networks that utilize linear network coding. We consider transmission of packets from one source to many receivers over a single-hop broadcast erasure channel. Our method utilizes…

Networking and Internet Architecture · Computer Science 2015-03-19 Arman Rezaee , Linda Zeger , Muriel Médard

We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in contrast to traditional ones where the adversary controls a…

Information Theory · Computer Science 2013-03-04 Pak Hou Che , Minghua Chen , Tracey Ho , Sidharth Jaggi , Michael Langberg

Inspired by compressive sensing principles, we propose novel error control coding techniques for communication systems. The information bits are encoded in the support and the non-zero entries of a sparse signal. By selecting a dictionary…

Information Theory · Computer Science 2021-02-09 Madhusudan Kumar Sinha , Arun Pachai Kannu

In this paper, a comprehensive study of packet-based instantly decodable network coding (IDNC) for single-hop wireless broadcast is presented. The optimal IDNC solution in terms of throughput is proposed and its packet decoding delay…

Information Theory · Computer Science 2013-09-04 Mingchao Yu , Parastoo Sadeghi , Neda Aboutorab

Designing efficient sparse recovery algorithms that could handle noisy quantized measurements is important in a variety of applications -- from radar to source localization, spectrum sensing and wireless networking. We take advantage of the…

Signal Processing · Electrical Eng. & Systems 2022-05-24 Shuai Huang , Deqiang Qiu , Trac D. Tran

Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy…

Information Theory · Computer Science 2017-08-25 Zhichao Sheng , Hoang Duong Tuan , Ali Arshad Nasir , Trung Q. Duong , H. Vincent Poor

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

This paper addresses the performance of space-time coding over fading channels with impulsive noise which is known to accurately capture network interference. We use the symmetric alpha stable noise distribution and adopt two models which…

Information Theory · Computer Science 2011-02-17 Junghoon Lee , Cihan Tepedelenlioglu

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

In this paper, we propose an opportunistic network coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to…

Information Theory · Computer Science 2016-11-17 Yulong Zou , Jia Zhu , Baoyu Zheng

We design polynomial time schemes for secure message transmission over arbitrary networks, in the presence of an eavesdropper, and where each edge corresponds to an erasure channel with public feedback. Our schemes are described through…

Information Theory · Computer Science 2015-04-27 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

This paper studies remote state estimation in the presence of an eavesdropper. A sensor transmits local state estimates over a packet dropping link to a remote estimator, while an eavesdropper can successfully overhear each sensor…

Systems and Control · Computer Science 2017-02-10 Alex S. Leong , Daniel E. Quevedo , Daniel Dolz , Subhrakanti Dey

This work proposes a novel approach to reinforce localization security in wireless networks in the presence of malicious nodes that are able to manipulate (spoof) radio measurements. It substitutes the original measurement model by another…

Signal Processing · Electrical Eng. & Systems 2025-04-01 Slavisa Tomic , Marko Beko , Yakubu Tsado , Bamidele Adebisi , Abiola Oladipo

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…

Information Theory · Computer Science 2013-02-06 Galen Reeves , Michael Gastpar

This work focuses on distributed linear precoding when users transmit correlated information over a fading Multiple-Input and Multiple-Output Multiple Access Channel. Precoders are optimized in order to minimize the sum-Mean Square Error…

Information Theory · Computer Science 2024-01-31 P. Suárez-Casal , J. P. González-Coma , O. Fresnedo , L. Castedo

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo