By Topic

A deterministic approach to throughput scaling in 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)
Kulkarni, S.R. ; Dept. of Electr. Eng., Princeton Univ., NJ, USA ; Viswanath, P.

Some significant steps towards a systematic study of how throughput of wireless networks scales with space and number of users have been initiated recently. In this paper, we revisit the throughput scaling problem. Our key contribution is the identification of deterministic properties in the location of the nodes that, combined with a simple deterministic algorithm, provides a throughput that is very easily computed. Furthermore, our deterministic approach can be used to make almost sure statements for various random node locations and traffic patterns, easily strengthening some previous results and obtaining throughput for non-i.i.d. distributions.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: