scispace - formally typeset
Search or ask a question
Topic

Throughput

About: Throughput is a research topic. Over the lifetime, 47980 publications have been published within this topic receiving 814395 citations. The topic is also known as: system throughput & aggregate throughput.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, two relaying protocols, namely, time switching-based relaying (TSR) and power splitting-based relay (PSR), are proposed to enable energy harvesting and information processing at the relay.
Abstract: An emerging solution for prolonging the lifetime of energy constrained relay nodes in wireless networks is to avail the ambient radio-frequency (RF) signal and to simultaneously harvest energy and process information. In this paper, an amplify-and-forward (AF) relaying network is considered, where an energy constrained relay node harvests energy from the received RF signal and uses that harvested energy to forward the source information to the destination. Based on the time switching and power splitting receiver architectures, two relaying protocols, namely, i) time switching-based relaying (TSR) protocol and ii) power splitting-based relaying (PSR) protocol are proposed to enable energy harvesting and information processing at the relay. In order to determine the throughput, analytical expressions for the outage probability and the ergodic capacity are derived for delay-limited and delay-tolerant transmission modes, respectively. The numerical analysis provides practical insights into the effect of various system parameters, such as energy harvesting time, power splitting ratio, source transmission rate, source to relay distance, noise power, and energy harvesting efficiency, on the performance of wireless energy harvesting and information processing using AF relay nodes. In particular, the TSR protocol outperforms the PSR protocol in terms of throughput at relatively low signal-to-noise-ratios and high transmission rate.

1,443 citations

Proceedings ArticleDOI
27 Aug 2007
TL;DR: This paper adopts the opposite approach; it encourages strategically picked senders to interfere, and achieves significantly higher throughput than both traditional wireless routing and prior work on wireless network coding.
Abstract: Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages strategically picked senders to interfere. Instead of forwarding packets, routers forward the interfering signals. The destination leverages network-level information to cancel the interference and recover the signal destined to it. The result is analog network coding because it mixes signals not bits.So, what if wireless routers forward signals instead of packets? Theoretically, such an approach doubles the capacity of the canonical 2-way relay network. Surprisingly, it is also practical. We implement our design using software radios and show that it achieves significantly higher throughput than both traditional wireless routing and prior work on wireless network coding.

1,440 citations

Journal ArticleDOI
TL;DR: A distributed algorithm is proposed that enables each station to tune its backoff algorithm at run-time and indicates that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed.
Abstract: In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated by simulation. Specifically, we investigate the sensitiveness of our algorithm to some network configuration parameters (number of active stations, presence of hidden terminals). Our results indicate that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed.

1,436 citations

Journal ArticleDOI
P. Bender1, Peter J. Black1, M. Grob1, Roberto Padovani1, N. Sindhushyana, S. Viterbi1 
TL;DR: The network architecture, based on Internet protocols adapted to the mobile environment, is described, followed by a discussion of economic considerations in comparison to cable and DSL services.
Abstract: This article presents an approach to providing very high-data-rate downstream Internet access by nomadic users within the current CDMA physical layer architecture. A means for considerably increasing the throughput by optimizing packet data protocols and by other network and coding techniques are presented and supported by simulations and laboratory measurements. The network architecture, based on Internet protocols adapted to the mobile environment, is described, followed by a discussion of economic considerations in comparison to cable and DSL services.

1,385 citations

Proceedings ArticleDOI
22 Apr 2001
TL;DR: The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically when the nodes are mobile rather than fixed, by exploiting node mobility as a type of multiuser diversity.
Abstract: The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when the nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a type of multiuser diversity.

1,376 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
94% related
Wireless
133.4K papers, 1.9M citations
93% related
Wireless network
122.5K papers, 2.1M citations
92% related
Server
79.5K papers, 1.4M citations
92% related
Wireless sensor network
142K papers, 2.4M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
20241
20232,197
20224,459
20212,051
20202,444