English
Related papers

Related papers: Elastic Routing in Wireless Ad Hoc Networks With D…

200 papers

In this paper, we propose a selection region based multihop routing protocol with directional antennas for wireless mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and the beamwidth of…

Information Theory · Computer Science 2016-11-17 Di Li , Changchuan Yin , Changhai Chen

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 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

Capacity scaling of a large hybrid network with unit node density, consisting of $n$ wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links…

Information Theory · Computer Science 2014-07-29 Cheol Jeong , Won-Yong Shin

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…

Information Theory · Computer Science 2007-07-13 Shuchin Aeron , Venkatesh Saligrama

This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of $n$ randomly located wireless nodes. The infrastructure uses multi-antenna base stations (BSs), in which the number of…

Information Theory · Computer Science 2016-11-18 Won-Yong Shin , Sang-Woon Jeon , Natasha Devroye , Mai H. Vu , Sae-Young Chung , Yong H. Lee , Vahid Tarokh

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…

Networking and Internet Architecture · Computer Science 2014-07-23 K. Rahimi Malekshan , F. Lahouti

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…

Information Theory · Computer Science 2020-04-22 Hyeon-Seong Im , Si-Hyeon Lee

We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…

Information Theory · Computer Science 2010-07-20 Di Li , Changchuan Yin , Changhai Chen , Shuguang Cui

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

We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availability of the communication channel (i.e., the occurrence of a…

Networking and Internet Architecture · Computer Science 2009-12-22 Wei Ren , Qing Zhao , Ananthram Swami

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

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…

Information Theory · Computer Science 2019-07-01 Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan

In this paper, we examine the benefits of multiple antenna communication in random wireless networks, the topology of which is modeled by stochastic geometry. The setting is that of the Poisson bipolar model introduced in [1], which is a…

Information Theory · Computer Science 2016-08-23 Junse Lee , Namyoon Lee , Francois Baccelli

A lot of work has been done on routing protocols for mobile ad hoc networks, but still standardization of them requires some more issues less addressed by the existing routing protocols. In this paper a new paradigm of maintaining multiple…

Networking and Internet Architecture · Computer Science 2009-12-23 Mano Yadav , Vinay Rishiwal , K. V. Arya

Emerging ad hoc networks are infrastructure-less networks consisting of wireless devices with various power constraints, capabilities and mobility characteristics. An essential capability in future ad hoc networks is the ability to provide…

Networking and Internet Architecture · Computer Science 2007-05-23 Ahmed Helmy

This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing…

Information Theory · Computer Science 2016-11-17 Don Torrieri , Salvatore Talarico , Matthew C. Valenti

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

The benefit of multi-antenna receivers is investigated in wireless ad hoc networks, and the main finding is that network throughput can be made to scale linearly with the number of receive antennas nR even if each transmitting node uses…

Information Theory · Computer Science 2016-11-17 Nihar Jindal , Jeffrey G. Andrews , Steven Weber

The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails…

Networking and Internet Architecture · Computer Science 2019-05-15 Shahbaz Rezaei , Mohammed Gharib , Ali Movaghar
‹ Prev 1 2 3 10 Next ›