English
Related papers

Related papers: Wireless ad-hoc networks: Strategies and Scaling l…

200 papers

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

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

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

A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of…

Information Theory · Computer Science 2016-11-18 Jamshid Abouei , Hossein Bagheri , Amir K. Khandani

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Networking and Internet Architecture · Computer Science 2010-07-12 Juan Jose Jaramillo , R. Srikant , Lei Ying

We investigate on the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected…

Networking and Internet Architecture · Computer Science 2015-03-20 S. Gitzenis , G. S. Paschos , L. Tassiulas

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

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information…

Information Theory · Computer Science 2009-08-27 Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia

In this paper we present a methodology employing statistical analysis and stochastic geometry to study geometric routing schemes in wireless ad-hoc networks. In particular, we analyze the network layer performance of one such scheme, the…

Networking and Internet Architecture · Computer Science 2014-01-21 Armin Banaei , Daren B. H. Cline , Costas N. Georghiades , Shuguang Cui

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…

Information Theory · Computer Science 2016-11-17 Dong Zheng , Man-On Pun , Weiyan Ge , Junshan Zhang , H. Vincent Poor

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency…

Networking and Internet Architecture · Computer Science 2017-05-25 Riten Gupta , Niyant Krishnamurthi , Uen-Tao Wang , Tejaswi Tamminedi , Mario Gerla

We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service completion. This may…

Performance · Computer Science 2015-03-18 U. Ayesta , M. Erausquin , M. Jonckheere , I. M. Verloop

Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. We…

Networking and Internet Architecture · Computer Science 2016-09-09 Armin Banaei , Daren B. H. Cline , Costas N. Georghiades , Shuguang Cui

This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop…

Information Theory · Computer Science 2018-07-20 Anish Prasad Shrestha , Kyung Sup Kwak

In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…

Networking and Internet Architecture · Computer Science 2016-11-17 Tao Yang , Guoqiang Mao , Wei Zhang , Xiaofeng Tao

The characteristics of wireless communication channels may vary with time due to fading, environmental changes and movement of mobile wireless devices. Tracking and estimating channel gains of wireless channels is therefore a fundamentally…

Networking and Internet Architecture · Computer Science 2010-08-17 Hongyi Yao , Xiaohang Li , Soung Chang Liew

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

Two-way relaying can significantly improve performance of next generation wireless networks. However, due to its dependence on multi-node cooperation and transmission coordination, applying this technique to a wireless network in an…

Information Theory · Computer Science 2012-07-27 Wenguang Mao , Xudong Wang

Wireless Ad-hoc network is generally employed in military and emergencies due to its flexibility and easy-to-use. It's suitable for military wireless network that has the characteristics of mobility and works effectively under severe…

Networking and Internet Architecture · Computer Science 2013-04-09 Haibo Jiang , YaoFei Ma , Dongsheng Hong , Zhen Li