What is the traffic hauling capacity of wireless networks? Conference Paper uri icon

abstract

  • 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 sq.m., 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. Above we say that the network transports 1 bit-meter when 1 bit has been transported over a distance of 1 meter.

name of conference

  • 1999 Conference on Decision and Control

published proceedings

  • Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)

author list (cited authors)

  • Gupta, P., & Kumar, P. R

citation count

  • 8

complete list of authors

  • Gupta, P||Kumar, PR

publication date

  • January 1999

publisher