English
Related papers

Related papers: Random Access Transport Capacity

200 papers

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

This paper studies the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna base stations (BSs), where the number of antennas per BS is allowed to scale as a function of the network size. The…

Information Theory · Computer Science 2014-06-12 Harpreet S. Dhillon , Giuseppe Caire

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…

Networking and Internet Architecture · Computer Science 2016-11-15 Manolis Ploumidis , Nikolaos Pappas , Apostolos Traganitis

A multi-hop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multi-antenna relays until it reaches a multi-antenna destination. Assuming correlated fading at each hop, each relay receives a…

Information Theory · Computer Science 2016-11-18 Nadia Fawaz , Keyvan Zarifi , Merouane Debbah , David Gesbert

Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of…

Networking and Internet Architecture · Computer Science 2012-12-11 Kishore Angrishi

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…

Networking and Internet Architecture · Computer Science 2013-10-24 Stavros Toumpis

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

Statistical Mechanics · Physics 2007-05-23 Ingmar Glauche , Wolfram Krause , Rudolf Sollacher , Martin Greiner

We characterize trade-offs between the end-to-end communication delay and the energy in urban vehicular communications with infrastructure assistance. Our study exploits the self-similarity of the location of communication entities in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-03 Dalia Popescu , Philippe Jacquet , Bernard Mans , Bartomiej Blaszczyszyn

The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available…

Information Theory · Computer Science 2009-03-09 Philippe Jacquet , Bernard Mans , Georgios Rodolakis

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

Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power…

Signal Processing · Electrical Eng. & Systems 2019-02-08 Bhathiya Pilanawithana , Saman Atapattu , Jamie Evans

We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source- destination pairs increases up to the operating maximum. Our opportunistic…

Information Theory · Computer Science 2016-11-18 Won-Yong Shin , Sae-Young Chung , Yong H. Lee

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Most prior work on finding the transmission capacity…

Information Theory · Computer Science 2010-09-09 Rahul Vaze , Kien T. Truong , Steven Weber , Robert W. Heath

Real-time applications are performance critical applications that require bounded service latency. In multi-hop wireless ad-hoc and sensor networks, communication delays are dominant over processing delays. Therefore, to enable real-time…

Networking and Internet Architecture · Computer Science 2012-01-25 Deepali Virmani , Satbir Jain

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

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

We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…

Networking and Internet Architecture · Computer Science 2018-11-27 Ashok Krishnan K. S. , Vinod Sharma

Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more…

Networking and Internet Architecture · Computer Science 2010-09-24 Tapas Kumar Patra , Joy Kuri

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

In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission…

Networking and Internet Architecture · Computer Science 2017-06-20 Kamal Rahimi Malekshan , Weihua Zhuang