English
Related papers

Related papers: Mobility-Assisted Covert Communication over Wirele…

200 papers

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We…

Information Theory · Computer Science 2012-09-28 Urs Niesen , Devavrat Shah , Gregory Wornell

Ad Hoc networks with multi-hop topology are widely used in military and civilian applications. One challenge for Ad Hoc networks is to design efficient Media Access Control (MAC) protocols to ensure the quality of service (QoS). In Ad Hoc…

Networking and Internet Architecture · Computer Science 2023-05-01 Ze Liu , Bo Li , Mao Yang , ZhongJiang Yan

Mobile Ad Hoc Network (MANET) is a collection of nodes that can be rapidly deployed as a multi-hop network without the aid of any centralized administration. Misbehavior is challenged by bandwidth and energy efficient medium access control…

Networking and Internet Architecture · Computer Science 2010-11-03 R. Kalaiarasi , Getsy S. Sara , S. Neelavathy Pari , D. Sridharan

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

We consider a wireless device-to-device (D2D) caching network where n nodes are placed on a regular grid of area A(n). Each node caches L_C*F (coded) bits from a library of size L*F bits, where L is the number of files and F is the size of…

Information Theory · Computer Science 2016-12-23 An Liu , Vincent Lau , Giuseppe Caire

In this paper, we investigate the fundamental tradeoff between communication and sensing performance of \emph{ad hoc} integrated sensing and communication (ISAC) wireless networks. Specifically, we consider that $n$ nodes are randomly…

Information Theory · Computer Science 2025-02-17 Min Qiu , Ming-Chun Lee , Yu-Chih Huang , Jinhong Yuan

A device-to-device (D2D) wireless network is considered, where user devices also have the ability to cache content. In such networks, users are mobile and communication links can be spontaneously activated and dropped depending on the…

Networking and Internet Architecture · Computer Science 2016-11-09 Chedia Jarray , Anastasios Giovanidis

A MIMO secure two-hop wireless communication system is considered in this paper. In this model, there are no direct links between the source-destination and the source-eavesdropper. The problem is maximizing the secrecy capacity of the…

Information Theory · Computer Science 2011-10-18 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

Mobile Ad Hoc networks, due to the unattended nature of the network itself and the dispersed location of nodes, are subject to several unique security issues. One of the most vexed security threat is node capture. A few solutions have…

Cryptography and Security · Computer Science 2016-09-08 Mauro Conti , Roberto Di Pietro , Andrea Gabrielli , Luigi V. Mancini , Alessandro Mei

Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…

Information Theory · Computer Science 2016-11-15 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor

Mobile ad hoc networks (MANETs) are self-configuring wireless networks that lack permanent infrastructure and are formed among mobile nodes on demand. Rapid node mobility results in dramatic channel variation, or fading, that degrades MANET…

Networking and Internet Architecture · Computer Science 2012-04-27 Neil Mehta , Alexandra Duel-Hallen , Wenye Wang

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme…

Information Theory · Computer Science 2016-11-17 Ayfer Ozgur , Olivier Leveque

We consider a covert communication scenario where a transmitter wishes to communicate simultaneously to two legitimate receivers while ensuring that the communication is not detected by an adversary, the warden. The legitimate receivers and…

Information Theory · Computer Science 2018-10-11 Vincent Y. F. Tan , Si-Hyeon Lee

Adapting applications' data rates in multi-hop wireless ad-hoc networks is inherently challenging. Packet collision, channel contention, and queue buildup contribute to packet loss but are difficult to manage in conventional TCP/IP…

Networking and Internet Architecture · Computer Science 2021-07-15 Md Ashiqur Rahman , Beichuan Zhang

A sequence number checking technique is proposed to improve the performance of TCP connections in mobile ad hoc networks. While a TCP connection is initialized, a routing protocol takes the responsibility for checking the hop count between…

Networking and Internet Architecture · Computer Science 2015-10-20 May Zin Oo , Mazliza Othman , Timothy O Farrell

In this paper, we investigate joint information theoretic secrecy and covert communication in a single-input multi-output (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that…

Signal Processing · Electrical Eng. & Systems 2020-07-13 Moslem Forouzesh , Paeiz Azmi , Ali Kuhestani , Phee Lep Yeoh

In wireless ad hoc networks, the absence of any control on packets forwarding, make these networks vulnerable by various deny of service attacks (DoS). A node, in wireless ad hoc network, counts always on intermediate nodes to send these…

Cryptography and Security · Computer Science 2010-02-09 Abderrahmane Baadache , Ali Belmehdi

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…

Cryptography and Security · Computer Science 2020-01-22 Ke Li , Don Towsley , Dennis Goeckel

We consider a two-hop cellular system in which the mobile nodes help the base station by relaying information to the dead spots. While two-hop cellular schemes have been analyzed previously, the distribution of the node locations has not…

Information Theory · Computer Science 2009-11-19 Radha Krishna Ganti , Martin Haenggi