English
Related papers

Related papers: Throughput Scaling of Wireless Networks With Rando…

200 papers

In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these…

Information Theory · Computer Science 2007-07-16 Antonio J. Caamaño , Juan J. Vinagre , Mark Wilby , Javier Ramos

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

This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…

Networking and Internet Architecture · Computer Science 2008-05-12 Lin Dai , Tony T. Lee

Throughput-Outage scaling laws for single-hop cache-aided device-to-device (D2D) communications have been extensively investigated under the assumption of the protocol model. However, the corresponding performance under physical models has…

Information Theory · Computer Science 2021-06-02 Ming-Chun Lee , Andreas F. Molisch , Mingyue Ji

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 this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

Consider $n$ source-destination pairs randomly located in a shared wireless medium, resulting in interference between different transmissions. All wireless links are modeled by independently and identically distributed (i.i.d.) random…

Information Theory · Computer Science 2013-06-25 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet , Cedric Adjih

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…

Performance · Computer Science 2013-07-30 Florin Ciucu , Jens Schmitt

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…

Information Theory · Computer Science 2007-07-13 Vivek P. Mhatre , Catherine P. Rosenberg

Inspired by the Statistical Physics of complex networks, wireless multihop ad hoc communication networks are considered in abstracted form. Since such engineered networks are able to modify their structure via topology control, we search…

Networking and Internet Architecture · Computer Science 2009-11-11 Wolfram Krause , Jan Scholz , Martin Greiner

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an…

Networking and Internet Architecture · Computer Science 2013-10-01 Manolis Ploumidis , Nikolaos Pappas , Vasilios A. Siris , Apostolos Traganitis

We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered…

Information Theory · Computer Science 2007-09-19 David Gesbert , Marios Kountouris

This work investigates the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. We allow the use of physical-layer network coding (PNC). Although the use of PNC for unicast has…

Information Theory · Computer Science 2013-08-06 Shen Feng , Soung C. Liew

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

The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…

Computational Geometry · Computer Science 2011-11-30 Majid Khabbazian , Stephane Durocher , Alireza Haghnegahdar

In this paper, we consider the effect of feedback channel error on the throughput of one-hop wireless networks under the random connection model. The transmission strategy is based on activating source-destination pairs with strongest…

Information Theory · Computer Science 2013-08-13 Seyed Pooya Shariatpanahi , Hamed Shah-Mansouri , Babak Hossein Khalaj

The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Stefano Ferretti , Vittorio Ghini

The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…

Networking and Internet Architecture · Computer Science 2017-04-11 Mehdi Salehi Heydar Abad , Ozgur Ercetin , Eylem Ekici