English
Related papers

Related papers: Mobility-Assisted Covert Communication over Wirele…

200 papers

We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit…

Information Theory · Computer Science 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

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

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They…

Information Theory · Computer Science 2016-11-17 Urs Niesen , Piyush Gupta , Devavrat Shah

Throughput scaling laws of an ad hoc network equipping directional antennas at each node are analyzed. More specifically, this paper considers a general framework in which the beam width of each node can scale at an arbitrary rate relative…

Information Theory · Computer Science 2015-05-19 Jangho Yoon , Won-Yong Shin , Sang-Woon Jeon

In IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention…

Networking and Internet Architecture · Computer Science 2010-07-05 Pooja Saini

In this paper, we analyze asymptotic delay-throughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing…

Performance · Computer Science 2008-07-09 Michele Garetto , Emilio Leonardi

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

We propose a physical layer (PHY) caching scheme for wireless adhoc networks. The PHY caching exploits cache-assisted multihop gain and cache-induced dual-layer CoMP gain, which substantially improves the throughput of wireless adhoc…

Information Theory · Computer Science 2015-10-20 An Liu , Vincent Lau

Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active…

Networking and Internet Architecture · Computer Science 2010-07-15 S. Sumathy , B. Upendra Kumar

This paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $\rho(n)$ of achievable network sum capacity to the sum of the point-to-point…

Information Theory · Computer Science 2007-07-13 Shuchin Aeron , Venkatesh Saligrama

As a representative of a complex technological system, so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a…

Disordered Systems and Neural Networks · Physics 2007-05-23 Wolfram Krause , Ingmar Glauche , Rudolf Sollacher , Martin Greiner

In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert…

Networking and Internet Architecture · Computer Science 2018-03-13 Azadeh Sheikholeslami , Majid Ghaderi , Don Towsley , Boulat A. Bash , Saikat Guha , Dennis Goeckel

The problem of communication among nodes in an \emph{extended network} is considered, where radio power decay and interference are limiting factors. It has been shown previously that, with simple multi-hopping, the achievable total…

Networking and Internet Architecture · Computer Science 2008-05-26 Sam Vakil , Ben Liang

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r^{-alpha}, as well as a random phase. We…

Information Theory · Computer Science 2007-07-13 Ayfer Ozgur , Olivier Leveque , David Tse

In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two mobility time-scales: (i) Fast mobility where node mobility is at the same time-scale as…

Networking and Internet Architecture · Computer Science 2007-07-13 Lei Ying , Sichao Yang , R. Srikant

In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert…

Information Theory · Computer Science 2021-05-13 Tong-Xing Zheng , Ziteng Yang , Chao Wang , Zan Li , Jinhong Yuan , Xiaohong Guan

This paper studies multi-antenna-aided covert communications coexisting with randomly located wardens and interferers, considering both centralized and distributed antenna systems (CAS/DAS). The throughput performance of the covert…

Information Theory · Computer Science 2019-02-20 Tong-Xing Zheng , Hui-Ming Wang , Derrick Wing Kwan Ng , Jinhong Yuan

Multihop ad hoc wireless networks consist of mobile nodes that communicate with each other without any fixed infrastructure. The nodes in these networks are power constrained, since they operate in limited battery energy. Cooperative…

Networking and Internet Architecture · Computer Science 2014-06-23 Preetha Theresa Joy , K. Poulose Jacob

In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power…

Physics and Society · Physics 2016-06-08 Eun Lee , Petter Holme

Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission…

Information Theory · Computer Science 2007-07-13 Rohit Negi , Arjunan Rajeswaran
‹ Prev 1 2 3 10 Next ›