中文
相关论文

相关论文: Asymptotic Scaling Laws of Wireless Adhoc Network …

200 篇论文

Recently, physical layer (PHY) caching has been proposed to exploit the dynamic side information induced by caches at base stations (BSs) to support Coordinated Multi-Point (CoMP) and achieve huge degrees of freedom (DoF) gains. Due to the…

信息论 · 计算机科学 2018-10-18 An Liu , Vincent Lau , Wenchao Ding , Edmund Yeh

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…

信息论 · 计算机科学 2016-12-23 An Liu , Vincent Lau , Giuseppe Caire

We study the effect of node mobility on the throughput scaling of the covert communication over a wireless adhoc network. It is assumed that $n$ mobile nodes want to communicate each other in a unit disk while keeping the presence of the…

信息论 · 计算机科学 2020-04-22 Hyeon-Seong Im , Si-Hyeon Lee

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…

信息论 · 计算机科学 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

Dense wireless networks are a promising solution to meet the huge capacity demand in 5G wireless systems. However, there are two implementation issues, namely the interference and backhaul issues. To resolve these issues, we propose a novel…

信息论 · 计算机科学 2016-11-15 An Liu , Vincent Lau

We investigate the potentials of applying the coded caching paradigm in wireless networks. In order to do this, we investigate physical layer schemes for downlink transmission from a multiantenna transmitter to several cache-enabled users.…

信息论 · 计算机科学 2018-01-30 Seyed Pooya Shariatpanahi , Giuseppe Caire , Babak Hossein Khalaj

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…

信息论 · 计算机科学 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

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…

网络与互联网体系结构 · 计算机科学 2014-06-23 Preetha Theresa Joy , K. Poulose Jacob

Caching popular contents at the edge of the network can positively impact the performance and future sustainability of wireless networks in several ways, e.g., end-to-end access delay reduction and peak rate increase. In this paper, we aim…

信息论 · 计算机科学 2017-03-21 Marco Maso , Italo Atzeni , Imène Ghamnia , Ejder Baştuğ , Mérouane Debbah

We consider the effect of caching in wireless networks where fading is the dominant channel effect. First, we propose a one-hop transmission strategy for cache-enabled wireless networks, which is based on exploiting multi-user diversity…

信息论 · 计算机科学 2013-09-03 Seyed Pooya Shariatpanahi , Hamed Shah-Mansouri , Babak Hossein Khalaj

We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to…

网络与互联网体系结构 · 计算机科学 2017-04-25 Milad Mahdian , Edmund Yeh

Cooperative relaying has been proposed as a promising transmission technique that effectively creates spatial diversity through the cooperation among spatially distributed nodes. However, to achieve efficient communications while gaining…

网络与互联网体系结构 · 计算机科学 2012-05-21 Teck Aguilar , Syue-Ju Syue , Vincent Gauthier , Hossam Afifi , Chin-Liang Wang

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…

信息论 · 计算机科学 2007-07-13 Shuchin Aeron , Venkatesh Saligrama

In this paper, we investigate for the first time the benefits of wireless caching for the physical layer security (PLS) of wireless networks. In particular, a caching scheme enabling power-efficient PLS is proposed for cellular video…

信息论 · 计算机科学 2016-12-06 Lin Xiang , Derrick Wing Kwan Ng , Robert Schober , Vincent W. S. Wong

Recent work has shown the feasibility of single-channel full-duplex wireless physical layer, allowing nodes to send and receive in the same frequency band at the same time. In this report, we first design and implement a real-time…

网络与互联网体系结构 · 计算机科学 2011-07-05 Achaleshwar Sahai , Gaurav Patel , Ashutosh Sabharwal

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…

信息论 · 计算机科学 2015-05-19 Jangho Yoon , Won-Yong Shin , Sang-Woon Jeon

The ability of physical layer relay caching to increase the degrees of freedom (DoF) of a single cell was recently illustrated. In this paper, we extend this result to the case of multiple cells in which a caching relay is shared among…

信息论 · 计算机科学 2017-02-21 Osama A. Hanna , Amr El-Keyi , Mohammed Nafie

In wireless ad-hoc networks, forwarding data through intermediate relays extends the coverage area and enhances the network throughput. We consider a general wireless multiuser multihop transmission, where each data flow is subject to a…

网络与互联网体系结构 · 计算机科学 2014-07-23 K. Rahimi Malekshan , F. Lahouti

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

信息论 · 计算机科学 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

We consider a wireless device-to-device (D2D) network where $n$ nodes are uniformly distributed at random over the network area. We let each node with storage capacity $M$ cache files from a library of size $m \geq M$. Each node in the…

信息论 · 计算机科学 2016-11-17 Sang-Woon Jeon , Song-Nam Hong , Mingyue Ji , Giuseppe Caire , Andreas F. Molisch
‹ 上一页 1 2 3 10 下一页 ›