Results 1  10
of
511
Per User Throughput in Large Wireless Networks
"... Abstract — Previous results show that a node’s throughput scales poorly as the network size increases when every node has traffic. However, in many cases, only a fraction of nodes in large networks have data to send or receive at any given time, while other nodes can act as relays/routers. Therefore ..."
Abstract
 Add to MetaCart
/routers. Therefore, in this paper, we study the scaling behavior from a user’s viewpoint (a user is a node with traffic). We first derive an upper bound on per user throughput. To derive the lower bound, we propose a simple scheduling scheme that enables users to cooperate with relay nodes and fully utilize
Mobility increases the capacity of adhoc wireless networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the persession throughpu ..."
Abstract

Cited by 1220 (5 self)
 Add to MetaCart
session throughput for applications with loose delay constraints, such that the topology changes over the timescale of packet delivery. Under this assumption, the peruser throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3243 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
Capacity of ad hoc wireless networks with infrastructure support
 IEEE Journal on Selected Areas in Communications
, 2005
"... Abstract—We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity bits/s, and infrastructure nodes which in addition are interconnected with each o ..."
Abstract

Cited by 87 (0 self)
 Add to MetaCart
Abstract—We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity bits/s, and infrastructure nodes which in addition are interconnected with each
HARQ in Poisson Point Processbased Heterogeneous Networks
, 2015
"... AbstractHybrid automatic repeat request (HARQ) plays an important role in improving the transmission efficiency and the robustness of wireless networks. Considering Ktier heterogeneous networks (HetNets) and modelling the locations of the base stations (BSs) as a homogeneous Poisson point process ..."
Abstract
 Add to MetaCart
process (PPP), this paper investigates the performance of HetNets implementing HARQ. We give closedform expressions for the quality of service (QoS) coverage probability which is defined in terms of whether the received signal quality is above a predetermined threshold, and the peruser throughput
Application of Cellular Automata to Modeling Mobility and Radio Communication in Wireless Networks
 IEEE Sarnoff Symposium
"... By contrast, the authors in [2] use random mobility to show that under certain conditions, mobility can significantly increase the peruser throughput. The underlying assumption is that each node has data to send to one other node. The mobility model shows that they will eventually be close enough t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
By contrast, the authors in [2] use random mobility to show that under certain conditions, mobility can significantly increase the peruser throughput. The underlying assumption is that each node has data to send to one other node. The mobility model shows that they will eventually be close enough
Even OneDimensional Mobility Increases Ad Hoc Wireless Capacity
"... We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along onedimensional paths. We examine the scaling laws for the peruser throughput achievable over long timescales, making this suitable for applications ..."
Abstract
 Add to MetaCart
We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along onedimensional paths. We examine the scaling laws for the peruser throughput achievable over long timescales, making this suitable for applications
Mobility Increases the Capacity of Ad Hoc Wireless Networks
, 2002
"... 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 nodes communicate in random source–destination pairs. These nodes are assumed to be mobile. We examine the persession throughput ..."
Abstract
 Add to MetaCart
for applications with loose delay constraints, such that the topology changes over the timescale of packet delivery. Under this assumption, the peruser throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting a form of multiuser diversity via
Optical Wavelength Routing, Translation, and Packet/Cell Switched Networks
, 1996
"... We study several models for fixedsize packetkell switching (e.g., 53 bytes for asynchronous transfer mode) in wavelength routed optical networks with an emphasis on throughput performance analysis. In particular, we examine the associated tradeoffs between functionality and hardware complexity. ..."
Abstract
 Add to MetaCart
permutations is 3 logw N where W is the number of wavelengths. The resultant normalized per user throughput of 1/3 log, N is close to the conjectured optimal of 1/(2 log, N 1) under the conditions specified in the model. Finally, using another model we show that it is possible to achieve a normalized per user
Dynamic Channel Assignment and Power Allocation in Multichannel Wireless Networks with Peruser Bandwidth Guarantees
"... Abstract—We address the joint channel assignment and power allocation question in a multichannel wireless (access point) network where channel states differ across channels as well as users, and vary with time. Our goal is to obtain channel assignment and power allocation solutions that can dynamica ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
dynamically adapt to changing channel conditions, and would maximize system throughput under peruser bandwidth (QoS) constraints, in a longterm sense. Using stochastic optimization techniques, we obtain an optimal scheduling policy that operates without knowledge of arrival rates and channel statistics
Results 1  10
of
511