By Topic

Per User Throughput in Large Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dan Xu ; Comput. Sci. Dept., Univ. of California, Davis, CA ; Xin Liu

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, 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 the networks capacity. We show that per user throughput depends on the network size, the number of users, and the node deployment schemes, and is in general much more optimistic. Our scheme also sheds light on designing efficient cooperation protocols in heterogeneous networks and cognitive radio networks.

Published in:

Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON '08. 5th Annual IEEE Communications Society Conference on

Date of Conference:

16-20 June 2008