English
Related papers

Related papers: On Capacity and Delay of Wireless Networks with No…

200 papers

We study broadcast capacity and minimum delay scaling laws for highly mobile wireless networks, in which each node has to disseminate or broadcast packets to all other nodes in the network. In particular, we consider a cell partitioned…

Information Theory · Computer Science 2018-08-14 Rajat Talak , Sertac Karaman , Eytan Modiano

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

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

We investigate optimal resource allocation for delay-limited cooperative communication in time varying wireless networks. Motivated by real-time applications that have stringent delay constraints, we develop a dynamic cooperation strategy…

Information Theory · Computer Science 2009-10-08 Rahul Urgaonkar , Michael J. Neely

We consider the delay properties of max-weight opportunistic scheduling in a multi-user ON/OFF wireless system, such as a multi-user downlink or uplink. It is well known that max-weight scheduling stabilizes the network (and hence yields…

Optimization and Control · Mathematics 2009-01-02 Michael J. Neely

Cellular communication networks are plagued with redundant capacity, which results in low utilization and cost-effectiveness of network capital investments. The redundant capacity can be exploited to deliver secondary traffic that is…

Networking and Internet Architecture · Computer Science 2016-12-30 Lingyu Chen , Chen Liu , Xuemin Hong , Cheng-Xiang Wang , John Thompson , Jianghong Shi

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

We study how large functional networks can grow stably under possible cascading overload failures and evaluated the maximum stable network size above which even a small-scale failure would cause a fatal breakdown of the network. Employing a…

Physics and Society · Physics 2017-11-01 Shogo Mizutaka , Kousuke Yakubo

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

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…

Information Theory · Computer Science 2010-05-10 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

In this paper, we introduce novel coding schemes for wireless networks with random transmission delays. These coding schemes obviate the need for synchronicity, reduce the number of transmissions and achieve the optimal rate region in the…

Information Theory · Computer Science 2015-03-04 Niv Voskoboynik , Haim H. Permuter , Asaf Cohen

It has been found that the networks with scale-free distribution are very resilient to random failures. The purpose of this work is to determine the network design guideline which maximize the network robustness to random failures with the…

Statistical Mechanics · Physics 2009-11-11 Jian-Guo Liu , Zhong-Tuo Wang , Yan-Zhong Dang

Overheads incurred by routing protocols diminish the capacity available for relaying useful data in a mobile wireless ad hoc network. Discovering lower bounds on the amount of protocol overhead incurred for routing data packets is important…

Information Theory · Computer Science 2007-07-13 Nabhendra Bisnik , Alhussein A. Abouzeid

Maximizing robustness and minimizing cost are common objectives in the design of infrastructure networks. However, most infrastructure networks evolve and operate in a highly decentralized fashion, which may significantly impact the…

Physics and Society · Physics 2008-05-29 Dong-Hee Kim , Adilson E. Motter

The time-varying feature of wireless channels usually makes the hard delay bound for data transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a small violation probability has been widely used for delay…

Information Theory · Computer Science 2011-05-03 Qinghe Du , Yi Huang , Pinyi Ren , Chao Zhang

The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit…

Information Theory · Computer Science 2010-10-11 Radha Krishna Ganti , Martin Haenggi

The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to…

Information Theory · Computer Science 2013-04-23 Sina Lashgari , A. Salman Avestimehr

Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network $n$. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take…

Networking and Internet Architecture · Computer Science 2022-02-22 Eugene Perevalov , Rick S. Blum , Xun Chen , Anthony Nigara

This paper studies the effect of bandwidth partitioning (BWP) on the reliability and delay performance in infrastructureless wireless networks. The reliability performance is characterized by the density of concurrent transmissions that…

Information Theory · Computer Science 2019-09-04 Sanket Sanjay Kalamkar