English
Related papers

Related papers: Throughput and Delay Scaling in Supportive Two-Tie…

200 papers

Consider a static wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access…

Information Theory · Computer Science 2008-12-31 Long Gao , Rui Zhang , Changchuan Yin , Shuguang Cui

We study the scaling laws for the throughputs and delays of two coexisting wireless networks that operate in the same geographic region. The primary network consists of Poisson distributed legacy users of density n, and the secondary…

Information Theory · Computer Science 2008-05-09 Changchuan Yin , Long Gao , Shuguang Cui

Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of $\Theta(1)$ is achievable. El Gamal,…

Information Theory · Computer Science 2007-07-16 James Mammen , Devavrat Shah

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

We study two distinct, but overlapping, networks that operate at the same time, space, and frequency. The first network consists of $n$ randomly distributed \emph{primary users}, which form either an ad hoc network, or an…

Information Theory · Computer Science 2016-11-17 Sang-Woon Jeon , Natasha Devroye , Mai Vu , Sae-Young Chung , Vahid Tarokh

In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…

Networking and Internet Architecture · Computer Science 2016-03-30 Zheng Chen , Nikolaos Pappas , Marios Kountouris , Vangelis Angelakis

We study, from a network layer perspective, the effect of an Ad-Hoc secondary network with N nodes randomly accessing the spectrum licensed to a primary node during the idle slots of the primary user. If the sensing is perfect, then the…

Information Theory · Computer Science 2012-05-09 Anthony Fanous , Anthony Ephremides

We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive…

Information Theory · Computer Science 2016-11-18 Mai Vu , Natasha Devroye , Masoud Sharif , Vahid Tarokh

Wireless mesh networks play a critical role in enabling key networking scenarios in beyond-5G (B5G) and 6G networks, including integrated access and backhaul (IAB), multi-hop sidelinks, and V2X. However, it still poses a challenge to…

Information Theory · Computer Science 2023-11-01 Lei Lei , Aimin Tang , Xudong Wang

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…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling…

Information Theory · Computer Science 2007-10-10 Awlok Josan , Mingyan Liu , David L. Neuhoff , S. Sandeep Pradhan

In the literature, scaling laws for wireless mobile networks have been characterized under various models of node mobility and several assumptions on how communication occurs between nodes. To improve the realism in the analysis of scaling…

Networking and Internet Architecture · Computer Science 2012-07-09 Yoora Kim , Kyunghan Lee , Ness B. Shroff , Injong Rhee , Song Chong

Cognitive radio methodologies have the potential to dramatically increase the throughput of wireless systems. Herein, control strategies which enable the superposition in time and frequency of primary and secondary user transmissions are…

Information Theory · Computer Science 2015-03-14 Marco Levorato , Urbashi Mitra , Michele Zorzi

In this paper, we analyze the coexistence of a primary and a secondary (cognitive) network when both networks use the IEEE 802.11 based distributed coordination function for medium access control. Specifically, we consider the problem of…

Networking and Internet Architecture · Computer Science 2013-09-11 Santhosh Kumar , Nirmal Shende , Chandra R. Murthy , Arun Ayyagari

In this paper we analyze a cognitive radio network with one primary and one secondary transmitter, in which the primary transmitter has bursty arrivals while the secondary node is assumed to be saturated (i.e. always has a packet waiting to…

Networking and Internet Architecture · Computer Science 2015-06-15 Nikolaos Pappas , Marios Kountouris

The use of $N$ cognitive relays to assist primary and secondary transmissions in a time-slotted cognitive setting with one primary user (PU) and one secondary user (SU) is investigated. An overlapped spectrum sensing strategy is proposed…

Information Theory · Computer Science 2014-05-21 Ahmed El Shafie , Tamer Khattab , Ahmed Sultan , H. Vincent Poor

With the analysis of the hierarchical scheme, the potential influence of the pre-constant in deriving scaling laws is exposed. It is found that a modified hierarchical scheme can achieve a throughput arbitrarily times higher than the…

Information Theory · Computer Science 2009-09-29 Liang-Liang Xie

Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay…

Networking and Internet Architecture · Computer Science 2015-05-01 Bita Azimdoost , Cedric Westphal , Hamid R. Sadjadpour

We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to…

Information Theory · Computer Science 2009-08-31 Zhenning Kong , Edmund M. Yeh , Emina Soljanin
‹ Prev 1 2 3 10 Next ›