By Topic

What is the traffic hauling capacity of 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)
Gupta, P. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Kumar, P.R.

We consider multi-hop radio networks, also known as packet radio networks, or ad hoc networks. Consider n nodes located in a disk of area A m2., with each node capable of transmitting at W bits/sec over a common channel. If the nodes are randomly located and each node's destination is randomly chosen, then each node can obtain a throughput of Θ(w/√n log n) bit/sec for its destination, under optimal operation. In the best case when the node locations, OD-pair assignments, and traffic patterns can be optimally chosen, then the entire network can transport Θ(W√An) bit-meters/sec. In this case, we say that the network transports 1 bit-meter when 1 bit has been transported over a distance of 1 meter

Published in:

Decision and Control, 1999. Proceedings of the 38th IEEE Conference on  (Volume:4 )

Date of Conference: