English
Related papers

Related papers: On the Delay-Throughput Tradeoff in Distributed Wi…

200 papers

A distributed single-hop wireless network with $K$ links is considered, where the links are partitioned into a fixed number ($M$) of clusters each operating in a subchannel with bandwidth $\frac{W}{M}$. The subchannels are assumed to be…

Information Theory · Computer Science 2008-10-15 Jamshid Abouei , Alireza Bayesteh , Masoud Ebrahimi , Amir K. Khandani

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…

Information Theory · Computer Science 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…

Information Theory · Computer Science 2011-01-26 Dongyue Xue , Eylem Ekici

Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict packet…

Information Theory · Computer Science 2018-09-21 Emmanouil Fountoulakis , Nikolaos Pappas , Qi Liao , Anthony Ephremides , Vangelis Angelakis

Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the…

Networking and Internet Architecture · Computer Science 2008-07-30 Ruifeng Zhang , Jean-Marie Gorce , Katia Jaffrès-Runser

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

Exchange of crucial and confidential information leads to the unprecedented attention on the security problem in wireless networks. Though the security has been studied in a number of works, the joint optimization of the physical layer…

Information Theory · Computer Science 2018-02-02 Yi Zhong , Xiaohu Ge , Tao Han , Qiang Li , Jing Zhang

Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…

Networking and Internet Architecture · Computer Science 2016-11-17 Bo Ji , Changhee Joo , Ness B. Shroff

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

Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by…

Information Theory · Computer Science 2010-04-27 Rahul Vaze

Consider a static wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access…

Information Theory · Computer Science 2008-12-31 Long Gao , Rui Zhang , Changchuan Yin , Shuguang Cui

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme…

Information Theory · Computer Science 2016-11-17 Ayfer Ozgur , Olivier Leveque

A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad Maddah-Ali , Amir Khandani

Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications.We investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop…

Networking and Internet Architecture · Computer Science 2012-02-06 Weifei Zeng , Chris T. K. Ng , Muriel Medard

This paper investigates the average throughput of a wireless powered communications system, where an energy constrained source, powered by a dedicated power beacon (PB), communicates with a destination. It is assumed that the PB is capable…

Information Theory · Computer Science 2016-11-18 Caijun Zhong , Xiaoming Chen , Zhaoyang Zhang , George Karagiannidis

Diamond relay channel model, as a basic transmission model, has recently been attracting considerable attention in wireless Ad Hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the…

Information Theory · Computer Science 2009-07-13 Qing Wang , Pingyi Fan , Khaled Ben Letaief

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

In this paper, we analytically analyzed the impact of an error-prone channel over all performance measures in a trafficsaturated IEEE 802.11 WLAN. We calculated station's transmission probability by using the modified Markov chain model of…

Networking and Internet Architecture · Computer Science 2010-05-18 Zoran Hadzi-Velkov , Boris Spasenovski

A fundamental problem in the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation…

Networking and Internet Architecture · Computer Science 2012-07-30 Hussein Al-Zubaidy , Jorg Liebeherr , Almut Burchard
‹ Prev 1 2 3 10 Next ›